./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/loops-crafted-1/Mono1_1-1.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version e04fb08f Calling Ultimate with: /usr/lib/jvm/java-1.11.0-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_45d864c2-58e6-4cbb-9052-1e3b0f5f4da8/bin/uautomizer-tPACEb0tL8/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_45d864c2-58e6-4cbb-9052-1e3b0f5f4da8/bin/uautomizer-tPACEb0tL8/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_45d864c2-58e6-4cbb-9052-1e3b0f5f4da8/bin/uautomizer-tPACEb0tL8/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_45d864c2-58e6-4cbb-9052-1e3b0f5f4da8/bin/uautomizer-tPACEb0tL8/config/AutomizerReach.xml -i ../../sv-benchmarks/c/loops-crafted-1/Mono1_1-1.c -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_45d864c2-58e6-4cbb-9052-1e3b0f5f4da8/bin/uautomizer-tPACEb0tL8/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_45d864c2-58e6-4cbb-9052-1e3b0f5f4da8/bin/uautomizer-tPACEb0tL8 --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 73587fb730a0fae8f0f61c4bce66b3ef3eca8012a1c96e30e457f1e4f757a73f --- Real Ultimate output --- [0.001s][warning][os,container] Duplicate cpuset controllers detected. Picking /sys/fs/cgroup/cpuset, skipping /sys/fs/cgroup/cpuset. This is Ultimate 0.2.2-dev-e04fb08 [2022-11-16 12:46:33,328 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-11-16 12:46:33,330 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-11-16 12:46:33,356 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-11-16 12:46:33,356 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-11-16 12:46:33,357 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-11-16 12:46:33,361 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-11-16 12:46:33,370 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-11-16 12:46:33,374 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-11-16 12:46:33,375 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-11-16 12:46:33,376 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-11-16 12:46:33,377 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-11-16 12:46:33,377 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-11-16 12:46:33,378 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-11-16 12:46:33,379 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-11-16 12:46:33,380 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-11-16 12:46:33,381 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-11-16 12:46:33,382 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-11-16 12:46:33,387 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-11-16 12:46:33,397 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-11-16 12:46:33,401 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-11-16 12:46:33,405 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-11-16 12:46:33,406 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-11-16 12:46:33,407 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-11-16 12:46:33,410 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-11-16 12:46:33,411 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-11-16 12:46:33,411 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-11-16 12:46:33,412 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-11-16 12:46:33,412 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-11-16 12:46:33,413 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-11-16 12:46:33,414 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-11-16 12:46:33,414 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-11-16 12:46:33,426 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-11-16 12:46:33,427 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-11-16 12:46:33,428 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-11-16 12:46:33,428 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-11-16 12:46:33,429 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-11-16 12:46:33,429 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-11-16 12:46:33,430 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-11-16 12:46:33,431 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-11-16 12:46:33,431 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-11-16 12:46:33,434 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_45d864c2-58e6-4cbb-9052-1e3b0f5f4da8/bin/uautomizer-tPACEb0tL8/config/svcomp-Reach-32bit-Automizer_Default.epf [2022-11-16 12:46:33,478 INFO L113 SettingsManager]: Loading preferences was successful [2022-11-16 12:46:33,478 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-11-16 12:46:33,479 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-11-16 12:46:33,479 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-11-16 12:46:33,481 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-11-16 12:46:33,481 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-11-16 12:46:33,482 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-11-16 12:46:33,482 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-11-16 12:46:33,482 INFO L138 SettingsManager]: * Use SBE=true [2022-11-16 12:46:33,482 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-11-16 12:46:33,483 INFO L138 SettingsManager]: * sizeof long=4 [2022-11-16 12:46:33,483 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-11-16 12:46:33,484 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-11-16 12:46:33,484 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-11-16 12:46:33,484 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-11-16 12:46:33,484 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-11-16 12:46:33,484 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-11-16 12:46:33,485 INFO L138 SettingsManager]: * sizeof long double=12 [2022-11-16 12:46:33,485 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-11-16 12:46:33,485 INFO L138 SettingsManager]: * Use constant arrays=true [2022-11-16 12:46:33,485 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-11-16 12:46:33,485 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-11-16 12:46:33,485 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-11-16 12:46:33,486 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-11-16 12:46:33,486 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-11-16 12:46:33,486 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-11-16 12:46:33,486 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-11-16 12:46:33,486 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-11-16 12:46:33,487 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-11-16 12:46:33,487 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-11-16 12:46:33,488 INFO L138 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2022-11-16 12:46:33,489 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-11-16 12:46:33,489 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-11-16 12:46:33,489 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_45d864c2-58e6-4cbb-9052-1e3b0f5f4da8/bin/uautomizer-tPACEb0tL8/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_45d864c2-58e6-4cbb-9052-1e3b0f5f4da8/bin/uautomizer-tPACEb0tL8 Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness.graphml Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(reach_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 73587fb730a0fae8f0f61c4bce66b3ef3eca8012a1c96e30e457f1e4f757a73f [2022-11-16 12:46:33,760 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-11-16 12:46:33,789 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-11-16 12:46:33,793 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-11-16 12:46:33,794 INFO L271 PluginConnector]: Initializing CDTParser... [2022-11-16 12:46:33,795 INFO L275 PluginConnector]: CDTParser initialized [2022-11-16 12:46:33,796 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_45d864c2-58e6-4cbb-9052-1e3b0f5f4da8/bin/uautomizer-tPACEb0tL8/../../sv-benchmarks/c/loops-crafted-1/Mono1_1-1.c [2022-11-16 12:46:33,868 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_45d864c2-58e6-4cbb-9052-1e3b0f5f4da8/bin/uautomizer-tPACEb0tL8/data/bd1752590/9ed599d42ea940c0a7c186557c4ef4f7/FLAG28bbc6e61 [2022-11-16 12:46:34,249 INFO L306 CDTParser]: Found 1 translation units. [2022-11-16 12:46:34,250 INFO L160 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_45d864c2-58e6-4cbb-9052-1e3b0f5f4da8/sv-benchmarks/c/loops-crafted-1/Mono1_1-1.c [2022-11-16 12:46:34,256 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_45d864c2-58e6-4cbb-9052-1e3b0f5f4da8/bin/uautomizer-tPACEb0tL8/data/bd1752590/9ed599d42ea940c0a7c186557c4ef4f7/FLAG28bbc6e61 [2022-11-16 12:46:34,663 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_45d864c2-58e6-4cbb-9052-1e3b0f5f4da8/bin/uautomizer-tPACEb0tL8/data/bd1752590/9ed599d42ea940c0a7c186557c4ef4f7 [2022-11-16 12:46:34,666 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-11-16 12:46:34,667 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-11-16 12:46:34,669 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-11-16 12:46:34,669 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-11-16 12:46:34,677 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-11-16 12:46:34,678 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.11 12:46:34" (1/1) ... [2022-11-16 12:46:34,679 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5bba23c2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 12:46:34, skipping insertion in model container [2022-11-16 12:46:34,680 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.11 12:46:34" (1/1) ... [2022-11-16 12:46:34,687 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-11-16 12:46:34,700 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-11-16 12:46:34,954 WARN L229 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_45d864c2-58e6-4cbb-9052-1e3b0f5f4da8/sv-benchmarks/c/loops-crafted-1/Mono1_1-1.c[313,326] [2022-11-16 12:46:34,978 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-11-16 12:46:34,987 INFO L203 MainTranslator]: Completed pre-run [2022-11-16 12:46:34,999 WARN L229 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_45d864c2-58e6-4cbb-9052-1e3b0f5f4da8/sv-benchmarks/c/loops-crafted-1/Mono1_1-1.c[313,326] [2022-11-16 12:46:35,002 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-11-16 12:46:35,016 INFO L208 MainTranslator]: Completed translation [2022-11-16 12:46:35,017 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 12:46:35 WrapperNode [2022-11-16 12:46:35,017 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-11-16 12:46:35,019 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-11-16 12:46:35,019 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-11-16 12:46:35,019 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-11-16 12:46:35,027 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 12:46:35" (1/1) ... [2022-11-16 12:46:35,037 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 12:46:35" (1/1) ... [2022-11-16 12:46:35,055 INFO L138 Inliner]: procedures = 12, calls = 8, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 26 [2022-11-16 12:46:35,056 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-11-16 12:46:35,057 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-11-16 12:46:35,058 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-11-16 12:46:35,058 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-11-16 12:46:35,067 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 12:46:35" (1/1) ... [2022-11-16 12:46:35,068 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 12:46:35" (1/1) ... [2022-11-16 12:46:35,070 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 12:46:35" (1/1) ... [2022-11-16 12:46:35,070 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 12:46:35" (1/1) ... [2022-11-16 12:46:35,073 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 12:46:35" (1/1) ... [2022-11-16 12:46:35,080 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 12:46:35" (1/1) ... [2022-11-16 12:46:35,087 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 12:46:35" (1/1) ... [2022-11-16 12:46:35,088 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 12:46:35" (1/1) ... [2022-11-16 12:46:35,089 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-11-16 12:46:35,091 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-11-16 12:46:35,092 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-11-16 12:46:35,092 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-11-16 12:46:35,094 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 12:46:35" (1/1) ... [2022-11-16 12:46:35,101 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-11-16 12:46:35,110 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_45d864c2-58e6-4cbb-9052-1e3b0f5f4da8/bin/uautomizer-tPACEb0tL8/z3 [2022-11-16 12:46:35,124 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_45d864c2-58e6-4cbb-9052-1e3b0f5f4da8/bin/uautomizer-tPACEb0tL8/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-11-16 12:46:35,131 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_45d864c2-58e6-4cbb-9052-1e3b0f5f4da8/bin/uautomizer-tPACEb0tL8/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-11-16 12:46:35,164 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-11-16 12:46:35,164 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-11-16 12:46:35,165 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-11-16 12:46:35,165 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-11-16 12:46:35,227 INFO L235 CfgBuilder]: Building ICFG [2022-11-16 12:46:35,229 INFO L261 CfgBuilder]: Building CFG for each procedure with an implementation [2022-11-16 12:46:35,377 INFO L276 CfgBuilder]: Performing block encoding [2022-11-16 12:46:35,396 INFO L295 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-11-16 12:46:35,397 INFO L300 CfgBuilder]: Removed 1 assume(true) statements. [2022-11-16 12:46:35,398 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 16.11 12:46:35 BoogieIcfgContainer [2022-11-16 12:46:35,399 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-11-16 12:46:35,401 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-11-16 12:46:35,401 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-11-16 12:46:35,405 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-11-16 12:46:35,405 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 16.11 12:46:34" (1/3) ... [2022-11-16 12:46:35,406 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4bf6eb92 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.11 12:46:35, skipping insertion in model container [2022-11-16 12:46:35,406 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 12:46:35" (2/3) ... [2022-11-16 12:46:35,406 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4bf6eb92 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.11 12:46:35, skipping insertion in model container [2022-11-16 12:46:35,407 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 16.11 12:46:35" (3/3) ... [2022-11-16 12:46:35,408 INFO L112 eAbstractionObserver]: Analyzing ICFG Mono1_1-1.c [2022-11-16 12:46:35,427 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-11-16 12:46:35,427 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-11-16 12:46:35,492 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-11-16 12:46:35,500 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;@ab6b2a1, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2022-11-16 12:46:35,500 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-11-16 12:46:35,520 INFO L276 IsEmpty]: Start isEmpty. Operand has 12 states, 10 states have (on average 1.5) internal successors, (15), 11 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-16 12:46:35,526 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2022-11-16 12:46:35,526 INFO L187 NwaCegarLoop]: Found error trace [2022-11-16 12:46:35,527 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2022-11-16 12:46:35,528 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-16 12:46:35,533 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-16 12:46:35,533 INFO L85 PathProgramCache]: Analyzing trace with hash 889937703, now seen corresponding path program 1 times [2022-11-16 12:46:35,563 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-16 12:46:35,564 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1914341484] [2022-11-16 12:46:35,564 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 12:46:35,564 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-16 12:46:35,686 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:46:35,751 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-16 12:46:35,752 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-16 12:46:35,752 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1914341484] [2022-11-16 12:46:35,753 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1914341484] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-16 12:46:35,753 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-16 12:46:35,754 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-11-16 12:46:35,755 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2072358390] [2022-11-16 12:46:35,757 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-16 12:46:35,763 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2022-11-16 12:46:35,765 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-16 12:46:35,803 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2022-11-16 12:46:35,805 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2022-11-16 12:46:35,808 INFO L87 Difference]: Start difference. First operand has 12 states, 10 states have (on average 1.5) internal successors, (15), 11 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 2 states, 2 states have (on average 3.0) internal successors, (6), 2 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-16 12:46:35,823 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-16 12:46:35,823 INFO L93 Difference]: Finished difference Result 20 states and 23 transitions. [2022-11-16 12:46:35,824 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-11-16 12:46:35,826 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 3.0) internal successors, (6), 2 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 6 [2022-11-16 12:46:35,827 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-16 12:46:35,835 INFO L225 Difference]: With dead ends: 20 [2022-11-16 12:46:35,835 INFO L226 Difference]: Without dead ends: 8 [2022-11-16 12:46:35,839 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2022-11-16 12:46:35,849 INFO L413 NwaCegarLoop]: 13 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, 13 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-11-16 12:46:35,851 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 13 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-11-16 12:46:35,870 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8 states. [2022-11-16 12:46:35,893 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8 to 8. [2022-11-16 12:46:35,894 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8 states, 7 states have (on average 1.2857142857142858) internal successors, (9), 7 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-16 12:46:35,895 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 9 transitions. [2022-11-16 12:46:35,896 INFO L78 Accepts]: Start accepts. Automaton has 8 states and 9 transitions. Word has length 6 [2022-11-16 12:46:35,897 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-16 12:46:35,897 INFO L495 AbstractCegarLoop]: Abstraction has 8 states and 9 transitions. [2022-11-16 12:46:35,898 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 3.0) internal successors, (6), 2 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-16 12:46:35,898 INFO L276 IsEmpty]: Start isEmpty. Operand 8 states and 9 transitions. [2022-11-16 12:46:35,899 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2022-11-16 12:46:35,899 INFO L187 NwaCegarLoop]: Found error trace [2022-11-16 12:46:35,899 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2022-11-16 12:46:35,899 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-11-16 12:46:35,900 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-16 12:46:35,903 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-16 12:46:35,903 INFO L85 PathProgramCache]: Analyzing trace with hash 889639793, now seen corresponding path program 1 times [2022-11-16 12:46:35,904 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-16 12:46:35,904 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [952309134] [2022-11-16 12:46:35,904 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 12:46:35,904 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-16 12:46:35,944 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:46:36,143 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-16 12:46:36,143 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-16 12:46:36,143 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [952309134] [2022-11-16 12:46:36,145 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [952309134] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-16 12:46:36,145 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-16 12:46:36,145 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-16 12:46:36,145 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [636472715] [2022-11-16 12:46:36,146 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-16 12:46:36,147 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-16 12:46:36,148 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-16 12:46:36,149 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-16 12:46:36,150 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-16 12:46:36,152 INFO L87 Difference]: Start difference. First operand 8 states and 9 transitions. Second operand has 3 states, 3 states have (on average 2.0) internal successors, (6), 3 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-16 12:46:36,186 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-16 12:46:36,187 INFO L93 Difference]: Finished difference Result 16 states and 20 transitions. [2022-11-16 12:46:36,187 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-16 12:46:36,188 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 2.0) internal successors, (6), 3 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 6 [2022-11-16 12:46:36,188 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-16 12:46:36,188 INFO L225 Difference]: With dead ends: 16 [2022-11-16 12:46:36,188 INFO L226 Difference]: Without dead ends: 10 [2022-11-16 12:46:36,189 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-16 12:46:36,190 INFO L413 NwaCegarLoop]: 7 mSDtfsCounter, 1 mSDsluCounter, 3 mSDsCounter, 0 mSdLazyCounter, 7 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 10 SdHoareTripleChecker+Invalid, 8 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 7 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-11-16 12:46:36,193 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 10 Invalid, 8 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 7 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-11-16 12:46:36,194 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10 states. [2022-11-16 12:46:36,197 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10 to 10. [2022-11-16 12:46:36,199 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10 states, 9 states have (on average 1.2222222222222223) internal successors, (11), 9 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-16 12:46:36,201 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 11 transitions. [2022-11-16 12:46:36,201 INFO L78 Accepts]: Start accepts. Automaton has 10 states and 11 transitions. Word has length 6 [2022-11-16 12:46:36,201 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-16 12:46:36,202 INFO L495 AbstractCegarLoop]: Abstraction has 10 states and 11 transitions. [2022-11-16 12:46:36,203 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 2.0) internal successors, (6), 3 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-16 12:46:36,203 INFO L276 IsEmpty]: Start isEmpty. Operand 10 states and 11 transitions. [2022-11-16 12:46:36,203 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2022-11-16 12:46:36,204 INFO L187 NwaCegarLoop]: Found error trace [2022-11-16 12:46:36,204 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2022-11-16 12:46:36,205 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-11-16 12:46:36,206 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-16 12:46:36,207 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-16 12:46:36,208 INFO L85 PathProgramCache]: Analyzing trace with hash 295691924, now seen corresponding path program 1 times [2022-11-16 12:46:36,208 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-16 12:46:36,209 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2046145023] [2022-11-16 12:46:36,210 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 12:46:36,211 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-16 12:46:36,222 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:46:36,331 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-16 12:46:36,331 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-16 12:46:36,331 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2046145023] [2022-11-16 12:46:36,332 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2046145023] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-16 12:46:36,351 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [580531853] [2022-11-16 12:46:36,352 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 12:46:36,352 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-16 12:46:36,352 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_45d864c2-58e6-4cbb-9052-1e3b0f5f4da8/bin/uautomizer-tPACEb0tL8/z3 [2022-11-16 12:46:36,359 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_45d864c2-58e6-4cbb-9052-1e3b0f5f4da8/bin/uautomizer-tPACEb0tL8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-16 12:46:36,385 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_45d864c2-58e6-4cbb-9052-1e3b0f5f4da8/bin/uautomizer-tPACEb0tL8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2022-11-16 12:46:36,409 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:46:36,411 INFO L263 TraceCheckSpWp]: Trace formula consists of 39 conjuncts, 5 conjunts are in the unsatisfiable core [2022-11-16 12:46:36,424 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-16 12:46:36,458 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-16 12:46:36,459 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-16 12:46:36,493 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-16 12:46:36,493 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [580531853] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-16 12:46:36,494 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-16 12:46:36,494 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 7 [2022-11-16 12:46:36,494 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [22563088] [2022-11-16 12:46:36,494 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-16 12:46:36,495 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-11-16 12:46:36,495 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-16 12:46:36,496 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-11-16 12:46:36,496 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=23, Unknown=0, NotChecked=0, Total=42 [2022-11-16 12:46:36,497 INFO L87 Difference]: Start difference. First operand 10 states and 11 transitions. Second operand has 7 states, 7 states have (on average 2.0) internal successors, (14), 7 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-16 12:46:36,565 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-16 12:46:36,566 INFO L93 Difference]: Finished difference Result 20 states and 26 transitions. [2022-11-16 12:46:36,566 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-11-16 12:46:36,568 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 2.0) internal successors, (14), 7 states have internal predecessors, (14), 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 8 [2022-11-16 12:46:36,568 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-16 12:46:36,569 INFO L225 Difference]: With dead ends: 20 [2022-11-16 12:46:36,569 INFO L226 Difference]: Without dead ends: 14 [2022-11-16 12:46:36,572 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 14 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=26, Invalid=30, Unknown=0, NotChecked=0, Total=56 [2022-11-16 12:46:36,575 INFO L413 NwaCegarLoop]: 6 mSDtfsCounter, 4 mSDsluCounter, 9 mSDsCounter, 0 mSdLazyCounter, 22 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 15 SdHoareTripleChecker+Invalid, 30 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 22 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-11-16 12:46:36,577 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [4 Valid, 15 Invalid, 30 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 22 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-11-16 12:46:36,578 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14 states. [2022-11-16 12:46:36,592 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14 to 13. [2022-11-16 12:46:36,593 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 13 states, 12 states have (on average 1.1666666666666667) internal successors, (14), 12 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-16 12:46:36,593 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 14 transitions. [2022-11-16 12:46:36,594 INFO L78 Accepts]: Start accepts. Automaton has 13 states and 14 transitions. Word has length 8 [2022-11-16 12:46:36,594 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-16 12:46:36,594 INFO L495 AbstractCegarLoop]: Abstraction has 13 states and 14 transitions. [2022-11-16 12:46:36,595 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 2.0) internal successors, (14), 7 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-16 12:46:36,595 INFO L276 IsEmpty]: Start isEmpty. Operand 13 states and 14 transitions. [2022-11-16 12:46:36,595 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2022-11-16 12:46:36,596 INFO L187 NwaCegarLoop]: Found error trace [2022-11-16 12:46:36,596 INFO L195 NwaCegarLoop]: trace histogram [3, 2, 1, 1, 1, 1, 1, 1, 1] [2022-11-16 12:46:36,606 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_45d864c2-58e6-4cbb-9052-1e3b0f5f4da8/bin/uautomizer-tPACEb0tL8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2022-11-16 12:46:36,801 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2,2 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_45d864c2-58e6-4cbb-9052-1e3b0f5f4da8/bin/uautomizer-tPACEb0tL8/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-16 12:46:36,802 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-16 12:46:36,802 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-16 12:46:36,802 INFO L85 PathProgramCache]: Analyzing trace with hash 572634524, now seen corresponding path program 1 times [2022-11-16 12:46:36,803 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-16 12:46:36,803 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1474118984] [2022-11-16 12:46:36,803 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 12:46:36,803 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-16 12:46:36,833 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:46:37,074 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 3 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-16 12:46:37,074 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-16 12:46:37,075 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1474118984] [2022-11-16 12:46:37,075 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1474118984] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-16 12:46:37,075 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [36877111] [2022-11-16 12:46:37,075 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 12:46:37,076 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-16 12:46:37,076 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_45d864c2-58e6-4cbb-9052-1e3b0f5f4da8/bin/uautomizer-tPACEb0tL8/z3 [2022-11-16 12:46:37,084 INFO L229 MonitoredProcess]: Starting monitored process 3 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_45d864c2-58e6-4cbb-9052-1e3b0f5f4da8/bin/uautomizer-tPACEb0tL8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-16 12:46:37,095 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_45d864c2-58e6-4cbb-9052-1e3b0f5f4da8/bin/uautomizer-tPACEb0tL8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2022-11-16 12:46:37,135 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:46:37,136 INFO L263 TraceCheckSpWp]: Trace formula consists of 47 conjuncts, 8 conjunts are in the unsatisfiable core [2022-11-16 12:46:37,137 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-16 12:46:37,219 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 3 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-16 12:46:37,219 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-16 12:46:37,434 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 3 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-16 12:46:37,434 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [36877111] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-16 12:46:37,434 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-16 12:46:37,435 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 6] total 10 [2022-11-16 12:46:37,435 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [360953635] [2022-11-16 12:46:37,435 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-16 12:46:37,436 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-11-16 12:46:37,436 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-16 12:46:37,436 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-11-16 12:46:37,437 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=37, Invalid=53, Unknown=0, NotChecked=0, Total=90 [2022-11-16 12:46:37,437 INFO L87 Difference]: Start difference. First operand 13 states and 14 transitions. Second operand has 10 states, 10 states have (on average 2.2) internal successors, (22), 10 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-16 12:46:37,710 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-16 12:46:37,710 INFO L93 Difference]: Finished difference Result 28 states and 34 transitions. [2022-11-16 12:46:37,711 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-11-16 12:46:37,711 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 2.2) internal successors, (22), 10 states have internal predecessors, (22), 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 12 [2022-11-16 12:46:37,712 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-16 12:46:37,712 INFO L225 Difference]: With dead ends: 28 [2022-11-16 12:46:37,712 INFO L226 Difference]: Without dead ends: 21 [2022-11-16 12:46:37,713 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 18 SyntacticMatches, 2 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 22 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=67, Invalid=89, Unknown=0, NotChecked=0, Total=156 [2022-11-16 12:46:37,714 INFO L413 NwaCegarLoop]: 6 mSDtfsCounter, 15 mSDsluCounter, 11 mSDsCounter, 0 mSdLazyCounter, 43 mSolverCounterSat, 15 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 15 SdHoareTripleChecker+Valid, 17 SdHoareTripleChecker+Invalid, 58 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 15 IncrementalHoareTripleChecker+Valid, 43 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-16 12:46:37,715 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [15 Valid, 17 Invalid, 58 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [15 Valid, 43 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-16 12:46:37,715 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21 states. [2022-11-16 12:46:37,720 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21 to 21. [2022-11-16 12:46:37,720 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 21 states, 20 states have (on average 1.1) internal successors, (22), 20 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-16 12:46:37,721 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 22 transitions. [2022-11-16 12:46:37,721 INFO L78 Accepts]: Start accepts. Automaton has 21 states and 22 transitions. Word has length 12 [2022-11-16 12:46:37,721 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-16 12:46:37,721 INFO L495 AbstractCegarLoop]: Abstraction has 21 states and 22 transitions. [2022-11-16 12:46:37,722 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 2.2) internal successors, (22), 10 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-16 12:46:37,722 INFO L276 IsEmpty]: Start isEmpty. Operand 21 states and 22 transitions. [2022-11-16 12:46:37,722 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2022-11-16 12:46:37,722 INFO L187 NwaCegarLoop]: Found error trace [2022-11-16 12:46:37,723 INFO L195 NwaCegarLoop]: trace histogram [7, 6, 1, 1, 1, 1, 1, 1, 1] [2022-11-16 12:46:37,732 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_45d864c2-58e6-4cbb-9052-1e3b0f5f4da8/bin/uautomizer-tPACEb0tL8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2022-11-16 12:46:37,927 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3,3 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_45d864c2-58e6-4cbb-9052-1e3b0f5f4da8/bin/uautomizer-tPACEb0tL8/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-16 12:46:37,927 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-16 12:46:37,928 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-16 12:46:37,928 INFO L85 PathProgramCache]: Analyzing trace with hash 1634475176, now seen corresponding path program 2 times [2022-11-16 12:46:37,928 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-16 12:46:37,928 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2008775508] [2022-11-16 12:46:37,928 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 12:46:37,928 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-16 12:46:37,955 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:46:38,235 INFO L134 CoverageAnalysis]: Checked inductivity of 49 backedges. 7 proven. 42 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-16 12:46:38,236 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-16 12:46:38,240 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2008775508] [2022-11-16 12:46:38,240 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2008775508] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-16 12:46:38,241 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [67663586] [2022-11-16 12:46:38,241 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-11-16 12:46:38,241 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-16 12:46:38,241 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_45d864c2-58e6-4cbb-9052-1e3b0f5f4da8/bin/uautomizer-tPACEb0tL8/z3 [2022-11-16 12:46:38,242 INFO L229 MonitoredProcess]: Starting monitored process 4 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_45d864c2-58e6-4cbb-9052-1e3b0f5f4da8/bin/uautomizer-tPACEb0tL8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-16 12:46:38,251 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_45d864c2-58e6-4cbb-9052-1e3b0f5f4da8/bin/uautomizer-tPACEb0tL8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2022-11-16 12:46:38,306 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-11-16 12:46:38,306 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-16 12:46:38,312 INFO L263 TraceCheckSpWp]: Trace formula consists of 63 conjuncts, 16 conjunts are in the unsatisfiable core [2022-11-16 12:46:38,313 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-16 12:46:38,413 INFO L134 CoverageAnalysis]: Checked inductivity of 49 backedges. 7 proven. 42 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-16 12:46:38,413 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-16 12:46:38,733 INFO L134 CoverageAnalysis]: Checked inductivity of 49 backedges. 7 proven. 42 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-16 12:46:38,733 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [67663586] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-16 12:46:38,733 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-16 12:46:38,733 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 10] total 18 [2022-11-16 12:46:38,733 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [914699643] [2022-11-16 12:46:38,734 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-16 12:46:38,734 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2022-11-16 12:46:38,734 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-16 12:46:38,734 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2022-11-16 12:46:38,735 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=105, Invalid=201, Unknown=0, NotChecked=0, Total=306 [2022-11-16 12:46:38,735 INFO L87 Difference]: Start difference. First operand 21 states and 22 transitions. Second operand has 18 states, 18 states have (on average 2.111111111111111) internal successors, (38), 18 states have internal predecessors, (38), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-16 12:46:40,665 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-16 12:46:40,665 INFO L93 Difference]: Finished difference Result 44 states and 54 transitions. [2022-11-16 12:46:40,666 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2022-11-16 12:46:40,666 INFO L78 Accepts]: Start accepts. Automaton has has 18 states, 18 states have (on average 2.111111111111111) internal successors, (38), 18 states have internal predecessors, (38), 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 20 [2022-11-16 12:46:40,666 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-16 12:46:40,667 INFO L225 Difference]: With dead ends: 44 [2022-11-16 12:46:40,667 INFO L226 Difference]: Without dead ends: 37 [2022-11-16 12:46:40,667 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 55 GetRequests, 30 SyntacticMatches, 2 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 60 ImplicationChecksByTransitivity, 2.0s TimeCoverageRelationStatistics Valid=231, Invalid=369, Unknown=0, NotChecked=0, Total=600 [2022-11-16 12:46:40,668 INFO L413 NwaCegarLoop]: 6 mSDtfsCounter, 35 mSDsluCounter, 13 mSDsCounter, 0 mSdLazyCounter, 133 mSolverCounterSat, 30 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 35 SdHoareTripleChecker+Valid, 19 SdHoareTripleChecker+Invalid, 163 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 30 IncrementalHoareTripleChecker+Valid, 133 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-11-16 12:46:40,668 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [35 Valid, 19 Invalid, 163 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [30 Valid, 133 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-11-16 12:46:40,669 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 37 states. [2022-11-16 12:46:40,675 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 37 to 37. [2022-11-16 12:46:40,675 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 37 states, 36 states have (on average 1.0555555555555556) internal successors, (38), 36 states have internal predecessors, (38), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-16 12:46:40,676 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37 states to 37 states and 38 transitions. [2022-11-16 12:46:40,676 INFO L78 Accepts]: Start accepts. Automaton has 37 states and 38 transitions. Word has length 20 [2022-11-16 12:46:40,677 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-16 12:46:40,677 INFO L495 AbstractCegarLoop]: Abstraction has 37 states and 38 transitions. [2022-11-16 12:46:40,677 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 18 states have (on average 2.111111111111111) internal successors, (38), 18 states have internal predecessors, (38), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-16 12:46:40,677 INFO L276 IsEmpty]: Start isEmpty. Operand 37 states and 38 transitions. [2022-11-16 12:46:40,678 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2022-11-16 12:46:40,678 INFO L187 NwaCegarLoop]: Found error trace [2022-11-16 12:46:40,678 INFO L195 NwaCegarLoop]: trace histogram [15, 14, 1, 1, 1, 1, 1, 1, 1] [2022-11-16 12:46:40,691 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_45d864c2-58e6-4cbb-9052-1e3b0f5f4da8/bin/uautomizer-tPACEb0tL8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2022-11-16 12:46:40,883 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,4 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_45d864c2-58e6-4cbb-9052-1e3b0f5f4da8/bin/uautomizer-tPACEb0tL8/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-16 12:46:40,883 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-16 12:46:40,884 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-16 12:46:40,884 INFO L85 PathProgramCache]: Analyzing trace with hash -1104705856, now seen corresponding path program 3 times [2022-11-16 12:46:40,884 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-16 12:46:40,884 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [564128723] [2022-11-16 12:46:40,884 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 12:46:40,884 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-16 12:46:40,900 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:46:41,320 INFO L134 CoverageAnalysis]: Checked inductivity of 225 backedges. 15 proven. 210 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-16 12:46:41,320 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-16 12:46:41,320 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [564128723] [2022-11-16 12:46:41,320 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [564128723] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-16 12:46:41,321 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1972731697] [2022-11-16 12:46:41,321 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-11-16 12:46:41,321 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-16 12:46:41,321 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_45d864c2-58e6-4cbb-9052-1e3b0f5f4da8/bin/uautomizer-tPACEb0tL8/z3 [2022-11-16 12:46:41,324 INFO L229 MonitoredProcess]: Starting monitored process 5 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_45d864c2-58e6-4cbb-9052-1e3b0f5f4da8/bin/uautomizer-tPACEb0tL8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-16 12:46:41,351 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_45d864c2-58e6-4cbb-9052-1e3b0f5f4da8/bin/uautomizer-tPACEb0tL8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2022-11-16 12:46:41,378 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2022-11-16 12:46:41,378 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-16 12:46:41,379 INFO L263 TraceCheckSpWp]: Trace formula consists of 47 conjuncts, 14 conjunts are in the unsatisfiable core [2022-11-16 12:46:41,381 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-16 12:46:41,479 INFO L134 CoverageAnalysis]: Checked inductivity of 225 backedges. 42 proven. 1 refuted. 0 times theorem prover too weak. 182 trivial. 0 not checked. [2022-11-16 12:46:41,480 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-16 12:46:41,767 INFO L134 CoverageAnalysis]: Checked inductivity of 225 backedges. 42 proven. 1 refuted. 0 times theorem prover too weak. 182 trivial. 0 not checked. [2022-11-16 12:46:41,767 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1972731697] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-16 12:46:41,767 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-16 12:46:41,768 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 4, 7] total 24 [2022-11-16 12:46:41,768 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [519314725] [2022-11-16 12:46:41,768 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-16 12:46:41,768 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 24 states [2022-11-16 12:46:41,769 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-16 12:46:41,769 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2022-11-16 12:46:41,769 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=126, Invalid=426, Unknown=0, NotChecked=0, Total=552 [2022-11-16 12:46:41,770 INFO L87 Difference]: Start difference. First operand 37 states and 38 transitions. Second operand has 24 states, 24 states have (on average 2.0416666666666665) internal successors, (49), 24 states have internal predecessors, (49), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-16 12:46:42,405 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-16 12:46:42,405 INFO L93 Difference]: Finished difference Result 54 states and 63 transitions. [2022-11-16 12:46:42,405 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2022-11-16 12:46:42,406 INFO L78 Accepts]: Start accepts. Automaton has has 24 states, 24 states have (on average 2.0416666666666665) internal successors, (49), 24 states have internal predecessors, (49), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 36 [2022-11-16 12:46:42,406 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-16 12:46:42,408 INFO L225 Difference]: With dead ends: 54 [2022-11-16 12:46:42,408 INFO L226 Difference]: Without dead ends: 45 [2022-11-16 12:46:42,408 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 92 GetRequests, 66 SyntacticMatches, 1 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=175, Invalid=527, Unknown=0, NotChecked=0, Total=702 [2022-11-16 12:46:42,409 INFO L413 NwaCegarLoop]: 4 mSDtfsCounter, 43 mSDsluCounter, 13 mSDsCounter, 0 mSdLazyCounter, 506 mSolverCounterSat, 45 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 43 SdHoareTripleChecker+Valid, 17 SdHoareTripleChecker+Invalid, 551 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 45 IncrementalHoareTripleChecker+Valid, 506 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2022-11-16 12:46:42,410 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [43 Valid, 17 Invalid, 551 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [45 Valid, 506 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2022-11-16 12:46:42,410 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 45 states. [2022-11-16 12:46:42,419 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 45 to 45. [2022-11-16 12:46:42,420 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 45 states, 44 states have (on average 1.0909090909090908) internal successors, (48), 44 states have internal predecessors, (48), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-16 12:46:42,421 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 45 states to 45 states and 48 transitions. [2022-11-16 12:46:42,421 INFO L78 Accepts]: Start accepts. Automaton has 45 states and 48 transitions. Word has length 36 [2022-11-16 12:46:42,421 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-16 12:46:42,421 INFO L495 AbstractCegarLoop]: Abstraction has 45 states and 48 transitions. [2022-11-16 12:46:42,421 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 24 states, 24 states have (on average 2.0416666666666665) internal successors, (49), 24 states have internal predecessors, (49), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-16 12:46:42,421 INFO L276 IsEmpty]: Start isEmpty. Operand 45 states and 48 transitions. [2022-11-16 12:46:42,422 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2022-11-16 12:46:42,422 INFO L187 NwaCegarLoop]: Found error trace [2022-11-16 12:46:42,423 INFO L195 NwaCegarLoop]: trace histogram [19, 15, 4, 1, 1, 1, 1, 1, 1] [2022-11-16 12:46:42,432 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_45d864c2-58e6-4cbb-9052-1e3b0f5f4da8/bin/uautomizer-tPACEb0tL8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2022-11-16 12:46:42,627 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5,5 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_45d864c2-58e6-4cbb-9052-1e3b0f5f4da8/bin/uautomizer-tPACEb0tL8/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-16 12:46:42,628 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-16 12:46:42,628 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-16 12:46:42,628 INFO L85 PathProgramCache]: Analyzing trace with hash -1664138286, now seen corresponding path program 4 times [2022-11-16 12:46:42,628 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-16 12:46:42,628 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1442368669] [2022-11-16 12:46:42,628 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 12:46:42,628 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-16 12:46:42,649 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:46:43,204 INFO L134 CoverageAnalysis]: Checked inductivity of 361 backedges. 112 proven. 240 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2022-11-16 12:46:43,204 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-16 12:46:43,204 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1442368669] [2022-11-16 12:46:43,205 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1442368669] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-16 12:46:43,205 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [987252534] [2022-11-16 12:46:43,205 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-11-16 12:46:43,205 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-16 12:46:43,205 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_45d864c2-58e6-4cbb-9052-1e3b0f5f4da8/bin/uautomizer-tPACEb0tL8/z3 [2022-11-16 12:46:43,207 INFO L229 MonitoredProcess]: Starting monitored process 6 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_45d864c2-58e6-4cbb-9052-1e3b0f5f4da8/bin/uautomizer-tPACEb0tL8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-16 12:46:43,231 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_45d864c2-58e6-4cbb-9052-1e3b0f5f4da8/bin/uautomizer-tPACEb0tL8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2022-11-16 12:46:43,273 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-11-16 12:46:43,273 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-16 12:46:43,275 INFO L263 TraceCheckSpWp]: Trace formula consists of 111 conjuncts, 38 conjunts are in the unsatisfiable core [2022-11-16 12:46:43,277 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-16 12:46:43,499 INFO L134 CoverageAnalysis]: Checked inductivity of 361 backedges. 54 proven. 306 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-11-16 12:46:43,500 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-16 12:46:44,925 INFO L134 CoverageAnalysis]: Checked inductivity of 361 backedges. 54 proven. 306 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-11-16 12:46:44,925 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [987252534] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-16 12:46:44,925 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-16 12:46:44,925 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 20, 21] total 40 [2022-11-16 12:46:44,926 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2123893147] [2022-11-16 12:46:44,926 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-16 12:46:44,926 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 40 states [2022-11-16 12:46:44,926 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-16 12:46:44,927 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 40 interpolants. [2022-11-16 12:46:44,928 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=455, Invalid=1105, Unknown=0, NotChecked=0, Total=1560 [2022-11-16 12:46:44,928 INFO L87 Difference]: Start difference. First operand 45 states and 48 transitions. Second operand has 40 states, 40 states have (on average 2.1) internal successors, (84), 40 states have internal predecessors, (84), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-16 12:47:51,957 WARN L233 SmtUtils]: Spent 9.08s on a formula simplification. DAG size of input: 129 DAG size of output: 17 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-11-16 12:47:51,974 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-16 12:47:51,974 INFO L93 Difference]: Finished difference Result 96 states and 121 transitions. [2022-11-16 12:47:51,975 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 37 states. [2022-11-16 12:47:51,975 INFO L78 Accepts]: Start accepts. Automaton has has 40 states, 40 states have (on average 2.1) internal successors, (84), 40 states have internal predecessors, (84), 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 44 [2022-11-16 12:47:51,975 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-16 12:47:51,976 INFO L225 Difference]: With dead ends: 96 [2022-11-16 12:47:51,976 INFO L226 Difference]: Without dead ends: 83 [2022-11-16 12:47:51,977 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 123 GetRequests, 65 SyntacticMatches, 2 SemanticMatches, 56 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 250 ImplicationChecksByTransitivity, 67.7s TimeCoverageRelationStatistics Valid=1175, Invalid=2130, Unknown=1, NotChecked=0, Total=3306 [2022-11-16 12:47:51,978 INFO L413 NwaCegarLoop]: 6 mSDtfsCounter, 88 mSDsluCounter, 30 mSDsCounter, 0 mSdLazyCounter, 651 mSolverCounterSat, 110 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 88 SdHoareTripleChecker+Valid, 36 SdHoareTripleChecker+Invalid, 761 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 110 IncrementalHoareTripleChecker+Valid, 651 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2022-11-16 12:47:51,978 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [88 Valid, 36 Invalid, 761 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [110 Valid, 651 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2022-11-16 12:47:51,979 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 83 states. [2022-11-16 12:47:51,998 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 83 to 83. [2022-11-16 12:47:51,999 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 83 states, 82 states have (on average 1.048780487804878) internal successors, (86), 82 states have internal predecessors, (86), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-16 12:47:52,000 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 83 states to 83 states and 86 transitions. [2022-11-16 12:47:52,000 INFO L78 Accepts]: Start accepts. Automaton has 83 states and 86 transitions. Word has length 44 [2022-11-16 12:47:52,000 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-16 12:47:52,000 INFO L495 AbstractCegarLoop]: Abstraction has 83 states and 86 transitions. [2022-11-16 12:47:52,001 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 40 states, 40 states have (on average 2.1) internal successors, (84), 40 states have internal predecessors, (84), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-16 12:47:52,001 INFO L276 IsEmpty]: Start isEmpty. Operand 83 states and 86 transitions. [2022-11-16 12:47:52,002 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 83 [2022-11-16 12:47:52,003 INFO L187 NwaCegarLoop]: Found error trace [2022-11-16 12:47:52,003 INFO L195 NwaCegarLoop]: trace histogram [38, 34, 4, 1, 1, 1, 1, 1, 1] [2022-11-16 12:47:52,010 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_45d864c2-58e6-4cbb-9052-1e3b0f5f4da8/bin/uautomizer-tPACEb0tL8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Ended with exit code 0 [2022-11-16 12:47:52,208 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,6 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_45d864c2-58e6-4cbb-9052-1e3b0f5f4da8/bin/uautomizer-tPACEb0tL8/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-16 12:47:52,208 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-16 12:47:52,208 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-16 12:47:52,208 INFO L85 PathProgramCache]: Analyzing trace with hash -1705672597, now seen corresponding path program 5 times [2022-11-16 12:47:52,209 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-16 12:47:52,209 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2019390891] [2022-11-16 12:47:52,209 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 12:47:52,209 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-16 12:47:52,247 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:47:54,009 INFO L134 CoverageAnalysis]: Checked inductivity of 1444 backedges. 245 proven. 1190 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2022-11-16 12:47:54,009 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-16 12:47:54,009 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2019390891] [2022-11-16 12:47:54,009 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2019390891] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-16 12:47:54,010 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1372153702] [2022-11-16 12:47:54,010 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2022-11-16 12:47:54,010 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-16 12:47:54,010 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_45d864c2-58e6-4cbb-9052-1e3b0f5f4da8/bin/uautomizer-tPACEb0tL8/z3 [2022-11-16 12:47:54,011 INFO L229 MonitoredProcess]: Starting monitored process 7 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_45d864c2-58e6-4cbb-9052-1e3b0f5f4da8/bin/uautomizer-tPACEb0tL8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-16 12:47:54,013 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_45d864c2-58e6-4cbb-9052-1e3b0f5f4da8/bin/uautomizer-tPACEb0tL8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2022-11-16 12:48:55,678 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 39 check-sat command(s) [2022-11-16 12:48:55,678 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-16 12:48:55,696 INFO L263 TraceCheckSpWp]: Trace formula consists of 187 conjuncts, 76 conjunts are in the unsatisfiable core [2022-11-16 12:48:55,699 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-16 12:48:56,203 INFO L134 CoverageAnalysis]: Checked inductivity of 1444 backedges. 111 proven. 1332 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-11-16 12:48:56,203 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-16 12:49:01,188 INFO L134 CoverageAnalysis]: Checked inductivity of 1444 backedges. 111 proven. 1332 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-11-16 12:49:01,188 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1372153702] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-16 12:49:01,188 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-16 12:49:01,189 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [37, 39, 40] total 78 [2022-11-16 12:49:01,189 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [742664463] [2022-11-16 12:49:01,189 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-16 12:49:01,192 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 78 states [2022-11-16 12:49:01,192 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-16 12:49:01,194 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 78 interpolants. [2022-11-16 12:49:01,196 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1633, Invalid=4373, Unknown=0, NotChecked=0, Total=6006 [2022-11-16 12:49:01,197 INFO L87 Difference]: Start difference. First operand 83 states and 86 transitions. Second operand has 78 states, 78 states have (on average 2.051282051282051) internal successors, (160), 78 states have internal predecessors, (160), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-16 12:50:17,849 WARN L233 SmtUtils]: Spent 35.38s on a formula simplification. DAG size of input: 259 DAG size of output: 10 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-11-16 12:50:19,873 WARN L833 $PredicateComparison]: unable to prove that (and (let ((.cse0 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 28) 4294967296))) (or (not (< .cse0 100000000)) (< .cse0 10000000))) (let ((.cse1 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 10) 4294967296))) (or (< .cse1 10000000) (not (< .cse1 100000000)))) (let ((.cse2 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 32) 4294967296))) (or (not (< .cse2 100000000)) (< .cse2 10000000))) (let ((.cse3 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 22) 4294967296))) (or (not (< .cse3 100000000)) (< .cse3 10000000))) (let ((.cse4 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 35) 4294967296))) (or (< .cse4 10000000) (not (< .cse4 100000000)))) (let ((.cse5 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 18) 4294967296))) (or (not (< .cse5 100000000)) (< .cse5 10000000))) (let ((.cse6 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 17) 4294967296))) (or (not (< .cse6 100000000)) (< .cse6 10000000))) (let ((.cse7 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 33) 4294967296))) (or (not (< .cse7 100000000)) (< .cse7 10000000))) (let ((.cse8 (mod (+ 23 |c_ULTIMATE.start_main_~x~0#1|) 4294967296))) (or (< .cse8 10000000) (not (< .cse8 100000000)))) (let ((.cse9 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 31) 4294967296))) (or (not (< .cse9 100000000)) (< .cse9 10000000))) (let ((.cse10 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 36) 4294967296))) (or (< .cse10 10000000) (not (< .cse10 100000000)))) (let ((.cse11 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 8) 4294967296))) (or (not (< .cse11 100000000)) (< .cse11 10000000))) (let ((.cse12 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 13) 4294967296))) (or (< .cse12 10000000) (not (< .cse12 100000000)))) (let ((.cse13 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 2) 4294967296))) (or (< .cse13 10000000) (not (< .cse13 100000000)))) (let ((.cse14 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 16) 4294967296))) (or (not (< .cse14 100000000)) (< .cse14 10000000))) (let ((.cse15 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 11) 4294967296))) (or (not (< .cse15 100000000)) (< .cse15 10000000))) (let ((.cse16 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 30) 4294967296))) (or (< .cse16 10000000) (not (< .cse16 100000000)))) (< (mod |c_ULTIMATE.start_main_~x~0#1| 4294967296) 10000000) (let ((.cse17 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 29) 4294967296))) (or (< .cse17 10000000) (not (< .cse17 100000000)))) (let ((.cse18 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 25) 4294967296))) (or (not (< .cse18 100000000)) (< .cse18 10000000))) (let ((.cse19 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 6) 4294967296))) (or (not (< .cse19 100000000)) (< .cse19 10000000))) (let ((.cse20 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 24) 4294967296))) (or (not (< .cse20 100000000)) (< .cse20 10000000))) (let ((.cse21 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 14) 4294967296))) (or (not (< .cse21 100000000)) (< .cse21 10000000))) (let ((.cse22 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 37) 4294967296))) (or (< .cse22 10000000) (not (< .cse22 100000000)))) (let ((.cse23 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 4) 4294967296))) (or (not (< .cse23 100000000)) (< .cse23 10000000))) (let ((.cse24 (mod (+ 19 |c_ULTIMATE.start_main_~x~0#1|) 4294967296))) (or (< .cse24 10000000) (not (< .cse24 100000000)))) (let ((.cse25 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 9) 4294967296))) (or (not (< .cse25 100000000)) (< .cse25 10000000))) (let ((.cse26 (mod (+ 7 |c_ULTIMATE.start_main_~x~0#1|) 4294967296))) (or (< .cse26 10000000) (not (< .cse26 100000000)))) (let ((.cse27 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 34) 4294967296))) (or (not (< .cse27 100000000)) (< .cse27 10000000))) (let ((.cse28 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 15) 4294967296))) (or (not (< .cse28 100000000)) (< .cse28 10000000))) (let ((.cse29 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 27) 4294967296))) (or (< .cse29 10000000) (not (< .cse29 100000000)))) (let ((.cse30 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 12) 4294967296))) (or (not (< .cse30 100000000)) (< .cse30 10000000))) (let ((.cse31 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 20) 4294967296))) (or (not (< .cse31 100000000)) (< .cse31 10000000))) (let ((.cse32 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 21) 4294967296))) (or (< .cse32 10000000) (not (< .cse32 100000000)))) (let ((.cse33 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 26) 4294967296))) (or (< .cse33 10000000) (not (< .cse33 100000000)))) (let ((.cse34 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 5) 4294967296))) (or (not (< .cse34 100000000)) (< .cse34 10000000)))) is different from false [2022-11-16 12:50:21,904 WARN L833 $PredicateComparison]: unable to prove that (and (let ((.cse0 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 28) 4294967296))) (or (not (< .cse0 100000000)) (< .cse0 10000000))) (let ((.cse1 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 10) 4294967296))) (or (< .cse1 10000000) (not (< .cse1 100000000)))) (let ((.cse2 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 32) 4294967296))) (or (not (< .cse2 100000000)) (< .cse2 10000000))) (let ((.cse3 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 22) 4294967296))) (or (not (< .cse3 100000000)) (< .cse3 10000000))) (let ((.cse4 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 35) 4294967296))) (or (< .cse4 10000000) (not (< .cse4 100000000)))) (let ((.cse5 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 18) 4294967296))) (or (not (< .cse5 100000000)) (< .cse5 10000000))) (let ((.cse6 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 17) 4294967296))) (or (not (< .cse6 100000000)) (< .cse6 10000000))) (let ((.cse7 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 33) 4294967296))) (or (not (< .cse7 100000000)) (< .cse7 10000000))) (let ((.cse8 (mod (+ 23 |c_ULTIMATE.start_main_~x~0#1|) 4294967296))) (or (< .cse8 10000000) (not (< .cse8 100000000)))) (let ((.cse9 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 31) 4294967296))) (or (not (< .cse9 100000000)) (< .cse9 10000000))) (let ((.cse10 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 36) 4294967296))) (or (< .cse10 10000000) (not (< .cse10 100000000)))) (let ((.cse11 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 8) 4294967296))) (or (not (< .cse11 100000000)) (< .cse11 10000000))) (let ((.cse12 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 13) 4294967296))) (or (< .cse12 10000000) (not (< .cse12 100000000)))) (let ((.cse13 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 16) 4294967296))) (or (not (< .cse13 100000000)) (< .cse13 10000000))) (let ((.cse14 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 11) 4294967296))) (or (not (< .cse14 100000000)) (< .cse14 10000000))) (let ((.cse15 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 30) 4294967296))) (or (< .cse15 10000000) (not (< .cse15 100000000)))) (let ((.cse16 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 29) 4294967296))) (or (< .cse16 10000000) (not (< .cse16 100000000)))) (let ((.cse17 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 25) 4294967296))) (or (not (< .cse17 100000000)) (< .cse17 10000000))) (let ((.cse18 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 6) 4294967296))) (or (not (< .cse18 100000000)) (< .cse18 10000000))) (let ((.cse19 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 24) 4294967296))) (or (not (< .cse19 100000000)) (< .cse19 10000000))) (let ((.cse20 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 14) 4294967296))) (or (not (< .cse20 100000000)) (< .cse20 10000000))) (let ((.cse21 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 4) 4294967296))) (or (not (< .cse21 100000000)) (< .cse21 10000000))) (let ((.cse22 (mod (+ 19 |c_ULTIMATE.start_main_~x~0#1|) 4294967296))) (or (< .cse22 10000000) (not (< .cse22 100000000)))) (let ((.cse23 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 9) 4294967296))) (or (not (< .cse23 100000000)) (< .cse23 10000000))) (let ((.cse24 (mod (+ 7 |c_ULTIMATE.start_main_~x~0#1|) 4294967296))) (or (< .cse24 10000000) (not (< .cse24 100000000)))) (let ((.cse25 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 34) 4294967296))) (or (not (< .cse25 100000000)) (< .cse25 10000000))) (let ((.cse26 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 15) 4294967296))) (or (not (< .cse26 100000000)) (< .cse26 10000000))) (let ((.cse27 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 27) 4294967296))) (or (< .cse27 10000000) (not (< .cse27 100000000)))) (let ((.cse28 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 12) 4294967296))) (or (not (< .cse28 100000000)) (< .cse28 10000000))) (let ((.cse29 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 20) 4294967296))) (or (not (< .cse29 100000000)) (< .cse29 10000000))) (let ((.cse30 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 21) 4294967296))) (or (< .cse30 10000000) (not (< .cse30 100000000)))) (let ((.cse31 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 26) 4294967296))) (or (< .cse31 10000000) (not (< .cse31 100000000)))) (let ((.cse32 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 5) 4294967296))) (or (not (< .cse32 100000000)) (< .cse32 10000000)))) is different from false [2022-11-16 12:52:04,226 WARN L233 SmtUtils]: Spent 58.93s on a formula simplification. DAG size of input: 229 DAG size of output: 19 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-11-16 12:54:16,061 WARN L233 SmtUtils]: Spent 1.57m on a formula simplification. DAG size of input: 262 DAG size of output: 17 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-11-16 12:54:18,662 WARN L833 $PredicateComparison]: unable to prove that (and (let ((.cse0 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 28) 4294967296))) (or (not (< .cse0 100000000)) (< .cse0 10000000))) (let ((.cse1 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 10) 4294967296))) (or (< .cse1 10000000) (not (< .cse1 100000000)))) (let ((.cse2 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 32) 4294967296))) (or (not (< .cse2 100000000)) (< .cse2 10000000))) (let ((.cse3 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 22) 4294967296))) (or (not (< .cse3 100000000)) (< .cse3 10000000))) (let ((.cse4 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 35) 4294967296))) (or (< .cse4 10000000) (not (< .cse4 100000000)))) (let ((.cse5 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 18) 4294967296))) (or (not (< .cse5 100000000)) (< .cse5 10000000))) (let ((.cse6 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 17) 4294967296))) (or (not (< .cse6 100000000)) (< .cse6 10000000))) (let ((.cse7 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 33) 4294967296))) (or (not (< .cse7 100000000)) (< .cse7 10000000))) (let ((.cse8 (mod (+ 23 |c_ULTIMATE.start_main_~x~0#1|) 4294967296))) (or (< .cse8 10000000) (not (< .cse8 100000000)))) (let ((.cse9 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 31) 4294967296))) (or (not (< .cse9 100000000)) (< .cse9 10000000))) (let ((.cse10 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 36) 4294967296))) (or (< .cse10 10000000) (not (< .cse10 100000000)))) (let ((.cse11 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 8) 4294967296))) (or (not (< .cse11 100000000)) (< .cse11 10000000))) (let ((.cse12 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 13) 4294967296))) (or (< .cse12 10000000) (not (< .cse12 100000000)))) (let ((.cse13 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 2) 4294967296))) (or (< .cse13 10000000) (not (< .cse13 100000000)))) (let ((.cse14 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 16) 4294967296))) (or (not (< .cse14 100000000)) (< .cse14 10000000))) (let ((.cse15 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 11) 4294967296))) (or (not (< .cse15 100000000)) (< .cse15 10000000))) (let ((.cse16 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 30) 4294967296))) (or (< .cse16 10000000) (not (< .cse16 100000000)))) (let ((.cse17 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 29) 4294967296))) (or (< .cse17 10000000) (not (< .cse17 100000000)))) (let ((.cse18 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 25) 4294967296))) (or (not (< .cse18 100000000)) (< .cse18 10000000))) (let ((.cse19 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 6) 4294967296))) (or (not (< .cse19 100000000)) (< .cse19 10000000))) (let ((.cse20 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 24) 4294967296))) (or (not (< .cse20 100000000)) (< .cse20 10000000))) (let ((.cse21 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 14) 4294967296))) (or (not (< .cse21 100000000)) (< .cse21 10000000))) (let ((.cse22 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 37) 4294967296))) (or (< .cse22 10000000) (not (< .cse22 100000000)))) (let ((.cse23 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 4) 4294967296))) (or (not (< .cse23 100000000)) (< .cse23 10000000))) (let ((.cse24 (mod (+ 19 |c_ULTIMATE.start_main_~x~0#1|) 4294967296))) (or (< .cse24 10000000) (not (< .cse24 100000000)))) (let ((.cse25 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 9) 4294967296))) (or (not (< .cse25 100000000)) (< .cse25 10000000))) (let ((.cse26 (mod (+ 7 |c_ULTIMATE.start_main_~x~0#1|) 4294967296))) (or (< .cse26 10000000) (not (< .cse26 100000000)))) (let ((.cse27 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 34) 4294967296))) (or (not (< .cse27 100000000)) (< .cse27 10000000))) (let ((.cse28 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 15) 4294967296))) (or (not (< .cse28 100000000)) (< .cse28 10000000))) (let ((.cse29 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 27) 4294967296))) (or (< .cse29 10000000) (not (< .cse29 100000000)))) (let ((.cse30 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 12) 4294967296))) (or (not (< .cse30 100000000)) (< .cse30 10000000))) (let ((.cse31 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 20) 4294967296))) (or (not (< .cse31 100000000)) (< .cse31 10000000))) (let ((.cse32 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 21) 4294967296))) (or (< .cse32 10000000) (not (< .cse32 100000000)))) (let ((.cse33 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 38) 4294967296))) (or (not (< .cse33 100000000)) (< .cse33 10000000))) (let ((.cse34 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 26) 4294967296))) (or (< .cse34 10000000) (not (< .cse34 100000000)))) (let ((.cse35 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 5) 4294967296))) (or (not (< .cse35 100000000)) (< .cse35 10000000)))) is different from false [2022-11-16 12:54:20,794 WARN L833 $PredicateComparison]: unable to prove that (and (let ((.cse0 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 28) 4294967296))) (or (not (< .cse0 100000000)) (< .cse0 10000000))) (let ((.cse1 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 10) 4294967296))) (or (< .cse1 10000000) (not (< .cse1 100000000)))) (let ((.cse2 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 32) 4294967296))) (or (not (< .cse2 100000000)) (< .cse2 10000000))) (let ((.cse3 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 22) 4294967296))) (or (not (< .cse3 100000000)) (< .cse3 10000000))) (let ((.cse4 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 18) 4294967296))) (or (not (< .cse4 100000000)) (< .cse4 10000000))) (let ((.cse5 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 17) 4294967296))) (or (not (< .cse5 100000000)) (< .cse5 10000000))) (let ((.cse6 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 33) 4294967296))) (or (not (< .cse6 100000000)) (< .cse6 10000000))) (let ((.cse7 (mod (+ 23 |c_ULTIMATE.start_main_~x~0#1|) 4294967296))) (or (< .cse7 10000000) (not (< .cse7 100000000)))) (let ((.cse8 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 31) 4294967296))) (or (not (< .cse8 100000000)) (< .cse8 10000000))) (let ((.cse9 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 8) 4294967296))) (or (not (< .cse9 100000000)) (< .cse9 10000000))) (let ((.cse10 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 13) 4294967296))) (or (< .cse10 10000000) (not (< .cse10 100000000)))) (let ((.cse11 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 2) 4294967296))) (or (< .cse11 10000000) (not (< .cse11 100000000)))) (let ((.cse12 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 16) 4294967296))) (or (not (< .cse12 100000000)) (< .cse12 10000000))) (let ((.cse13 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 11) 4294967296))) (or (not (< .cse13 100000000)) (< .cse13 10000000))) (let ((.cse14 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 30) 4294967296))) (or (< .cse14 10000000) (not (< .cse14 100000000)))) (< (mod |c_ULTIMATE.start_main_~x~0#1| 4294967296) 10000000) (let ((.cse15 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 29) 4294967296))) (or (< .cse15 10000000) (not (< .cse15 100000000)))) (let ((.cse16 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 25) 4294967296))) (or (not (< .cse16 100000000)) (< .cse16 10000000))) (let ((.cse17 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 6) 4294967296))) (or (not (< .cse17 100000000)) (< .cse17 10000000))) (let ((.cse18 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 24) 4294967296))) (or (not (< .cse18 100000000)) (< .cse18 10000000))) (let ((.cse19 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 14) 4294967296))) (or (not (< .cse19 100000000)) (< .cse19 10000000))) (let ((.cse20 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 4) 4294967296))) (or (not (< .cse20 100000000)) (< .cse20 10000000))) (let ((.cse21 (mod (+ 19 |c_ULTIMATE.start_main_~x~0#1|) 4294967296))) (or (< .cse21 10000000) (not (< .cse21 100000000)))) (let ((.cse22 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 9) 4294967296))) (or (not (< .cse22 100000000)) (< .cse22 10000000))) (let ((.cse23 (mod (+ 7 |c_ULTIMATE.start_main_~x~0#1|) 4294967296))) (or (< .cse23 10000000) (not (< .cse23 100000000)))) (let ((.cse24 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 34) 4294967296))) (or (not (< .cse24 100000000)) (< .cse24 10000000))) (let ((.cse25 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 15) 4294967296))) (or (not (< .cse25 100000000)) (< .cse25 10000000))) (let ((.cse26 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 27) 4294967296))) (or (< .cse26 10000000) (not (< .cse26 100000000)))) (let ((.cse27 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 12) 4294967296))) (or (not (< .cse27 100000000)) (< .cse27 10000000))) (let ((.cse28 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 20) 4294967296))) (or (not (< .cse28 100000000)) (< .cse28 10000000))) (let ((.cse29 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 21) 4294967296))) (or (< .cse29 10000000) (not (< .cse29 100000000)))) (let ((.cse30 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 26) 4294967296))) (or (< .cse30 10000000) (not (< .cse30 100000000)))) (let ((.cse31 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 5) 4294967296))) (or (not (< .cse31 100000000)) (< .cse31 10000000)))) is different from false [2022-11-16 12:55:42,525 WARN L233 SmtUtils]: Spent 46.78s on a formula simplification. DAG size of input: 215 DAG size of output: 19 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-11-16 12:56:35,460 WARN L233 SmtUtils]: Spent 10.42s on a formula simplification. DAG size of input: 217 DAG size of output: 10 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-11-16 12:57:26,979 WARN L233 SmtUtils]: Spent 14.38s on a formula simplification. DAG size of input: 210 DAG size of output: 10 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-11-16 12:57:29,028 WARN L833 $PredicateComparison]: unable to prove that (and (let ((.cse0 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 28) 4294967296))) (or (not (< .cse0 100000000)) (< .cse0 10000000))) (let ((.cse1 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 10) 4294967296))) (or (< .cse1 10000000) (not (< .cse1 100000000)))) (let ((.cse2 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 22) 4294967296))) (or (not (< .cse2 100000000)) (< .cse2 10000000))) (let ((.cse3 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 18) 4294967296))) (or (not (< .cse3 100000000)) (< .cse3 10000000))) (let ((.cse4 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 17) 4294967296))) (or (not (< .cse4 100000000)) (< .cse4 10000000))) (let ((.cse5 (mod (+ 23 |c_ULTIMATE.start_main_~x~0#1|) 4294967296))) (or (< .cse5 10000000) (not (< .cse5 100000000)))) (let ((.cse6 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 8) 4294967296))) (or (not (< .cse6 100000000)) (< .cse6 10000000))) (let ((.cse7 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 13) 4294967296))) (or (< .cse7 10000000) (not (< .cse7 100000000)))) (let ((.cse8 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 2) 4294967296))) (or (< .cse8 10000000) (not (< .cse8 100000000)))) (let ((.cse9 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 16) 4294967296))) (or (not (< .cse9 100000000)) (< .cse9 10000000))) (let ((.cse10 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 11) 4294967296))) (or (not (< .cse10 100000000)) (< .cse10 10000000))) (let ((.cse11 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 30) 4294967296))) (or (< .cse11 10000000) (not (< .cse11 100000000)))) (< (mod |c_ULTIMATE.start_main_~x~0#1| 4294967296) 10000000) (let ((.cse12 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 29) 4294967296))) (or (< .cse12 10000000) (not (< .cse12 100000000)))) (let ((.cse13 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 25) 4294967296))) (or (not (< .cse13 100000000)) (< .cse13 10000000))) (let ((.cse14 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 6) 4294967296))) (or (not (< .cse14 100000000)) (< .cse14 10000000))) (let ((.cse15 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 24) 4294967296))) (or (not (< .cse15 100000000)) (< .cse15 10000000))) (let ((.cse16 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 14) 4294967296))) (or (not (< .cse16 100000000)) (< .cse16 10000000))) (let ((.cse17 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 4) 4294967296))) (or (not (< .cse17 100000000)) (< .cse17 10000000))) (let ((.cse18 (mod (+ 19 |c_ULTIMATE.start_main_~x~0#1|) 4294967296))) (or (< .cse18 10000000) (not (< .cse18 100000000)))) (let ((.cse19 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 9) 4294967296))) (or (not (< .cse19 100000000)) (< .cse19 10000000))) (let ((.cse20 (mod (+ 7 |c_ULTIMATE.start_main_~x~0#1|) 4294967296))) (or (< .cse20 10000000) (not (< .cse20 100000000)))) (let ((.cse21 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 15) 4294967296))) (or (not (< .cse21 100000000)) (< .cse21 10000000))) (let ((.cse22 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 27) 4294967296))) (or (< .cse22 10000000) (not (< .cse22 100000000)))) (let ((.cse23 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 12) 4294967296))) (or (not (< .cse23 100000000)) (< .cse23 10000000))) (let ((.cse24 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 20) 4294967296))) (or (not (< .cse24 100000000)) (< .cse24 10000000))) (let ((.cse25 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 21) 4294967296))) (or (< .cse25 10000000) (not (< .cse25 100000000)))) (let ((.cse26 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 26) 4294967296))) (or (< .cse26 10000000) (not (< .cse26 100000000)))) (let ((.cse27 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 5) 4294967296))) (or (not (< .cse27 100000000)) (< .cse27 10000000)))) is different from false [2022-11-16 12:58:35,449 WARN L233 SmtUtils]: Spent 13.04s on a formula simplification. DAG size of input: 187 DAG size of output: 19 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-11-16 12:59:18,711 WARN L233 SmtUtils]: Spent 10.91s on a formula simplification. DAG size of input: 189 DAG size of output: 10 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-11-16 12:59:20,738 WARN L833 $PredicateComparison]: unable to prove that (and (let ((.cse0 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 10) 4294967296))) (or (< .cse0 10000000) (not (< .cse0 100000000)))) (let ((.cse1 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 22) 4294967296))) (or (not (< .cse1 100000000)) (< .cse1 10000000))) (let ((.cse2 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 18) 4294967296))) (or (not (< .cse2 100000000)) (< .cse2 10000000))) (let ((.cse3 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 17) 4294967296))) (or (not (< .cse3 100000000)) (< .cse3 10000000))) (let ((.cse4 (mod (+ 23 |c_ULTIMATE.start_main_~x~0#1|) 4294967296))) (or (< .cse4 10000000) (not (< .cse4 100000000)))) (let ((.cse5 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 8) 4294967296))) (or (not (< .cse5 100000000)) (< .cse5 10000000))) (let ((.cse6 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 13) 4294967296))) (or (< .cse6 10000000) (not (< .cse6 100000000)))) (let ((.cse7 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 2) 4294967296))) (or (< .cse7 10000000) (not (< .cse7 100000000)))) (let ((.cse8 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 16) 4294967296))) (or (not (< .cse8 100000000)) (< .cse8 10000000))) (let ((.cse9 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 11) 4294967296))) (or (not (< .cse9 100000000)) (< .cse9 10000000))) (< (mod |c_ULTIMATE.start_main_~x~0#1| 4294967296) 10000000) (let ((.cse10 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 25) 4294967296))) (or (not (< .cse10 100000000)) (< .cse10 10000000))) (let ((.cse11 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 6) 4294967296))) (or (not (< .cse11 100000000)) (< .cse11 10000000))) (let ((.cse12 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 24) 4294967296))) (or (not (< .cse12 100000000)) (< .cse12 10000000))) (let ((.cse13 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 14) 4294967296))) (or (not (< .cse13 100000000)) (< .cse13 10000000))) (let ((.cse14 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 4) 4294967296))) (or (not (< .cse14 100000000)) (< .cse14 10000000))) (let ((.cse15 (mod (+ 19 |c_ULTIMATE.start_main_~x~0#1|) 4294967296))) (or (< .cse15 10000000) (not (< .cse15 100000000)))) (let ((.cse16 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 9) 4294967296))) (or (not (< .cse16 100000000)) (< .cse16 10000000))) (let ((.cse17 (mod (+ 7 |c_ULTIMATE.start_main_~x~0#1|) 4294967296))) (or (< .cse17 10000000) (not (< .cse17 100000000)))) (let ((.cse18 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 15) 4294967296))) (or (not (< .cse18 100000000)) (< .cse18 10000000))) (let ((.cse19 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 27) 4294967296))) (or (< .cse19 10000000) (not (< .cse19 100000000)))) (let ((.cse20 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 12) 4294967296))) (or (not (< .cse20 100000000)) (< .cse20 10000000))) (let ((.cse21 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 20) 4294967296))) (or (not (< .cse21 100000000)) (< .cse21 10000000))) (let ((.cse22 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 21) 4294967296))) (or (< .cse22 10000000) (not (< .cse22 100000000)))) (let ((.cse23 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 26) 4294967296))) (or (< .cse23 10000000) (not (< .cse23 100000000)))) (let ((.cse24 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 5) 4294967296))) (or (not (< .cse24 100000000)) (< .cse24 10000000)))) is different from false [2022-11-16 13:00:12,091 WARN L233 SmtUtils]: Spent 7.16s on a formula simplification. DAG size of input: 166 DAG size of output: 19 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-11-16 13:00:51,014 WARN L233 SmtUtils]: Spent 10.55s on a formula simplification. DAG size of input: 168 DAG size of output: 10 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-11-16 13:01:28,227 WARN L233 SmtUtils]: Spent 5.27s on a formula simplification. DAG size of input: 161 DAG size of output: 10 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate)