./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/loops-crafted-1/Mono6_1.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 6b4ec56b Calling Ultimate with: /usr/lib/jvm/java-11-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1ed3933e-95e2-4f88-b795-0747b9d55b6b/bin/uautomizer-ug76WZFUDN/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1ed3933e-95e2-4f88-b795-0747b9d55b6b/bin/uautomizer-ug76WZFUDN/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1ed3933e-95e2-4f88-b795-0747b9d55b6b/bin/uautomizer-ug76WZFUDN/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1ed3933e-95e2-4f88-b795-0747b9d55b6b/bin/uautomizer-ug76WZFUDN/config/AutomizerReach.xml -i ../../sv-benchmarks/c/loops-crafted-1/Mono6_1.c -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1ed3933e-95e2-4f88-b795-0747b9d55b6b/bin/uautomizer-ug76WZFUDN/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1ed3933e-95e2-4f88-b795-0747b9d55b6b/bin/uautomizer-ug76WZFUDN --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 d34109ac38ddcd69eb693c43509c1355293ac88c80ebd192d8e2af9a8be8f805 --- 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-6b4ec56 [2022-11-20 09:27:08,292 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-11-20 09:27:08,294 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-11-20 09:27:08,315 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-11-20 09:27:08,315 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-11-20 09:27:08,316 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-11-20 09:27:08,318 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-11-20 09:27:08,320 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-11-20 09:27:08,321 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-11-20 09:27:08,323 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-11-20 09:27:08,324 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-11-20 09:27:08,325 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-11-20 09:27:08,325 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-11-20 09:27:08,327 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-11-20 09:27:08,328 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-11-20 09:27:08,329 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-11-20 09:27:08,330 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-11-20 09:27:08,331 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-11-20 09:27:08,333 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-11-20 09:27:08,334 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-11-20 09:27:08,336 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-11-20 09:27:08,337 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-11-20 09:27:08,339 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-11-20 09:27:08,340 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-11-20 09:27:08,343 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-11-20 09:27:08,344 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-11-20 09:27:08,344 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-11-20 09:27:08,345 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-11-20 09:27:08,351 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-11-20 09:27:08,353 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-11-20 09:27:08,353 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-11-20 09:27:08,356 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-11-20 09:27:08,357 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-11-20 09:27:08,357 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-11-20 09:27:08,359 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-11-20 09:27:08,359 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-11-20 09:27:08,360 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-11-20 09:27:08,360 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-11-20 09:27:08,360 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-11-20 09:27:08,361 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-11-20 09:27:08,364 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-11-20 09:27:08,365 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1ed3933e-95e2-4f88-b795-0747b9d55b6b/bin/uautomizer-ug76WZFUDN/config/svcomp-Reach-32bit-Automizer_Default.epf [2022-11-20 09:27:08,424 INFO L113 SettingsManager]: Loading preferences was successful [2022-11-20 09:27:08,424 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-11-20 09:27:08,425 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-11-20 09:27:08,425 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-11-20 09:27:08,426 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-11-20 09:27:08,426 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-11-20 09:27:08,426 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-11-20 09:27:08,427 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-11-20 09:27:08,427 INFO L138 SettingsManager]: * Use SBE=true [2022-11-20 09:27:08,427 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-11-20 09:27:08,427 INFO L138 SettingsManager]: * sizeof long=4 [2022-11-20 09:27:08,427 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-11-20 09:27:08,428 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-11-20 09:27:08,428 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-11-20 09:27:08,428 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-11-20 09:27:08,428 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-11-20 09:27:08,428 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-11-20 09:27:08,429 INFO L138 SettingsManager]: * sizeof long double=12 [2022-11-20 09:27:08,429 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-11-20 09:27:08,429 INFO L138 SettingsManager]: * Use constant arrays=true [2022-11-20 09:27:08,429 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-11-20 09:27:08,429 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-11-20 09:27:08,430 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-11-20 09:27:08,430 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-11-20 09:27:08,430 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-11-20 09:27:08,430 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-11-20 09:27:08,431 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-11-20 09:27:08,431 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-11-20 09:27:08,431 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-11-20 09:27:08,431 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-11-20 09:27:08,431 INFO L138 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2022-11-20 09:27:08,432 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-11-20 09:27:08,432 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-11-20 09:27:08,432 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_1ed3933e-95e2-4f88-b795-0747b9d55b6b/bin/uautomizer-ug76WZFUDN/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_1ed3933e-95e2-4f88-b795-0747b9d55b6b/bin/uautomizer-ug76WZFUDN 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 -> d34109ac38ddcd69eb693c43509c1355293ac88c80ebd192d8e2af9a8be8f805 [2022-11-20 09:27:08,688 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-11-20 09:27:08,712 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-11-20 09:27:08,715 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-11-20 09:27:08,716 INFO L271 PluginConnector]: Initializing CDTParser... [2022-11-20 09:27:08,717 INFO L275 PluginConnector]: CDTParser initialized [2022-11-20 09:27:08,718 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1ed3933e-95e2-4f88-b795-0747b9d55b6b/bin/uautomizer-ug76WZFUDN/../../sv-benchmarks/c/loops-crafted-1/Mono6_1.c [2022-11-20 09:27:11,853 INFO L500 CDTParser]: Created temporary CDT project at NULL [2022-11-20 09:27:12,069 INFO L351 CDTParser]: Found 1 translation units. [2022-11-20 09:27:12,070 INFO L172 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1ed3933e-95e2-4f88-b795-0747b9d55b6b/sv-benchmarks/c/loops-crafted-1/Mono6_1.c [2022-11-20 09:27:12,075 INFO L394 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1ed3933e-95e2-4f88-b795-0747b9d55b6b/bin/uautomizer-ug76WZFUDN/data/9992e5d3a/14f1aad041ad491682a0c190832f2adb/FLAG83151b728 [2022-11-20 09:27:12,090 INFO L402 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1ed3933e-95e2-4f88-b795-0747b9d55b6b/bin/uautomizer-ug76WZFUDN/data/9992e5d3a/14f1aad041ad491682a0c190832f2adb [2022-11-20 09:27:12,092 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-11-20 09:27:12,094 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-11-20 09:27:12,100 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-11-20 09:27:12,100 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-11-20 09:27:12,104 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-11-20 09:27:12,105 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.11 09:27:12" (1/1) ... [2022-11-20 09:27:12,106 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@434da60c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 09:27:12, skipping insertion in model container [2022-11-20 09:27:12,106 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.11 09:27:12" (1/1) ... [2022-11-20 09:27:12,114 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-11-20 09:27:12,128 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-11-20 09:27:12,266 WARN L237 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_1ed3933e-95e2-4f88-b795-0747b9d55b6b/sv-benchmarks/c/loops-crafted-1/Mono6_1.c[311,324] [2022-11-20 09:27:12,278 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-11-20 09:27:12,289 INFO L203 MainTranslator]: Completed pre-run [2022-11-20 09:27:12,301 WARN L237 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_1ed3933e-95e2-4f88-b795-0747b9d55b6b/sv-benchmarks/c/loops-crafted-1/Mono6_1.c[311,324] [2022-11-20 09:27:12,304 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-11-20 09:27:12,317 INFO L208 MainTranslator]: Completed translation [2022-11-20 09:27:12,318 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 09:27:12 WrapperNode [2022-11-20 09:27:12,318 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-11-20 09:27:12,319 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-11-20 09:27:12,320 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-11-20 09:27:12,320 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-11-20 09:27:12,328 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 09:27:12" (1/1) ... [2022-11-20 09:27:12,335 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 09:27:12" (1/1) ... [2022-11-20 09:27:12,349 INFO L138 Inliner]: procedures = 12, calls = 8, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 32 [2022-11-20 09:27:12,350 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-11-20 09:27:12,350 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-11-20 09:27:12,351 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-11-20 09:27:12,351 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-11-20 09:27:12,360 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 09:27:12" (1/1) ... [2022-11-20 09:27:12,360 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 09:27:12" (1/1) ... [2022-11-20 09:27:12,361 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 09:27:12" (1/1) ... [2022-11-20 09:27:12,362 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 09:27:12" (1/1) ... [2022-11-20 09:27:12,364 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 09:27:12" (1/1) ... [2022-11-20 09:27:12,368 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 09:27:12" (1/1) ... [2022-11-20 09:27:12,369 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 09:27:12" (1/1) ... [2022-11-20 09:27:12,370 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 09:27:12" (1/1) ... [2022-11-20 09:27:12,371 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-11-20 09:27:12,372 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-11-20 09:27:12,372 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-11-20 09:27:12,372 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-11-20 09:27:12,373 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 09:27:12" (1/1) ... [2022-11-20 09:27:12,380 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-11-20 09:27:12,395 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1ed3933e-95e2-4f88-b795-0747b9d55b6b/bin/uautomizer-ug76WZFUDN/z3 [2022-11-20 09:27:12,410 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1ed3933e-95e2-4f88-b795-0747b9d55b6b/bin/uautomizer-ug76WZFUDN/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-11-20 09:27:12,412 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1ed3933e-95e2-4f88-b795-0747b9d55b6b/bin/uautomizer-ug76WZFUDN/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-11-20 09:27:12,450 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-11-20 09:27:12,451 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-11-20 09:27:12,451 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-11-20 09:27:12,451 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-11-20 09:27:12,510 INFO L235 CfgBuilder]: Building ICFG [2022-11-20 09:27:12,512 INFO L261 CfgBuilder]: Building CFG for each procedure with an implementation [2022-11-20 09:27:12,613 INFO L276 CfgBuilder]: Performing block encoding [2022-11-20 09:27:12,619 INFO L295 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-11-20 09:27:12,619 INFO L300 CfgBuilder]: Removed 1 assume(true) statements. [2022-11-20 09:27:12,621 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.11 09:27:12 BoogieIcfgContainer [2022-11-20 09:27:12,622 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-11-20 09:27:12,624 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-11-20 09:27:12,624 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-11-20 09:27:12,628 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-11-20 09:27:12,628 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 20.11 09:27:12" (1/3) ... [2022-11-20 09:27:12,629 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@b4705aa and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.11 09:27:12, skipping insertion in model container [2022-11-20 09:27:12,629 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 09:27:12" (2/3) ... [2022-11-20 09:27:12,629 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@b4705aa and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.11 09:27:12, skipping insertion in model container [2022-11-20 09:27:12,630 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.11 09:27:12" (3/3) ... [2022-11-20 09:27:12,631 INFO L112 eAbstractionObserver]: Analyzing ICFG Mono6_1.c [2022-11-20 09:27:12,651 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-11-20 09:27:12,651 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-11-20 09:27:12,701 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-11-20 09:27:12,708 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;@7d1ab1ef, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2022-11-20 09:27:12,708 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-11-20 09:27:12,713 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-20 09:27:12,719 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2022-11-20 09:27:12,720 INFO L187 NwaCegarLoop]: Found error trace [2022-11-20 09:27:12,720 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2022-11-20 09:27:12,721 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-20 09:27:12,727 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 09:27:12,727 INFO L85 PathProgramCache]: Analyzing trace with hash 889968487, now seen corresponding path program 1 times [2022-11-20 09:27:12,737 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-20 09:27:12,738 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2029682232] [2022-11-20 09:27:12,738 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 09:27:12,739 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-20 09:27:12,834 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 09:27:12,922 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-20 09:27:12,922 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-20 09:27:12,923 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2029682232] [2022-11-20 09:27:12,924 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2029682232] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-20 09:27:12,924 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-20 09:27:12,925 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-11-20 09:27:12,926 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [259354594] [2022-11-20 09:27:12,927 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-20 09:27:12,932 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2022-11-20 09:27:12,933 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-20 09:27:12,988 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2022-11-20 09:27:12,990 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2022-11-20 09:27:12,992 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-20 09:27:13,008 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-20 09:27:13,008 INFO L93 Difference]: Finished difference Result 21 states and 24 transitions. [2022-11-20 09:27:13,011 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-11-20 09:27:13,012 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-20 09:27:13,013 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-20 09:27:13,023 INFO L225 Difference]: With dead ends: 21 [2022-11-20 09:27:13,023 INFO L226 Difference]: Without dead ends: 9 [2022-11-20 09:27:13,027 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-20 09:27:13,032 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-20 09:27:13,034 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-20 09:27:13,053 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9 states. [2022-11-20 09:27:13,067 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9 to 9. [2022-11-20 09:27:13,068 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-20 09:27:13,069 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 10 transitions. [2022-11-20 09:27:13,072 INFO L78 Accepts]: Start accepts. Automaton has 9 states and 10 transitions. Word has length 6 [2022-11-20 09:27:13,072 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-20 09:27:13,073 INFO L495 AbstractCegarLoop]: Abstraction has 9 states and 10 transitions. [2022-11-20 09:27:13,073 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-20 09:27:13,073 INFO L276 IsEmpty]: Start isEmpty. Operand 9 states and 10 transitions. [2022-11-20 09:27:13,074 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2022-11-20 09:27:13,074 INFO L187 NwaCegarLoop]: Found error trace [2022-11-20 09:27:13,074 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2022-11-20 09:27:13,074 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-11-20 09:27:13,075 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-20 09:27:13,078 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 09:27:13,079 INFO L85 PathProgramCache]: Analyzing trace with hash 889640786, now seen corresponding path program 1 times [2022-11-20 09:27:13,079 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-20 09:27:13,080 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [743236200] [2022-11-20 09:27:13,080 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 09:27:13,080 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-20 09:27:13,143 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 09:27:13,361 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-20 09:27:13,361 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-20 09:27:13,362 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [743236200] [2022-11-20 09:27:13,362 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [743236200] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-20 09:27:13,362 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-20 09:27:13,363 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-20 09:27:13,363 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [530178908] [2022-11-20 09:27:13,363 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-20 09:27:13,365 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-20 09:27:13,365 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-20 09:27:13,366 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-20 09:27:13,366 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-20 09:27:13,367 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-20 09:27:13,396 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-20 09:27:13,397 INFO L93 Difference]: Finished difference Result 19 states and 23 transitions. [2022-11-20 09:27:13,397 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-20 09:27:13,398 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-20 09:27:13,398 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-20 09:27:13,399 INFO L225 Difference]: With dead ends: 19 [2022-11-20 09:27:13,399 INFO L226 Difference]: Without dead ends: 12 [2022-11-20 09:27:13,399 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-20 09:27:13,401 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-20 09:27:13,402 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-20 09:27:13,403 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12 states. [2022-11-20 09:27:13,405 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12 to 11. [2022-11-20 09:27:13,406 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-20 09:27:13,407 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 12 transitions. [2022-11-20 09:27:13,407 INFO L78 Accepts]: Start accepts. Automaton has 11 states and 12 transitions. Word has length 6 [2022-11-20 09:27:13,407 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-20 09:27:13,408 INFO L495 AbstractCegarLoop]: Abstraction has 11 states and 12 transitions. [2022-11-20 09:27:13,408 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-20 09:27:13,408 INFO L276 IsEmpty]: Start isEmpty. Operand 11 states and 12 transitions. [2022-11-20 09:27:13,409 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2022-11-20 09:27:13,409 INFO L187 NwaCegarLoop]: Found error trace [2022-11-20 09:27:13,409 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-20 09:27:13,409 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-11-20 09:27:13,410 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-20 09:27:13,410 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 09:27:13,411 INFO L85 PathProgramCache]: Analyzing trace with hash 641725625, now seen corresponding path program 1 times [2022-11-20 09:27:13,411 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-20 09:27:13,411 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1109593169] [2022-11-20 09:27:13,411 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 09:27:13,412 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-20 09:27:13,428 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 09:27:13,738 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-20 09:27:13,738 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-20 09:27:13,738 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1109593169] [2022-11-20 09:27:13,739 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1109593169] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-20 09:27:13,739 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [375283412] [2022-11-20 09:27:13,739 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 09:27:13,739 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-20 09:27:13,740 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1ed3933e-95e2-4f88-b795-0747b9d55b6b/bin/uautomizer-ug76WZFUDN/z3 [2022-11-20 09:27:13,744 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1ed3933e-95e2-4f88-b795-0747b9d55b6b/bin/uautomizer-ug76WZFUDN/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-20 09:27:13,769 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1ed3933e-95e2-4f88-b795-0747b9d55b6b/bin/uautomizer-ug76WZFUDN/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2022-11-20 09:27:13,815 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 09:27:13,818 INFO L263 TraceCheckSpWp]: Trace formula consists of 43 conjuncts, 14 conjunts are in the unsatisfiable core [2022-11-20 09:27:13,824 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-20 09:27:14,011 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-20 09:27:14,011 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-20 09:27:14,108 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-20 09:27:14,109 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [375283412] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-20 09:27:14,110 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-20 09:27:14,110 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 5, 5] total 10 [2022-11-20 09:27:14,113 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [805421149] [2022-11-20 09:27:14,115 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-20 09:27:14,116 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-11-20 09:27:14,117 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-20 09:27:14,118 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-11-20 09:27:14,119 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=67, Unknown=0, NotChecked=0, Total=90 [2022-11-20 09:27:14,119 INFO L87 Difference]: Start difference. First operand 11 states and 12 transitions. Second operand has 10 states, 10 states have (on average 2.3) internal successors, (23), 10 states have internal predecessors, (23), 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-20 09:27:14,419 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-20 09:27:14,420 INFO L93 Difference]: Finished difference Result 33 states and 41 transitions. [2022-11-20 09:27:14,420 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-11-20 09:27:14,421 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 2.3) internal successors, (23), 10 states have internal predecessors, (23), 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-20 09:27:14,421 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-20 09:27:14,421 INFO L225 Difference]: With dead ends: 33 [2022-11-20 09:27:14,422 INFO L226 Difference]: Without dead ends: 22 [2022-11-20 09:27:14,422 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 12 SyntacticMatches, 1 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 19 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=57, Invalid=153, Unknown=0, NotChecked=0, Total=210 [2022-11-20 09:27:14,424 INFO L413 NwaCegarLoop]: 4 mSDtfsCounter, 16 mSDsluCounter, 18 mSDsCounter, 0 mSdLazyCounter, 63 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 16 SdHoareTripleChecker+Valid, 22 SdHoareTripleChecker+Invalid, 72 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 63 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-20 09:27:14,425 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [16 Valid, 22 Invalid, 72 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 63 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-20 09:27:14,426 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22 states. [2022-11-20 09:27:14,431 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22 to 20. [2022-11-20 09:27:14,431 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 20 states, 19 states have (on average 1.2105263157894737) internal successors, (23), 19 states have internal predecessors, (23), 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-20 09:27:14,432 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 23 transitions. [2022-11-20 09:27:14,432 INFO L78 Accepts]: Start accepts. Automaton has 20 states and 23 transitions. Word has length 9 [2022-11-20 09:27:14,433 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-20 09:27:14,433 INFO L495 AbstractCegarLoop]: Abstraction has 20 states and 23 transitions. [2022-11-20 09:27:14,433 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 2.3) internal successors, (23), 10 states have internal predecessors, (23), 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-20 09:27:14,434 INFO L276 IsEmpty]: Start isEmpty. Operand 20 states and 23 transitions. [2022-11-20 09:27:14,434 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2022-11-20 09:27:14,434 INFO L187 NwaCegarLoop]: Found error trace [2022-11-20 09:27:14,435 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 4, 1, 1, 1, 1, 1, 1] [2022-11-20 09:27:14,449 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1ed3933e-95e2-4f88-b795-0747b9d55b6b/bin/uautomizer-ug76WZFUDN/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2022-11-20 09:27:14,640 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2,2 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1ed3933e-95e2-4f88-b795-0747b9d55b6b/bin/uautomizer-ug76WZFUDN/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-20 09:27:14,641 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-20 09:27:14,641 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 09:27:14,642 INFO L85 PathProgramCache]: Analyzing trace with hash 1171899538, now seen corresponding path program 2 times [2022-11-20 09:27:14,642 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-20 09:27:14,642 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1145497301] [2022-11-20 09:27:14,643 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 09:27:14,643 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-20 09:27:14,676 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 09:27:15,064 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-20 09:27:15,065 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-20 09:27:15,065 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1145497301] [2022-11-20 09:27:15,065 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1145497301] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-20 09:27:15,068 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1093699970] [2022-11-20 09:27:15,068 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-11-20 09:27:15,069 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-20 09:27:15,069 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1ed3933e-95e2-4f88-b795-0747b9d55b6b/bin/uautomizer-ug76WZFUDN/z3 [2022-11-20 09:27:15,070 INFO L229 MonitoredProcess]: Starting monitored process 3 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1ed3933e-95e2-4f88-b795-0747b9d55b6b/bin/uautomizer-ug76WZFUDN/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-20 09:27:15,093 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1ed3933e-95e2-4f88-b795-0747b9d55b6b/bin/uautomizer-ug76WZFUDN/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2022-11-20 09:27:15,131 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2022-11-20 09:27:15,131 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-20 09:27:15,133 INFO L263 TraceCheckSpWp]: Trace formula consists of 39 conjuncts, 11 conjunts are in the unsatisfiable core [2022-11-20 09:27:15,135 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-20 09:27:15,303 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2022-11-20 09:27:15,303 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-20 09:27:15,305 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1093699970] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-20 09:27:15,305 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-11-20 09:27:15,306 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [8] total 11 [2022-11-20 09:27:15,306 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1308959279] [2022-11-20 09:27:15,306 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-20 09:27:15,307 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-11-20 09:27:15,307 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-20 09:27:15,307 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-11-20 09:27:15,308 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=86, Unknown=0, NotChecked=0, Total=110 [2022-11-20 09:27:15,308 INFO L87 Difference]: Start difference. First operand 20 states and 23 transitions. Second operand has 5 states, 5 states have (on average 1.8) internal successors, (9), 5 states have internal predecessors, (9), 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-20 09:27:15,373 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-20 09:27:15,373 INFO L93 Difference]: Finished difference Result 30 states and 35 transitions. [2022-11-20 09:27:15,373 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-11-20 09:27:15,374 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 1.8) internal successors, (9), 5 states have internal predecessors, (9), 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-20 09:27:15,374 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-20 09:27:15,376 INFO L225 Difference]: With dead ends: 30 [2022-11-20 09:27:15,376 INFO L226 Difference]: Without dead ends: 26 [2022-11-20 09:27:15,376 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 16 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=34, Invalid=122, Unknown=0, NotChecked=0, Total=156 [2022-11-20 09:27:15,377 INFO L413 NwaCegarLoop]: 6 mSDtfsCounter, 3 mSDsluCounter, 13 mSDsCounter, 0 mSdLazyCounter, 20 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3 SdHoareTripleChecker+Valid, 19 SdHoareTripleChecker+Invalid, 20 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 20 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-11-20 09:27:15,378 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [3 Valid, 19 Invalid, 20 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 20 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-11-20 09:27:15,379 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26 states. [2022-11-20 09:27:15,383 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26 to 26. [2022-11-20 09:27:15,395 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 26 states, 25 states have (on average 1.24) internal successors, (31), 25 states have internal predecessors, (31), 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-20 09:27:15,396 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 31 transitions. [2022-11-20 09:27:15,396 INFO L78 Accepts]: Start accepts. Automaton has 26 states and 31 transitions. Word has length 18 [2022-11-20 09:27:15,396 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-20 09:27:15,396 INFO L495 AbstractCegarLoop]: Abstraction has 26 states and 31 transitions. [2022-11-20 09:27:15,397 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 1.8) internal successors, (9), 5 states have internal predecessors, (9), 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-20 09:27:15,397 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 31 transitions. [2022-11-20 09:27:15,397 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2022-11-20 09:27:15,398 INFO L187 NwaCegarLoop]: Found error trace [2022-11-20 09:27:15,398 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 3, 1, 1, 1, 1, 1, 1, 1] [2022-11-20 09:27:15,423 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1ed3933e-95e2-4f88-b795-0747b9d55b6b/bin/uautomizer-ug76WZFUDN/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2022-11-20 09:27:15,604 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3,3 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1ed3933e-95e2-4f88-b795-0747b9d55b6b/bin/uautomizer-ug76WZFUDN/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-20 09:27:15,604 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-20 09:27:15,605 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 09:27:15,605 INFO L85 PathProgramCache]: Analyzing trace with hash 491841168, now seen corresponding path program 1 times [2022-11-20 09:27:15,605 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-20 09:27:15,606 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1200977157] [2022-11-20 09:27:15,606 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 09:27:15,606 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-20 09:27:15,622 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 09:27:15,725 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 13 proven. 7 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-11-20 09:27:15,725 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-20 09:27:15,725 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1200977157] [2022-11-20 09:27:15,725 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1200977157] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-20 09:27:15,725 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [412804470] [2022-11-20 09:27:15,726 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 09:27:15,726 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-20 09:27:15,726 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1ed3933e-95e2-4f88-b795-0747b9d55b6b/bin/uautomizer-ug76WZFUDN/z3 [2022-11-20 09:27:15,727 INFO L229 MonitoredProcess]: Starting monitored process 4 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1ed3933e-95e2-4f88-b795-0747b9d55b6b/bin/uautomizer-ug76WZFUDN/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-20 09:27:15,745 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1ed3933e-95e2-4f88-b795-0747b9d55b6b/bin/uautomizer-ug76WZFUDN/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2022-11-20 09:27:15,770 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 09:27:15,771 INFO L263 TraceCheckSpWp]: Trace formula consists of 57 conjuncts, 13 conjunts are in the unsatisfiable core [2022-11-20 09:27:15,772 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-20 09:27:15,859 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 13 proven. 7 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-11-20 09:27:15,859 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-20 09:27:16,150 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-20 09:27:16,150 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [412804470] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-20 09:27:16,150 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-20 09:27:16,150 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 6, 9] total 14 [2022-11-20 09:27:16,151 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2146397787] [2022-11-20 09:27:16,151 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-20 09:27:16,151 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2022-11-20 09:27:16,151 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-20 09:27:16,152 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2022-11-20 09:27:16,152 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=52, Invalid=130, Unknown=0, NotChecked=0, Total=182 [2022-11-20 09:27:16,152 INFO L87 Difference]: Start difference. First operand 26 states and 31 transitions. Second operand has 14 states, 14 states have (on average 2.4285714285714284) internal successors, (34), 14 states have internal predecessors, (34), 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-20 09:27:18,137 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-20 09:27:18,137 INFO L93 Difference]: Finished difference Result 53 states and 65 transitions. [2022-11-20 09:27:18,138 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2022-11-20 09:27:18,138 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 2.4285714285714284) internal successors, (34), 14 states have internal predecessors, (34), 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-20 09:27:18,139 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-20 09:27:18,139 INFO L225 Difference]: With dead ends: 53 [2022-11-20 09:27:18,139 INFO L226 Difference]: Without dead ends: 43 [2022-11-20 09:27:18,140 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 53 GetRequests, 27 SyntacticMatches, 2 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 133 ImplicationChecksByTransitivity, 1.8s TimeCoverageRelationStatistics Valid=200, Invalid=450, Unknown=0, NotChecked=0, Total=650 [2022-11-20 09:27:18,141 INFO L413 NwaCegarLoop]: 4 mSDtfsCounter, 62 mSDsluCounter, 25 mSDsCounter, 0 mSdLazyCounter, 103 mSolverCounterSat, 23 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 62 SdHoareTripleChecker+Valid, 29 SdHoareTripleChecker+Invalid, 126 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 23 IncrementalHoareTripleChecker+Valid, 103 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-11-20 09:27:18,141 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [62 Valid, 29 Invalid, 126 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [23 Valid, 103 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2022-11-20 09:27:18,142 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 43 states. [2022-11-20 09:27:18,150 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 43 to 37. [2022-11-20 09:27:18,150 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 37 states, 36 states have (on average 1.2222222222222223) internal successors, (44), 36 states have internal predecessors, (44), 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-20 09:27:18,151 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37 states to 37 states and 44 transitions. [2022-11-20 09:27:18,151 INFO L78 Accepts]: Start accepts. Automaton has 37 states and 44 transitions. Word has length 18 [2022-11-20 09:27:18,152 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-20 09:27:18,152 INFO L495 AbstractCegarLoop]: Abstraction has 37 states and 44 transitions. [2022-11-20 09:27:18,152 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 2.4285714285714284) internal successors, (34), 14 states have internal predecessors, (34), 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-20 09:27:18,152 INFO L276 IsEmpty]: Start isEmpty. Operand 37 states and 44 transitions. [2022-11-20 09:27:18,153 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2022-11-20 09:27:18,153 INFO L187 NwaCegarLoop]: Found error trace [2022-11-20 09:27:18,153 INFO L195 NwaCegarLoop]: trace histogram [5, 5, 4, 1, 1, 1, 1, 1, 1, 1] [2022-11-20 09:27:18,160 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1ed3933e-95e2-4f88-b795-0747b9d55b6b/bin/uautomizer-ug76WZFUDN/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2022-11-20 09:27:18,358 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,4 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1ed3933e-95e2-4f88-b795-0747b9d55b6b/bin/uautomizer-ug76WZFUDN/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-20 09:27:18,359 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-20 09:27:18,359 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 09:27:18,360 INFO L85 PathProgramCache]: Analyzing trace with hash -191017413, now seen corresponding path program 2 times [2022-11-20 09:27:18,360 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-20 09:27:18,360 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1541483214] [2022-11-20 09:27:18,360 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 09:27:18,360 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-20 09:27:18,370 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 09:27:18,489 INFO L134 CoverageAnalysis]: Checked inductivity of 35 backedges. 9 proven. 26 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-20 09:27:18,489 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-20 09:27:18,489 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1541483214] [2022-11-20 09:27:18,489 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1541483214] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-20 09:27:18,490 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2044265810] [2022-11-20 09:27:18,490 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-11-20 09:27:18,492 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-20 09:27:18,492 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1ed3933e-95e2-4f88-b795-0747b9d55b6b/bin/uautomizer-ug76WZFUDN/z3 [2022-11-20 09:27:18,494 INFO L229 MonitoredProcess]: Starting monitored process 5 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1ed3933e-95e2-4f88-b795-0747b9d55b6b/bin/uautomizer-ug76WZFUDN/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-20 09:27:18,496 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1ed3933e-95e2-4f88-b795-0747b9d55b6b/bin/uautomizer-ug76WZFUDN/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2022-11-20 09:27:18,544 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-11-20 09:27:18,545 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-20 09:27:18,546 INFO L263 TraceCheckSpWp]: Trace formula consists of 61 conjuncts, 22 conjunts are in the unsatisfiable core [2022-11-20 09:27:18,547 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-20 09:27:18,723 INFO L134 CoverageAnalysis]: Checked inductivity of 35 backedges. 0 proven. 35 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-20 09:27:18,724 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-20 09:27:18,944 INFO L134 CoverageAnalysis]: Checked inductivity of 35 backedges. 0 proven. 33 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-11-20 09:27:18,945 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2044265810] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-20 09:27:18,945 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-20 09:27:18,945 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 10, 8] total 21 [2022-11-20 09:27:18,945 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1937393056] [2022-11-20 09:27:18,945 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-20 09:27:18,946 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 21 states [2022-11-20 09:27:18,946 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-20 09:27:18,946 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2022-11-20 09:27:18,946 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=89, Invalid=331, Unknown=0, NotChecked=0, Total=420 [2022-11-20 09:27:18,947 INFO L87 Difference]: Start difference. First operand 37 states and 44 transitions. Second operand has 21 states, 21 states have (on average 2.761904761904762) internal successors, (58), 21 states have internal predecessors, (58), 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-20 09:27:21,919 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.55s for a HTC check with result VALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-11-20 09:27:23,939 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-11-20 09:27:26,009 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-11-20 09:27:27,471 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-20 09:27:27,471 INFO L93 Difference]: Finished difference Result 91 states and 114 transitions. [2022-11-20 09:27:27,471 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2022-11-20 09:27:27,472 INFO L78 Accepts]: Start accepts. Automaton has has 21 states, 21 states have (on average 2.761904761904762) internal successors, (58), 21 states have internal predecessors, (58), 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 21 [2022-11-20 09:27:27,472 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-20 09:27:27,473 INFO L225 Difference]: With dead ends: 91 [2022-11-20 09:27:27,473 INFO L226 Difference]: Without dead ends: 70 [2022-11-20 09:27:27,473 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 58 GetRequests, 28 SyntacticMatches, 2 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 175 ImplicationChecksByTransitivity, 1.8s TimeCoverageRelationStatistics Valid=199, Invalid=671, Unknown=0, NotChecked=0, Total=870 [2022-11-20 09:27:27,474 INFO L413 NwaCegarLoop]: 4 mSDtfsCounter, 20 mSDsluCounter, 30 mSDsCounter, 0 mSdLazyCounter, 227 mSolverCounterSat, 20 mSolverCounterUnsat, 2 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 6.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 20 SdHoareTripleChecker+Valid, 34 SdHoareTripleChecker+Invalid, 249 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 20 IncrementalHoareTripleChecker+Valid, 227 IncrementalHoareTripleChecker+Invalid, 2 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 6.9s IncrementalHoareTripleChecker+Time [2022-11-20 09:27:27,475 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [20 Valid, 34 Invalid, 249 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [20 Valid, 227 Invalid, 2 Unknown, 0 Unchecked, 6.9s Time] [2022-11-20 09:27:27,475 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 70 states. [2022-11-20 09:27:27,487 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 70 to 64. [2022-11-20 09:27:27,487 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 64 states, 63 states have (on average 1.2222222222222223) internal successors, (77), 63 states have internal predecessors, (77), 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-20 09:27:27,488 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 64 states to 64 states and 77 transitions. [2022-11-20 09:27:27,489 INFO L78 Accepts]: Start accepts. Automaton has 64 states and 77 transitions. Word has length 21 [2022-11-20 09:27:27,489 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-20 09:27:27,489 INFO L495 AbstractCegarLoop]: Abstraction has 64 states and 77 transitions. [2022-11-20 09:27:27,489 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 21 states, 21 states have (on average 2.761904761904762) internal successors, (58), 21 states have internal predecessors, (58), 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-20 09:27:27,489 INFO L276 IsEmpty]: Start isEmpty. Operand 64 states and 77 transitions. [2022-11-20 09:27:27,490 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2022-11-20 09:27:27,490 INFO L187 NwaCegarLoop]: Found error trace [2022-11-20 09:27:27,490 INFO L195 NwaCegarLoop]: trace histogram [8, 8, 7, 1, 1, 1, 1, 1, 1, 1] [2022-11-20 09:27:27,500 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1ed3933e-95e2-4f88-b795-0747b9d55b6b/bin/uautomizer-ug76WZFUDN/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2022-11-20 09:27:27,695 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5,5 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1ed3933e-95e2-4f88-b795-0747b9d55b6b/bin/uautomizer-ug76WZFUDN/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-20 09:27:27,695 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-20 09:27:27,696 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 09:27:27,696 INFO L85 PathProgramCache]: Analyzing trace with hash -1978693868, now seen corresponding path program 3 times [2022-11-20 09:27:27,696 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-20 09:27:27,696 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [423209827] [2022-11-20 09:27:27,696 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 09:27:27,696 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-20 09:27:27,707 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 09:27:27,878 INFO L134 CoverageAnalysis]: Checked inductivity of 92 backedges. 45 proven. 40 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2022-11-20 09:27:27,878 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-20 09:27:27,878 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [423209827] [2022-11-20 09:27:27,879 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [423209827] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-20 09:27:27,879 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [65098309] [2022-11-20 09:27:27,879 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-11-20 09:27:27,879 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-20 09:27:27,879 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1ed3933e-95e2-4f88-b795-0747b9d55b6b/bin/uautomizer-ug76WZFUDN/z3 [2022-11-20 09:27:27,880 INFO L229 MonitoredProcess]: Starting monitored process 6 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1ed3933e-95e2-4f88-b795-0747b9d55b6b/bin/uautomizer-ug76WZFUDN/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-20 09:27:27,901 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1ed3933e-95e2-4f88-b795-0747b9d55b6b/bin/uautomizer-ug76WZFUDN/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2022-11-20 09:27:27,928 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2022-11-20 09:27:27,928 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-20 09:27:27,931 INFO L263 TraceCheckSpWp]: Trace formula consists of 43 conjuncts, 7 conjunts are in the unsatisfiable core [2022-11-20 09:27:27,932 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-20 09:27:28,054 INFO L134 CoverageAnalysis]: Checked inductivity of 92 backedges. 15 proven. 0 refuted. 0 times theorem prover too weak. 77 trivial. 0 not checked. [2022-11-20 09:27:28,054 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-20 09:27:28,055 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [65098309] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-20 09:27:28,055 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-11-20 09:27:28,055 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [8] total 11 [2022-11-20 09:27:28,055 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [494396581] [2022-11-20 09:27:28,056 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-20 09:27:28,056 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-11-20 09:27:28,056 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-20 09:27:28,056 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-11-20 09:27:28,057 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=84, Unknown=0, NotChecked=0, Total=110 [2022-11-20 09:27:28,057 INFO L87 Difference]: Start difference. First operand 64 states and 77 transitions. Second operand has 5 states, 5 states have (on average 2.4) internal successors, (12), 5 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-20 09:27:28,113 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-20 09:27:28,114 INFO L93 Difference]: Finished difference Result 83 states and 99 transitions. [2022-11-20 09:27:28,114 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-11-20 09:27:28,114 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 2.4) internal successors, (12), 5 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) Word has length 30 [2022-11-20 09:27:28,115 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-20 09:27:28,115 INFO L225 Difference]: With dead ends: 83 [2022-11-20 09:27:28,116 INFO L226 Difference]: Without dead ends: 79 [2022-11-20 09:27:28,116 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 40 GetRequests, 29 SyntacticMatches, 1 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=31, Invalid=101, Unknown=0, NotChecked=0, Total=132 [2022-11-20 09:27:28,117 INFO L413 NwaCegarLoop]: 5 mSDtfsCounter, 8 mSDsluCounter, 5 mSDsCounter, 0 mSdLazyCounter, 21 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 8 SdHoareTripleChecker+Valid, 10 SdHoareTripleChecker+Invalid, 22 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 21 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-11-20 09:27:28,117 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [8 Valid, 10 Invalid, 22 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 21 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-11-20 09:27:28,118 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 79 states. [2022-11-20 09:27:28,130 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 79 to 54. [2022-11-20 09:27:28,130 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 54 states, 53 states have (on average 1.1886792452830188) internal successors, (63), 53 states have internal predecessors, (63), 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-20 09:27:28,131 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 54 states to 54 states and 63 transitions. [2022-11-20 09:27:28,132 INFO L78 Accepts]: Start accepts. Automaton has 54 states and 63 transitions. Word has length 30 [2022-11-20 09:27:28,132 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-20 09:27:28,132 INFO L495 AbstractCegarLoop]: Abstraction has 54 states and 63 transitions. [2022-11-20 09:27:28,132 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 2.4) internal successors, (12), 5 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-20 09:27:28,132 INFO L276 IsEmpty]: Start isEmpty. Operand 54 states and 63 transitions. [2022-11-20 09:27:28,133 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2022-11-20 09:27:28,133 INFO L187 NwaCegarLoop]: Found error trace [2022-11-20 09:27:28,134 INFO L195 NwaCegarLoop]: trace histogram [9, 9, 7, 2, 1, 1, 1, 1, 1, 1] [2022-11-20 09:27:28,146 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1ed3933e-95e2-4f88-b795-0747b9d55b6b/bin/uautomizer-ug76WZFUDN/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2022-11-20 09:27:28,339 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,6 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1ed3933e-95e2-4f88-b795-0747b9d55b6b/bin/uautomizer-ug76WZFUDN/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-20 09:27:28,339 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-20 09:27:28,339 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 09:27:28,340 INFO L85 PathProgramCache]: Analyzing trace with hash -1598856071, now seen corresponding path program 4 times [2022-11-20 09:27:28,340 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-20 09:27:28,340 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [676023013] [2022-11-20 09:27:28,340 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 09:27:28,340 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-20 09:27:28,354 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 09:27:28,542 INFO L134 CoverageAnalysis]: Checked inductivity of 117 backedges. 62 proven. 40 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2022-11-20 09:27:28,543 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-20 09:27:28,543 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [676023013] [2022-11-20 09:27:28,543 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [676023013] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-20 09:27:28,543 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [350097654] [2022-11-20 09:27:28,544 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-11-20 09:27:28,544 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-20 09:27:28,544 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1ed3933e-95e2-4f88-b795-0747b9d55b6b/bin/uautomizer-ug76WZFUDN/z3 [2022-11-20 09:27:28,545 INFO L229 MonitoredProcess]: Starting monitored process 7 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1ed3933e-95e2-4f88-b795-0747b9d55b6b/bin/uautomizer-ug76WZFUDN/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-20 09:27:28,551 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1ed3933e-95e2-4f88-b795-0747b9d55b6b/bin/uautomizer-ug76WZFUDN/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2022-11-20 09:27:28,597 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-11-20 09:27:28,597 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-20 09:27:28,598 INFO L263 TraceCheckSpWp]: Trace formula consists of 79 conjuncts, 16 conjunts are in the unsatisfiable core [2022-11-20 09:27:28,606 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-20 09:27:28,764 INFO L134 CoverageAnalysis]: Checked inductivity of 117 backedges. 62 proven. 40 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2022-11-20 09:27:28,764 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-20 09:27:29,038 INFO L134 CoverageAnalysis]: Checked inductivity of 117 backedges. 62 proven. 40 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2022-11-20 09:27:29,038 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [350097654] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-20 09:27:29,038 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-20 09:27:29,039 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 9, 9] total 22 [2022-11-20 09:27:29,039 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1989879886] [2022-11-20 09:27:29,039 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-20 09:27:29,039 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 22 states [2022-11-20 09:27:29,039 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-20 09:27:29,040 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2022-11-20 09:27:29,040 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=151, Invalid=311, Unknown=0, NotChecked=0, Total=462 [2022-11-20 09:27:29,040 INFO L87 Difference]: Start difference. First operand 54 states and 63 transitions. Second operand has 22 states, 22 states have (on average 2.8636363636363638) internal successors, (63), 22 states have internal predecessors, (63), 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-20 09:27:32,698 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-20 09:27:32,698 INFO L93 Difference]: Finished difference Result 78 states and 93 transitions. [2022-11-20 09:27:32,699 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2022-11-20 09:27:32,699 INFO L78 Accepts]: Start accepts. Automaton has has 22 states, 22 states have (on average 2.8636363636363638) internal successors, (63), 22 states have internal predecessors, (63), 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 33 [2022-11-20 09:27:32,699 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-20 09:27:32,700 INFO L225 Difference]: With dead ends: 78 [2022-11-20 09:27:32,700 INFO L226 Difference]: Without dead ends: 46 [2022-11-20 09:27:32,700 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 84 GetRequests, 53 SyntacticMatches, 1 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 321 ImplicationChecksByTransitivity, 3.6s TimeCoverageRelationStatistics Valid=381, Invalid=611, Unknown=0, NotChecked=0, Total=992 [2022-11-20 09:27:32,701 INFO L413 NwaCegarLoop]: 6 mSDtfsCounter, 48 mSDsluCounter, 9 mSDsCounter, 0 mSdLazyCounter, 178 mSolverCounterSat, 29 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 48 SdHoareTripleChecker+Valid, 15 SdHoareTripleChecker+Invalid, 207 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 29 IncrementalHoareTripleChecker+Valid, 178 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-11-20 09:27:32,701 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [48 Valid, 15 Invalid, 207 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [29 Valid, 178 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-11-20 09:27:32,702 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 46 states. [2022-11-20 09:27:32,712 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 46 to 46. [2022-11-20 09:27:32,713 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 46 states, 45 states have (on average 1.0444444444444445) internal successors, (47), 45 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-20 09:27:32,714 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 46 states to 46 states and 47 transitions. [2022-11-20 09:27:32,714 INFO L78 Accepts]: Start accepts. Automaton has 46 states and 47 transitions. Word has length 33 [2022-11-20 09:27:32,714 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-20 09:27:32,714 INFO L495 AbstractCegarLoop]: Abstraction has 46 states and 47 transitions. [2022-11-20 09:27:32,714 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 22 states, 22 states have (on average 2.8636363636363638) internal successors, (63), 22 states have internal predecessors, (63), 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-20 09:27:32,715 INFO L276 IsEmpty]: Start isEmpty. Operand 46 states and 47 transitions. [2022-11-20 09:27:32,715 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2022-11-20 09:27:32,716 INFO L187 NwaCegarLoop]: Found error trace [2022-11-20 09:27:32,716 INFO L195 NwaCegarLoop]: trace histogram [13, 13, 12, 1, 1, 1, 1, 1, 1, 1] [2022-11-20 09:27:32,729 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1ed3933e-95e2-4f88-b795-0747b9d55b6b/bin/uautomizer-ug76WZFUDN/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0 [2022-11-20 09:27:32,922 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,7 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1ed3933e-95e2-4f88-b795-0747b9d55b6b/bin/uautomizer-ug76WZFUDN/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-20 09:27:32,922 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-20 09:27:32,922 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 09:27:32,922 INFO L85 PathProgramCache]: Analyzing trace with hash 141362107, now seen corresponding path program 5 times [2022-11-20 09:27:32,923 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-20 09:27:32,923 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [381710784] [2022-11-20 09:27:32,923 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 09:27:32,923 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-20 09:27:32,935 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 09:27:33,295 INFO L134 CoverageAnalysis]: Checked inductivity of 247 backedges. 25 proven. 222 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-20 09:27:33,296 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-20 09:27:33,296 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [381710784] [2022-11-20 09:27:33,296 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [381710784] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-20 09:27:33,296 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1837492850] [2022-11-20 09:27:33,296 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2022-11-20 09:27:33,296 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-20 09:27:33,297 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1ed3933e-95e2-4f88-b795-0747b9d55b6b/bin/uautomizer-ug76WZFUDN/z3 [2022-11-20 09:27:33,298 INFO L229 MonitoredProcess]: Starting monitored process 8 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1ed3933e-95e2-4f88-b795-0747b9d55b6b/bin/uautomizer-ug76WZFUDN/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-20 09:27:33,306 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1ed3933e-95e2-4f88-b795-0747b9d55b6b/bin/uautomizer-ug76WZFUDN/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2022-11-20 09:27:34,425 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 14 check-sat command(s) [2022-11-20 09:27:34,425 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-20 09:27:34,428 INFO L263 TraceCheckSpWp]: Trace formula consists of 93 conjuncts, 40 conjunts are in the unsatisfiable core [2022-11-20 09:27:34,429 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-20 09:27:34,999 INFO L134 CoverageAnalysis]: Checked inductivity of 247 backedges. 0 proven. 247 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-20 09:27:34,999 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-20 09:27:35,909 INFO L134 CoverageAnalysis]: Checked inductivity of 247 backedges. 0 proven. 245 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-11-20 09:27:35,909 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1837492850] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-20 09:27:35,909 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-20 09:27:35,909 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 18, 16] total 45 [2022-11-20 09:27:35,909 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2114277618] [2022-11-20 09:27:35,910 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-20 09:27:35,910 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 45 states [2022-11-20 09:27:35,910 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-20 09:27:35,911 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 45 interpolants. [2022-11-20 09:27:35,912 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=321, Invalid=1659, Unknown=0, NotChecked=0, Total=1980 [2022-11-20 09:27:35,912 INFO L87 Difference]: Start difference. First operand 46 states and 47 transitions. Second operand has 45 states, 45 states have (on average 2.888888888888889) internal successors, (130), 45 states have internal predecessors, (130), 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-20 09:27:38,363 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse0 (mod |c_ULTIMATE.start_main_~z~0#1| 4294967296))) (and (not (= (mod (+ |c_ULTIMATE.start_main_~x~0#1| 2) 4294967296) .cse0)) (not (= .cse0 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 5) 4294967296))) (not (= (mod (+ |c_ULTIMATE.start_main_~x~0#1| 9) 4294967296) .cse0)) (not (= (mod |c_ULTIMATE.start_main_~x~0#1| 4294967296) .cse0)) (not (= (mod (+ |c_ULTIMATE.start_main_~x~0#1| 8) 4294967296) .cse0)) (not (= .cse0 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 11) 4294967296))) (not (= .cse0 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 12) 4294967296))) (not (= .cse0 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 3) 4294967296))) (not (= .cse0 (mod (+ 7 |c_ULTIMATE.start_main_~x~0#1|) 4294967296))) (not (= (mod (+ |c_ULTIMATE.start_main_~x~0#1| 4) 4294967296) .cse0)) (not (= .cse0 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 10) 4294967296))) (not (= .cse0 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 6) 4294967296))) (not (= .cse0 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 1) 4294967296))))) is different from false [2022-11-20 09:28:10,073 WARN L233 SmtUtils]: Spent 22.74s on a formula simplification that was a NOOP. DAG size: 65 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-11-20 09:28:12,101 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse0 (mod |c_ULTIMATE.start_main_~z~0#1| 4294967296))) (and (not (= (mod (+ |c_ULTIMATE.start_main_~x~0#1| 2) 4294967296) .cse0)) (not (= .cse0 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 5) 4294967296))) (not (= (mod (+ |c_ULTIMATE.start_main_~x~0#1| 9) 4294967296) .cse0)) (not (= (mod |c_ULTIMATE.start_main_~x~0#1| 4294967296) .cse0)) (not (= (mod (+ |c_ULTIMATE.start_main_~x~0#1| 8) 4294967296) .cse0)) (not (= .cse0 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 11) 4294967296))) (not (= .cse0 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 3) 4294967296))) (not (= .cse0 (mod (+ 7 |c_ULTIMATE.start_main_~x~0#1|) 4294967296))) (not (= (mod (+ |c_ULTIMATE.start_main_~x~0#1| 4) 4294967296) .cse0)) (not (= .cse0 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 10) 4294967296))) (not (= .cse0 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 6) 4294967296))) (not (= .cse0 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 1) 4294967296))))) is different from false [2022-11-20 09:28:14,153 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse0 (mod |c_ULTIMATE.start_main_~z~0#1| 4294967296))) (and (not (= (mod (+ |c_ULTIMATE.start_main_~x~0#1| 2) 4294967296) .cse0)) (not (= .cse0 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 5) 4294967296))) (not (= (mod (+ |c_ULTIMATE.start_main_~x~0#1| 9) 4294967296) .cse0)) (not (= (mod (+ |c_ULTIMATE.start_main_~x~0#1| 8) 4294967296) .cse0)) (not (= .cse0 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 11) 4294967296))) (not (= .cse0 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 3) 4294967296))) (not (= .cse0 (mod (+ 7 |c_ULTIMATE.start_main_~x~0#1|) 4294967296))) (not (= (mod (+ |c_ULTIMATE.start_main_~x~0#1| 4) 4294967296) .cse0)) (not (= .cse0 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 10) 4294967296))) (not (= .cse0 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 6) 4294967296))) (not (= .cse0 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 1) 4294967296))))) is different from false [2022-11-20 09:29:03,414 WARN L233 SmtUtils]: Spent 20.81s on a formula simplification that was a NOOP. DAG size: 58 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-11-20 09:29:07,328 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-11-20 09:29:09,333 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-11-20 09:29:11,336 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-11-20 09:29:13,342 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-11-20 09:29:15,120 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.78s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-11-20 09:29:17,140 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.02s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-11-20 09:29:19,145 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-11-20 09:29:21,151 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-11-20 09:29:23,156 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-11-20 09:29:25,164 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-11-20 09:29:27,204 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-11-20 09:29:30,155 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-11-20 09:29:33,141 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-11-20 09:29:36,209 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse0 (mod |c_ULTIMATE.start_main_~z~0#1| 4294967296))) (and (not (= (mod (+ |c_ULTIMATE.start_main_~x~0#1| 2) 4294967296) .cse0)) (not (= .cse0 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 5) 4294967296))) (not (= (mod (+ |c_ULTIMATE.start_main_~x~0#1| 9) 4294967296) .cse0)) (not (= (mod |c_ULTIMATE.start_main_~x~0#1| 4294967296) .cse0)) (not (= (mod (+ |c_ULTIMATE.start_main_~x~0#1| 8) 4294967296) .cse0)) (not (= .cse0 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 3) 4294967296))) (not (= .cse0 (mod (+ 7 |c_ULTIMATE.start_main_~x~0#1|) 4294967296))) (not (= (mod (+ |c_ULTIMATE.start_main_~x~0#1| 4) 4294967296) .cse0)) (not (= .cse0 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 6) 4294967296))) (not (= .cse0 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 1) 4294967296))))) is different from false [2022-11-20 09:29:54,001 WARN L233 SmtUtils]: Spent 14.90s on a formula simplification that was a NOOP. DAG size: 50 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-11-20 09:29:56,039 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse0 (mod |c_ULTIMATE.start_main_~z~0#1| 4294967296))) (and (not (= (mod (+ |c_ULTIMATE.start_main_~x~0#1| 2) 4294967296) .cse0)) (not (= .cse0 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 5) 4294967296))) (not (= (mod |c_ULTIMATE.start_main_~x~0#1| 4294967296) .cse0)) (not (= (mod (+ |c_ULTIMATE.start_main_~x~0#1| 8) 4294967296) .cse0)) (not (= .cse0 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 3) 4294967296))) (not (= .cse0 (mod (+ 7 |c_ULTIMATE.start_main_~x~0#1|) 4294967296))) (not (= (mod (+ |c_ULTIMATE.start_main_~x~0#1| 4) 4294967296) .cse0)) (not (= .cse0 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 6) 4294967296))) (not (= .cse0 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 1) 4294967296))))) is different from false [2022-11-20 09:30:08,351 WARN L233 SmtUtils]: Spent 7.28s on a formula simplification that was a NOOP. DAG size: 45 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-11-20 09:30:24,187 WARN L233 SmtUtils]: Spent 7.92s on a formula simplification that was a NOOP. DAG size: 43 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-11-20 09:30:34,984 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.73s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-11-20 09:30:36,989 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-11-20 09:30:38,995 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-11-20 09:30:41,015 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.02s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-11-20 09:30:43,026 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-11-20 09:30:45,048 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.02s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-11-20 09:30:47,058 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-11-20 09:30:49,142 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-11-20 09:30:57,680 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-11-20 09:30:59,808 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-11-20 09:31:06,282 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-20 09:31:06,282 INFO L93 Difference]: Finished difference Result 118 states and 140 transitions. [2022-11-20 09:31:06,282 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 40 states. [2022-11-20 09:31:06,282 INFO L78 Accepts]: Start accepts. Automaton has has 45 states, 45 states have (on average 2.888888888888889) internal successors, (130), 45 states have internal predecessors, (130), 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 45 [2022-11-20 09:31:06,283 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-20 09:31:06,283 INFO L225 Difference]: With dead ends: 118 [2022-11-20 09:31:06,283 INFO L226 Difference]: Without dead ends: 103 [2022-11-20 09:31:06,285 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 128 GetRequests, 60 SyntacticMatches, 2 SemanticMatches, 66 ConstructedPredicates, 5 IntricatePredicates, 0 DeprecatedPredicates, 797 ImplicationChecksByTransitivity, 156.9s TimeCoverageRelationStatistics Valid=760, Invalid=3158, Unknown=8, NotChecked=630, Total=4556 [2022-11-20 09:31:06,286 INFO L413 NwaCegarLoop]: 4 mSDtfsCounter, 34 mSDsluCounter, 48 mSDsCounter, 0 mSdLazyCounter, 1064 mSolverCounterSat, 43 mSolverCounterUnsat, 21 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 54.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 34 SdHoareTripleChecker+Valid, 52 SdHoareTripleChecker+Invalid, 1141 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 43 IncrementalHoareTripleChecker+Valid, 1064 IncrementalHoareTripleChecker+Invalid, 21 IncrementalHoareTripleChecker+Unknown, 13 IncrementalHoareTripleChecker+Unchecked, 54.7s IncrementalHoareTripleChecker+Time [2022-11-20 09:31:06,286 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [34 Valid, 52 Invalid, 1141 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [43 Valid, 1064 Invalid, 21 Unknown, 13 Unchecked, 54.7s Time] [2022-11-20 09:31:06,289 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 103 states. [2022-11-20 09:31:06,306 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 103 to 97. [2022-11-20 09:31:06,306 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 97 states, 96 states have (on average 1.1875) internal successors, (114), 96 states have internal predecessors, (114), 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-20 09:31:06,307 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 97 states to 97 states and 114 transitions. [2022-11-20 09:31:06,307 INFO L78 Accepts]: Start accepts. Automaton has 97 states and 114 transitions. Word has length 45 [2022-11-20 09:31:06,308 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-20 09:31:06,308 INFO L495 AbstractCegarLoop]: Abstraction has 97 states and 114 transitions. [2022-11-20 09:31:06,308 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 45 states, 45 states have (on average 2.888888888888889) internal successors, (130), 45 states have internal predecessors, (130), 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-20 09:31:06,308 INFO L276 IsEmpty]: Start isEmpty. Operand 97 states and 114 transitions. [2022-11-20 09:31:06,309 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2022-11-20 09:31:06,309 INFO L187 NwaCegarLoop]: Found error trace [2022-11-20 09:31:06,310 INFO L195 NwaCegarLoop]: trace histogram [16, 16, 14, 2, 1, 1, 1, 1, 1, 1] [2022-11-20 09:31:06,320 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1ed3933e-95e2-4f88-b795-0747b9d55b6b/bin/uautomizer-ug76WZFUDN/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Ended with exit code 0 [2022-11-20 09:31:06,515 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,8 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1ed3933e-95e2-4f88-b795-0747b9d55b6b/bin/uautomizer-ug76WZFUDN/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-20 09:31:06,516 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-20 09:31:06,516 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 09:31:06,516 INFO L85 PathProgramCache]: Analyzing trace with hash 1567248470, now seen corresponding path program 6 times [2022-11-20 09:31:06,516 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-20 09:31:06,517 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [298992039] [2022-11-20 09:31:06,517 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 09:31:06,517 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-20 09:31:06,542 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 09:31:07,000 INFO L134 CoverageAnalysis]: Checked inductivity of 376 backedges. 109 proven. 260 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2022-11-20 09:31:07,001 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-20 09:31:07,001 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [298992039] [2022-11-20 09:31:07,001 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [298992039] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-20 09:31:07,001 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1301609899] [2022-11-20 09:31:07,001 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2022-11-20 09:31:07,001 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-20 09:31:07,002 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1ed3933e-95e2-4f88-b795-0747b9d55b6b/bin/uautomizer-ug76WZFUDN/z3 [2022-11-20 09:31:07,003 INFO L229 MonitoredProcess]: Starting monitored process 9 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1ed3933e-95e2-4f88-b795-0747b9d55b6b/bin/uautomizer-ug76WZFUDN/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-20 09:31:07,021 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1ed3933e-95e2-4f88-b795-0747b9d55b6b/bin/uautomizer-ug76WZFUDN/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2022-11-20 09:31:07,068 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 7 check-sat command(s) [2022-11-20 09:31:07,069 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-20 09:31:07,070 INFO L263 TraceCheckSpWp]: Trace formula consists of 65 conjuncts, 9 conjunts are in the unsatisfiable core [2022-11-20 09:31:07,071 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-20 09:31:07,295 INFO L134 CoverageAnalysis]: Checked inductivity of 376 backedges. 73 proven. 2 refuted. 0 times theorem prover too weak. 301 trivial. 0 not checked. [2022-11-20 09:31:07,295 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-20 09:31:07,635 INFO L134 CoverageAnalysis]: Checked inductivity of 376 backedges. 149 proven. 75 refuted. 0 times theorem prover too weak. 152 trivial. 0 not checked. [2022-11-20 09:31:07,636 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1301609899] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-20 09:31:07,636 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-20 09:31:07,636 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 6, 7] total 25 [2022-11-20 09:31:07,636 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1239366864] [2022-11-20 09:31:07,637 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-20 09:31:07,637 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 25 states [2022-11-20 09:31:07,637 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-20 09:31:07,638 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2022-11-20 09:31:07,638 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=81, Invalid=519, Unknown=0, NotChecked=0, Total=600 [2022-11-20 09:31:07,638 INFO L87 Difference]: Start difference. First operand 97 states and 114 transitions. Second operand has 25 states, 25 states have (on average 3.08) internal successors, (77), 25 states have internal predecessors, (77), 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-20 09:31:08,934 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-20 09:31:08,934 INFO L93 Difference]: Finished difference Result 157 states and 194 transitions. [2022-11-20 09:31:08,935 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2022-11-20 09:31:08,935 INFO L78 Accepts]: Start accepts. Automaton has has 25 states, 25 states have (on average 3.08) internal successors, (77), 25 states have internal predecessors, (77), 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 54 [2022-11-20 09:31:08,935 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-20 09:31:08,936 INFO L225 Difference]: With dead ends: 157 [2022-11-20 09:31:08,936 INFO L226 Difference]: Without dead ends: 145 [2022-11-20 09:31:08,937 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 144 GetRequests, 100 SyntacticMatches, 1 SemanticMatches, 43 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 267 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=424, Invalid=1556, Unknown=0, NotChecked=0, Total=1980 [2022-11-20 09:31:08,938 INFO L413 NwaCegarLoop]: 5 mSDtfsCounter, 103 mSDsluCounter, 53 mSDsCounter, 0 mSdLazyCounter, 596 mSolverCounterSat, 53 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 103 SdHoareTripleChecker+Valid, 58 SdHoareTripleChecker+Invalid, 649 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 53 IncrementalHoareTripleChecker+Valid, 596 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-11-20 09:31:08,938 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [103 Valid, 58 Invalid, 649 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [53 Valid, 596 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2022-11-20 09:31:08,939 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 145 states. [2022-11-20 09:31:08,973 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 145 to 109. [2022-11-20 09:31:08,974 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 109 states, 108 states have (on average 1.1851851851851851) internal successors, (128), 108 states have internal predecessors, (128), 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-20 09:31:08,977 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 109 states to 109 states and 128 transitions. [2022-11-20 09:31:08,977 INFO L78 Accepts]: Start accepts. Automaton has 109 states and 128 transitions. Word has length 54 [2022-11-20 09:31:08,978 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-20 09:31:08,978 INFO L495 AbstractCegarLoop]: Abstraction has 109 states and 128 transitions. [2022-11-20 09:31:08,978 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 25 states, 25 states have (on average 3.08) internal successors, (77), 25 states have internal predecessors, (77), 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-20 09:31:08,978 INFO L276 IsEmpty]: Start isEmpty. Operand 109 states and 128 transitions. [2022-11-20 09:31:08,988 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 73 [2022-11-20 09:31:08,988 INFO L187 NwaCegarLoop]: Found error trace [2022-11-20 09:31:08,989 INFO L195 NwaCegarLoop]: trace histogram [22, 22, 16, 6, 1, 1, 1, 1, 1, 1] [2022-11-20 09:31:09,002 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1ed3933e-95e2-4f88-b795-0747b9d55b6b/bin/uautomizer-ug76WZFUDN/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Forceful destruction successful, exit code 0 [2022-11-20 09:31:09,195 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1ed3933e-95e2-4f88-b795-0747b9d55b6b/bin/uautomizer-ug76WZFUDN/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable9 [2022-11-20 09:31:09,195 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-20 09:31:09,195 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 09:31:09,195 INFO L85 PathProgramCache]: Analyzing trace with hash -752211018, now seen corresponding path program 7 times [2022-11-20 09:31:09,196 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-20 09:31:09,196 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [69918898] [2022-11-20 09:31:09,196 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 09:31:09,196 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-20 09:31:09,219 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 09:31:09,780 INFO L134 CoverageAnalysis]: Checked inductivity of 715 backedges. 313 proven. 345 refuted. 0 times theorem prover too weak. 57 trivial. 0 not checked. [2022-11-20 09:31:09,780 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-20 09:31:09,780 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [69918898] [2022-11-20 09:31:09,780 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [69918898] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-20 09:31:09,781 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [216464903] [2022-11-20 09:31:09,781 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2022-11-20 09:31:09,781 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-20 09:31:09,781 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1ed3933e-95e2-4f88-b795-0747b9d55b6b/bin/uautomizer-ug76WZFUDN/z3 [2022-11-20 09:31:09,786 INFO L229 MonitoredProcess]: Starting monitored process 10 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1ed3933e-95e2-4f88-b795-0747b9d55b6b/bin/uautomizer-ug76WZFUDN/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-20 09:31:09,805 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1ed3933e-95e2-4f88-b795-0747b9d55b6b/bin/uautomizer-ug76WZFUDN/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2022-11-20 09:31:09,892 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 09:31:09,894 INFO L263 TraceCheckSpWp]: Trace formula consists of 139 conjuncts, 40 conjunts are in the unsatisfiable core [2022-11-20 09:31:09,896 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-20 09:31:10,223 INFO L134 CoverageAnalysis]: Checked inductivity of 715 backedges. 205 proven. 495 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2022-11-20 09:31:10,223 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-20 09:31:11,712 INFO L134 CoverageAnalysis]: Checked inductivity of 715 backedges. 205 proven. 495 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2022-11-20 09:31:11,712 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [216464903] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-20 09:31:11,712 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-20 09:31:11,713 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 21, 22] total 42 [2022-11-20 09:31:11,713 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1908356159] [2022-11-20 09:31:11,713 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-20 09:31:11,714 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 42 states [2022-11-20 09:31:11,714 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-20 09:31:11,715 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 42 interpolants. [2022-11-20 09:31:11,715 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=498, Invalid=1224, Unknown=0, NotChecked=0, Total=1722 [2022-11-20 09:31:11,716 INFO L87 Difference]: Start difference. First operand 109 states and 128 transitions. Second operand has 42 states, 42 states have (on average 3.0) internal successors, (126), 42 states have internal predecessors, (126), 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-20 09:32:40,828 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-20 09:32:40,828 INFO L93 Difference]: Finished difference Result 169 states and 206 transitions. [2022-11-20 09:32:40,828 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 40 states. [2022-11-20 09:32:40,829 INFO L78 Accepts]: Start accepts. Automaton has has 42 states, 42 states have (on average 3.0) internal successors, (126), 42 states have internal predecessors, (126), 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 72 [2022-11-20 09:32:40,829 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-20 09:32:40,830 INFO L225 Difference]: With dead ends: 169 [2022-11-20 09:32:40,830 INFO L226 Difference]: Without dead ends: 136 [2022-11-20 09:32:40,831 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 180 GetRequests, 120 SyntacticMatches, 2 SemanticMatches, 58 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 257 ImplicationChecksByTransitivity, 89.6s TimeCoverageRelationStatistics Valid=1254, Invalid=2286, Unknown=0, NotChecked=0, Total=3540 [2022-11-20 09:32:40,832 INFO L413 NwaCegarLoop]: 7 mSDtfsCounter, 115 mSDsluCounter, 60 mSDsCounter, 0 mSdLazyCounter, 1070 mSolverCounterSat, 45 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 115 SdHoareTripleChecker+Valid, 67 SdHoareTripleChecker+Invalid, 1115 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 45 IncrementalHoareTripleChecker+Valid, 1070 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2022-11-20 09:32:40,832 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [115 Valid, 67 Invalid, 1115 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [45 Valid, 1070 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2022-11-20 09:32:40,833 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 136 states. [2022-11-20 09:32:40,855 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 136 to 136. [2022-11-20 09:32:40,855 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 136 states, 135 states have (on average 1.0444444444444445) internal successors, (141), 135 states have internal predecessors, (141), 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-20 09:32:40,856 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 136 states to 136 states and 141 transitions. [2022-11-20 09:32:40,857 INFO L78 Accepts]: Start accepts. Automaton has 136 states and 141 transitions. Word has length 72 [2022-11-20 09:32:40,857 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-20 09:32:40,857 INFO L495 AbstractCegarLoop]: Abstraction has 136 states and 141 transitions. [2022-11-20 09:32:40,857 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 42 states, 42 states have (on average 3.0) internal successors, (126), 42 states have internal predecessors, (126), 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-20 09:32:40,858 INFO L276 IsEmpty]: Start isEmpty. Operand 136 states and 141 transitions. [2022-11-20 09:32:40,864 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 136 [2022-11-20 09:32:40,864 INFO L187 NwaCegarLoop]: Found error trace [2022-11-20 09:32:40,864 INFO L195 NwaCegarLoop]: trace histogram [43, 43, 38, 5, 1, 1, 1, 1, 1, 1] [2022-11-20 09:32:40,870 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1ed3933e-95e2-4f88-b795-0747b9d55b6b/bin/uautomizer-ug76WZFUDN/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Forceful destruction successful, exit code 0 [2022-11-20 09:32:41,065 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1ed3933e-95e2-4f88-b795-0747b9d55b6b/bin/uautomizer-ug76WZFUDN/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable10 [2022-11-20 09:32:41,065 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-20 09:32:41,065 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 09:32:41,066 INFO L85 PathProgramCache]: Analyzing trace with hash -1538427173, now seen corresponding path program 8 times [2022-11-20 09:32:41,066 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-20 09:32:41,066 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1345871599] [2022-11-20 09:32:41,066 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 09:32:41,066 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-20 09:32:41,116 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 09:32:43,127 INFO L134 CoverageAnalysis]: Checked inductivity of 2752 backedges. 541 proven. 2185 refuted. 0 times theorem prover too weak. 26 trivial. 0 not checked. [2022-11-20 09:32:43,127 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-20 09:32:43,127 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1345871599] [2022-11-20 09:32:43,128 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1345871599] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-20 09:32:43,128 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1996955252] [2022-11-20 09:32:43,128 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-11-20 09:32:43,128 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-20 09:32:43,128 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1ed3933e-95e2-4f88-b795-0747b9d55b6b/bin/uautomizer-ug76WZFUDN/z3 [2022-11-20 09:32:43,129 INFO L229 MonitoredProcess]: Starting monitored process 11 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1ed3933e-95e2-4f88-b795-0747b9d55b6b/bin/uautomizer-ug76WZFUDN/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-20 09:32:43,134 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1ed3933e-95e2-4f88-b795-0747b9d55b6b/bin/uautomizer-ug76WZFUDN/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Waiting until timeout for monitored process [2022-11-20 09:32:43,209 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-11-20 09:32:43,210 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-20 09:32:43,213 INFO L263 TraceCheckSpWp]: Trace formula consists of 221 conjuncts, 106 conjunts are in the unsatisfiable core [2022-11-20 09:32:43,216 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-20 09:32:46,329 INFO L134 CoverageAnalysis]: Checked inductivity of 2752 backedges. 0 proven. 2752 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-20 09:32:46,329 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-20 09:32:52,638 INFO L134 CoverageAnalysis]: Checked inductivity of 2752 backedges. 0 proven. 2712 refuted. 0 times theorem prover too weak. 40 trivial. 0 not checked. [2022-11-20 09:32:52,639 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1996955252] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-20 09:32:52,639 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-20 09:32:52,639 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [41, 52, 42] total 131 [2022-11-20 09:32:52,639 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1171674080] [2022-11-20 09:32:52,639 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-20 09:32:52,640 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 131 states [2022-11-20 09:32:52,640 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-20 09:32:52,642 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 131 interpolants. [2022-11-20 09:32:52,646 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=2287, Invalid=14743, Unknown=0, NotChecked=0, Total=17030 [2022-11-20 09:32:52,646 INFO L87 Difference]: Start difference. First operand 136 states and 141 transitions. Second operand has 131 states, 131 states have (on average 2.885496183206107) internal successors, (378), 131 states have internal predecessors, (378), 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-20 09:32:58,236 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse0 (mod |c_ULTIMATE.start_main_~z~0#1| 4294967296))) (and (not (= (mod (+ |c_ULTIMATE.start_main_~x~0#1| 24) 4294967296) .cse0)) (not (= (mod (+ |c_ULTIMATE.start_main_~x~0#1| 2) 4294967296) .cse0)) (not (= (mod (+ |c_ULTIMATE.start_main_~x~0#1| 27) 4294967296) .cse0)) (not (= .cse0 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 33) 4294967296))) (not (= .cse0 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 5) 4294967296))) (not (= (mod (+ |c_ULTIMATE.start_main_~x~0#1| 21) 4294967296) .cse0)) (not (= (mod (+ |c_ULTIMATE.start_main_~x~0#1| 25) 4294967296) .cse0)) (not (= .cse0 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 14) 4294967296))) (not (= (mod (+ |c_ULTIMATE.start_main_~x~0#1| 9) 4294967296) .cse0)) (not (= .cse0 (mod (+ 19 |c_ULTIMATE.start_main_~x~0#1|) 4294967296))) (not (= .cse0 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 22) 4294967296))) (not (= .cse0 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 13) 4294967296))) (not (= (mod |c_ULTIMATE.start_main_~x~0#1| 4294967296) .cse0)) (not (= (mod (+ |c_ULTIMATE.start_main_~x~0#1| 8) 4294967296) .cse0)) (not (= .cse0 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 11) 4294967296))) (not (= .cse0 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 32) 4294967296))) (not (= (mod (+ |c_ULTIMATE.start_main_~x~0#1| 29) 4294967296) .cse0)) (not (= (mod (+ |c_ULTIMATE.start_main_~x~0#1| 16) 4294967296) .cse0)) (not (= (mod (+ |c_ULTIMATE.start_main_~x~0#1| 35) 4294967296) .cse0)) (not (= .cse0 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 17) 4294967296))) (not (= .cse0 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 12) 4294967296))) (not (= .cse0 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 36) 4294967296))) (not (= .cse0 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 3) 4294967296))) (not (= .cse0 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 15) 4294967296))) (not (= .cse0 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 20) 4294967296))) (not (= .cse0 (mod (+ 7 |c_ULTIMATE.start_main_~x~0#1|) 4294967296))) (not (= (mod (+ |c_ULTIMATE.start_main_~x~0#1| 31) 4294967296) .cse0)) (not (= .cse0 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 34) 4294967296))) (not (= .cse0 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 30) 4294967296))) (not (= (mod (+ |c_ULTIMATE.start_main_~x~0#1| 4) 4294967296) .cse0)) (not (= (mod (+ 23 |c_ULTIMATE.start_main_~x~0#1|) 4294967296) .cse0)) (not (= (mod (+ |c_ULTIMATE.start_main_~x~0#1| 26) 4294967296) .cse0)) (not (= .cse0 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 37) 4294967296))) (not (= .cse0 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 18) 4294967296))) (not (= .cse0 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 10) 4294967296))) (not (= (mod (+ |c_ULTIMATE.start_main_~x~0#1| 38) 4294967296) .cse0)) (not (= .cse0 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 6) 4294967296))) (not (= .cse0 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 28) 4294967296))) (not (= .cse0 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 1) 4294967296))))) is different from false [2022-11-20 09:33:00,260 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse0 (mod |c_ULTIMATE.start_main_~z~0#1| 4294967296))) (and (not (= (mod (+ |c_ULTIMATE.start_main_~x~0#1| 24) 4294967296) .cse0)) (not (= (mod (+ |c_ULTIMATE.start_main_~x~0#1| 2) 4294967296) .cse0)) (not (= (mod (+ |c_ULTIMATE.start_main_~x~0#1| 27) 4294967296) .cse0)) (not (= .cse0 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 33) 4294967296))) (not (= .cse0 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 5) 4294967296))) (not (= (mod (+ |c_ULTIMATE.start_main_~x~0#1| 21) 4294967296) .cse0)) (not (= (mod (+ |c_ULTIMATE.start_main_~x~0#1| 25) 4294967296) .cse0)) (not (= .cse0 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 14) 4294967296))) (not (= (mod (+ |c_ULTIMATE.start_main_~x~0#1| 9) 4294967296) .cse0)) (not (= .cse0 (mod (+ 19 |c_ULTIMATE.start_main_~x~0#1|) 4294967296))) (not (= .cse0 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 22) 4294967296))) (not (= .cse0 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 13) 4294967296))) (not (= (mod (+ |c_ULTIMATE.start_main_~x~0#1| 8) 4294967296) .cse0)) (not (= .cse0 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 11) 4294967296))) (not (= .cse0 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 32) 4294967296))) (not (= (mod (+ |c_ULTIMATE.start_main_~x~0#1| 29) 4294967296) .cse0)) (not (= (mod (+ |c_ULTIMATE.start_main_~x~0#1| 16) 4294967296) .cse0)) (not (= (mod (+ |c_ULTIMATE.start_main_~x~0#1| 35) 4294967296) .cse0)) (not (= .cse0 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 17) 4294967296))) (not (= .cse0 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 12) 4294967296))) (not (= .cse0 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 36) 4294967296))) (not (= .cse0 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 3) 4294967296))) (not (= .cse0 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 15) 4294967296))) (not (= .cse0 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 20) 4294967296))) (not (= .cse0 (mod (+ 7 |c_ULTIMATE.start_main_~x~0#1|) 4294967296))) (not (= (mod (+ |c_ULTIMATE.start_main_~x~0#1| 31) 4294967296) .cse0)) (not (= .cse0 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 34) 4294967296))) (not (= .cse0 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 30) 4294967296))) (not (= (mod (+ |c_ULTIMATE.start_main_~x~0#1| 4) 4294967296) .cse0)) (not (= (mod (+ 23 |c_ULTIMATE.start_main_~x~0#1|) 4294967296) .cse0)) (not (= (mod (+ |c_ULTIMATE.start_main_~x~0#1| 26) 4294967296) .cse0)) (not (= .cse0 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 37) 4294967296))) (not (= .cse0 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 18) 4294967296))) (not (= .cse0 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 10) 4294967296))) (not (= (mod (+ |c_ULTIMATE.start_main_~x~0#1| 38) 4294967296) .cse0)) (not (= .cse0 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 6) 4294967296))) (not (= .cse0 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 28) 4294967296))) (not (= .cse0 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 1) 4294967296))))) is different from false [2022-11-20 09:33:02,278 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse0 (mod |c_ULTIMATE.start_main_~z~0#1| 4294967296))) (and (not (= (mod (+ |c_ULTIMATE.start_main_~x~0#1| 24) 4294967296) .cse0)) (not (= (mod (+ |c_ULTIMATE.start_main_~x~0#1| 2) 4294967296) .cse0)) (not (= (mod (+ |c_ULTIMATE.start_main_~x~0#1| 27) 4294967296) .cse0)) (not (= .cse0 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 33) 4294967296))) (not (= .cse0 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 5) 4294967296))) (not (= (mod (+ |c_ULTIMATE.start_main_~x~0#1| 21) 4294967296) .cse0)) (not (= (mod (+ |c_ULTIMATE.start_main_~x~0#1| 25) 4294967296) .cse0)) (not (= .cse0 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 14) 4294967296))) (not (= (mod (+ |c_ULTIMATE.start_main_~x~0#1| 9) 4294967296) .cse0)) (not (= .cse0 (mod (+ 19 |c_ULTIMATE.start_main_~x~0#1|) 4294967296))) (not (= .cse0 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 22) 4294967296))) (not (= .cse0 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 13) 4294967296))) (not (= (mod |c_ULTIMATE.start_main_~x~0#1| 4294967296) .cse0)) (not (= (mod (+ |c_ULTIMATE.start_main_~x~0#1| 8) 4294967296) .cse0)) (not (= .cse0 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 11) 4294967296))) (not (= .cse0 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 32) 4294967296))) (not (= (mod (+ |c_ULTIMATE.start_main_~x~0#1| 29) 4294967296) .cse0)) (not (= (mod (+ |c_ULTIMATE.start_main_~x~0#1| 16) 4294967296) .cse0)) (not (= (mod (+ |c_ULTIMATE.start_main_~x~0#1| 35) 4294967296) .cse0)) (not (= .cse0 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 17) 4294967296))) (not (= .cse0 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 12) 4294967296))) (not (= .cse0 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 36) 4294967296))) (not (= .cse0 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 3) 4294967296))) (not (= .cse0 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 15) 4294967296))) (not (= .cse0 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 20) 4294967296))) (not (= .cse0 (mod (+ 7 |c_ULTIMATE.start_main_~x~0#1|) 4294967296))) (not (= (mod (+ |c_ULTIMATE.start_main_~x~0#1| 31) 4294967296) .cse0)) (not (= .cse0 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 34) 4294967296))) (not (= .cse0 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 30) 4294967296))) (not (= (mod (+ |c_ULTIMATE.start_main_~x~0#1| 4) 4294967296) .cse0)) (not (= (mod (+ 23 |c_ULTIMATE.start_main_~x~0#1|) 4294967296) .cse0)) (not (= (mod (+ |c_ULTIMATE.start_main_~x~0#1| 26) 4294967296) .cse0)) (not (= .cse0 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 37) 4294967296))) (not (= .cse0 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 18) 4294967296))) (not (= .cse0 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 10) 4294967296))) (not (= .cse0 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 6) 4294967296))) (not (= .cse0 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 28) 4294967296))) (not (= .cse0 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 1) 4294967296))))) is different from false [2022-11-20 09:33:04,370 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse0 (mod |c_ULTIMATE.start_main_~z~0#1| 4294967296))) (and (not (= (mod (+ |c_ULTIMATE.start_main_~x~0#1| 24) 4294967296) .cse0)) (not (= (mod (+ |c_ULTIMATE.start_main_~x~0#1| 2) 4294967296) .cse0)) (not (= (mod (+ |c_ULTIMATE.start_main_~x~0#1| 27) 4294967296) .cse0)) (not (= .cse0 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 33) 4294967296))) (not (= .cse0 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 5) 4294967296))) (not (= (mod (+ |c_ULTIMATE.start_main_~x~0#1| 21) 4294967296) .cse0)) (not (= (mod (+ |c_ULTIMATE.start_main_~x~0#1| 25) 4294967296) .cse0)) (not (= .cse0 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 14) 4294967296))) (not (= (mod (+ |c_ULTIMATE.start_main_~x~0#1| 9) 4294967296) .cse0)) (not (= .cse0 (mod (+ 19 |c_ULTIMATE.start_main_~x~0#1|) 4294967296))) (not (= .cse0 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 22) 4294967296))) (not (= .cse0 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 13) 4294967296))) (not (= (mod (+ |c_ULTIMATE.start_main_~x~0#1| 8) 4294967296) .cse0)) (not (= .cse0 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 11) 4294967296))) (not (= .cse0 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 32) 4294967296))) (not (= (mod (+ |c_ULTIMATE.start_main_~x~0#1| 29) 4294967296) .cse0)) (not (= (mod (+ |c_ULTIMATE.start_main_~x~0#1| 16) 4294967296) .cse0)) (not (= (mod (+ |c_ULTIMATE.start_main_~x~0#1| 35) 4294967296) .cse0)) (not (= .cse0 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 17) 4294967296))) (not (= .cse0 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 12) 4294967296))) (not (= .cse0 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 36) 4294967296))) (not (= .cse0 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 3) 4294967296))) (not (= .cse0 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 15) 4294967296))) (not (= .cse0 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 20) 4294967296))) (not (= .cse0 (mod (+ 7 |c_ULTIMATE.start_main_~x~0#1|) 4294967296))) (not (= (mod (+ |c_ULTIMATE.start_main_~x~0#1| 31) 4294967296) .cse0)) (not (= .cse0 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 34) 4294967296))) (not (= .cse0 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 30) 4294967296))) (not (= (mod (+ |c_ULTIMATE.start_main_~x~0#1| 4) 4294967296) .cse0)) (not (= (mod (+ 23 |c_ULTIMATE.start_main_~x~0#1|) 4294967296) .cse0)) (not (= (mod (+ |c_ULTIMATE.start_main_~x~0#1| 26) 4294967296) .cse0)) (not (= .cse0 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 37) 4294967296))) (not (= .cse0 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 18) 4294967296))) (not (= .cse0 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 10) 4294967296))) (not (= .cse0 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 6) 4294967296))) (not (= .cse0 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 28) 4294967296))) (not (= .cse0 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 1) 4294967296))))) is different from false [2022-11-20 09:33:06,533 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse0 (mod |c_ULTIMATE.start_main_~z~0#1| 4294967296))) (and (not (= (mod (+ |c_ULTIMATE.start_main_~x~0#1| 24) 4294967296) .cse0)) (not (= (mod (+ |c_ULTIMATE.start_main_~x~0#1| 2) 4294967296) .cse0)) (not (= (mod (+ |c_ULTIMATE.start_main_~x~0#1| 27) 4294967296) .cse0)) (not (= .cse0 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 33) 4294967296))) (not (= .cse0 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 5) 4294967296))) (not (= (mod (+ |c_ULTIMATE.start_main_~x~0#1| 21) 4294967296) .cse0)) (not (= (mod (+ |c_ULTIMATE.start_main_~x~0#1| 25) 4294967296) .cse0)) (not (= .cse0 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 14) 4294967296))) (not (= (mod (+ |c_ULTIMATE.start_main_~x~0#1| 9) 4294967296) .cse0)) (not (= .cse0 (mod (+ 19 |c_ULTIMATE.start_main_~x~0#1|) 4294967296))) (not (= .cse0 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 22) 4294967296))) (not (= .cse0 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 13) 4294967296))) (not (= (mod |c_ULTIMATE.start_main_~x~0#1| 4294967296) .cse0)) (not (= (mod (+ |c_ULTIMATE.start_main_~x~0#1| 8) 4294967296) .cse0)) (not (= .cse0 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 11) 4294967296))) (not (= .cse0 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 32) 4294967296))) (not (= (mod (+ |c_ULTIMATE.start_main_~x~0#1| 29) 4294967296) .cse0)) (not (= (mod (+ |c_ULTIMATE.start_main_~x~0#1| 16) 4294967296) .cse0)) (not (= (mod (+ |c_ULTIMATE.start_main_~x~0#1| 35) 4294967296) .cse0)) (not (= .cse0 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 17) 4294967296))) (not (= .cse0 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 12) 4294967296))) (not (= .cse0 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 36) 4294967296))) (not (= .cse0 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 3) 4294967296))) (not (= .cse0 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 15) 4294967296))) (not (= .cse0 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 20) 4294967296))) (not (= .cse0 (mod (+ 7 |c_ULTIMATE.start_main_~x~0#1|) 4294967296))) (not (= (mod (+ |c_ULTIMATE.start_main_~x~0#1| 31) 4294967296) .cse0)) (not (= .cse0 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 34) 4294967296))) (not (= .cse0 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 30) 4294967296))) (not (= (mod (+ |c_ULTIMATE.start_main_~x~0#1| 4) 4294967296) .cse0)) (not (= (mod (+ 23 |c_ULTIMATE.start_main_~x~0#1|) 4294967296) .cse0)) (not (= (mod (+ |c_ULTIMATE.start_main_~x~0#1| 26) 4294967296) .cse0)) (not (= .cse0 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 18) 4294967296))) (not (= .cse0 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 10) 4294967296))) (not (= .cse0 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 6) 4294967296))) (not (= .cse0 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 28) 4294967296))) (not (= .cse0 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 1) 4294967296))))) is different from false [2022-11-20 09:33:08,584 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse0 (mod |c_ULTIMATE.start_main_~z~0#1| 4294967296))) (and (not (= (mod (+ |c_ULTIMATE.start_main_~x~0#1| 24) 4294967296) .cse0)) (not (= (mod (+ |c_ULTIMATE.start_main_~x~0#1| 2) 4294967296) .cse0)) (not (= (mod (+ |c_ULTIMATE.start_main_~x~0#1| 27) 4294967296) .cse0)) (not (= .cse0 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 33) 4294967296))) (not (= .cse0 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 5) 4294967296))) (not (= (mod (+ |c_ULTIMATE.start_main_~x~0#1| 21) 4294967296) .cse0)) (not (= (mod (+ |c_ULTIMATE.start_main_~x~0#1| 25) 4294967296) .cse0)) (not (= .cse0 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 14) 4294967296))) (not (= (mod (+ |c_ULTIMATE.start_main_~x~0#1| 9) 4294967296) .cse0)) (not (= .cse0 (mod (+ 19 |c_ULTIMATE.start_main_~x~0#1|) 4294967296))) (not (= .cse0 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 22) 4294967296))) (not (= .cse0 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 13) 4294967296))) (not (= (mod (+ |c_ULTIMATE.start_main_~x~0#1| 8) 4294967296) .cse0)) (not (= .cse0 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 11) 4294967296))) (not (= .cse0 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 32) 4294967296))) (not (= (mod (+ |c_ULTIMATE.start_main_~x~0#1| 29) 4294967296) .cse0)) (not (= (mod (+ |c_ULTIMATE.start_main_~x~0#1| 16) 4294967296) .cse0)) (not (= (mod (+ |c_ULTIMATE.start_main_~x~0#1| 35) 4294967296) .cse0)) (not (= .cse0 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 17) 4294967296))) (not (= .cse0 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 12) 4294967296))) (not (= .cse0 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 36) 4294967296))) (not (= .cse0 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 3) 4294967296))) (not (= .cse0 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 15) 4294967296))) (not (= .cse0 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 20) 4294967296))) (not (= .cse0 (mod (+ 7 |c_ULTIMATE.start_main_~x~0#1|) 4294967296))) (not (= (mod (+ |c_ULTIMATE.start_main_~x~0#1| 31) 4294967296) .cse0)) (not (= .cse0 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 34) 4294967296))) (not (= .cse0 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 30) 4294967296))) (not (= (mod (+ |c_ULTIMATE.start_main_~x~0#1| 4) 4294967296) .cse0)) (not (= (mod (+ 23 |c_ULTIMATE.start_main_~x~0#1|) 4294967296) .cse0)) (not (= (mod (+ |c_ULTIMATE.start_main_~x~0#1| 26) 4294967296) .cse0)) (not (= .cse0 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 18) 4294967296))) (not (= .cse0 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 10) 4294967296))) (not (= .cse0 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 6) 4294967296))) (not (= .cse0 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 28) 4294967296))) (not (= .cse0 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 1) 4294967296))))) is different from false [2022-11-20 09:33:10,601 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse0 (mod |c_ULTIMATE.start_main_~z~0#1| 4294967296))) (and (not (= (mod (+ |c_ULTIMATE.start_main_~x~0#1| 24) 4294967296) .cse0)) (not (= (mod (+ |c_ULTIMATE.start_main_~x~0#1| 2) 4294967296) .cse0)) (not (= (mod (+ |c_ULTIMATE.start_main_~x~0#1| 27) 4294967296) .cse0)) (not (= .cse0 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 33) 4294967296))) (not (= .cse0 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 5) 4294967296))) (not (= (mod (+ |c_ULTIMATE.start_main_~x~0#1| 21) 4294967296) .cse0)) (not (= (mod (+ |c_ULTIMATE.start_main_~x~0#1| 25) 4294967296) .cse0)) (not (= .cse0 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 14) 4294967296))) (not (= (mod (+ |c_ULTIMATE.start_main_~x~0#1| 9) 4294967296) .cse0)) (not (= .cse0 (mod (+ 19 |c_ULTIMATE.start_main_~x~0#1|) 4294967296))) (not (= .cse0 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 22) 4294967296))) (not (= .cse0 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 13) 4294967296))) (not (= (mod |c_ULTIMATE.start_main_~x~0#1| 4294967296) .cse0)) (not (= (mod (+ |c_ULTIMATE.start_main_~x~0#1| 8) 4294967296) .cse0)) (not (= .cse0 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 11) 4294967296))) (not (= .cse0 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 32) 4294967296))) (not (= (mod (+ |c_ULTIMATE.start_main_~x~0#1| 29) 4294967296) .cse0)) (not (= (mod (+ |c_ULTIMATE.start_main_~x~0#1| 16) 4294967296) .cse0)) (not (= (mod (+ |c_ULTIMATE.start_main_~x~0#1| 35) 4294967296) .cse0)) (not (= .cse0 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 17) 4294967296))) (not (= .cse0 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 12) 4294967296))) (not (= .cse0 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 3) 4294967296))) (not (= .cse0 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 15) 4294967296))) (not (= .cse0 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 20) 4294967296))) (not (= .cse0 (mod (+ 7 |c_ULTIMATE.start_main_~x~0#1|) 4294967296))) (not (= (mod (+ |c_ULTIMATE.start_main_~x~0#1| 31) 4294967296) .cse0)) (not (= .cse0 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 34) 4294967296))) (not (= .cse0 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 30) 4294967296))) (not (= (mod (+ |c_ULTIMATE.start_main_~x~0#1| 4) 4294967296) .cse0)) (not (= (mod (+ 23 |c_ULTIMATE.start_main_~x~0#1|) 4294967296) .cse0)) (not (= (mod (+ |c_ULTIMATE.start_main_~x~0#1| 26) 4294967296) .cse0)) (not (= .cse0 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 18) 4294967296))) (not (= .cse0 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 10) 4294967296))) (not (= .cse0 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 6) 4294967296))) (not (= .cse0 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 28) 4294967296))) (not (= .cse0 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 1) 4294967296))))) is different from false [2022-11-20 09:33:12,617 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse0 (mod |c_ULTIMATE.start_main_~z~0#1| 4294967296))) (and (not (= (mod (+ |c_ULTIMATE.start_main_~x~0#1| 24) 4294967296) .cse0)) (not (= (mod (+ |c_ULTIMATE.start_main_~x~0#1| 2) 4294967296) .cse0)) (not (= (mod (+ |c_ULTIMATE.start_main_~x~0#1| 27) 4294967296) .cse0)) (not (= .cse0 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 33) 4294967296))) (not (= .cse0 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 5) 4294967296))) (not (= (mod (+ |c_ULTIMATE.start_main_~x~0#1| 21) 4294967296) .cse0)) (not (= (mod (+ |c_ULTIMATE.start_main_~x~0#1| 25) 4294967296) .cse0)) (not (= .cse0 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 14) 4294967296))) (not (= (mod (+ |c_ULTIMATE.start_main_~x~0#1| 9) 4294967296) .cse0)) (not (= .cse0 (mod (+ 19 |c_ULTIMATE.start_main_~x~0#1|) 4294967296))) (not (= .cse0 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 22) 4294967296))) (not (= .cse0 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 13) 4294967296))) (not (= (mod (+ |c_ULTIMATE.start_main_~x~0#1| 8) 4294967296) .cse0)) (not (= .cse0 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 11) 4294967296))) (not (= .cse0 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 32) 4294967296))) (not (= (mod (+ |c_ULTIMATE.start_main_~x~0#1| 29) 4294967296) .cse0)) (not (= (mod (+ |c_ULTIMATE.start_main_~x~0#1| 16) 4294967296) .cse0)) (not (= (mod (+ |c_ULTIMATE.start_main_~x~0#1| 35) 4294967296) .cse0)) (not (= .cse0 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 17) 4294967296))) (not (= .cse0 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 12) 4294967296))) (not (= .cse0 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 3) 4294967296))) (not (= .cse0 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 15) 4294967296))) (not (= .cse0 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 20) 4294967296))) (not (= .cse0 (mod (+ 7 |c_ULTIMATE.start_main_~x~0#1|) 4294967296))) (not (= (mod (+ |c_ULTIMATE.start_main_~x~0#1| 31) 4294967296) .cse0)) (not (= .cse0 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 34) 4294967296))) (not (= .cse0 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 30) 4294967296))) (not (= (mod (+ |c_ULTIMATE.start_main_~x~0#1| 4) 4294967296) .cse0)) (not (= (mod (+ 23 |c_ULTIMATE.start_main_~x~0#1|) 4294967296) .cse0)) (not (= (mod (+ |c_ULTIMATE.start_main_~x~0#1| 26) 4294967296) .cse0)) (not (= .cse0 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 18) 4294967296))) (not (= .cse0 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 10) 4294967296))) (not (= .cse0 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 6) 4294967296))) (not (= .cse0 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 28) 4294967296))) (not (= .cse0 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 1) 4294967296))))) is different from false [2022-11-20 09:33:14,754 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse0 (mod |c_ULTIMATE.start_main_~z~0#1| 4294967296))) (and (not (= (mod (+ |c_ULTIMATE.start_main_~x~0#1| 24) 4294967296) .cse0)) (not (= (mod (+ |c_ULTIMATE.start_main_~x~0#1| 2) 4294967296) .cse0)) (not (= (mod (+ |c_ULTIMATE.start_main_~x~0#1| 27) 4294967296) .cse0)) (not (= .cse0 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 33) 4294967296))) (not (= .cse0 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 5) 4294967296))) (not (= (mod (+ |c_ULTIMATE.start_main_~x~0#1| 21) 4294967296) .cse0)) (not (= (mod (+ |c_ULTIMATE.start_main_~x~0#1| 25) 4294967296) .cse0)) (not (= .cse0 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 14) 4294967296))) (not (= (mod (+ |c_ULTIMATE.start_main_~x~0#1| 9) 4294967296) .cse0)) (not (= .cse0 (mod (+ 19 |c_ULTIMATE.start_main_~x~0#1|) 4294967296))) (not (= .cse0 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 22) 4294967296))) (not (= .cse0 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 13) 4294967296))) (not (= (mod |c_ULTIMATE.start_main_~x~0#1| 4294967296) .cse0)) (not (= (mod (+ |c_ULTIMATE.start_main_~x~0#1| 8) 4294967296) .cse0)) (not (= .cse0 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 11) 4294967296))) (not (= .cse0 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 32) 4294967296))) (not (= (mod (+ |c_ULTIMATE.start_main_~x~0#1| 29) 4294967296) .cse0)) (not (= (mod (+ |c_ULTIMATE.start_main_~x~0#1| 16) 4294967296) .cse0)) (not (= .cse0 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 17) 4294967296))) (not (= .cse0 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 12) 4294967296))) (not (= .cse0 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 3) 4294967296))) (not (= .cse0 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 15) 4294967296))) (not (= .cse0 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 20) 4294967296))) (not (= .cse0 (mod (+ 7 |c_ULTIMATE.start_main_~x~0#1|) 4294967296))) (not (= (mod (+ |c_ULTIMATE.start_main_~x~0#1| 31) 4294967296) .cse0)) (not (= .cse0 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 34) 4294967296))) (not (= .cse0 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 30) 4294967296))) (not (= (mod (+ |c_ULTIMATE.start_main_~x~0#1| 4) 4294967296) .cse0)) (not (= (mod (+ 23 |c_ULTIMATE.start_main_~x~0#1|) 4294967296) .cse0)) (not (= (mod (+ |c_ULTIMATE.start_main_~x~0#1| 26) 4294967296) .cse0)) (not (= .cse0 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 18) 4294967296))) (not (= .cse0 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 10) 4294967296))) (not (= .cse0 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 6) 4294967296))) (not (= .cse0 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 28) 4294967296))) (not (= .cse0 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 1) 4294967296))))) is different from false [2022-11-20 09:33:16,769 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse0 (mod |c_ULTIMATE.start_main_~z~0#1| 4294967296))) (and (not (= (mod (+ |c_ULTIMATE.start_main_~x~0#1| 24) 4294967296) .cse0)) (not (= (mod (+ |c_ULTIMATE.start_main_~x~0#1| 2) 4294967296) .cse0)) (not (= (mod (+ |c_ULTIMATE.start_main_~x~0#1| 27) 4294967296) .cse0)) (not (= .cse0 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 33) 4294967296))) (not (= .cse0 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 5) 4294967296))) (not (= (mod (+ |c_ULTIMATE.start_main_~x~0#1| 21) 4294967296) .cse0)) (not (= (mod (+ |c_ULTIMATE.start_main_~x~0#1| 25) 4294967296) .cse0)) (not (= .cse0 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 14) 4294967296))) (not (= (mod (+ |c_ULTIMATE.start_main_~x~0#1| 9) 4294967296) .cse0)) (not (= .cse0 (mod (+ 19 |c_ULTIMATE.start_main_~x~0#1|) 4294967296))) (not (= .cse0 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 22) 4294967296))) (not (= .cse0 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 13) 4294967296))) (not (= (mod (+ |c_ULTIMATE.start_main_~x~0#1| 8) 4294967296) .cse0)) (not (= .cse0 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 11) 4294967296))) (not (= .cse0 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 32) 4294967296))) (not (= (mod (+ |c_ULTIMATE.start_main_~x~0#1| 29) 4294967296) .cse0)) (not (= (mod (+ |c_ULTIMATE.start_main_~x~0#1| 16) 4294967296) .cse0)) (not (= .cse0 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 17) 4294967296))) (not (= .cse0 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 12) 4294967296))) (not (= .cse0 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 3) 4294967296))) (not (= .cse0 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 15) 4294967296))) (not (= .cse0 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 20) 4294967296))) (not (= .cse0 (mod (+ 7 |c_ULTIMATE.start_main_~x~0#1|) 4294967296))) (not (= (mod (+ |c_ULTIMATE.start_main_~x~0#1| 31) 4294967296) .cse0)) (not (= .cse0 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 34) 4294967296))) (not (= .cse0 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 30) 4294967296))) (not (= (mod (+ |c_ULTIMATE.start_main_~x~0#1| 4) 4294967296) .cse0)) (not (= (mod (+ 23 |c_ULTIMATE.start_main_~x~0#1|) 4294967296) .cse0)) (not (= (mod (+ |c_ULTIMATE.start_main_~x~0#1| 26) 4294967296) .cse0)) (not (= .cse0 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 18) 4294967296))) (not (= .cse0 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 10) 4294967296))) (not (= .cse0 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 6) 4294967296))) (not (= .cse0 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 28) 4294967296))) (not (= .cse0 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 1) 4294967296))))) is different from false [2022-11-20 09:33:18,790 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse0 (mod |c_ULTIMATE.start_main_~z~0#1| 4294967296))) (and (not (= (mod (+ |c_ULTIMATE.start_main_~x~0#1| 24) 4294967296) .cse0)) (not (= (mod (+ |c_ULTIMATE.start_main_~x~0#1| 2) 4294967296) .cse0)) (not (= (mod (+ |c_ULTIMATE.start_main_~x~0#1| 27) 4294967296) .cse0)) (not (= .cse0 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 33) 4294967296))) (not (= .cse0 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 5) 4294967296))) (not (= (mod (+ |c_ULTIMATE.start_main_~x~0#1| 21) 4294967296) .cse0)) (not (= (mod (+ |c_ULTIMATE.start_main_~x~0#1| 25) 4294967296) .cse0)) (not (= .cse0 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 14) 4294967296))) (not (= (mod (+ |c_ULTIMATE.start_main_~x~0#1| 9) 4294967296) .cse0)) (not (= .cse0 (mod (+ 19 |c_ULTIMATE.start_main_~x~0#1|) 4294967296))) (not (= .cse0 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 22) 4294967296))) (not (= .cse0 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 13) 4294967296))) (not (= (mod |c_ULTIMATE.start_main_~x~0#1| 4294967296) .cse0)) (not (= (mod (+ |c_ULTIMATE.start_main_~x~0#1| 8) 4294967296) .cse0)) (not (= .cse0 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 11) 4294967296))) (not (= .cse0 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 32) 4294967296))) (not (= (mod (+ |c_ULTIMATE.start_main_~x~0#1| 29) 4294967296) .cse0)) (not (= (mod (+ |c_ULTIMATE.start_main_~x~0#1| 16) 4294967296) .cse0)) (not (= .cse0 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 17) 4294967296))) (not (= .cse0 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 12) 4294967296))) (not (= .cse0 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 3) 4294967296))) (not (= .cse0 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 15) 4294967296))) (not (= .cse0 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 20) 4294967296))) (not (= .cse0 (mod (+ 7 |c_ULTIMATE.start_main_~x~0#1|) 4294967296))) (not (= (mod (+ |c_ULTIMATE.start_main_~x~0#1| 31) 4294967296) .cse0)) (not (= .cse0 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 30) 4294967296))) (not (= (mod (+ |c_ULTIMATE.start_main_~x~0#1| 4) 4294967296) .cse0)) (not (= (mod (+ 23 |c_ULTIMATE.start_main_~x~0#1|) 4294967296) .cse0)) (not (= (mod (+ |c_ULTIMATE.start_main_~x~0#1| 26) 4294967296) .cse0)) (not (= .cse0 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 18) 4294967296))) (not (= .cse0 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 10) 4294967296))) (not (= .cse0 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 6) 4294967296))) (not (= .cse0 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 28) 4294967296))) (not (= .cse0 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 1) 4294967296))))) is different from false [2022-11-20 09:33:20,847 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse0 (mod |c_ULTIMATE.start_main_~z~0#1| 4294967296))) (and (not (= (mod (+ |c_ULTIMATE.start_main_~x~0#1| 24) 4294967296) .cse0)) (not (= (mod (+ |c_ULTIMATE.start_main_~x~0#1| 2) 4294967296) .cse0)) (not (= (mod (+ |c_ULTIMATE.start_main_~x~0#1| 27) 4294967296) .cse0)) (not (= .cse0 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 33) 4294967296))) (not (= .cse0 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 5) 4294967296))) (not (= (mod (+ |c_ULTIMATE.start_main_~x~0#1| 21) 4294967296) .cse0)) (not (= (mod (+ |c_ULTIMATE.start_main_~x~0#1| 25) 4294967296) .cse0)) (not (= .cse0 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 14) 4294967296))) (not (= (mod (+ |c_ULTIMATE.start_main_~x~0#1| 9) 4294967296) .cse0)) (not (= .cse0 (mod (+ 19 |c_ULTIMATE.start_main_~x~0#1|) 4294967296))) (not (= .cse0 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 22) 4294967296))) (not (= .cse0 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 13) 4294967296))) (not (= (mod (+ |c_ULTIMATE.start_main_~x~0#1| 8) 4294967296) .cse0)) (not (= .cse0 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 11) 4294967296))) (not (= .cse0 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 32) 4294967296))) (not (= (mod (+ |c_ULTIMATE.start_main_~x~0#1| 29) 4294967296) .cse0)) (not (= (mod (+ |c_ULTIMATE.start_main_~x~0#1| 16) 4294967296) .cse0)) (not (= .cse0 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 17) 4294967296))) (not (= .cse0 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 12) 4294967296))) (not (= .cse0 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 3) 4294967296))) (not (= .cse0 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 15) 4294967296))) (not (= .cse0 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 20) 4294967296))) (not (= .cse0 (mod (+ 7 |c_ULTIMATE.start_main_~x~0#1|) 4294967296))) (not (= (mod (+ |c_ULTIMATE.start_main_~x~0#1| 31) 4294967296) .cse0)) (not (= .cse0 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 30) 4294967296))) (not (= (mod (+ |c_ULTIMATE.start_main_~x~0#1| 4) 4294967296) .cse0)) (not (= (mod (+ 23 |c_ULTIMATE.start_main_~x~0#1|) 4294967296) .cse0)) (not (= (mod (+ |c_ULTIMATE.start_main_~x~0#1| 26) 4294967296) .cse0)) (not (= .cse0 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 18) 4294967296))) (not (= .cse0 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 10) 4294967296))) (not (= .cse0 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 6) 4294967296))) (not (= .cse0 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 28) 4294967296))) (not (= .cse0 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 1) 4294967296))))) is different from false [2022-11-20 09:33:22,991 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse0 (mod |c_ULTIMATE.start_main_~z~0#1| 4294967296))) (and (not (= (mod (+ |c_ULTIMATE.start_main_~x~0#1| 24) 4294967296) .cse0)) (not (= (mod (+ |c_ULTIMATE.start_main_~x~0#1| 2) 4294967296) .cse0)) (not (= (mod (+ |c_ULTIMATE.start_main_~x~0#1| 27) 4294967296) .cse0)) (not (= .cse0 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 5) 4294967296))) (not (= (mod (+ |c_ULTIMATE.start_main_~x~0#1| 21) 4294967296) .cse0)) (not (= (mod (+ |c_ULTIMATE.start_main_~x~0#1| 25) 4294967296) .cse0)) (not (= .cse0 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 14) 4294967296))) (not (= (mod (+ |c_ULTIMATE.start_main_~x~0#1| 9) 4294967296) .cse0)) (not (= .cse0 (mod (+ 19 |c_ULTIMATE.start_main_~x~0#1|) 4294967296))) (not (= .cse0 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 22) 4294967296))) (not (= .cse0 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 13) 4294967296))) (not (= (mod |c_ULTIMATE.start_main_~x~0#1| 4294967296) .cse0)) (not (= (mod (+ |c_ULTIMATE.start_main_~x~0#1| 8) 4294967296) .cse0)) (not (= .cse0 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 11) 4294967296))) (not (= .cse0 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 32) 4294967296))) (not (= (mod (+ |c_ULTIMATE.start_main_~x~0#1| 29) 4294967296) .cse0)) (not (= (mod (+ |c_ULTIMATE.start_main_~x~0#1| 16) 4294967296) .cse0)) (not (= .cse0 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 17) 4294967296))) (not (= .cse0 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 12) 4294967296))) (not (= .cse0 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 3) 4294967296))) (not (= .cse0 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 15) 4294967296))) (not (= .cse0 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 20) 4294967296))) (not (= .cse0 (mod (+ 7 |c_ULTIMATE.start_main_~x~0#1|) 4294967296))) (not (= (mod (+ |c_ULTIMATE.start_main_~x~0#1| 31) 4294967296) .cse0)) (not (= .cse0 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 30) 4294967296))) (not (= (mod (+ |c_ULTIMATE.start_main_~x~0#1| 4) 4294967296) .cse0)) (not (= (mod (+ 23 |c_ULTIMATE.start_main_~x~0#1|) 4294967296) .cse0)) (not (= (mod (+ |c_ULTIMATE.start_main_~x~0#1| 26) 4294967296) .cse0)) (not (= .cse0 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 18) 4294967296))) (not (= .cse0 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 10) 4294967296))) (not (= .cse0 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 6) 4294967296))) (not (= .cse0 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 28) 4294967296))) (not (= .cse0 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 1) 4294967296))))) is different from false [2022-11-20 09:33:25,008 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse0 (mod |c_ULTIMATE.start_main_~z~0#1| 4294967296))) (and (not (= (mod (+ |c_ULTIMATE.start_main_~x~0#1| 24) 4294967296) .cse0)) (not (= (mod (+ |c_ULTIMATE.start_main_~x~0#1| 2) 4294967296) .cse0)) (not (= (mod (+ |c_ULTIMATE.start_main_~x~0#1| 27) 4294967296) .cse0)) (not (= .cse0 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 5) 4294967296))) (not (= (mod (+ |c_ULTIMATE.start_main_~x~0#1| 21) 4294967296) .cse0)) (not (= (mod (+ |c_ULTIMATE.start_main_~x~0#1| 25) 4294967296) .cse0)) (not (= .cse0 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 14) 4294967296))) (not (= (mod (+ |c_ULTIMATE.start_main_~x~0#1| 9) 4294967296) .cse0)) (not (= .cse0 (mod (+ 19 |c_ULTIMATE.start_main_~x~0#1|) 4294967296))) (not (= .cse0 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 22) 4294967296))) (not (= .cse0 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 13) 4294967296))) (not (= (mod (+ |c_ULTIMATE.start_main_~x~0#1| 8) 4294967296) .cse0)) (not (= .cse0 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 11) 4294967296))) (not (= .cse0 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 32) 4294967296))) (not (= (mod (+ |c_ULTIMATE.start_main_~x~0#1| 29) 4294967296) .cse0)) (not (= (mod (+ |c_ULTIMATE.start_main_~x~0#1| 16) 4294967296) .cse0)) (not (= .cse0 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 17) 4294967296))) (not (= .cse0 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 12) 4294967296))) (not (= .cse0 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 3) 4294967296))) (not (= .cse0 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 15) 4294967296))) (not (= .cse0 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 20) 4294967296))) (not (= .cse0 (mod (+ 7 |c_ULTIMATE.start_main_~x~0#1|) 4294967296))) (not (= (mod (+ |c_ULTIMATE.start_main_~x~0#1| 31) 4294967296) .cse0)) (not (= .cse0 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 30) 4294967296))) (not (= (mod (+ |c_ULTIMATE.start_main_~x~0#1| 4) 4294967296) .cse0)) (not (= (mod (+ 23 |c_ULTIMATE.start_main_~x~0#1|) 4294967296) .cse0)) (not (= (mod (+ |c_ULTIMATE.start_main_~x~0#1| 26) 4294967296) .cse0)) (not (= .cse0 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 18) 4294967296))) (not (= .cse0 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 10) 4294967296))) (not (= .cse0 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 6) 4294967296))) (not (= .cse0 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 28) 4294967296))) (not (= .cse0 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 1) 4294967296))))) is different from false [2022-11-20 09:33:27,030 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse0 (mod |c_ULTIMATE.start_main_~z~0#1| 4294967296))) (and (not (= (mod (+ |c_ULTIMATE.start_main_~x~0#1| 24) 4294967296) .cse0)) (not (= (mod (+ |c_ULTIMATE.start_main_~x~0#1| 2) 4294967296) .cse0)) (not (= (mod (+ |c_ULTIMATE.start_main_~x~0#1| 27) 4294967296) .cse0)) (not (= .cse0 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 5) 4294967296))) (not (= (mod (+ |c_ULTIMATE.start_main_~x~0#1| 21) 4294967296) .cse0)) (not (= (mod (+ |c_ULTIMATE.start_main_~x~0#1| 25) 4294967296) .cse0)) (not (= .cse0 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 14) 4294967296))) (not (= (mod (+ |c_ULTIMATE.start_main_~x~0#1| 9) 4294967296) .cse0)) (not (= .cse0 (mod (+ 19 |c_ULTIMATE.start_main_~x~0#1|) 4294967296))) (not (= .cse0 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 22) 4294967296))) (not (= .cse0 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 13) 4294967296))) (not (= (mod |c_ULTIMATE.start_main_~x~0#1| 4294967296) .cse0)) (not (= (mod (+ |c_ULTIMATE.start_main_~x~0#1| 8) 4294967296) .cse0)) (not (= .cse0 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 11) 4294967296))) (not (= (mod (+ |c_ULTIMATE.start_main_~x~0#1| 29) 4294967296) .cse0)) (not (= (mod (+ |c_ULTIMATE.start_main_~x~0#1| 16) 4294967296) .cse0)) (not (= .cse0 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 17) 4294967296))) (not (= .cse0 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 12) 4294967296))) (not (= .cse0 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 3) 4294967296))) (not (= .cse0 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 15) 4294967296))) (not (= .cse0 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 20) 4294967296))) (not (= .cse0 (mod (+ 7 |c_ULTIMATE.start_main_~x~0#1|) 4294967296))) (not (= (mod (+ |c_ULTIMATE.start_main_~x~0#1| 31) 4294967296) .cse0)) (not (= .cse0 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 30) 4294967296))) (not (= (mod (+ |c_ULTIMATE.start_main_~x~0#1| 4) 4294967296) .cse0)) (not (= (mod (+ 23 |c_ULTIMATE.start_main_~x~0#1|) 4294967296) .cse0)) (not (= (mod (+ |c_ULTIMATE.start_main_~x~0#1| 26) 4294967296) .cse0)) (not (= .cse0 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 18) 4294967296))) (not (= .cse0 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 10) 4294967296))) (not (= .cse0 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 6) 4294967296))) (not (= .cse0 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 28) 4294967296))) (not (= .cse0 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 1) 4294967296))))) is different from false [2022-11-20 09:38:31,155 WARN L233 SmtUtils]: Spent 2.10m on a formula simplification that was a NOOP. DAG size: 160 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-11-20 09:38:33,164 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-11-20 09:38:35,168 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-11-20 09:38:37,174 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-11-20 09:38:39,181 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-11-20 09:38:40,732 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.55s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-11-20 09:38:42,737 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-11-20 09:38:45,325 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-11-20 09:38:47,351 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse0 (mod |c_ULTIMATE.start_main_~z~0#1| 4294967296))) (and (not (= (mod (+ |c_ULTIMATE.start_main_~x~0#1| 24) 4294967296) .cse0)) (not (= (mod (+ |c_ULTIMATE.start_main_~x~0#1| 2) 4294967296) .cse0)) (not (= (mod (+ |c_ULTIMATE.start_main_~x~0#1| 27) 4294967296) .cse0)) (not (= .cse0 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 5) 4294967296))) (not (= (mod (+ |c_ULTIMATE.start_main_~x~0#1| 21) 4294967296) .cse0)) (not (= (mod (+ |c_ULTIMATE.start_main_~x~0#1| 25) 4294967296) .cse0)) (not (= .cse0 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 14) 4294967296))) (not (= (mod (+ |c_ULTIMATE.start_main_~x~0#1| 9) 4294967296) .cse0)) (not (= .cse0 (mod (+ 19 |c_ULTIMATE.start_main_~x~0#1|) 4294967296))) (not (= .cse0 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 22) 4294967296))) (not (= .cse0 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 13) 4294967296))) (not (= (mod |c_ULTIMATE.start_main_~x~0#1| 4294967296) .cse0)) (not (= (mod (+ |c_ULTIMATE.start_main_~x~0#1| 8) 4294967296) .cse0)) (not (= .cse0 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 11) 4294967296))) (not (= (mod (+ |c_ULTIMATE.start_main_~x~0#1| 29) 4294967296) .cse0)) (not (= (mod (+ |c_ULTIMATE.start_main_~x~0#1| 16) 4294967296) .cse0)) (not (= .cse0 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 17) 4294967296))) (not (= .cse0 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 12) 4294967296))) (not (= .cse0 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 3) 4294967296))) (not (= .cse0 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 15) 4294967296))) (not (= .cse0 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 20) 4294967296))) (not (= .cse0 (mod (+ 7 |c_ULTIMATE.start_main_~x~0#1|) 4294967296))) (not (= .cse0 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 30) 4294967296))) (not (= (mod (+ |c_ULTIMATE.start_main_~x~0#1| 4) 4294967296) .cse0)) (not (= (mod (+ 23 |c_ULTIMATE.start_main_~x~0#1|) 4294967296) .cse0)) (not (= (mod (+ |c_ULTIMATE.start_main_~x~0#1| 26) 4294967296) .cse0)) (not (= .cse0 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 18) 4294967296))) (not (= .cse0 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 10) 4294967296))) (not (= .cse0 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 6) 4294967296))) (not (= .cse0 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 28) 4294967296))) (not (= .cse0 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 1) 4294967296))))) is different from false [2022-11-20 09:38:49,382 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse0 (mod |c_ULTIMATE.start_main_~z~0#1| 4294967296))) (and (not (= (mod (+ |c_ULTIMATE.start_main_~x~0#1| 24) 4294967296) .cse0)) (not (= (mod (+ |c_ULTIMATE.start_main_~x~0#1| 2) 4294967296) .cse0)) (not (= (mod (+ |c_ULTIMATE.start_main_~x~0#1| 27) 4294967296) .cse0)) (not (= .cse0 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 5) 4294967296))) (not (= (mod (+ |c_ULTIMATE.start_main_~x~0#1| 21) 4294967296) .cse0)) (not (= (mod (+ |c_ULTIMATE.start_main_~x~0#1| 25) 4294967296) .cse0)) (not (= .cse0 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 14) 4294967296))) (not (= (mod (+ |c_ULTIMATE.start_main_~x~0#1| 9) 4294967296) .cse0)) (not (= .cse0 (mod (+ 19 |c_ULTIMATE.start_main_~x~0#1|) 4294967296))) (not (= .cse0 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 22) 4294967296))) (not (= .cse0 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 13) 4294967296))) (not (= (mod (+ |c_ULTIMATE.start_main_~x~0#1| 8) 4294967296) .cse0)) (not (= .cse0 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 11) 4294967296))) (not (= (mod (+ |c_ULTIMATE.start_main_~x~0#1| 29) 4294967296) .cse0)) (not (= (mod (+ |c_ULTIMATE.start_main_~x~0#1| 16) 4294967296) .cse0)) (not (= .cse0 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 17) 4294967296))) (not (= .cse0 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 12) 4294967296))) (not (= .cse0 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 3) 4294967296))) (not (= .cse0 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 15) 4294967296))) (not (= .cse0 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 20) 4294967296))) (not (= .cse0 (mod (+ 7 |c_ULTIMATE.start_main_~x~0#1|) 4294967296))) (not (= .cse0 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 30) 4294967296))) (not (= (mod (+ |c_ULTIMATE.start_main_~x~0#1| 4) 4294967296) .cse0)) (not (= (mod (+ 23 |c_ULTIMATE.start_main_~x~0#1|) 4294967296) .cse0)) (not (= (mod (+ |c_ULTIMATE.start_main_~x~0#1| 26) 4294967296) .cse0)) (not (= .cse0 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 18) 4294967296))) (not (= .cse0 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 10) 4294967296))) (not (= .cse0 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 6) 4294967296))) (not (= .cse0 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 28) 4294967296))) (not (= .cse0 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 1) 4294967296))))) is different from false [2022-11-20 09:38:51,395 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse0 (mod |c_ULTIMATE.start_main_~z~0#1| 4294967296))) (and (not (= (mod (+ |c_ULTIMATE.start_main_~x~0#1| 24) 4294967296) .cse0)) (not (= (mod (+ |c_ULTIMATE.start_main_~x~0#1| 2) 4294967296) .cse0)) (not (= (mod (+ |c_ULTIMATE.start_main_~x~0#1| 27) 4294967296) .cse0)) (not (= .cse0 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 5) 4294967296))) (not (= (mod (+ |c_ULTIMATE.start_main_~x~0#1| 21) 4294967296) .cse0)) (not (= (mod (+ |c_ULTIMATE.start_main_~x~0#1| 25) 4294967296) .cse0)) (not (= .cse0 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 14) 4294967296))) (not (= (mod (+ |c_ULTIMATE.start_main_~x~0#1| 9) 4294967296) .cse0)) (not (= .cse0 (mod (+ 19 |c_ULTIMATE.start_main_~x~0#1|) 4294967296))) (not (= .cse0 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 22) 4294967296))) (not (= .cse0 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 13) 4294967296))) (not (= (mod |c_ULTIMATE.start_main_~x~0#1| 4294967296) .cse0)) (not (= (mod (+ |c_ULTIMATE.start_main_~x~0#1| 8) 4294967296) .cse0)) (not (= .cse0 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 11) 4294967296))) (not (= (mod (+ |c_ULTIMATE.start_main_~x~0#1| 29) 4294967296) .cse0)) (not (= (mod (+ |c_ULTIMATE.start_main_~x~0#1| 16) 4294967296) .cse0)) (not (= .cse0 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 17) 4294967296))) (not (= .cse0 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 12) 4294967296))) (not (= .cse0 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 3) 4294967296))) (not (= .cse0 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 15) 4294967296))) (not (= .cse0 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 20) 4294967296))) (not (= .cse0 (mod (+ 7 |c_ULTIMATE.start_main_~x~0#1|) 4294967296))) (not (= (mod (+ |c_ULTIMATE.start_main_~x~0#1| 4) 4294967296) .cse0)) (not (= (mod (+ 23 |c_ULTIMATE.start_main_~x~0#1|) 4294967296) .cse0)) (not (= (mod (+ |c_ULTIMATE.start_main_~x~0#1| 26) 4294967296) .cse0)) (not (= .cse0 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 18) 4294967296))) (not (= .cse0 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 10) 4294967296))) (not (= .cse0 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 6) 4294967296))) (not (= .cse0 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 28) 4294967296))) (not (= .cse0 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 1) 4294967296))))) is different from false