./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/loops-crafted-1/mono-crafted_10.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version e04fb08f Calling Ultimate with: /usr/lib/jvm/java-1.11.0-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4eeb5c4a-192a-40ea-814b-e6b71bd9c04f/bin/uautomizer-tPACEb0tL8/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4eeb5c4a-192a-40ea-814b-e6b71bd9c04f/bin/uautomizer-tPACEb0tL8/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4eeb5c4a-192a-40ea-814b-e6b71bd9c04f/bin/uautomizer-tPACEb0tL8/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4eeb5c4a-192a-40ea-814b-e6b71bd9c04f/bin/uautomizer-tPACEb0tL8/config/AutomizerReach.xml -i ../../sv-benchmarks/c/loops-crafted-1/mono-crafted_10.c -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4eeb5c4a-192a-40ea-814b-e6b71bd9c04f/bin/uautomizer-tPACEb0tL8/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4eeb5c4a-192a-40ea-814b-e6b71bd9c04f/bin/uautomizer-tPACEb0tL8 --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 8c5f43b3e9ff1d4598a5a525fe9e716f863331c4c517b4b8adb0491943243286 --- Real Ultimate output --- [0.001s][warning][os,container] Duplicate cpuset controllers detected. Picking /sys/fs/cgroup/cpuset, skipping /sys/fs/cgroup/cpuset. This is Ultimate 0.2.2-dev-e04fb08 [2022-11-16 12:43:42,228 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-11-16 12:43:42,230 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-11-16 12:43:42,255 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-11-16 12:43:42,256 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-11-16 12:43:42,257 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-11-16 12:43:42,259 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-11-16 12:43:42,261 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-11-16 12:43:42,263 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-11-16 12:43:42,264 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-11-16 12:43:42,265 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-11-16 12:43:42,267 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-11-16 12:43:42,267 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-11-16 12:43:42,269 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-11-16 12:43:42,270 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-11-16 12:43:42,271 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-11-16 12:43:42,272 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-11-16 12:43:42,273 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-11-16 12:43:42,275 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-11-16 12:43:42,278 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-11-16 12:43:42,280 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-11-16 12:43:42,286 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-11-16 12:43:42,288 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-11-16 12:43:42,289 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-11-16 12:43:42,298 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-11-16 12:43:42,299 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-11-16 12:43:42,308 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-11-16 12:43:42,310 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-11-16 12:43:42,310 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-11-16 12:43:42,312 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-11-16 12:43:42,312 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-11-16 12:43:42,313 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-11-16 12:43:42,314 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-11-16 12:43:42,315 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-11-16 12:43:42,316 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-11-16 12:43:42,317 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-11-16 12:43:42,318 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-11-16 12:43:42,318 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-11-16 12:43:42,321 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-11-16 12:43:42,322 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-11-16 12:43:42,323 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-11-16 12:43:42,325 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4eeb5c4a-192a-40ea-814b-e6b71bd9c04f/bin/uautomizer-tPACEb0tL8/config/svcomp-Reach-32bit-Automizer_Default.epf [2022-11-16 12:43:42,365 INFO L113 SettingsManager]: Loading preferences was successful [2022-11-16 12:43:42,366 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-11-16 12:43:42,367 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-11-16 12:43:42,367 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-11-16 12:43:42,368 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-11-16 12:43:42,368 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-11-16 12:43:42,369 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-11-16 12:43:42,369 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-11-16 12:43:42,370 INFO L138 SettingsManager]: * Use SBE=true [2022-11-16 12:43:42,370 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-11-16 12:43:42,371 INFO L138 SettingsManager]: * sizeof long=4 [2022-11-16 12:43:42,372 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-11-16 12:43:42,372 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-11-16 12:43:42,372 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-11-16 12:43:42,372 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-11-16 12:43:42,372 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-11-16 12:43:42,373 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-11-16 12:43:42,373 INFO L138 SettingsManager]: * sizeof long double=12 [2022-11-16 12:43:42,373 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-11-16 12:43:42,373 INFO L138 SettingsManager]: * Use constant arrays=true [2022-11-16 12:43:42,374 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-11-16 12:43:42,374 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-11-16 12:43:42,374 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-11-16 12:43:42,374 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-11-16 12:43:42,375 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-11-16 12:43:42,375 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-11-16 12:43:42,377 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-11-16 12:43:42,377 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-11-16 12:43:42,378 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-11-16 12:43:42,378 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-11-16 12:43:42,378 INFO L138 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2022-11-16 12:43:42,378 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-11-16 12:43:42,379 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-11-16 12:43:42,379 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4eeb5c4a-192a-40ea-814b-e6b71bd9c04f/bin/uautomizer-tPACEb0tL8/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4eeb5c4a-192a-40ea-814b-e6b71bd9c04f/bin/uautomizer-tPACEb0tL8 Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness.graphml Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(reach_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 8c5f43b3e9ff1d4598a5a525fe9e716f863331c4c517b4b8adb0491943243286 [2022-11-16 12:43:42,703 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-11-16 12:43:42,727 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-11-16 12:43:42,730 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-11-16 12:43:42,732 INFO L271 PluginConnector]: Initializing CDTParser... [2022-11-16 12:43:42,733 INFO L275 PluginConnector]: CDTParser initialized [2022-11-16 12:43:42,734 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4eeb5c4a-192a-40ea-814b-e6b71bd9c04f/bin/uautomizer-tPACEb0tL8/../../sv-benchmarks/c/loops-crafted-1/mono-crafted_10.c [2022-11-16 12:43:42,807 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4eeb5c4a-192a-40ea-814b-e6b71bd9c04f/bin/uautomizer-tPACEb0tL8/data/f7ce2cbcb/48c1e801dd0045b7af12e06b3b7bd959/FLAG7caa25fd5 [2022-11-16 12:43:43,331 INFO L306 CDTParser]: Found 1 translation units. [2022-11-16 12:43:43,332 INFO L160 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4eeb5c4a-192a-40ea-814b-e6b71bd9c04f/sv-benchmarks/c/loops-crafted-1/mono-crafted_10.c [2022-11-16 12:43:43,339 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4eeb5c4a-192a-40ea-814b-e6b71bd9c04f/bin/uautomizer-tPACEb0tL8/data/f7ce2cbcb/48c1e801dd0045b7af12e06b3b7bd959/FLAG7caa25fd5 [2022-11-16 12:43:43,691 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4eeb5c4a-192a-40ea-814b-e6b71bd9c04f/bin/uautomizer-tPACEb0tL8/data/f7ce2cbcb/48c1e801dd0045b7af12e06b3b7bd959 [2022-11-16 12:43:43,694 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-11-16 12:43:43,701 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-11-16 12:43:43,705 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-11-16 12:43:43,705 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-11-16 12:43:43,708 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-11-16 12:43:43,709 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.11 12:43:43" (1/1) ... [2022-11-16 12:43:43,710 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@a6184cc and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 12:43:43, skipping insertion in model container [2022-11-16 12:43:43,710 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.11 12:43:43" (1/1) ... [2022-11-16 12:43:43,721 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-11-16 12:43:43,736 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-11-16 12:43:43,923 WARN L229 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4eeb5c4a-192a-40ea-814b-e6b71bd9c04f/sv-benchmarks/c/loops-crafted-1/mono-crafted_10.c[319,332] [2022-11-16 12:43:43,936 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-11-16 12:43:43,944 INFO L203 MainTranslator]: Completed pre-run [2022-11-16 12:43:43,955 WARN L229 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4eeb5c4a-192a-40ea-814b-e6b71bd9c04f/sv-benchmarks/c/loops-crafted-1/mono-crafted_10.c[319,332] [2022-11-16 12:43:43,958 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-11-16 12:43:43,973 INFO L208 MainTranslator]: Completed translation [2022-11-16 12:43:43,973 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 12:43:43 WrapperNode [2022-11-16 12:43:43,973 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-11-16 12:43:43,975 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-11-16 12:43:43,975 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-11-16 12:43:43,975 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-11-16 12:43:43,983 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 12:43:43" (1/1) ... [2022-11-16 12:43:43,989 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 12:43:43" (1/1) ... [2022-11-16 12:43:44,007 INFO L138 Inliner]: procedures = 12, calls = 8, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 32 [2022-11-16 12:43:44,007 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-11-16 12:43:44,008 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-11-16 12:43:44,008 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-11-16 12:43:44,008 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-11-16 12:43:44,015 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 12:43:43" (1/1) ... [2022-11-16 12:43:44,016 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 12:43:43" (1/1) ... [2022-11-16 12:43:44,017 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 12:43:43" (1/1) ... [2022-11-16 12:43:44,017 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 12:43:43" (1/1) ... [2022-11-16 12:43:44,020 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 12:43:43" (1/1) ... [2022-11-16 12:43:44,024 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 12:43:43" (1/1) ... [2022-11-16 12:43:44,025 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 12:43:43" (1/1) ... [2022-11-16 12:43:44,026 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 12:43:43" (1/1) ... [2022-11-16 12:43:44,027 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-11-16 12:43:44,028 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-11-16 12:43:44,028 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-11-16 12:43:44,029 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-11-16 12:43:44,030 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 12:43:43" (1/1) ... [2022-11-16 12:43:44,037 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-11-16 12:43:44,051 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4eeb5c4a-192a-40ea-814b-e6b71bd9c04f/bin/uautomizer-tPACEb0tL8/z3 [2022-11-16 12:43:44,063 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4eeb5c4a-192a-40ea-814b-e6b71bd9c04f/bin/uautomizer-tPACEb0tL8/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-11-16 12:43:44,066 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4eeb5c4a-192a-40ea-814b-e6b71bd9c04f/bin/uautomizer-tPACEb0tL8/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-11-16 12:43:44,113 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-11-16 12:43:44,113 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-11-16 12:43:44,115 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-11-16 12:43:44,115 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-11-16 12:43:44,187 INFO L235 CfgBuilder]: Building ICFG [2022-11-16 12:43:44,190 INFO L261 CfgBuilder]: Building CFG for each procedure with an implementation [2022-11-16 12:43:44,309 INFO L276 CfgBuilder]: Performing block encoding [2022-11-16 12:43:44,316 INFO L295 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-11-16 12:43:44,316 INFO L300 CfgBuilder]: Removed 1 assume(true) statements. [2022-11-16 12:43:44,319 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 16.11 12:43:44 BoogieIcfgContainer [2022-11-16 12:43:44,319 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-11-16 12:43:44,322 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-11-16 12:43:44,322 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-11-16 12:43:44,326 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-11-16 12:43:44,327 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 16.11 12:43:43" (1/3) ... [2022-11-16 12:43:44,328 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@223e1510 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.11 12:43:44, skipping insertion in model container [2022-11-16 12:43:44,328 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 12:43:43" (2/3) ... [2022-11-16 12:43:44,328 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@223e1510 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.11 12:43:44, skipping insertion in model container [2022-11-16 12:43:44,329 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 16.11 12:43:44" (3/3) ... [2022-11-16 12:43:44,331 INFO L112 eAbstractionObserver]: Analyzing ICFG mono-crafted_10.c [2022-11-16 12:43:44,354 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-11-16 12:43:44,355 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-11-16 12:43:44,413 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-11-16 12:43:44,420 INFO L357 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mHoare=true, mAutomataTypeConcurrency=PETRI_NET, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopsAndPotentialCycles, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mPorIndependenceSettings=[Lde.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings;@69a3c8c1, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2022-11-16 12:43:44,421 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-11-16 12:43:44,427 INFO L276 IsEmpty]: Start isEmpty. Operand has 13 states, 11 states have (on average 1.4545454545454546) internal successors, (16), 12 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-16 12:43:44,434 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2022-11-16 12:43:44,434 INFO L187 NwaCegarLoop]: Found error trace [2022-11-16 12:43:44,435 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2022-11-16 12:43:44,435 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-16 12:43:44,441 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-16 12:43:44,441 INFO L85 PathProgramCache]: Analyzing trace with hash 889968487, now seen corresponding path program 1 times [2022-11-16 12:43:44,451 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-16 12:43:44,452 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [802318042] [2022-11-16 12:43:44,452 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 12:43:44,452 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-16 12:43:44,547 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:43:44,631 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-16 12:43:44,632 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-16 12:43:44,635 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [802318042] [2022-11-16 12:43:44,637 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [802318042] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-16 12:43:44,637 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-16 12:43:44,638 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-11-16 12:43:44,640 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [519503637] [2022-11-16 12:43:44,641 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-16 12:43:44,648 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2022-11-16 12:43:44,651 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-16 12:43:44,693 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2022-11-16 12:43:44,694 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2022-11-16 12:43:44,697 INFO L87 Difference]: Start difference. First operand has 13 states, 11 states have (on average 1.4545454545454546) internal successors, (16), 12 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 2 states, 2 states have (on average 3.0) internal successors, (6), 2 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-16 12:43:44,721 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-16 12:43:44,721 INFO L93 Difference]: Finished difference Result 21 states and 24 transitions. [2022-11-16 12:43:44,722 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-11-16 12:43:44,724 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 3.0) internal successors, (6), 2 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 6 [2022-11-16 12:43:44,726 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-16 12:43:44,740 INFO L225 Difference]: With dead ends: 21 [2022-11-16 12:43:44,741 INFO L226 Difference]: Without dead ends: 9 [2022-11-16 12:43:44,746 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2022-11-16 12:43:44,751 INFO L413 NwaCegarLoop]: 14 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 0 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 14 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-11-16 12:43:44,753 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 14 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-11-16 12:43:44,775 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9 states. [2022-11-16 12:43:44,797 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9 to 9. [2022-11-16 12:43:44,799 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9 states, 8 states have (on average 1.25) internal successors, (10), 8 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-16 12:43:44,800 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 10 transitions. [2022-11-16 12:43:44,802 INFO L78 Accepts]: Start accepts. Automaton has 9 states and 10 transitions. Word has length 6 [2022-11-16 12:43:44,802 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-16 12:43:44,803 INFO L495 AbstractCegarLoop]: Abstraction has 9 states and 10 transitions. [2022-11-16 12:43:44,804 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 3.0) internal successors, (6), 2 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-16 12:43:44,805 INFO L276 IsEmpty]: Start isEmpty. Operand 9 states and 10 transitions. [2022-11-16 12:43:44,805 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2022-11-16 12:43:44,805 INFO L187 NwaCegarLoop]: Found error trace [2022-11-16 12:43:44,806 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2022-11-16 12:43:44,806 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-11-16 12:43:44,806 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-16 12:43:44,807 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-16 12:43:44,807 INFO L85 PathProgramCache]: Analyzing trace with hash 889640786, now seen corresponding path program 1 times [2022-11-16 12:43:44,808 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-16 12:43:44,808 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2079406704] [2022-11-16 12:43:44,808 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 12:43:44,809 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-16 12:43:44,878 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:43:45,091 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-16 12:43:45,092 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-16 12:43:45,092 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2079406704] [2022-11-16 12:43:45,092 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2079406704] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-16 12:43:45,092 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-16 12:43:45,093 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-16 12:43:45,093 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1753795151] [2022-11-16 12:43:45,093 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-16 12:43:45,094 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-16 12:43:45,095 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-16 12:43:45,095 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-16 12:43:45,096 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-16 12:43:45,096 INFO L87 Difference]: Start difference. First operand 9 states and 10 transitions. Second operand has 3 states, 3 states have (on average 2.0) internal successors, (6), 3 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-16 12:43:45,127 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-16 12:43:45,127 INFO L93 Difference]: Finished difference Result 19 states and 23 transitions. [2022-11-16 12:43:45,128 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-16 12:43:45,128 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 2.0) internal successors, (6), 3 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 6 [2022-11-16 12:43:45,128 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-16 12:43:45,129 INFO L225 Difference]: With dead ends: 19 [2022-11-16 12:43:45,129 INFO L226 Difference]: Without dead ends: 12 [2022-11-16 12:43:45,129 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-16 12:43:45,131 INFO L413 NwaCegarLoop]: 7 mSDtfsCounter, 2 mSDsluCounter, 3 mSDsCounter, 0 mSdLazyCounter, 9 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 10 SdHoareTripleChecker+Invalid, 10 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 9 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-11-16 12:43:45,132 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 10 Invalid, 10 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 9 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-11-16 12:43:45,133 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12 states. [2022-11-16 12:43:45,136 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12 to 11. [2022-11-16 12:43:45,136 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 11 states, 10 states have (on average 1.2) internal successors, (12), 10 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-16 12:43:45,137 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 12 transitions. [2022-11-16 12:43:45,137 INFO L78 Accepts]: Start accepts. Automaton has 11 states and 12 transitions. Word has length 6 [2022-11-16 12:43:45,137 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-16 12:43:45,138 INFO L495 AbstractCegarLoop]: Abstraction has 11 states and 12 transitions. [2022-11-16 12:43:45,138 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 2.0) internal successors, (6), 3 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-16 12:43:45,138 INFO L276 IsEmpty]: Start isEmpty. Operand 11 states and 12 transitions. [2022-11-16 12:43:45,139 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2022-11-16 12:43:45,139 INFO L187 NwaCegarLoop]: Found error trace [2022-11-16 12:43:45,139 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-16 12:43:45,139 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-11-16 12:43:45,140 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-16 12:43:45,140 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-16 12:43:45,141 INFO L85 PathProgramCache]: Analyzing trace with hash 641725625, now seen corresponding path program 1 times [2022-11-16 12:43:45,141 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-16 12:43:45,141 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [768637439] [2022-11-16 12:43:45,141 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 12:43:45,142 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-16 12:43:45,159 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:43:45,549 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-16 12:43:45,549 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-16 12:43:45,550 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [768637439] [2022-11-16 12:43:45,550 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [768637439] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-16 12:43:45,550 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [619185233] [2022-11-16 12:43:45,550 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 12:43:45,551 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-16 12:43:45,551 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4eeb5c4a-192a-40ea-814b-e6b71bd9c04f/bin/uautomizer-tPACEb0tL8/z3 [2022-11-16 12:43:45,555 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4eeb5c4a-192a-40ea-814b-e6b71bd9c04f/bin/uautomizer-tPACEb0tL8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-16 12:43:45,557 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4eeb5c4a-192a-40ea-814b-e6b71bd9c04f/bin/uautomizer-tPACEb0tL8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2022-11-16 12:43:45,620 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:43:45,622 INFO L263 TraceCheckSpWp]: Trace formula consists of 43 conjuncts, 8 conjunts are in the unsatisfiable core [2022-11-16 12:43:45,631 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-16 12:43:45,839 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-16 12:43:45,839 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-16 12:43:45,950 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-16 12:43:45,950 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [619185233] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-16 12:43:45,950 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-16 12:43:45,951 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 4, 5] total 9 [2022-11-16 12:43:45,955 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [339974287] [2022-11-16 12:43:45,955 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-16 12:43:45,956 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-11-16 12:43:45,957 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-16 12:43:45,958 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-11-16 12:43:45,958 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=40, Unknown=0, NotChecked=0, Total=72 [2022-11-16 12:43:45,959 INFO L87 Difference]: Start difference. First operand 11 states and 12 transitions. Second operand has 9 states, 9 states have (on average 2.0) internal successors, (18), 9 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-16 12:43:46,101 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-16 12:43:46,101 INFO L93 Difference]: Finished difference Result 26 states and 33 transitions. [2022-11-16 12:43:46,102 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-11-16 12:43:46,102 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 2.0) internal successors, (18), 9 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 9 [2022-11-16 12:43:46,103 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-16 12:43:46,104 INFO L225 Difference]: With dead ends: 26 [2022-11-16 12:43:46,105 INFO L226 Difference]: Without dead ends: 19 [2022-11-16 12:43:46,105 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 14 SyntacticMatches, 1 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=41, Invalid=49, Unknown=0, NotChecked=0, Total=90 [2022-11-16 12:43:46,109 INFO L413 NwaCegarLoop]: 5 mSDtfsCounter, 24 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 35 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 24 SdHoareTripleChecker+Valid, 12 SdHoareTripleChecker+Invalid, 43 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 35 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-16 12:43:46,111 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [24 Valid, 12 Invalid, 43 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 35 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-16 12:43:46,113 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19 states. [2022-11-16 12:43:46,124 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19 to 19. [2022-11-16 12:43:46,125 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 19 states, 18 states have (on average 1.1666666666666667) internal successors, (21), 18 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-16 12:43:46,127 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 21 transitions. [2022-11-16 12:43:46,127 INFO L78 Accepts]: Start accepts. Automaton has 19 states and 21 transitions. Word has length 9 [2022-11-16 12:43:46,128 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-16 12:43:46,129 INFO L495 AbstractCegarLoop]: Abstraction has 19 states and 21 transitions. [2022-11-16 12:43:46,129 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 2.0) internal successors, (18), 9 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-16 12:43:46,129 INFO L276 IsEmpty]: Start isEmpty. Operand 19 states and 21 transitions. [2022-11-16 12:43:46,130 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2022-11-16 12:43:46,130 INFO L187 NwaCegarLoop]: Found error trace [2022-11-16 12:43:46,130 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 4, 1, 1, 1, 1, 1, 1] [2022-11-16 12:43:46,142 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4eeb5c4a-192a-40ea-814b-e6b71bd9c04f/bin/uautomizer-tPACEb0tL8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2022-11-16 12:43:46,336 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2,2 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4eeb5c4a-192a-40ea-814b-e6b71bd9c04f/bin/uautomizer-tPACEb0tL8/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-16 12:43:46,337 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-16 12:43:46,338 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-16 12:43:46,338 INFO L85 PathProgramCache]: Analyzing trace with hash 1171899538, now seen corresponding path program 2 times [2022-11-16 12:43:46,338 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-16 12:43:46,338 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1465182062] [2022-11-16 12:43:46,339 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 12:43:46,339 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-16 12:43:46,359 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:43:46,655 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 0 proven. 22 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-16 12:43:46,657 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-16 12:43:46,657 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1465182062] [2022-11-16 12:43:46,657 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1465182062] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-16 12:43:46,660 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [212246916] [2022-11-16 12:43:46,660 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-11-16 12:43:46,662 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-16 12:43:46,662 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4eeb5c4a-192a-40ea-814b-e6b71bd9c04f/bin/uautomizer-tPACEb0tL8/z3 [2022-11-16 12:43:46,663 INFO L229 MonitoredProcess]: Starting monitored process 3 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4eeb5c4a-192a-40ea-814b-e6b71bd9c04f/bin/uautomizer-tPACEb0tL8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-16 12:43:46,671 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4eeb5c4a-192a-40ea-814b-e6b71bd9c04f/bin/uautomizer-tPACEb0tL8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2022-11-16 12:43:46,734 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-11-16 12:43:46,734 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-16 12:43:46,736 INFO L263 TraceCheckSpWp]: Trace formula consists of 55 conjuncts, 21 conjunts are in the unsatisfiable core [2022-11-16 12:43:46,738 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-16 12:43:47,033 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 0 proven. 22 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-16 12:43:47,033 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-16 12:43:47,372 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 0 proven. 22 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-16 12:43:47,373 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [212246916] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-16 12:43:47,373 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-16 12:43:47,373 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 7, 9] total 20 [2022-11-16 12:43:47,373 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [122259639] [2022-11-16 12:43:47,373 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-16 12:43:47,374 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 20 states [2022-11-16 12:43:47,374 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-16 12:43:47,375 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2022-11-16 12:43:47,375 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=109, Invalid=271, Unknown=0, NotChecked=0, Total=380 [2022-11-16 12:43:47,375 INFO L87 Difference]: Start difference. First operand 19 states and 21 transitions. Second operand has 20 states, 20 states have (on average 2.4) internal successors, (48), 20 states have internal predecessors, (48), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-16 12:43:50,313 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-16 12:43:50,314 INFO L93 Difference]: Finished difference Result 57 states and 72 transitions. [2022-11-16 12:43:50,314 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2022-11-16 12:43:50,314 INFO L78 Accepts]: Start accepts. Automaton has has 20 states, 20 states have (on average 2.4) internal successors, (48), 20 states have internal predecessors, (48), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 18 [2022-11-16 12:43:50,314 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-16 12:43:50,316 INFO L225 Difference]: With dead ends: 57 [2022-11-16 12:43:50,316 INFO L226 Difference]: Without dead ends: 38 [2022-11-16 12:43:50,317 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 56 GetRequests, 25 SyntacticMatches, 0 SemanticMatches, 31 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 265 ImplicationChecksByTransitivity, 2.7s TimeCoverageRelationStatistics Valid=288, Invalid=768, Unknown=0, NotChecked=0, Total=1056 [2022-11-16 12:43:50,318 INFO L413 NwaCegarLoop]: 4 mSDtfsCounter, 60 mSDsluCounter, 21 mSDsCounter, 0 mSdLazyCounter, 209 mSolverCounterSat, 14 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 60 SdHoareTripleChecker+Valid, 25 SdHoareTripleChecker+Invalid, 223 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 14 IncrementalHoareTripleChecker+Valid, 209 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2022-11-16 12:43:50,319 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [60 Valid, 25 Invalid, 223 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [14 Valid, 209 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2022-11-16 12:43:50,319 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 38 states. [2022-11-16 12:43:50,334 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 38 to 37. [2022-11-16 12:43:50,334 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 37 states, 36 states have (on average 1.1666666666666667) internal successors, (42), 36 states have internal predecessors, (42), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-16 12:43:50,335 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37 states to 37 states and 42 transitions. [2022-11-16 12:43:50,335 INFO L78 Accepts]: Start accepts. Automaton has 37 states and 42 transitions. Word has length 18 [2022-11-16 12:43:50,335 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-16 12:43:50,335 INFO L495 AbstractCegarLoop]: Abstraction has 37 states and 42 transitions. [2022-11-16 12:43:50,336 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 20 states, 20 states have (on average 2.4) internal successors, (48), 20 states have internal predecessors, (48), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-16 12:43:50,336 INFO L276 IsEmpty]: Start isEmpty. Operand 37 states and 42 transitions. [2022-11-16 12:43:50,336 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2022-11-16 12:43:50,337 INFO L187 NwaCegarLoop]: Found error trace [2022-11-16 12:43:50,337 INFO L195 NwaCegarLoop]: trace histogram [6, 6, 5, 1, 1, 1, 1, 1, 1, 1] [2022-11-16 12:43:50,349 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4eeb5c4a-192a-40ea-814b-e6b71bd9c04f/bin/uautomizer-tPACEb0tL8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2022-11-16 12:43:50,542 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3,3 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4eeb5c4a-192a-40ea-814b-e6b71bd9c04f/bin/uautomizer-tPACEb0tL8/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-16 12:43:50,543 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-16 12:43:50,543 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-16 12:43:50,544 INFO L85 PathProgramCache]: Analyzing trace with hash -1843997196, now seen corresponding path program 1 times [2022-11-16 12:43:50,544 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-16 12:43:50,544 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1983068188] [2022-11-16 12:43:50,544 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 12:43:50,544 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-16 12:43:50,557 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:43:50,728 INFO L134 CoverageAnalysis]: Checked inductivity of 51 backedges. 11 proven. 40 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-16 12:43:50,729 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-16 12:43:50,729 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1983068188] [2022-11-16 12:43:50,729 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1983068188] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-16 12:43:50,729 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2006699135] [2022-11-16 12:43:50,730 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 12:43:50,730 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-16 12:43:50,730 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4eeb5c4a-192a-40ea-814b-e6b71bd9c04f/bin/uautomizer-tPACEb0tL8/z3 [2022-11-16 12:43:50,731 INFO L229 MonitoredProcess]: Starting monitored process 4 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4eeb5c4a-192a-40ea-814b-e6b71bd9c04f/bin/uautomizer-tPACEb0tL8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-16 12:43:50,742 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4eeb5c4a-192a-40ea-814b-e6b71bd9c04f/bin/uautomizer-tPACEb0tL8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2022-11-16 12:43:50,789 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:43:50,790 INFO L263 TraceCheckSpWp]: Trace formula consists of 65 conjuncts, 13 conjunts are in the unsatisfiable core [2022-11-16 12:43:50,791 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-16 12:43:50,894 INFO L134 CoverageAnalysis]: Checked inductivity of 51 backedges. 11 proven. 40 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-16 12:43:50,895 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-16 12:43:51,059 INFO L134 CoverageAnalysis]: Checked inductivity of 51 backedges. 11 proven. 40 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-16 12:43:51,059 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2006699135] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-16 12:43:51,059 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-16 12:43:51,059 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8, 8] total 15 [2022-11-16 12:43:51,060 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [189371945] [2022-11-16 12:43:51,060 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-16 12:43:51,060 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2022-11-16 12:43:51,060 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-16 12:43:51,061 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2022-11-16 12:43:51,061 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=75, Invalid=135, Unknown=0, NotChecked=0, Total=210 [2022-11-16 12:43:51,061 INFO L87 Difference]: Start difference. First operand 37 states and 42 transitions. Second operand has 15 states, 15 states have (on average 3.0) internal successors, (45), 15 states have internal predecessors, (45), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-16 12:43:51,718 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-16 12:43:51,718 INFO L93 Difference]: Finished difference Result 60 states and 69 transitions. [2022-11-16 12:43:51,718 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2022-11-16 12:43:51,718 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 15 states have (on average 3.0) internal successors, (45), 15 states have internal predecessors, (45), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 24 [2022-11-16 12:43:51,719 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-16 12:43:51,719 INFO L225 Difference]: With dead ends: 60 [2022-11-16 12:43:51,719 INFO L226 Difference]: Without dead ends: 53 [2022-11-16 12:43:51,720 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 61 GetRequests, 41 SyntacticMatches, 2 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 35 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=150, Invalid=230, Unknown=0, NotChecked=0, Total=380 [2022-11-16 12:43:51,721 INFO L413 NwaCegarLoop]: 5 mSDtfsCounter, 25 mSDsluCounter, 18 mSDsCounter, 0 mSdLazyCounter, 149 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 25 SdHoareTripleChecker+Valid, 23 SdHoareTripleChecker+Invalid, 161 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 149 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-11-16 12:43:51,721 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [25 Valid, 23 Invalid, 161 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 149 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-11-16 12:43:51,722 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 53 states. [2022-11-16 12:43:51,732 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 53 to 44. [2022-11-16 12:43:51,733 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 44 states, 43 states have (on average 1.0930232558139534) internal successors, (47), 43 states have internal predecessors, (47), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-16 12:43:51,733 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 44 states to 44 states and 47 transitions. [2022-11-16 12:43:51,734 INFO L78 Accepts]: Start accepts. Automaton has 44 states and 47 transitions. Word has length 24 [2022-11-16 12:43:51,734 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-16 12:43:51,734 INFO L495 AbstractCegarLoop]: Abstraction has 44 states and 47 transitions. [2022-11-16 12:43:51,734 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 15 states have (on average 3.0) internal successors, (45), 15 states have internal predecessors, (45), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-16 12:43:51,734 INFO L276 IsEmpty]: Start isEmpty. Operand 44 states and 47 transitions. [2022-11-16 12:43:51,735 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2022-11-16 12:43:51,735 INFO L187 NwaCegarLoop]: Found error trace [2022-11-16 12:43:51,736 INFO L195 NwaCegarLoop]: trace histogram [10, 10, 10, 1, 1, 1, 1, 1, 1] [2022-11-16 12:43:51,742 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4eeb5c4a-192a-40ea-814b-e6b71bd9c04f/bin/uautomizer-tPACEb0tL8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2022-11-16 12:43:51,936 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,4 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4eeb5c4a-192a-40ea-814b-e6b71bd9c04f/bin/uautomizer-tPACEb0tL8/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-16 12:43:51,936 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-16 12:43:51,937 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-16 12:43:51,937 INFO L85 PathProgramCache]: Analyzing trace with hash -51731342, now seen corresponding path program 3 times [2022-11-16 12:43:51,937 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-16 12:43:51,937 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [22285154] [2022-11-16 12:43:51,937 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 12:43:51,938 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-16 12:43:51,958 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:43:52,505 INFO L134 CoverageAnalysis]: Checked inductivity of 145 backedges. 0 proven. 145 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-16 12:43:52,505 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-16 12:43:52,506 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [22285154] [2022-11-16 12:43:52,506 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [22285154] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-16 12:43:52,506 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1133080699] [2022-11-16 12:43:52,506 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-11-16 12:43:52,506 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-16 12:43:52,506 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4eeb5c4a-192a-40ea-814b-e6b71bd9c04f/bin/uautomizer-tPACEb0tL8/z3 [2022-11-16 12:43:52,510 INFO L229 MonitoredProcess]: Starting monitored process 5 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4eeb5c4a-192a-40ea-814b-e6b71bd9c04f/bin/uautomizer-tPACEb0tL8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-16 12:43:52,538 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4eeb5c4a-192a-40ea-814b-e6b71bd9c04f/bin/uautomizer-tPACEb0tL8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2022-11-16 12:43:52,579 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2022-11-16 12:43:52,579 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-16 12:43:52,580 INFO L263 TraceCheckSpWp]: Trace formula consists of 43 conjuncts, 9 conjunts are in the unsatisfiable core [2022-11-16 12:43:52,582 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-16 12:43:52,873 INFO L134 CoverageAnalysis]: Checked inductivity of 145 backedges. 18 proven. 10 refuted. 0 times theorem prover too weak. 117 trivial. 0 not checked. [2022-11-16 12:43:52,873 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-16 12:43:53,124 INFO L134 CoverageAnalysis]: Checked inductivity of 145 backedges. 9 proven. 19 refuted. 0 times theorem prover too weak. 117 trivial. 0 not checked. [2022-11-16 12:43:53,124 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1133080699] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-16 12:43:53,125 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-16 12:43:53,125 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 6, 6] total 21 [2022-11-16 12:43:53,125 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [418745293] [2022-11-16 12:43:53,125 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-16 12:43:53,126 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 21 states [2022-11-16 12:43:53,126 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-16 12:43:53,126 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2022-11-16 12:43:53,127 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=114, Invalid=306, Unknown=0, NotChecked=0, Total=420 [2022-11-16 12:43:53,127 INFO L87 Difference]: Start difference. First operand 44 states and 47 transitions. Second operand has 21 states, 21 states have (on average 2.4285714285714284) internal successors, (51), 21 states have internal predecessors, (51), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-16 12:43:54,051 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-16 12:43:54,052 INFO L93 Difference]: Finished difference Result 57 states and 64 transitions. [2022-11-16 12:43:54,052 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2022-11-16 12:43:54,052 INFO L78 Accepts]: Start accepts. Automaton has has 21 states, 21 states have (on average 2.4285714285714284) internal successors, (51), 21 states have internal predecessors, (51), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 36 [2022-11-16 12:43:54,053 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-16 12:43:54,053 INFO L225 Difference]: With dead ends: 57 [2022-11-16 12:43:54,054 INFO L226 Difference]: Without dead ends: 53 [2022-11-16 12:43:54,054 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 98 GetRequests, 65 SyntacticMatches, 1 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 129 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=293, Invalid=829, Unknown=0, NotChecked=0, Total=1122 [2022-11-16 12:43:54,055 INFO L413 NwaCegarLoop]: 5 mSDtfsCounter, 90 mSDsluCounter, 12 mSDsCounter, 0 mSdLazyCounter, 364 mSolverCounterSat, 35 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 90 SdHoareTripleChecker+Valid, 17 SdHoareTripleChecker+Invalid, 399 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 35 IncrementalHoareTripleChecker+Valid, 364 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-11-16 12:43:54,055 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [90 Valid, 17 Invalid, 399 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [35 Valid, 364 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-11-16 12:43:54,056 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 53 states. [2022-11-16 12:43:54,072 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 53 to 52. [2022-11-16 12:43:54,072 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 52 states, 51 states have (on average 1.0784313725490196) internal successors, (55), 51 states have internal predecessors, (55), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-16 12:43:54,081 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 52 states to 52 states and 55 transitions. [2022-11-16 12:43:54,081 INFO L78 Accepts]: Start accepts. Automaton has 52 states and 55 transitions. Word has length 36 [2022-11-16 12:43:54,082 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-16 12:43:54,082 INFO L495 AbstractCegarLoop]: Abstraction has 52 states and 55 transitions. [2022-11-16 12:43:54,084 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 21 states, 21 states have (on average 2.4285714285714284) internal successors, (51), 21 states have internal predecessors, (51), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-16 12:43:54,085 INFO L276 IsEmpty]: Start isEmpty. Operand 52 states and 55 transitions. [2022-11-16 12:43:54,086 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2022-11-16 12:43:54,087 INFO L187 NwaCegarLoop]: Found error trace [2022-11-16 12:43:54,087 INFO L195 NwaCegarLoop]: trace histogram [15, 15, 12, 3, 1, 1, 1, 1, 1, 1] [2022-11-16 12:43:54,105 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4eeb5c4a-192a-40ea-814b-e6b71bd9c04f/bin/uautomizer-tPACEb0tL8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2022-11-16 12:43:54,306 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5,5 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4eeb5c4a-192a-40ea-814b-e6b71bd9c04f/bin/uautomizer-tPACEb0tL8/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-16 12:43:54,306 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-16 12:43:54,307 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-16 12:43:54,307 INFO L85 PathProgramCache]: Analyzing trace with hash -749374373, now seen corresponding path program 2 times [2022-11-16 12:43:54,307 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-16 12:43:54,307 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1328395330] [2022-11-16 12:43:54,307 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 12:43:54,308 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-16 12:43:54,343 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:43:54,919 INFO L134 CoverageAnalysis]: Checked inductivity of 330 backedges. 101 proven. 222 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2022-11-16 12:43:54,919 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-16 12:43:54,920 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1328395330] [2022-11-16 12:43:54,920 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1328395330] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-16 12:43:54,920 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1222431379] [2022-11-16 12:43:54,920 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-11-16 12:43:54,920 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-16 12:43:54,920 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4eeb5c4a-192a-40ea-814b-e6b71bd9c04f/bin/uautomizer-tPACEb0tL8/z3 [2022-11-16 12:43:54,922 INFO L229 MonitoredProcess]: Starting monitored process 6 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4eeb5c4a-192a-40ea-814b-e6b71bd9c04f/bin/uautomizer-tPACEb0tL8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-16 12:43:54,959 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4eeb5c4a-192a-40ea-814b-e6b71bd9c04f/bin/uautomizer-tPACEb0tL8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2022-11-16 12:43:55,001 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-11-16 12:43:55,002 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-16 12:43:55,004 INFO L263 TraceCheckSpWp]: Trace formula consists of 105 conjuncts, 31 conjunts are in the unsatisfiable core [2022-11-16 12:43:55,006 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-16 12:43:55,257 INFO L134 CoverageAnalysis]: Checked inductivity of 330 backedges. 29 proven. 301 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-16 12:43:55,257 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-16 12:43:55,961 INFO L134 CoverageAnalysis]: Checked inductivity of 330 backedges. 29 proven. 301 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-16 12:43:55,961 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1222431379] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-16 12:43:55,961 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-16 12:43:55,961 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 17, 17] total 33 [2022-11-16 12:43:55,961 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2009523229] [2022-11-16 12:43:55,962 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-16 12:43:55,962 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 33 states [2022-11-16 12:43:55,962 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-16 12:43:55,963 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 33 interpolants. [2022-11-16 12:43:55,964 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=316, Invalid=740, Unknown=0, NotChecked=0, Total=1056 [2022-11-16 12:43:55,964 INFO L87 Difference]: Start difference. First operand 52 states and 55 transitions. Second operand has 33 states, 33 states have (on average 3.0606060606060606) internal successors, (101), 33 states have internal predecessors, (101), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-16 12:44:18,684 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-16 12:44:18,685 INFO L93 Difference]: Finished difference Result 121 states and 145 transitions. [2022-11-16 12:44:18,685 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2022-11-16 12:44:18,685 INFO L78 Accepts]: Start accepts. Automaton has has 33 states, 33 states have (on average 3.0606060606060606) internal successors, (101), 33 states have internal predecessors, (101), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 51 [2022-11-16 12:44:18,686 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-16 12:44:18,686 INFO L225 Difference]: With dead ends: 121 [2022-11-16 12:44:18,686 INFO L226 Difference]: Without dead ends: 106 [2022-11-16 12:44:18,688 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 131 GetRequests, 84 SyntacticMatches, 2 SemanticMatches, 45 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 156 ImplicationChecksByTransitivity, 22.8s TimeCoverageRelationStatistics Valid=778, Invalid=1384, Unknown=0, NotChecked=0, Total=2162 [2022-11-16 12:44:18,688 INFO L413 NwaCegarLoop]: 7 mSDtfsCounter, 85 mSDsluCounter, 54 mSDsCounter, 0 mSdLazyCounter, 746 mSolverCounterSat, 38 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 85 SdHoareTripleChecker+Valid, 61 SdHoareTripleChecker+Invalid, 784 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 38 IncrementalHoareTripleChecker+Valid, 746 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2022-11-16 12:44:18,689 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [85 Valid, 61 Invalid, 784 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [38 Valid, 746 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2022-11-16 12:44:18,689 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 106 states. [2022-11-16 12:44:18,705 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 106 to 106. [2022-11-16 12:44:18,709 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 106 states, 105 states have (on average 1.0380952380952382) internal successors, (109), 105 states have internal predecessors, (109), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-16 12:44:18,710 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 106 states to 106 states and 109 transitions. [2022-11-16 12:44:18,711 INFO L78 Accepts]: Start accepts. Automaton has 106 states and 109 transitions. Word has length 51 [2022-11-16 12:44:18,711 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-16 12:44:18,713 INFO L495 AbstractCegarLoop]: Abstraction has 106 states and 109 transitions. [2022-11-16 12:44:18,713 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 33 states, 33 states have (on average 3.0606060606060606) internal successors, (101), 33 states have internal predecessors, (101), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-16 12:44:18,713 INFO L276 IsEmpty]: Start isEmpty. Operand 106 states and 109 transitions. [2022-11-16 12:44:18,715 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2022-11-16 12:44:18,718 INFO L187 NwaCegarLoop]: Found error trace [2022-11-16 12:44:18,719 INFO L195 NwaCegarLoop]: trace histogram [33, 33, 30, 3, 1, 1, 1, 1, 1, 1] [2022-11-16 12:44:18,730 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4eeb5c4a-192a-40ea-814b-e6b71bd9c04f/bin/uautomizer-tPACEb0tL8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2022-11-16 12:44:18,925 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4eeb5c4a-192a-40ea-814b-e6b71bd9c04f/bin/uautomizer-tPACEb0tL8/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable6 [2022-11-16 12:44:18,925 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-16 12:44:18,925 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-16 12:44:18,926 INFO L85 PathProgramCache]: Analyzing trace with hash -1404636997, now seen corresponding path program 3 times [2022-11-16 12:44:18,926 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-16 12:44:18,926 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [87890602] [2022-11-16 12:44:18,926 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 12:44:18,926 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-16 12:44:18,951 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:44:20,333 INFO L134 CoverageAnalysis]: Checked inductivity of 1617 backedges. 245 proven. 1365 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2022-11-16 12:44:20,334 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-16 12:44:20,334 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [87890602] [2022-11-16 12:44:20,334 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [87890602] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-16 12:44:20,334 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1651024010] [2022-11-16 12:44:20,335 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-11-16 12:44:20,335 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-16 12:44:20,335 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4eeb5c4a-192a-40ea-814b-e6b71bd9c04f/bin/uautomizer-tPACEb0tL8/z3 [2022-11-16 12:44:20,336 INFO L229 MonitoredProcess]: Starting monitored process 7 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4eeb5c4a-192a-40ea-814b-e6b71bd9c04f/bin/uautomizer-tPACEb0tL8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-16 12:44:20,340 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4eeb5c4a-192a-40ea-814b-e6b71bd9c04f/bin/uautomizer-tPACEb0tL8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2022-11-16 12:44:20,440 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 7 check-sat command(s) [2022-11-16 12:44:20,440 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-16 12:44:20,441 INFO L263 TraceCheckSpWp]: Trace formula consists of 69 conjuncts, 16 conjunts are in the unsatisfiable core [2022-11-16 12:44:20,444 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-16 12:44:21,228 INFO L134 CoverageAnalysis]: Checked inductivity of 1617 backedges. 326 proven. 15 refuted. 0 times theorem prover too weak. 1276 trivial. 0 not checked. [2022-11-16 12:44:21,229 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-16 12:44:22,747 INFO L134 CoverageAnalysis]: Checked inductivity of 1617 backedges. 0 proven. 341 refuted. 0 times theorem prover too weak. 1276 trivial. 0 not checked. [2022-11-16 12:44:22,748 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1651024010] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-16 12:44:22,748 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-16 12:44:22,748 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [33, 9, 11] total 49 [2022-11-16 12:44:22,748 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [613354126] [2022-11-16 12:44:22,749 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-16 12:44:22,751 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 49 states [2022-11-16 12:44:22,751 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-16 12:44:22,751 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 49 interpolants. [2022-11-16 12:44:22,753 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=346, Invalid=2006, Unknown=0, NotChecked=0, Total=2352 [2022-11-16 12:44:22,753 INFO L87 Difference]: Start difference. First operand 106 states and 109 transitions. Second operand has 49 states, 49 states have (on average 2.7142857142857144) internal successors, (133), 49 states have internal predecessors, (133), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-16 12:44:29,446 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-16 12:44:29,447 INFO L93 Difference]: Finished difference Result 146 states and 166 transitions. [2022-11-16 12:44:29,447 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 47 states. [2022-11-16 12:44:29,448 INFO L78 Accepts]: Start accepts. Automaton has has 49 states, 49 states have (on average 2.7142857142857144) internal successors, (133), 49 states have internal predecessors, (133), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 105 [2022-11-16 12:44:29,448 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-16 12:44:29,449 INFO L225 Difference]: With dead ends: 146 [2022-11-16 12:44:29,449 INFO L226 Difference]: Without dead ends: 131 [2022-11-16 12:44:29,452 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 281 GetRequests, 195 SyntacticMatches, 1 SemanticMatches, 85 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1002 ImplicationChecksByTransitivity, 5.8s TimeCoverageRelationStatistics Valid=1203, Invalid=6279, Unknown=0, NotChecked=0, Total=7482 [2022-11-16 12:44:29,452 INFO L413 NwaCegarLoop]: 4 mSDtfsCounter, 252 mSDsluCounter, 49 mSDsCounter, 0 mSdLazyCounter, 3356 mSolverCounterSat, 114 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 252 SdHoareTripleChecker+Valid, 53 SdHoareTripleChecker+Invalid, 3470 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 114 IncrementalHoareTripleChecker+Valid, 3356 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.8s IncrementalHoareTripleChecker+Time [2022-11-16 12:44:29,453 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [252 Valid, 53 Invalid, 3470 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [114 Valid, 3356 Invalid, 0 Unknown, 0 Unchecked, 2.8s Time] [2022-11-16 12:44:29,453 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 131 states. [2022-11-16 12:44:29,469 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 131 to 130. [2022-11-16 12:44:29,470 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 130 states, 129 states have (on average 1.054263565891473) internal successors, (136), 129 states have internal predecessors, (136), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-16 12:44:29,471 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 130 states to 130 states and 136 transitions. [2022-11-16 12:44:29,471 INFO L78 Accepts]: Start accepts. Automaton has 130 states and 136 transitions. Word has length 105 [2022-11-16 12:44:29,472 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-16 12:44:29,472 INFO L495 AbstractCegarLoop]: Abstraction has 130 states and 136 transitions. [2022-11-16 12:44:29,472 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 49 states, 49 states have (on average 2.7142857142857144) internal successors, (133), 49 states have internal predecessors, (133), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-16 12:44:29,473 INFO L276 IsEmpty]: Start isEmpty. Operand 130 states and 136 transitions. [2022-11-16 12:44:29,474 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 130 [2022-11-16 12:44:29,474 INFO L187 NwaCegarLoop]: Found error trace [2022-11-16 12:44:29,474 INFO L195 NwaCegarLoop]: trace histogram [41, 41, 32, 9, 1, 1, 1, 1, 1, 1] [2022-11-16 12:44:29,482 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4eeb5c4a-192a-40ea-814b-e6b71bd9c04f/bin/uautomizer-tPACEb0tL8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0 [2022-11-16 12:44:29,680 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4eeb5c4a-192a-40ea-814b-e6b71bd9c04f/bin/uautomizer-tPACEb0tL8/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable7 [2022-11-16 12:44:29,680 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-16 12:44:29,681 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-16 12:44:29,681 INFO L85 PathProgramCache]: Analyzing trace with hash 674089979, now seen corresponding path program 4 times [2022-11-16 12:44:29,681 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-16 12:44:29,681 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1899251993] [2022-11-16 12:44:29,681 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 12:44:29,681 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-16 12:44:29,720 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:44:31,342 INFO L134 CoverageAnalysis]: Checked inductivity of 2501 backedges. 849 proven. 1552 refuted. 0 times theorem prover too weak. 100 trivial. 0 not checked. [2022-11-16 12:44:31,342 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-16 12:44:31,342 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1899251993] [2022-11-16 12:44:31,342 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1899251993] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-16 12:44:31,343 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1879664821] [2022-11-16 12:44:31,343 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-11-16 12:44:31,343 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-16 12:44:31,343 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4eeb5c4a-192a-40ea-814b-e6b71bd9c04f/bin/uautomizer-tPACEb0tL8/z3 [2022-11-16 12:44:31,344 INFO L229 MonitoredProcess]: Starting monitored process 8 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4eeb5c4a-192a-40ea-814b-e6b71bd9c04f/bin/uautomizer-tPACEb0tL8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-16 12:44:31,365 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4eeb5c4a-192a-40ea-814b-e6b71bd9c04f/bin/uautomizer-tPACEb0tL8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2022-11-16 12:44:31,502 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-11-16 12:44:31,502 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-16 12:44:31,505 INFO L263 TraceCheckSpWp]: Trace formula consists of 221 conjuncts, 70 conjunts are in the unsatisfiable core [2022-11-16 12:44:31,508 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-16 12:44:31,993 INFO L134 CoverageAnalysis]: Checked inductivity of 2501 backedges. 774 proven. 1650 refuted. 0 times theorem prover too weak. 77 trivial. 0 not checked. [2022-11-16 12:44:31,994 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-16 12:44:35,974 INFO L134 CoverageAnalysis]: Checked inductivity of 2501 backedges. 774 proven. 1650 refuted. 0 times theorem prover too weak. 77 trivial. 0 not checked. [2022-11-16 12:44:35,974 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1879664821] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-16 12:44:35,974 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-16 12:44:35,975 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [35, 36, 37] total 72 [2022-11-16 12:44:35,978 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1615801672] [2022-11-16 12:44:35,978 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-16 12:44:35,979 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 72 states [2022-11-16 12:44:35,979 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-16 12:44:35,980 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 72 interpolants. [2022-11-16 12:44:35,981 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1400, Invalid=3712, Unknown=0, NotChecked=0, Total=5112 [2022-11-16 12:44:35,982 INFO L87 Difference]: Start difference. First operand 130 states and 136 transitions. Second operand has 72 states, 72 states have (on average 2.986111111111111) internal successors, (215), 72 states have internal predecessors, (215), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-16 12:45:43,989 WARN L233 SmtUtils]: Spent 11.35s on a formula simplification. DAG size of input: 239 DAG size of output: 12 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-11-16 12:45:46,009 WARN L833 $PredicateComparison]: unable to prove that (and (let ((.cse0 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 12) 4294967296))) (or (not (<= 5000000 .cse0)) (< 4294967294 .cse0))) (not (<= 5000000 (mod |c_ULTIMATE.start_main_~x~0#1| 4294967296))) (let ((.cse1 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 29) 4294967296))) (or (< 4294967294 .cse1) (not (<= 5000000 .cse1)))) (let ((.cse2 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 28) 4294967296))) (or (not (<= 5000000 .cse2)) (< 4294967294 .cse2))) (let ((.cse3 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 4) 4294967296))) (or (< 4294967294 .cse3) (not (<= 5000000 .cse3)))) (let ((.cse4 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 17) 4294967296))) (or (< 4294967294 .cse4) (not (<= 5000000 .cse4)))) (let ((.cse5 (mod (+ 7 |c_ULTIMATE.start_main_~x~0#1|) 4294967296))) (or (not (<= 5000000 .cse5)) (< 4294967294 .cse5))) (let ((.cse6 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 9) 4294967296))) (or (not (<= 5000000 .cse6)) (< 4294967294 .cse6))) (let ((.cse7 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 5) 4294967296))) (or (< 4294967294 .cse7) (not (<= 5000000 .cse7)))) (let ((.cse8 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 3) 4294967296))) (or (< 4294967294 .cse8) (not (<= 5000000 .cse8)))) (let ((.cse9 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 31) 4294967296))) (or (not (<= 5000000 .cse9)) (< 4294967294 .cse9))) (let ((.cse10 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 11) 4294967296))) (or (< 4294967294 .cse10) (not (<= 5000000 .cse10)))) (let ((.cse11 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 14) 4294967296))) (or (not (<= 5000000 .cse11)) (< 4294967294 .cse11))) (let ((.cse12 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 30) 4294967296))) (or (< 4294967294 .cse12) (not (<= 5000000 .cse12)))) (let ((.cse13 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 6) 4294967296))) (or (not (<= 5000000 .cse13)) (< 4294967294 .cse13))) (let ((.cse14 (mod (+ 19 |c_ULTIMATE.start_main_~x~0#1|) 4294967296))) (or (< 4294967294 .cse14) (not (<= 5000000 .cse14)))) (let ((.cse15 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 16) 4294967296))) (or (< 4294967294 .cse15) (not (<= 5000000 .cse15)))) (let ((.cse16 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 15) 4294967296))) (or (< 4294967294 .cse16) (not (<= 5000000 .cse16)))) (let ((.cse17 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 2) 4294967296))) (or (< 4294967294 .cse17) (not (<= 5000000 .cse17)))) (let ((.cse18 (mod (+ 23 |c_ULTIMATE.start_main_~x~0#1|) 4294967296))) (or (not (<= 5000000 .cse18)) (< 4294967294 .cse18))) (let ((.cse19 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 13) 4294967296))) (or (not (<= 5000000 .cse19)) (< 4294967294 .cse19))) (let ((.cse20 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 21) 4294967296))) (or (< 4294967294 .cse20) (not (<= 5000000 .cse20)))) (let ((.cse21 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 32) 4294967296))) (or (< 4294967294 .cse21) (not (<= 5000000 .cse21)))) (let ((.cse22 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 26) 4294967296))) (or (not (<= 5000000 .cse22)) (< 4294967294 .cse22))) (let ((.cse23 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 8) 4294967296))) (or (not (<= 5000000 .cse23)) (< 4294967294 .cse23))) (let ((.cse24 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 1) 4294967296))) (or (< 4294967294 .cse24) (not (<= 5000000 .cse24)))) (let ((.cse25 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 20) 4294967296))) (or (not (<= 5000000 .cse25)) (< 4294967294 .cse25))) (let ((.cse26 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 24) 4294967296))) (or (not (<= 5000000 .cse26)) (< 4294967294 .cse26))) (let ((.cse27 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 22) 4294967296))) (or (< 4294967294 .cse27) (not (<= 5000000 .cse27)))) (let ((.cse28 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 18) 4294967296))) (or (not (<= 5000000 .cse28)) (< 4294967294 .cse28))) (let ((.cse29 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 10) 4294967296))) (or (not (<= 5000000 .cse29)) (< 4294967294 .cse29))) (let ((.cse30 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 27) 4294967296))) (or (< 4294967294 .cse30) (not (<= 5000000 .cse30)))) (let ((.cse31 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 25) 4294967296))) (or (not (<= 5000000 .cse31)) (< 4294967294 .cse31)))) is different from false [2022-11-16 12:46:48,285 WARN L233 SmtUtils]: Spent 17.82s on a formula simplification. DAG size of input: 222 DAG size of output: 17 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-11-16 12:47:55,137 WARN L233 SmtUtils]: Spent 14.49s on a formula simplification. DAG size of input: 222 DAG size of output: 17 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-11-16 12:49:03,503 WARN L233 SmtUtils]: Spent 16.48s on a formula simplification. DAG size of input: 225 DAG size of output: 12 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-11-16 12:49:05,614 WARN L833 $PredicateComparison]: unable to prove that (and (let ((.cse0 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 12) 4294967296))) (or (not (<= 5000000 .cse0)) (< 4294967294 .cse0))) (let ((.cse1 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 29) 4294967296))) (or (< 4294967294 .cse1) (not (<= 5000000 .cse1)))) (let ((.cse2 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 28) 4294967296))) (or (not (<= 5000000 .cse2)) (< 4294967294 .cse2))) (let ((.cse3 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 4) 4294967296))) (or (< 4294967294 .cse3) (not (<= 5000000 .cse3)))) (let ((.cse4 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 17) 4294967296))) (or (< 4294967294 .cse4) (not (<= 5000000 .cse4)))) (let ((.cse5 (mod (+ 7 |c_ULTIMATE.start_main_~x~0#1|) 4294967296))) (or (not (<= 5000000 .cse5)) (< 4294967294 .cse5))) (let ((.cse6 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 9) 4294967296))) (or (not (<= 5000000 .cse6)) (< 4294967294 .cse6))) (let ((.cse7 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 5) 4294967296))) (or (< 4294967294 .cse7) (not (<= 5000000 .cse7)))) (let ((.cse8 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 3) 4294967296))) (or (< 4294967294 .cse8) (not (<= 5000000 .cse8)))) (let ((.cse9 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 31) 4294967296))) (or (not (<= 5000000 .cse9)) (< 4294967294 .cse9))) (let ((.cse10 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 11) 4294967296))) (or (< 4294967294 .cse10) (not (<= 5000000 .cse10)))) (let ((.cse11 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 14) 4294967296))) (or (not (<= 5000000 .cse11)) (< 4294967294 .cse11))) (let ((.cse12 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 30) 4294967296))) (or (< 4294967294 .cse12) (not (<= 5000000 .cse12)))) (let ((.cse13 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 6) 4294967296))) (or (not (<= 5000000 .cse13)) (< 4294967294 .cse13))) (let ((.cse14 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 33) 4294967296))) (or (< 4294967294 .cse14) (not (<= 5000000 .cse14)))) (let ((.cse15 (mod (+ 19 |c_ULTIMATE.start_main_~x~0#1|) 4294967296))) (or (< 4294967294 .cse15) (not (<= 5000000 .cse15)))) (let ((.cse16 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 16) 4294967296))) (or (< 4294967294 .cse16) (not (<= 5000000 .cse16)))) (let ((.cse17 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 15) 4294967296))) (or (< 4294967294 .cse17) (not (<= 5000000 .cse17)))) (let ((.cse18 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 2) 4294967296))) (or (< 4294967294 .cse18) (not (<= 5000000 .cse18)))) (let ((.cse19 (mod (+ 23 |c_ULTIMATE.start_main_~x~0#1|) 4294967296))) (or (not (<= 5000000 .cse19)) (< 4294967294 .cse19))) (let ((.cse20 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 13) 4294967296))) (or (not (<= 5000000 .cse20)) (< 4294967294 .cse20))) (let ((.cse21 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 21) 4294967296))) (or (< 4294967294 .cse21) (not (<= 5000000 .cse21)))) (let ((.cse22 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 32) 4294967296))) (or (< 4294967294 .cse22) (not (<= 5000000 .cse22)))) (let ((.cse23 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 26) 4294967296))) (or (not (<= 5000000 .cse23)) (< 4294967294 .cse23))) (let ((.cse24 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 8) 4294967296))) (or (not (<= 5000000 .cse24)) (< 4294967294 .cse24))) (let ((.cse25 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 1) 4294967296))) (or (< 4294967294 .cse25) (not (<= 5000000 .cse25)))) (let ((.cse26 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 20) 4294967296))) (or (not (<= 5000000 .cse26)) (< 4294967294 .cse26))) (let ((.cse27 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 24) 4294967296))) (or (not (<= 5000000 .cse27)) (< 4294967294 .cse27))) (let ((.cse28 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 22) 4294967296))) (or (< 4294967294 .cse28) (not (<= 5000000 .cse28)))) (let ((.cse29 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 18) 4294967296))) (or (not (<= 5000000 .cse29)) (< 4294967294 .cse29))) (let ((.cse30 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 10) 4294967296))) (or (not (<= 5000000 .cse30)) (< 4294967294 .cse30))) (let ((.cse31 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 27) 4294967296))) (or (< 4294967294 .cse31) (not (<= 5000000 .cse31)))) (let ((.cse32 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 25) 4294967296))) (or (not (<= 5000000 .cse32)) (< 4294967294 .cse32)))) is different from false [2022-11-16 12:49:52,424 WARN L233 SmtUtils]: Spent 8.66s on a formula simplification. DAG size of input: 218 DAG size of output: 12 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-11-16 12:50:47,229 WARN L233 SmtUtils]: Spent 10.91s on a formula simplification. DAG size of input: 234 DAG size of output: 15 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-11-16 12:50:49,278 WARN L833 $PredicateComparison]: unable to prove that (and (let ((.cse0 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 12) 4294967296))) (or (not (<= 5000000 .cse0)) (< 4294967294 .cse0))) (not (<= 5000000 (mod |c_ULTIMATE.start_main_~x~0#1| 4294967296))) (let ((.cse1 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 29) 4294967296))) (or (< 4294967294 .cse1) (not (<= 5000000 .cse1)))) (let ((.cse2 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 28) 4294967296))) (or (not (<= 5000000 .cse2)) (< 4294967294 .cse2))) (let ((.cse3 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 4) 4294967296))) (or (< 4294967294 .cse3) (not (<= 5000000 .cse3)))) (let ((.cse4 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 17) 4294967296))) (or (< 4294967294 .cse4) (not (<= 5000000 .cse4)))) (let ((.cse5 (mod (+ 7 |c_ULTIMATE.start_main_~x~0#1|) 4294967296))) (or (not (<= 5000000 .cse5)) (< 4294967294 .cse5))) (let ((.cse6 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 9) 4294967296))) (or (not (<= 5000000 .cse6)) (< 4294967294 .cse6))) (let ((.cse7 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 5) 4294967296))) (or (< 4294967294 .cse7) (not (<= 5000000 .cse7)))) (let ((.cse8 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 3) 4294967296))) (or (< 4294967294 .cse8) (not (<= 5000000 .cse8)))) (let ((.cse9 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 11) 4294967296))) (or (< 4294967294 .cse9) (not (<= 5000000 .cse9)))) (let ((.cse10 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 14) 4294967296))) (or (not (<= 5000000 .cse10)) (< 4294967294 .cse10))) (let ((.cse11 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 6) 4294967296))) (or (not (<= 5000000 .cse11)) (< 4294967294 .cse11))) (let ((.cse12 (mod (+ 19 |c_ULTIMATE.start_main_~x~0#1|) 4294967296))) (or (< 4294967294 .cse12) (not (<= 5000000 .cse12)))) (let ((.cse13 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 16) 4294967296))) (or (< 4294967294 .cse13) (not (<= 5000000 .cse13)))) (let ((.cse14 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 15) 4294967296))) (or (< 4294967294 .cse14) (not (<= 5000000 .cse14)))) (let ((.cse15 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 2) 4294967296))) (or (< 4294967294 .cse15) (not (<= 5000000 .cse15)))) (let ((.cse16 (mod (+ 23 |c_ULTIMATE.start_main_~x~0#1|) 4294967296))) (or (not (<= 5000000 .cse16)) (< 4294967294 .cse16))) (let ((.cse17 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 13) 4294967296))) (or (not (<= 5000000 .cse17)) (< 4294967294 .cse17))) (let ((.cse18 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 21) 4294967296))) (or (< 4294967294 .cse18) (not (<= 5000000 .cse18)))) (let ((.cse19 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 26) 4294967296))) (or (not (<= 5000000 .cse19)) (< 4294967294 .cse19))) (let ((.cse20 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 8) 4294967296))) (or (not (<= 5000000 .cse20)) (< 4294967294 .cse20))) (let ((.cse21 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 1) 4294967296))) (or (< 4294967294 .cse21) (not (<= 5000000 .cse21)))) (let ((.cse22 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 20) 4294967296))) (or (not (<= 5000000 .cse22)) (< 4294967294 .cse22))) (let ((.cse23 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 24) 4294967296))) (or (not (<= 5000000 .cse23)) (< 4294967294 .cse23))) (let ((.cse24 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 22) 4294967296))) (or (< 4294967294 .cse24) (not (<= 5000000 .cse24)))) (let ((.cse25 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 18) 4294967296))) (or (not (<= 5000000 .cse25)) (< 4294967294 .cse25))) (let ((.cse26 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 10) 4294967296))) (or (not (<= 5000000 .cse26)) (< 4294967294 .cse26))) (let ((.cse27 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 27) 4294967296))) (or (< 4294967294 .cse27) (not (<= 5000000 .cse27)))) (let ((.cse28 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 25) 4294967296))) (or (not (<= 5000000 .cse28)) (< 4294967294 .cse28)))) is different from false [2022-11-16 12:52:38,164 WARN L233 SmtUtils]: Spent 6.66s on a formula simplification. DAG size of input: 201 DAG size of output: 17 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-11-16 12:53:43,317 WARN L233 SmtUtils]: Spent 6.96s on a formula simplification. DAG size of input: 204 DAG size of output: 12 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-11-16 12:54:57,309 WARN L233 SmtUtils]: Spent 10.69s on a formula simplification. DAG size of input: 197 DAG size of output: 12 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-11-16 12:55:56,487 WARN L233 SmtUtils]: Spent 7.13s on a formula simplification. DAG size of input: 190 DAG size of output: 12 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-11-16 12:57:09,548 WARN L233 SmtUtils]: Spent 16.20s on a formula simplification. DAG size of input: 183 DAG size of output: 12 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-11-16 12:58:10,753 WARN L233 SmtUtils]: Spent 6.64s on a formula simplification. DAG size of input: 176 DAG size of output: 12 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-11-16 12:59:07,246 WARN L233 SmtUtils]: Spent 5.82s on a formula simplification. DAG size of input: 169 DAG size of output: 12 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-11-16 12:59:09,270 WARN L833 $PredicateComparison]: unable to prove that (and (let ((.cse0 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 12) 4294967296))) (or (not (<= 5000000 .cse0)) (< 4294967294 .cse0))) (not (<= 5000000 (mod |c_ULTIMATE.start_main_~x~0#1| 4294967296))) (let ((.cse1 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 4) 4294967296))) (or (< 4294967294 .cse1) (not (<= 5000000 .cse1)))) (let ((.cse2 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 17) 4294967296))) (or (< 4294967294 .cse2) (not (<= 5000000 .cse2)))) (let ((.cse3 (mod (+ 7 |c_ULTIMATE.start_main_~x~0#1|) 4294967296))) (or (not (<= 5000000 .cse3)) (< 4294967294 .cse3))) (let ((.cse4 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 9) 4294967296))) (or (not (<= 5000000 .cse4)) (< 4294967294 .cse4))) (let ((.cse5 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 5) 4294967296))) (or (< 4294967294 .cse5) (not (<= 5000000 .cse5)))) (let ((.cse6 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 3) 4294967296))) (or (< 4294967294 .cse6) (not (<= 5000000 .cse6)))) (let ((.cse7 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 11) 4294967296))) (or (< 4294967294 .cse7) (not (<= 5000000 .cse7)))) (let ((.cse8 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 14) 4294967296))) (or (not (<= 5000000 .cse8)) (< 4294967294 .cse8))) (let ((.cse9 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 6) 4294967296))) (or (not (<= 5000000 .cse9)) (< 4294967294 .cse9))) (let ((.cse10 (mod (+ 19 |c_ULTIMATE.start_main_~x~0#1|) 4294967296))) (or (< 4294967294 .cse10) (not (<= 5000000 .cse10)))) (let ((.cse11 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 16) 4294967296))) (or (< 4294967294 .cse11) (not (<= 5000000 .cse11)))) (let ((.cse12 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 15) 4294967296))) (or (< 4294967294 .cse12) (not (<= 5000000 .cse12)))) (let ((.cse13 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 2) 4294967296))) (or (< 4294967294 .cse13) (not (<= 5000000 .cse13)))) (let ((.cse14 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 13) 4294967296))) (or (not (<= 5000000 .cse14)) (< 4294967294 .cse14))) (let ((.cse15 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 21) 4294967296))) (or (< 4294967294 .cse15) (not (<= 5000000 .cse15)))) (let ((.cse16 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 8) 4294967296))) (or (not (<= 5000000 .cse16)) (< 4294967294 .cse16))) (let ((.cse17 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 1) 4294967296))) (or (< 4294967294 .cse17) (not (<= 5000000 .cse17)))) (let ((.cse18 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 20) 4294967296))) (or (not (<= 5000000 .cse18)) (< 4294967294 .cse18))) (let ((.cse19 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 22) 4294967296))) (or (< 4294967294 .cse19) (not (<= 5000000 .cse19)))) (let ((.cse20 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 18) 4294967296))) (or (not (<= 5000000 .cse20)) (< 4294967294 .cse20))) (let ((.cse21 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 10) 4294967296))) (or (not (<= 5000000 .cse21)) (< 4294967294 .cse21)))) is different from false