./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/loops-crafted-1/Mono1_1-2.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version b5237d83 Calling Ultimate with: /usr/lib/jvm/java-11-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7cc82ec6-a64e-4752-950a-815f937b691d/bin/uautomizer-vX5HgA9Q3a/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7cc82ec6-a64e-4752-950a-815f937b691d/bin/uautomizer-vX5HgA9Q3a/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7cc82ec6-a64e-4752-950a-815f937b691d/bin/uautomizer-vX5HgA9Q3a/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7cc82ec6-a64e-4752-950a-815f937b691d/bin/uautomizer-vX5HgA9Q3a/config/AutomizerReach.xml -i ../../sv-benchmarks/c/loops-crafted-1/Mono1_1-2.c -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7cc82ec6-a64e-4752-950a-815f937b691d/bin/uautomizer-vX5HgA9Q3a/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7cc82ec6-a64e-4752-950a-815f937b691d/bin/uautomizer-vX5HgA9Q3a --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 87992b509300f030a5da432e9377be19bc7547f7933c7234d13c36c34b6235c7 --- 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-b5237d8 [2022-11-21 16:11:38,466 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-11-21 16:11:38,468 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-11-21 16:11:38,493 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-11-21 16:11:38,494 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-11-21 16:11:38,495 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-11-21 16:11:38,496 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-11-21 16:11:38,497 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-11-21 16:11:38,499 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-11-21 16:11:38,500 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-11-21 16:11:38,501 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-11-21 16:11:38,502 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-11-21 16:11:38,502 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-11-21 16:11:38,503 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-11-21 16:11:38,504 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-11-21 16:11:38,506 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-11-21 16:11:38,506 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-11-21 16:11:38,507 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-11-21 16:11:38,509 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-11-21 16:11:38,511 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-11-21 16:11:38,512 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-11-21 16:11:38,514 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-11-21 16:11:38,515 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-11-21 16:11:38,516 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-11-21 16:11:38,519 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-11-21 16:11:38,520 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-11-21 16:11:38,520 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-11-21 16:11:38,521 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-11-21 16:11:38,521 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-11-21 16:11:38,522 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-11-21 16:11:38,523 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-11-21 16:11:38,524 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-11-21 16:11:38,524 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-11-21 16:11:38,525 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-11-21 16:11:38,526 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-11-21 16:11:38,526 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-11-21 16:11:38,533 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-11-21 16:11:38,534 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-11-21 16:11:38,535 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-11-21 16:11:38,538 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-11-21 16:11:38,539 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-11-21 16:11:38,541 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7cc82ec6-a64e-4752-950a-815f937b691d/bin/uautomizer-vX5HgA9Q3a/config/svcomp-Reach-32bit-Automizer_Default.epf [2022-11-21 16:11:38,582 INFO L113 SettingsManager]: Loading preferences was successful [2022-11-21 16:11:38,582 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-11-21 16:11:38,583 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-11-21 16:11:38,583 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-11-21 16:11:38,584 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-11-21 16:11:38,584 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-11-21 16:11:38,585 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-11-21 16:11:38,585 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-11-21 16:11:38,585 INFO L138 SettingsManager]: * Use SBE=true [2022-11-21 16:11:38,585 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-11-21 16:11:38,586 INFO L138 SettingsManager]: * sizeof long=4 [2022-11-21 16:11:38,587 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-11-21 16:11:38,587 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-11-21 16:11:38,587 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-11-21 16:11:38,587 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-11-21 16:11:38,588 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-11-21 16:11:38,588 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-11-21 16:11:38,588 INFO L138 SettingsManager]: * sizeof long double=12 [2022-11-21 16:11:38,588 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-11-21 16:11:38,589 INFO L138 SettingsManager]: * Use constant arrays=true [2022-11-21 16:11:38,589 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-11-21 16:11:38,589 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-11-21 16:11:38,589 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-11-21 16:11:38,590 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-11-21 16:11:38,590 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-11-21 16:11:38,590 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-11-21 16:11:38,590 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-11-21 16:11:38,591 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-11-21 16:11:38,591 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-11-21 16:11:38,591 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-11-21 16:11:38,591 INFO L138 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2022-11-21 16:11:38,591 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-11-21 16:11:38,592 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-11-21 16:11:38,592 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_7cc82ec6-a64e-4752-950a-815f937b691d/bin/uautomizer-vX5HgA9Q3a/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_7cc82ec6-a64e-4752-950a-815f937b691d/bin/uautomizer-vX5HgA9Q3a 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 -> 87992b509300f030a5da432e9377be19bc7547f7933c7234d13c36c34b6235c7 [2022-11-21 16:11:38,902 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-11-21 16:11:38,938 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-11-21 16:11:38,940 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-11-21 16:11:38,943 INFO L271 PluginConnector]: Initializing CDTParser... [2022-11-21 16:11:38,944 INFO L275 PluginConnector]: CDTParser initialized [2022-11-21 16:11:38,945 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7cc82ec6-a64e-4752-950a-815f937b691d/bin/uautomizer-vX5HgA9Q3a/../../sv-benchmarks/c/loops-crafted-1/Mono1_1-2.c [2022-11-21 16:11:42,059 INFO L500 CDTParser]: Created temporary CDT project at NULL [2022-11-21 16:11:42,331 INFO L351 CDTParser]: Found 1 translation units. [2022-11-21 16:11:42,331 INFO L172 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7cc82ec6-a64e-4752-950a-815f937b691d/sv-benchmarks/c/loops-crafted-1/Mono1_1-2.c [2022-11-21 16:11:42,337 INFO L394 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7cc82ec6-a64e-4752-950a-815f937b691d/bin/uautomizer-vX5HgA9Q3a/data/2acf6285b/9c79454527fb4024960ac1bb788d22cd/FLAG637b83269 [2022-11-21 16:11:42,352 INFO L402 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7cc82ec6-a64e-4752-950a-815f937b691d/bin/uautomizer-vX5HgA9Q3a/data/2acf6285b/9c79454527fb4024960ac1bb788d22cd [2022-11-21 16:11:42,355 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-11-21 16:11:42,356 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-11-21 16:11:42,358 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-11-21 16:11:42,358 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-11-21 16:11:42,362 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-11-21 16:11:42,362 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 21.11 04:11:42" (1/1) ... [2022-11-21 16:11:42,363 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@1356608a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 04:11:42, skipping insertion in model container [2022-11-21 16:11:42,364 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 21.11 04:11:42" (1/1) ... [2022-11-21 16:11:42,371 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-11-21 16:11:42,383 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-11-21 16:11:42,532 WARN L237 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7cc82ec6-a64e-4752-950a-815f937b691d/sv-benchmarks/c/loops-crafted-1/Mono1_1-2.c[313,326] [2022-11-21 16:11:42,544 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-11-21 16:11:42,554 INFO L203 MainTranslator]: Completed pre-run [2022-11-21 16:11:42,566 WARN L237 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7cc82ec6-a64e-4752-950a-815f937b691d/sv-benchmarks/c/loops-crafted-1/Mono1_1-2.c[313,326] [2022-11-21 16:11:42,568 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-11-21 16:11:42,581 INFO L208 MainTranslator]: Completed translation [2022-11-21 16:11:42,582 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 04:11:42 WrapperNode [2022-11-21 16:11:42,582 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-11-21 16:11:42,583 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-11-21 16:11:42,583 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-11-21 16:11:42,583 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-11-21 16:11:42,591 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 04:11:42" (1/1) ... [2022-11-21 16:11:42,598 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 04:11:42" (1/1) ... [2022-11-21 16:11:42,615 INFO L138 Inliner]: procedures = 12, calls = 8, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 26 [2022-11-21 16:11:42,615 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-11-21 16:11:42,616 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-11-21 16:11:42,616 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-11-21 16:11:42,616 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-11-21 16:11:42,625 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 04:11:42" (1/1) ... [2022-11-21 16:11:42,625 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 04:11:42" (1/1) ... [2022-11-21 16:11:42,627 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 04:11:42" (1/1) ... [2022-11-21 16:11:42,627 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 04:11:42" (1/1) ... [2022-11-21 16:11:42,631 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 04:11:42" (1/1) ... [2022-11-21 16:11:42,636 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 04:11:42" (1/1) ... [2022-11-21 16:11:42,643 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 04:11:42" (1/1) ... [2022-11-21 16:11:42,646 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 04:11:42" (1/1) ... [2022-11-21 16:11:42,647 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-11-21 16:11:42,647 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-11-21 16:11:42,647 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-11-21 16:11:42,648 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-11-21 16:11:42,649 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 04:11:42" (1/1) ... [2022-11-21 16:11:42,655 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-11-21 16:11:42,669 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7cc82ec6-a64e-4752-950a-815f937b691d/bin/uautomizer-vX5HgA9Q3a/z3 [2022-11-21 16:11:42,689 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7cc82ec6-a64e-4752-950a-815f937b691d/bin/uautomizer-vX5HgA9Q3a/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-11-21 16:11:42,704 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7cc82ec6-a64e-4752-950a-815f937b691d/bin/uautomizer-vX5HgA9Q3a/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-11-21 16:11:42,744 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-11-21 16:11:42,744 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-11-21 16:11:42,744 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-11-21 16:11:42,745 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-11-21 16:11:42,814 INFO L235 CfgBuilder]: Building ICFG [2022-11-21 16:11:42,816 INFO L261 CfgBuilder]: Building CFG for each procedure with an implementation [2022-11-21 16:11:42,977 INFO L276 CfgBuilder]: Performing block encoding [2022-11-21 16:11:42,988 INFO L295 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-11-21 16:11:42,988 INFO L300 CfgBuilder]: Removed 1 assume(true) statements. [2022-11-21 16:11:42,991 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 21.11 04:11:42 BoogieIcfgContainer [2022-11-21 16:11:42,999 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-11-21 16:11:43,003 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-11-21 16:11:43,003 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-11-21 16:11:43,010 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-11-21 16:11:43,012 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 21.11 04:11:42" (1/3) ... [2022-11-21 16:11:43,013 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6534cd66 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 21.11 04:11:43, skipping insertion in model container [2022-11-21 16:11:43,014 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 04:11:42" (2/3) ... [2022-11-21 16:11:43,015 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6534cd66 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 21.11 04:11:43, skipping insertion in model container [2022-11-21 16:11:43,016 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 21.11 04:11:42" (3/3) ... [2022-11-21 16:11:43,018 INFO L112 eAbstractionObserver]: Analyzing ICFG Mono1_1-2.c [2022-11-21 16:11:43,041 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-11-21 16:11:43,041 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-11-21 16:11:43,097 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-11-21 16:11:43,104 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;@10d8a537, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2022-11-21 16:11:43,104 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-11-21 16:11:43,109 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-21 16:11:43,115 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2022-11-21 16:11:43,115 INFO L187 NwaCegarLoop]: Found error trace [2022-11-21 16:11:43,116 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2022-11-21 16:11:43,117 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-21 16:11:43,122 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-21 16:11:43,123 INFO L85 PathProgramCache]: Analyzing trace with hash 889937703, now seen corresponding path program 1 times [2022-11-21 16:11:43,131 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-21 16:11:43,131 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1620548522] [2022-11-21 16:11:43,131 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-21 16:11:43,132 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-21 16:11:43,238 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 16:11:43,302 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-21 16:11:43,302 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-21 16:11:43,303 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1620548522] [2022-11-21 16:11:43,304 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1620548522] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-21 16:11:43,304 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-21 16:11:43,304 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-11-21 16:11:43,306 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [750223481] [2022-11-21 16:11:43,306 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-21 16:11:43,311 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2022-11-21 16:11:43,311 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-21 16:11:43,340 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2022-11-21 16:11:43,341 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2022-11-21 16:11:43,343 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-21 16:11:43,357 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-21 16:11:43,357 INFO L93 Difference]: Finished difference Result 20 states and 23 transitions. [2022-11-21 16:11:43,358 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-11-21 16:11:43,360 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-21 16:11:43,360 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-21 16:11:43,368 INFO L225 Difference]: With dead ends: 20 [2022-11-21 16:11:43,368 INFO L226 Difference]: Without dead ends: 8 [2022-11-21 16:11:43,371 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-21 16:11:43,374 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-21 16:11:43,376 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-21 16:11:43,394 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8 states. [2022-11-21 16:11:43,403 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8 to 8. [2022-11-21 16:11:43,404 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-21 16:11:43,405 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 9 transitions. [2022-11-21 16:11:43,406 INFO L78 Accepts]: Start accepts. Automaton has 8 states and 9 transitions. Word has length 6 [2022-11-21 16:11:43,407 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-21 16:11:43,407 INFO L495 AbstractCegarLoop]: Abstraction has 8 states and 9 transitions. [2022-11-21 16:11:43,407 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-21 16:11:43,407 INFO L276 IsEmpty]: Start isEmpty. Operand 8 states and 9 transitions. [2022-11-21 16:11:43,408 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2022-11-21 16:11:43,408 INFO L187 NwaCegarLoop]: Found error trace [2022-11-21 16:11:43,408 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2022-11-21 16:11:43,408 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-11-21 16:11:43,409 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-21 16:11:43,409 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-21 16:11:43,410 INFO L85 PathProgramCache]: Analyzing trace with hash 889639793, now seen corresponding path program 1 times [2022-11-21 16:11:43,410 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-21 16:11:43,410 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [186318078] [2022-11-21 16:11:43,411 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-21 16:11:43,411 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-21 16:11:43,431 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 16:11:43,563 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-21 16:11:43,563 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-21 16:11:43,563 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [186318078] [2022-11-21 16:11:43,564 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [186318078] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-21 16:11:43,564 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-21 16:11:43,564 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-21 16:11:43,564 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [428001733] [2022-11-21 16:11:43,565 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-21 16:11:43,566 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-21 16:11:43,566 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-21 16:11:43,567 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-21 16:11:43,567 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-21 16:11:43,567 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-21 16:11:43,607 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-21 16:11:43,607 INFO L93 Difference]: Finished difference Result 16 states and 20 transitions. [2022-11-21 16:11:43,608 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-21 16:11:43,608 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-21 16:11:43,608 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-21 16:11:43,609 INFO L225 Difference]: With dead ends: 16 [2022-11-21 16:11:43,609 INFO L226 Difference]: Without dead ends: 10 [2022-11-21 16:11:43,609 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-21 16:11:43,611 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-21 16:11:43,611 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-21 16:11:43,612 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10 states. [2022-11-21 16:11:43,614 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10 to 10. [2022-11-21 16:11:43,614 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-21 16:11:43,615 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 11 transitions. [2022-11-21 16:11:43,615 INFO L78 Accepts]: Start accepts. Automaton has 10 states and 11 transitions. Word has length 6 [2022-11-21 16:11:43,615 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-21 16:11:43,615 INFO L495 AbstractCegarLoop]: Abstraction has 10 states and 11 transitions. [2022-11-21 16:11:43,616 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-21 16:11:43,616 INFO L276 IsEmpty]: Start isEmpty. Operand 10 states and 11 transitions. [2022-11-21 16:11:43,616 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2022-11-21 16:11:43,616 INFO L187 NwaCegarLoop]: Found error trace [2022-11-21 16:11:43,616 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2022-11-21 16:11:43,617 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-11-21 16:11:43,617 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-21 16:11:43,617 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-21 16:11:43,618 INFO L85 PathProgramCache]: Analyzing trace with hash 295691924, now seen corresponding path program 1 times [2022-11-21 16:11:43,618 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-21 16:11:43,618 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1969096413] [2022-11-21 16:11:43,618 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-21 16:11:43,619 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-21 16:11:43,642 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 16:11:43,863 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-21 16:11:43,863 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-21 16:11:43,864 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1969096413] [2022-11-21 16:11:43,864 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1969096413] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-21 16:11:43,864 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1214976279] [2022-11-21 16:11:43,864 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-21 16:11:43,865 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-21 16:11:43,865 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7cc82ec6-a64e-4752-950a-815f937b691d/bin/uautomizer-vX5HgA9Q3a/z3 [2022-11-21 16:11:43,869 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7cc82ec6-a64e-4752-950a-815f937b691d/bin/uautomizer-vX5HgA9Q3a/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-21 16:11:43,871 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7cc82ec6-a64e-4752-950a-815f937b691d/bin/uautomizer-vX5HgA9Q3a/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2022-11-21 16:11:43,931 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 16:11:43,960 INFO L263 TraceCheckSpWp]: Trace formula consists of 39 conjuncts, 5 conjunts are in the unsatisfiable core [2022-11-21 16:11:43,966 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-21 16:11:44,033 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-21 16:11:44,035 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-21 16:11:44,095 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-21 16:11:44,096 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1214976279] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-21 16:11:44,096 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-21 16:11:44,096 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 7 [2022-11-21 16:11:44,097 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [196766897] [2022-11-21 16:11:44,097 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-21 16:11:44,097 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-11-21 16:11:44,098 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-21 16:11:44,098 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-11-21 16:11:44,099 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=23, Unknown=0, NotChecked=0, Total=42 [2022-11-21 16:11:44,099 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-21 16:11:44,166 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-21 16:11:44,167 INFO L93 Difference]: Finished difference Result 20 states and 26 transitions. [2022-11-21 16:11:44,167 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-11-21 16:11:44,168 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-21 16:11:44,168 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-21 16:11:44,168 INFO L225 Difference]: With dead ends: 20 [2022-11-21 16:11:44,169 INFO L226 Difference]: Without dead ends: 14 [2022-11-21 16:11:44,169 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 14 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=26, Invalid=30, Unknown=0, NotChecked=0, Total=56 [2022-11-21 16:11:44,171 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-21 16:11:44,171 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-21 16:11:44,173 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14 states. [2022-11-21 16:11:44,178 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14 to 13. [2022-11-21 16:11:44,178 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-21 16:11:44,179 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 14 transitions. [2022-11-21 16:11:44,179 INFO L78 Accepts]: Start accepts. Automaton has 13 states and 14 transitions. Word has length 8 [2022-11-21 16:11:44,179 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-21 16:11:44,179 INFO L495 AbstractCegarLoop]: Abstraction has 13 states and 14 transitions. [2022-11-21 16:11:44,180 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-21 16:11:44,180 INFO L276 IsEmpty]: Start isEmpty. Operand 13 states and 14 transitions. [2022-11-21 16:11:44,180 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2022-11-21 16:11:44,180 INFO L187 NwaCegarLoop]: Found error trace [2022-11-21 16:11:44,181 INFO L195 NwaCegarLoop]: trace histogram [3, 2, 1, 1, 1, 1, 1, 1, 1] [2022-11-21 16:11:44,191 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7cc82ec6-a64e-4752-950a-815f937b691d/bin/uautomizer-vX5HgA9Q3a/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2022-11-21 16:11:44,386 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2,2 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7cc82ec6-a64e-4752-950a-815f937b691d/bin/uautomizer-vX5HgA9Q3a/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-21 16:11:44,387 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-21 16:11:44,387 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-21 16:11:44,388 INFO L85 PathProgramCache]: Analyzing trace with hash 572634524, now seen corresponding path program 1 times [2022-11-21 16:11:44,388 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-21 16:11:44,388 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1147029489] [2022-11-21 16:11:44,388 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-21 16:11:44,388 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-21 16:11:44,406 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 16:11:44,633 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-21 16:11:44,633 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-21 16:11:44,633 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1147029489] [2022-11-21 16:11:44,634 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1147029489] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-21 16:11:44,634 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1190235158] [2022-11-21 16:11:44,634 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-21 16:11:44,634 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-21 16:11:44,635 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7cc82ec6-a64e-4752-950a-815f937b691d/bin/uautomizer-vX5HgA9Q3a/z3 [2022-11-21 16:11:44,651 INFO L229 MonitoredProcess]: Starting monitored process 3 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7cc82ec6-a64e-4752-950a-815f937b691d/bin/uautomizer-vX5HgA9Q3a/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-21 16:11:44,665 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7cc82ec6-a64e-4752-950a-815f937b691d/bin/uautomizer-vX5HgA9Q3a/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2022-11-21 16:11:44,726 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 16:11:44,740 INFO L263 TraceCheckSpWp]: Trace formula consists of 47 conjuncts, 8 conjunts are in the unsatisfiable core [2022-11-21 16:11:44,741 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-21 16:11:44,823 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-21 16:11:44,823 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-21 16:11:44,931 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-21 16:11:44,932 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1190235158] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-21 16:11:44,932 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-21 16:11:44,932 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 6] total 10 [2022-11-21 16:11:44,933 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1257030451] [2022-11-21 16:11:44,933 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-21 16:11:44,933 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-11-21 16:11:44,934 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-21 16:11:44,934 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-11-21 16:11:44,935 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=37, Invalid=53, Unknown=0, NotChecked=0, Total=90 [2022-11-21 16:11:44,935 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-21 16:11:45,178 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-21 16:11:45,179 INFO L93 Difference]: Finished difference Result 28 states and 34 transitions. [2022-11-21 16:11:45,182 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-11-21 16:11:45,182 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-21 16:11:45,182 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-21 16:11:45,183 INFO L225 Difference]: With dead ends: 28 [2022-11-21 16:11:45,183 INFO L226 Difference]: Without dead ends: 21 [2022-11-21 16:11:45,183 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-21 16:11:45,184 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-21 16:11:45,185 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-21 16:11:45,186 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21 states. [2022-11-21 16:11:45,193 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21 to 21. [2022-11-21 16:11:45,197 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-21 16:11:45,198 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 22 transitions. [2022-11-21 16:11:45,198 INFO L78 Accepts]: Start accepts. Automaton has 21 states and 22 transitions. Word has length 12 [2022-11-21 16:11:45,198 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-21 16:11:45,199 INFO L495 AbstractCegarLoop]: Abstraction has 21 states and 22 transitions. [2022-11-21 16:11:45,199 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-21 16:11:45,200 INFO L276 IsEmpty]: Start isEmpty. Operand 21 states and 22 transitions. [2022-11-21 16:11:45,200 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2022-11-21 16:11:45,201 INFO L187 NwaCegarLoop]: Found error trace [2022-11-21 16:11:45,201 INFO L195 NwaCegarLoop]: trace histogram [7, 6, 1, 1, 1, 1, 1, 1, 1] [2022-11-21 16:11:45,215 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7cc82ec6-a64e-4752-950a-815f937b691d/bin/uautomizer-vX5HgA9Q3a/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2022-11-21 16:11:45,411 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3,3 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7cc82ec6-a64e-4752-950a-815f937b691d/bin/uautomizer-vX5HgA9Q3a/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-21 16:11:45,412 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-21 16:11:45,412 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-21 16:11:45,413 INFO L85 PathProgramCache]: Analyzing trace with hash 1634475176, now seen corresponding path program 2 times [2022-11-21 16:11:45,413 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-21 16:11:45,413 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1556389083] [2022-11-21 16:11:45,413 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-21 16:11:45,416 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-21 16:11:45,442 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 16:11:45,737 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-21 16:11:45,738 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-21 16:11:45,738 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1556389083] [2022-11-21 16:11:45,738 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1556389083] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-21 16:11:45,738 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [702435335] [2022-11-21 16:11:45,738 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-11-21 16:11:45,739 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-21 16:11:45,739 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7cc82ec6-a64e-4752-950a-815f937b691d/bin/uautomizer-vX5HgA9Q3a/z3 [2022-11-21 16:11:45,740 INFO L229 MonitoredProcess]: Starting monitored process 4 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7cc82ec6-a64e-4752-950a-815f937b691d/bin/uautomizer-vX5HgA9Q3a/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-21 16:11:45,746 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7cc82ec6-a64e-4752-950a-815f937b691d/bin/uautomizer-vX5HgA9Q3a/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2022-11-21 16:11:45,790 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-11-21 16:11:45,791 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-21 16:11:45,792 INFO L263 TraceCheckSpWp]: Trace formula consists of 63 conjuncts, 16 conjunts are in the unsatisfiable core [2022-11-21 16:11:45,794 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-21 16:11:45,900 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-21 16:11:45,901 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-21 16:11:46,218 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-21 16:11:46,219 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [702435335] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-21 16:11:46,219 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-21 16:11:46,219 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 10] total 18 [2022-11-21 16:11:46,220 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2052626665] [2022-11-21 16:11:46,220 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-21 16:11:46,220 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2022-11-21 16:11:46,220 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-21 16:11:46,221 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2022-11-21 16:11:46,222 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=105, Invalid=201, Unknown=0, NotChecked=0, Total=306 [2022-11-21 16:11:46,222 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-21 16:11:48,189 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-21 16:11:48,190 INFO L93 Difference]: Finished difference Result 44 states and 54 transitions. [2022-11-21 16:11:48,195 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2022-11-21 16:11:48,196 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-21 16:11:48,196 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-21 16:11:48,196 INFO L225 Difference]: With dead ends: 44 [2022-11-21 16:11:48,196 INFO L226 Difference]: Without dead ends: 37 [2022-11-21 16:11:48,197 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-21 16:11:48,198 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-21 16:11:48,199 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-21 16:11:48,199 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 37 states. [2022-11-21 16:11:48,212 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 37 to 37. [2022-11-21 16:11:48,213 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-21 16:11:48,214 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37 states to 37 states and 38 transitions. [2022-11-21 16:11:48,215 INFO L78 Accepts]: Start accepts. Automaton has 37 states and 38 transitions. Word has length 20 [2022-11-21 16:11:48,215 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-21 16:11:48,216 INFO L495 AbstractCegarLoop]: Abstraction has 37 states and 38 transitions. [2022-11-21 16:11:48,216 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-21 16:11:48,216 INFO L276 IsEmpty]: Start isEmpty. Operand 37 states and 38 transitions. [2022-11-21 16:11:48,218 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2022-11-21 16:11:48,219 INFO L187 NwaCegarLoop]: Found error trace [2022-11-21 16:11:48,219 INFO L195 NwaCegarLoop]: trace histogram [15, 14, 1, 1, 1, 1, 1, 1, 1] [2022-11-21 16:11:48,231 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7cc82ec6-a64e-4752-950a-815f937b691d/bin/uautomizer-vX5HgA9Q3a/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2022-11-21 16:11:48,424 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,4 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7cc82ec6-a64e-4752-950a-815f937b691d/bin/uautomizer-vX5HgA9Q3a/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-21 16:11:48,424 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-21 16:11:48,425 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-21 16:11:48,425 INFO L85 PathProgramCache]: Analyzing trace with hash -1104705856, now seen corresponding path program 3 times [2022-11-21 16:11:48,425 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-21 16:11:48,425 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1307647569] [2022-11-21 16:11:48,425 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-21 16:11:48,426 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-21 16:11:48,450 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 16:11:48,913 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-21 16:11:48,913 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-21 16:11:48,913 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1307647569] [2022-11-21 16:11:48,913 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1307647569] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-21 16:11:48,914 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1591455361] [2022-11-21 16:11:48,914 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-11-21 16:11:48,914 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-21 16:11:48,914 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7cc82ec6-a64e-4752-950a-815f937b691d/bin/uautomizer-vX5HgA9Q3a/z3 [2022-11-21 16:11:48,915 INFO L229 MonitoredProcess]: Starting monitored process 5 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7cc82ec6-a64e-4752-950a-815f937b691d/bin/uautomizer-vX5HgA9Q3a/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-21 16:11:48,939 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7cc82ec6-a64e-4752-950a-815f937b691d/bin/uautomizer-vX5HgA9Q3a/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2022-11-21 16:11:48,962 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2022-11-21 16:11:48,963 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-21 16:11:48,964 INFO L263 TraceCheckSpWp]: Trace formula consists of 47 conjuncts, 12 conjunts are in the unsatisfiable core [2022-11-21 16:11:48,965 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-21 16:11:49,039 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-21 16:11:49,039 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-21 16:11:49,255 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-21 16:11:49,255 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1591455361] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-21 16:11:49,255 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-21 16:11:49,255 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 4, 6] total 23 [2022-11-21 16:11:49,256 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1899382371] [2022-11-21 16:11:49,256 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-21 16:11:49,257 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 23 states [2022-11-21 16:11:49,258 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-21 16:11:49,258 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2022-11-21 16:11:49,260 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=116, Invalid=390, Unknown=0, NotChecked=0, Total=506 [2022-11-21 16:11:49,260 INFO L87 Difference]: Start difference. First operand 37 states and 38 transitions. Second operand has 23 states, 23 states have (on average 2.130434782608696) internal successors, (49), 23 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-21 16:11:49,861 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-21 16:11:49,861 INFO L93 Difference]: Finished difference Result 56 states and 66 transitions. [2022-11-21 16:11:49,862 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2022-11-21 16:11:49,862 INFO L78 Accepts]: Start accepts. Automaton has has 23 states, 23 states have (on average 2.130434782608696) internal successors, (49), 23 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-21 16:11:49,863 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-21 16:11:49,863 INFO L225 Difference]: With dead ends: 56 [2022-11-21 16:11:49,863 INFO L226 Difference]: Without dead ends: 47 [2022-11-21 16:11:49,864 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 93 GetRequests, 67 SyntacticMatches, 1 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 18 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=180, Invalid=522, Unknown=0, NotChecked=0, Total=702 [2022-11-21 16:11:49,865 INFO L413 NwaCegarLoop]: 4 mSDtfsCounter, 36 mSDsluCounter, 12 mSDsCounter, 0 mSdLazyCounter, 432 mSolverCounterSat, 54 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 36 SdHoareTripleChecker+Valid, 16 SdHoareTripleChecker+Invalid, 486 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 54 IncrementalHoareTripleChecker+Valid, 432 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-11-21 16:11:49,865 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [36 Valid, 16 Invalid, 486 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [54 Valid, 432 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2022-11-21 16:11:49,866 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 47 states. [2022-11-21 16:11:49,879 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 47 to 45. [2022-11-21 16:11:49,879 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 45 states, 44 states have (on average 1.1136363636363635) internal successors, (49), 44 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-21 16:11:49,880 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 45 states to 45 states and 49 transitions. [2022-11-21 16:11:49,881 INFO L78 Accepts]: Start accepts. Automaton has 45 states and 49 transitions. Word has length 36 [2022-11-21 16:11:49,881 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-21 16:11:49,881 INFO L495 AbstractCegarLoop]: Abstraction has 45 states and 49 transitions. [2022-11-21 16:11:49,882 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 23 states, 23 states have (on average 2.130434782608696) internal successors, (49), 23 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-21 16:11:49,882 INFO L276 IsEmpty]: Start isEmpty. Operand 45 states and 49 transitions. [2022-11-21 16:11:49,883 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2022-11-21 16:11:49,884 INFO L187 NwaCegarLoop]: Found error trace [2022-11-21 16:11:49,885 INFO L195 NwaCegarLoop]: trace histogram [19, 15, 4, 1, 1, 1, 1, 1, 1] [2022-11-21 16:11:49,896 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7cc82ec6-a64e-4752-950a-815f937b691d/bin/uautomizer-vX5HgA9Q3a/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2022-11-21 16:11:50,096 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5,5 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7cc82ec6-a64e-4752-950a-815f937b691d/bin/uautomizer-vX5HgA9Q3a/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-21 16:11:50,096 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-21 16:11:50,097 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-21 16:11:50,097 INFO L85 PathProgramCache]: Analyzing trace with hash -1664138286, now seen corresponding path program 4 times [2022-11-21 16:11:50,097 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-21 16:11:50,097 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1108631935] [2022-11-21 16:11:50,097 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-21 16:11:50,098 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-21 16:11:50,141 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 16:11:50,719 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-21 16:11:50,719 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-21 16:11:50,720 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1108631935] [2022-11-21 16:11:50,720 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1108631935] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-21 16:11:50,720 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [86418215] [2022-11-21 16:11:50,720 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-11-21 16:11:50,720 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-21 16:11:50,720 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7cc82ec6-a64e-4752-950a-815f937b691d/bin/uautomizer-vX5HgA9Q3a/z3 [2022-11-21 16:11:50,723 INFO L229 MonitoredProcess]: Starting monitored process 6 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7cc82ec6-a64e-4752-950a-815f937b691d/bin/uautomizer-vX5HgA9Q3a/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-21 16:11:50,753 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7cc82ec6-a64e-4752-950a-815f937b691d/bin/uautomizer-vX5HgA9Q3a/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2022-11-21 16:11:50,794 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-11-21 16:11:50,794 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-21 16:11:50,795 INFO L263 TraceCheckSpWp]: Trace formula consists of 111 conjuncts, 41 conjunts are in the unsatisfiable core [2022-11-21 16:11:50,798 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-21 16:11:51,082 INFO L134 CoverageAnalysis]: Checked inductivity of 361 backedges. 0 proven. 361 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-21 16:11:51,082 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-21 16:11:52,147 INFO L134 CoverageAnalysis]: Checked inductivity of 361 backedges. 0 proven. 361 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-21 16:11:52,147 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [86418215] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-21 16:11:52,147 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-21 16:11:52,147 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 22, 22] total 43 [2022-11-21 16:11:52,147 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [977932787] [2022-11-21 16:11:52,147 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-21 16:11:52,148 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 43 states [2022-11-21 16:11:52,148 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-21 16:11:52,149 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 43 interpolants. [2022-11-21 16:11:52,150 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=519, Invalid=1287, Unknown=0, NotChecked=0, Total=1806 [2022-11-21 16:11:52,150 INFO L87 Difference]: Start difference. First operand 45 states and 49 transitions. Second operand has 43 states, 43 states have (on average 2.0930232558139537) internal successors, (90), 43 states have internal predecessors, (90), 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-21 16:12:21,680 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-21 16:12:21,680 INFO L93 Difference]: Finished difference Result 76 states and 101 transitions. [2022-11-21 16:12:21,681 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2022-11-21 16:12:21,681 INFO L78 Accepts]: Start accepts. Automaton has has 43 states, 43 states have (on average 2.0930232558139537) internal successors, (90), 43 states have internal predecessors, (90), 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-21 16:12:21,681 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-21 16:12:21,683 INFO L225 Difference]: With dead ends: 76 [2022-11-21 16:12:21,683 INFO L226 Difference]: Without dead ends: 63 [2022-11-21 16:12:21,685 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 116 GetRequests, 62 SyntacticMatches, 2 SemanticMatches, 52 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 128 ImplicationChecksByTransitivity, 29.3s TimeCoverageRelationStatistics Valid=940, Invalid=1922, Unknown=0, NotChecked=0, Total=2862 [2022-11-21 16:12:21,686 INFO L413 NwaCegarLoop]: 6 mSDtfsCounter, 28 mSDsluCounter, 60 mSDsCounter, 0 mSdLazyCounter, 739 mSolverCounterSat, 330 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 28 SdHoareTripleChecker+Valid, 66 SdHoareTripleChecker+Invalid, 1069 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 330 IncrementalHoareTripleChecker+Valid, 739 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.5s IncrementalHoareTripleChecker+Time [2022-11-21 16:12:21,686 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [28 Valid, 66 Invalid, 1069 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [330 Valid, 739 Invalid, 0 Unknown, 0 Unchecked, 1.5s Time] [2022-11-21 16:12:21,687 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 63 states. [2022-11-21 16:12:21,697 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 63 to 63. [2022-11-21 16:12:21,697 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 63 states, 62 states have (on average 1.2096774193548387) internal successors, (75), 62 states have internal predecessors, (75), 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-21 16:12:21,698 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 63 states to 63 states and 75 transitions. [2022-11-21 16:12:21,699 INFO L78 Accepts]: Start accepts. Automaton has 63 states and 75 transitions. Word has length 44 [2022-11-21 16:12:21,699 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-21 16:12:21,699 INFO L495 AbstractCegarLoop]: Abstraction has 63 states and 75 transitions. [2022-11-21 16:12:21,699 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 43 states, 43 states have (on average 2.0930232558139537) internal successors, (90), 43 states have internal predecessors, (90), 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-21 16:12:21,700 INFO L276 IsEmpty]: Start isEmpty. Operand 63 states and 75 transitions. [2022-11-21 16:12:21,701 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2022-11-21 16:12:21,701 INFO L187 NwaCegarLoop]: Found error trace [2022-11-21 16:12:21,701 INFO L195 NwaCegarLoop]: trace histogram [28, 16, 12, 1, 1, 1, 1, 1, 1] [2022-11-21 16:12:21,711 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7cc82ec6-a64e-4752-950a-815f937b691d/bin/uautomizer-vX5HgA9Q3a/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2022-11-21 16:12:21,910 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,6 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7cc82ec6-a64e-4752-950a-815f937b691d/bin/uautomizer-vX5HgA9Q3a/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-21 16:12:21,911 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-21 16:12:21,911 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-21 16:12:21,911 INFO L85 PathProgramCache]: Analyzing trace with hash 1269144285, now seen corresponding path program 5 times [2022-11-21 16:12:21,911 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-21 16:12:21,911 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [479129438] [2022-11-21 16:12:21,912 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-21 16:12:21,912 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-21 16:12:21,935 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 16:12:22,564 INFO L134 CoverageAnalysis]: Checked inductivity of 784 backedges. 391 proven. 272 refuted. 0 times theorem prover too weak. 121 trivial. 0 not checked. [2022-11-21 16:12:22,564 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-21 16:12:22,564 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [479129438] [2022-11-21 16:12:22,564 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [479129438] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-21 16:12:22,565 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [734611465] [2022-11-21 16:12:22,565 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2022-11-21 16:12:22,565 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-21 16:12:22,565 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7cc82ec6-a64e-4752-950a-815f937b691d/bin/uautomizer-vX5HgA9Q3a/z3 [2022-11-21 16:12:22,567 INFO L229 MonitoredProcess]: Starting monitored process 7 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7cc82ec6-a64e-4752-950a-815f937b691d/bin/uautomizer-vX5HgA9Q3a/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-21 16:12:22,591 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7cc82ec6-a64e-4752-950a-815f937b691d/bin/uautomizer-vX5HgA9Q3a/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2022-11-21 16:12:24,551 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 29 check-sat command(s) [2022-11-21 16:12:24,551 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-21 16:12:24,556 INFO L263 TraceCheckSpWp]: Trace formula consists of 147 conjuncts, 36 conjunts are in the unsatisfiable core [2022-11-21 16:12:24,559 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-21 16:12:24,729 INFO L134 CoverageAnalysis]: Checked inductivity of 784 backedges. 391 proven. 272 refuted. 0 times theorem prover too weak. 121 trivial. 0 not checked. [2022-11-21 16:12:24,729 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-21 16:12:25,936 INFO L134 CoverageAnalysis]: Checked inductivity of 784 backedges. 391 proven. 272 refuted. 0 times theorem prover too weak. 121 trivial. 0 not checked. [2022-11-21 16:12:25,936 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [734611465] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-21 16:12:25,936 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-21 16:12:25,937 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [19, 19, 20] total 38 [2022-11-21 16:12:25,937 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [382994115] [2022-11-21 16:12:25,937 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-21 16:12:25,937 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 38 states [2022-11-21 16:12:25,938 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-21 16:12:25,938 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 38 interpolants. [2022-11-21 16:12:25,939 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=415, Invalid=991, Unknown=0, NotChecked=0, Total=1406 [2022-11-21 16:12:25,940 INFO L87 Difference]: Start difference. First operand 63 states and 75 transitions. Second operand has 38 states, 38 states have (on average 2.1052631578947367) internal successors, (80), 38 states have internal predecessors, (80), 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-21 16:13:09,897 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-21 16:13:09,897 INFO L93 Difference]: Finished difference Result 128 states and 170 transitions. [2022-11-21 16:13:09,898 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 37 states. [2022-11-21 16:13:09,898 INFO L78 Accepts]: Start accepts. Automaton has has 38 states, 38 states have (on average 2.1052631578947367) internal successors, (80), 38 states have internal predecessors, (80), 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 62 [2022-11-21 16:13:09,899 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-21 16:13:09,899 INFO L225 Difference]: With dead ends: 128 [2022-11-21 16:13:09,899 INFO L226 Difference]: Without dead ends: 99 [2022-11-21 16:13:09,901 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 159 GetRequests, 104 SyntacticMatches, 2 SemanticMatches, 53 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 225 ImplicationChecksByTransitivity, 44.6s TimeCoverageRelationStatistics Valid=1061, Invalid=1909, Unknown=0, NotChecked=0, Total=2970 [2022-11-21 16:13:09,902 INFO L413 NwaCegarLoop]: 6 mSDtfsCounter, 85 mSDsluCounter, 26 mSDsCounter, 0 mSdLazyCounter, 660 mSolverCounterSat, 99 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 85 SdHoareTripleChecker+Valid, 32 SdHoareTripleChecker+Invalid, 759 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 99 IncrementalHoareTripleChecker+Valid, 660 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2022-11-21 16:13:09,902 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [85 Valid, 32 Invalid, 759 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [99 Valid, 660 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2022-11-21 16:13:09,903 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 99 states. [2022-11-21 16:13:09,918 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 99 to 99. [2022-11-21 16:13:09,919 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 99 states, 98 states have (on average 1.1326530612244898) internal successors, (111), 98 states have internal predecessors, (111), 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-21 16:13:09,920 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 99 states to 99 states and 111 transitions. [2022-11-21 16:13:09,920 INFO L78 Accepts]: Start accepts. Automaton has 99 states and 111 transitions. Word has length 62 [2022-11-21 16:13:09,921 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-21 16:13:09,921 INFO L495 AbstractCegarLoop]: Abstraction has 99 states and 111 transitions. [2022-11-21 16:13:09,921 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 38 states, 38 states have (on average 2.1052631578947367) internal successors, (80), 38 states have internal predecessors, (80), 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-21 16:13:09,921 INFO L276 IsEmpty]: Start isEmpty. Operand 99 states and 111 transitions. [2022-11-21 16:13:09,923 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 99 [2022-11-21 16:13:09,924 INFO L187 NwaCegarLoop]: Found error trace [2022-11-21 16:13:09,924 INFO L195 NwaCegarLoop]: trace histogram [46, 34, 12, 1, 1, 1, 1, 1, 1] [2022-11-21 16:13:09,930 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7cc82ec6-a64e-4752-950a-815f937b691d/bin/uautomizer-vX5HgA9Q3a/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0 [2022-11-21 16:13:10,130 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7cc82ec6-a64e-4752-950a-815f937b691d/bin/uautomizer-vX5HgA9Q3a/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable7 [2022-11-21 16:13:10,130 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-21 16:13:10,131 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-21 16:13:10,131 INFO L85 PathProgramCache]: Analyzing trace with hash -905639277, now seen corresponding path program 6 times [2022-11-21 16:13:10,131 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-21 16:13:10,131 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [63901357] [2022-11-21 16:13:10,131 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-21 16:13:10,131 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-21 16:13:10,180 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 16:13:11,847 INFO L134 CoverageAnalysis]: Checked inductivity of 2116 backedges. 805 proven. 1190 refuted. 0 times theorem prover too weak. 121 trivial. 0 not checked. [2022-11-21 16:13:11,848 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-21 16:13:11,848 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [63901357] [2022-11-21 16:13:11,848 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [63901357] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-21 16:13:11,848 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [609659585] [2022-11-21 16:13:11,848 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2022-11-21 16:13:11,848 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-21 16:13:11,848 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7cc82ec6-a64e-4752-950a-815f937b691d/bin/uautomizer-vX5HgA9Q3a/z3 [2022-11-21 16:13:11,849 INFO L229 MonitoredProcess]: Starting monitored process 8 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7cc82ec6-a64e-4752-950a-815f937b691d/bin/uautomizer-vX5HgA9Q3a/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-21 16:13:11,852 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7cc82ec6-a64e-4752-950a-815f937b691d/bin/uautomizer-vX5HgA9Q3a/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2022-11-21 16:13:19,835 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 47 check-sat command(s) [2022-11-21 16:13:19,836 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-21 16:13:19,845 INFO L263 TraceCheckSpWp]: Trace formula consists of 219 conjuncts, 94 conjunts are in the unsatisfiable core [2022-11-21 16:13:19,849 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-21 16:13:20,721 INFO L134 CoverageAnalysis]: Checked inductivity of 2116 backedges. 46 proven. 2070 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-21 16:13:20,721 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-21 16:13:27,847 INFO L134 CoverageAnalysis]: Checked inductivity of 2116 backedges. 46 proven. 2070 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-21 16:13:27,848 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [609659585] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-21 16:13:27,848 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-21 16:13:27,848 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [37, 48, 49] total 96 [2022-11-21 16:13:27,848 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [168983717] [2022-11-21 16:13:27,848 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-21 16:13:27,849 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 96 states [2022-11-21 16:13:27,849 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-21 16:13:27,850 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 96 interpolants. [2022-11-21 16:13:27,852 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=2434, Invalid=6686, Unknown=0, NotChecked=0, Total=9120 [2022-11-21 16:13:27,853 INFO L87 Difference]: Start difference. First operand 99 states and 111 transitions. Second operand has 96 states, 96 states have (on average 2.0416666666666665) internal successors, (196), 96 states have internal predecessors, (196), 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-21 16:13:31,660 WARN L837 $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| 47) 4294967296))) (or (< .cse4 10000000) (not (< .cse4 100000000)))) (let ((.cse5 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 46) 4294967296))) (or (not (< .cse5 100000000)) (< .cse5 10000000))) (let ((.cse6 (mod (+ 41 |c_ULTIMATE.start_main_~x~0#1|) 4294967296))) (or (not (< .cse6 100000000)) (< .cse6 10000000))) (let ((.cse7 (mod (+ 53 |c_ULTIMATE.start_main_~x~0#1|) 4294967296))) (or (not (< .cse7 100000000)) (< .cse7 10000000))) (let ((.cse8 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 55) 4294967296))) (or (< .cse8 10000000) (not (< .cse8 100000000)))) (let ((.cse9 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 35) 4294967296))) (or (< .cse9 10000000) (not (< .cse9 100000000)))) (let ((.cse10 (mod (+ 40 |c_ULTIMATE.start_main_~x~0#1|) 4294967296))) (or (< .cse10 10000000) (not (< .cse10 100000000)))) (let ((.cse11 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 18) 4294967296))) (or (not (< .cse11 100000000)) (< .cse11 10000000))) (let ((.cse12 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 39) 4294967296))) (or (< .cse12 10000000) (not (< .cse12 100000000)))) (let ((.cse13 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 33) 4294967296))) (or (not (< .cse13 100000000)) (< .cse13 10000000))) (let ((.cse14 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 43) 4294967296))) (or (< .cse14 10000000) (not (< .cse14 100000000)))) (let ((.cse15 (mod (+ 23 |c_ULTIMATE.start_main_~x~0#1|) 4294967296))) (or (< .cse15 10000000) (not (< .cse15 100000000)))) (let ((.cse16 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 31) 4294967296))) (or (not (< .cse16 100000000)) (< .cse16 10000000))) (let ((.cse17 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 36) 4294967296))) (or (< .cse17 10000000) (not (< .cse17 100000000)))) (let ((.cse18 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 8) 4294967296))) (or (not (< .cse18 100000000)) (< .cse18 10000000))) (let ((.cse19 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 2) 4294967296))) (or (< .cse19 10000000) (not (< .cse19 100000000)))) (let ((.cse20 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 16) 4294967296))) (or (not (< .cse20 100000000)) (< .cse20 10000000))) (let ((.cse21 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 30) 4294967296))) (or (< .cse21 10000000) (not (< .cse21 100000000)))) (< (mod |c_ULTIMATE.start_main_~x~0#1| 4294967296) 10000000) (let ((.cse22 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 29) 4294967296))) (or (< .cse22 10000000) (not (< .cse22 100000000)))) (let ((.cse23 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 25) 4294967296))) (or (not (< .cse23 100000000)) (< .cse23 10000000))) (let ((.cse24 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 48) 4294967296))) (or (not (< .cse24 100000000)) (< .cse24 10000000))) (let ((.cse25 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 6) 4294967296))) (or (not (< .cse25 100000000)) (< .cse25 10000000))) (let ((.cse26 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 49) 4294967296))) (or (< .cse26 10000000) (not (< .cse26 100000000)))) (let ((.cse27 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 51) 4294967296))) (or (not (< .cse27 100000000)) (< .cse27 10000000))) (let ((.cse28 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 24) 4294967296))) (or (not (< .cse28 100000000)) (< .cse28 10000000))) (let ((.cse29 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 14) 4294967296))) (or (not (< .cse29 100000000)) (< .cse29 10000000))) (let ((.cse30 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 37) 4294967296))) (or (< .cse30 10000000) (not (< .cse30 100000000)))) (let ((.cse31 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 45) 4294967296))) (or (not (< .cse31 100000000)) (< .cse31 10000000))) (let ((.cse32 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 44) 4294967296))) (or (< .cse32 10000000) (not (< .cse32 100000000)))) (let ((.cse33 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 4) 4294967296))) (or (not (< .cse33 100000000)) (< .cse33 10000000))) (let ((.cse34 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 34) 4294967296))) (or (not (< .cse34 100000000)) (< .cse34 10000000))) (let ((.cse35 (mod (+ 56 |c_ULTIMATE.start_main_~x~0#1|) 4294967296))) (or (not (< .cse35 100000000)) (< .cse35 10000000))) (let ((.cse36 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 42) 4294967296))) (or (< .cse36 10000000) (not (< .cse36 100000000)))) (let ((.cse37 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 54) 4294967296))) (or (< .cse37 10000000) (not (< .cse37 100000000)))) (let ((.cse38 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 27) 4294967296))) (or (< .cse38 10000000) (not (< .cse38 100000000)))) (let ((.cse39 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 52) 4294967296))) (or (< .cse39 10000000) (not (< .cse39 100000000)))) (let ((.cse40 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 12) 4294967296))) (or (not (< .cse40 100000000)) (< .cse40 10000000))) (let ((.cse41 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 20) 4294967296))) (or (not (< .cse41 100000000)) (< .cse41 10000000))) (let ((.cse42 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 38) 4294967296))) (or (not (< .cse42 100000000)) (< .cse42 10000000))) (let ((.cse43 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 50) 4294967296))) (or (not (< .cse43 100000000)) (< .cse43 10000000))) (let ((.cse44 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 26) 4294967296))) (or (< .cse44 10000000) (not (< .cse44 100000000))))) is different from false [2022-11-21 16:15:13,654 WARN L233 SmtUtils]: Spent 40.66s on a formula simplification. DAG size of input: 243 DAG size of output: 19 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-11-21 16:15:16,741 WARN L837 $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| 32) 4294967296))) (or (not (< .cse1 100000000)) (< .cse1 10000000))) (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| 47) 4294967296))) (or (< .cse3 10000000) (not (< .cse3 100000000)))) (let ((.cse4 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 46) 4294967296))) (or (not (< .cse4 100000000)) (< .cse4 10000000))) (let ((.cse5 (mod (+ 41 |c_ULTIMATE.start_main_~x~0#1|) 4294967296))) (or (not (< .cse5 100000000)) (< .cse5 10000000))) (let ((.cse6 (mod (+ 53 |c_ULTIMATE.start_main_~x~0#1|) 4294967296))) (or (not (< .cse6 100000000)) (< .cse6 10000000))) (let ((.cse7 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 55) 4294967296))) (or (< .cse7 10000000) (not (< .cse7 100000000)))) (let ((.cse8 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 35) 4294967296))) (or (< .cse8 10000000) (not (< .cse8 100000000)))) (let ((.cse9 (mod (+ 40 |c_ULTIMATE.start_main_~x~0#1|) 4294967296))) (or (< .cse9 10000000) (not (< .cse9 100000000)))) (let ((.cse10 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 39) 4294967296))) (or (< .cse10 10000000) (not (< .cse10 100000000)))) (let ((.cse11 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 33) 4294967296))) (or (not (< .cse11 100000000)) (< .cse11 10000000))) (let ((.cse12 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 43) 4294967296))) (or (< .cse12 10000000) (not (< .cse12 100000000)))) (let ((.cse13 (mod (+ 23 |c_ULTIMATE.start_main_~x~0#1|) 4294967296))) (or (< .cse13 10000000) (not (< .cse13 100000000)))) (let ((.cse14 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 31) 4294967296))) (or (not (< .cse14 100000000)) (< .cse14 10000000))) (let ((.cse15 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 36) 4294967296))) (or (< .cse15 10000000) (not (< .cse15 100000000)))) (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| 48) 4294967296))) (or (not (< .cse19 100000000)) (< .cse19 10000000))) (let ((.cse20 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 49) 4294967296))) (or (< .cse20 10000000) (not (< .cse20 100000000)))) (let ((.cse21 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 51) 4294967296))) (or (not (< .cse21 100000000)) (< .cse21 10000000))) (let ((.cse22 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 24) 4294967296))) (or (not (< .cse22 100000000)) (< .cse22 10000000))) (let ((.cse23 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 37) 4294967296))) (or (< .cse23 10000000) (not (< .cse23 100000000)))) (let ((.cse24 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 45) 4294967296))) (or (not (< .cse24 100000000)) (< .cse24 10000000))) (let ((.cse25 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 44) 4294967296))) (or (< .cse25 10000000) (not (< .cse25 100000000)))) (let ((.cse26 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 34) 4294967296))) (or (not (< .cse26 100000000)) (< .cse26 10000000))) (let ((.cse27 (mod (+ 56 |c_ULTIMATE.start_main_~x~0#1|) 4294967296))) (or (not (< .cse27 100000000)) (< .cse27 10000000))) (let ((.cse28 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 42) 4294967296))) (or (< .cse28 10000000) (not (< .cse28 100000000)))) (let ((.cse29 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 54) 4294967296))) (or (< .cse29 10000000) (not (< .cse29 100000000)))) (let ((.cse30 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 27) 4294967296))) (or (< .cse30 10000000) (not (< .cse30 100000000)))) (let ((.cse31 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 52) 4294967296))) (or (< .cse31 10000000) (not (< .cse31 100000000)))) (let ((.cse32 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 20) 4294967296))) (or (not (< .cse32 100000000)) (< .cse32 10000000))) (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| 50) 4294967296))) (or (not (< .cse34 100000000)) (< .cse34 10000000))) (let ((.cse35 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 26) 4294967296))) (or (< .cse35 10000000) (not (< .cse35 100000000))))) is different from false [2022-11-21 16:15:18,935 WARN L837 $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| 47) 4294967296))) (or (< .cse4 10000000) (not (< .cse4 100000000)))) (let ((.cse5 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 46) 4294967296))) (or (not (< .cse5 100000000)) (< .cse5 10000000))) (let ((.cse6 (mod (+ 41 |c_ULTIMATE.start_main_~x~0#1|) 4294967296))) (or (not (< .cse6 100000000)) (< .cse6 10000000))) (let ((.cse7 (mod (+ 53 |c_ULTIMATE.start_main_~x~0#1|) 4294967296))) (or (not (< .cse7 100000000)) (< .cse7 10000000))) (let ((.cse8 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 35) 4294967296))) (or (< .cse8 10000000) (not (< .cse8 100000000)))) (let ((.cse9 (mod (+ 40 |c_ULTIMATE.start_main_~x~0#1|) 4294967296))) (or (< .cse9 10000000) (not (< .cse9 100000000)))) (let ((.cse10 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 18) 4294967296))) (or (not (< .cse10 100000000)) (< .cse10 10000000))) (let ((.cse11 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 39) 4294967296))) (or (< .cse11 10000000) (not (< .cse11 100000000)))) (let ((.cse12 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 33) 4294967296))) (or (not (< .cse12 100000000)) (< .cse12 10000000))) (let ((.cse13 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 43) 4294967296))) (or (< .cse13 10000000) (not (< .cse13 100000000)))) (let ((.cse14 (mod (+ 23 |c_ULTIMATE.start_main_~x~0#1|) 4294967296))) (or (< .cse14 10000000) (not (< .cse14 100000000)))) (let ((.cse15 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 31) 4294967296))) (or (not (< .cse15 100000000)) (< .cse15 10000000))) (let ((.cse16 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 36) 4294967296))) (or (< .cse16 10000000) (not (< .cse16 100000000)))) (let ((.cse17 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 8) 4294967296))) (or (not (< .cse17 100000000)) (< .cse17 10000000))) (let ((.cse18 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 2) 4294967296))) (or (< .cse18 10000000) (not (< .cse18 100000000)))) (let ((.cse19 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 16) 4294967296))) (or (not (< .cse19 100000000)) (< .cse19 10000000))) (let ((.cse20 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 30) 4294967296))) (or (< .cse20 10000000) (not (< .cse20 100000000)))) (< (mod |c_ULTIMATE.start_main_~x~0#1| 4294967296) 10000000) (let ((.cse21 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 29) 4294967296))) (or (< .cse21 10000000) (not (< .cse21 100000000)))) (let ((.cse22 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 25) 4294967296))) (or (not (< .cse22 100000000)) (< .cse22 10000000))) (let ((.cse23 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 48) 4294967296))) (or (not (< .cse23 100000000)) (< .cse23 10000000))) (let ((.cse24 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 6) 4294967296))) (or (not (< .cse24 100000000)) (< .cse24 10000000))) (let ((.cse25 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 49) 4294967296))) (or (< .cse25 10000000) (not (< .cse25 100000000)))) (let ((.cse26 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 51) 4294967296))) (or (not (< .cse26 100000000)) (< .cse26 10000000))) (let ((.cse27 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 24) 4294967296))) (or (not (< .cse27 100000000)) (< .cse27 10000000))) (let ((.cse28 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 14) 4294967296))) (or (not (< .cse28 100000000)) (< .cse28 10000000))) (let ((.cse29 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 37) 4294967296))) (or (< .cse29 10000000) (not (< .cse29 100000000)))) (let ((.cse30 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 45) 4294967296))) (or (not (< .cse30 100000000)) (< .cse30 10000000))) (let ((.cse31 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 44) 4294967296))) (or (< .cse31 10000000) (not (< .cse31 100000000)))) (let ((.cse32 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 4) 4294967296))) (or (not (< .cse32 100000000)) (< .cse32 10000000))) (let ((.cse33 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 34) 4294967296))) (or (not (< .cse33 100000000)) (< .cse33 10000000))) (let ((.cse34 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 42) 4294967296))) (or (< .cse34 10000000) (not (< .cse34 100000000)))) (let ((.cse35 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 54) 4294967296))) (or (< .cse35 10000000) (not (< .cse35 100000000)))) (let ((.cse36 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 27) 4294967296))) (or (< .cse36 10000000) (not (< .cse36 100000000)))) (let ((.cse37 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 52) 4294967296))) (or (< .cse37 10000000) (not (< .cse37 100000000)))) (let ((.cse38 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 12) 4294967296))) (or (not (< .cse38 100000000)) (< .cse38 10000000))) (let ((.cse39 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 20) 4294967296))) (or (not (< .cse39 100000000)) (< .cse39 10000000))) (let ((.cse40 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 38) 4294967296))) (or (not (< .cse40 100000000)) (< .cse40 10000000))) (let ((.cse41 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 50) 4294967296))) (or (not (< .cse41 100000000)) (< .cse41 10000000))) (let ((.cse42 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 26) 4294967296))) (or (< .cse42 10000000) (not (< .cse42 100000000))))) is different from false [2022-11-21 16:17:04,478 WARN L233 SmtUtils]: Spent 43.10s on a formula simplification. DAG size of input: 229 DAG size of output: 19 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-11-21 16:17:07,788 WARN L837 $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| 32) 4294967296))) (or (not (< .cse1 100000000)) (< .cse1 10000000))) (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| 47) 4294967296))) (or (< .cse3 10000000) (not (< .cse3 100000000)))) (let ((.cse4 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 46) 4294967296))) (or (not (< .cse4 100000000)) (< .cse4 10000000))) (let ((.cse5 (mod (+ 41 |c_ULTIMATE.start_main_~x~0#1|) 4294967296))) (or (not (< .cse5 100000000)) (< .cse5 10000000))) (let ((.cse6 (mod (+ 53 |c_ULTIMATE.start_main_~x~0#1|) 4294967296))) (or (not (< .cse6 100000000)) (< .cse6 10000000))) (let ((.cse7 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 55) 4294967296))) (or (< .cse7 10000000) (not (< .cse7 100000000)))) (let ((.cse8 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 35) 4294967296))) (or (< .cse8 10000000) (not (< .cse8 100000000)))) (let ((.cse9 (mod (+ 40 |c_ULTIMATE.start_main_~x~0#1|) 4294967296))) (or (< .cse9 10000000) (not (< .cse9 100000000)))) (let ((.cse10 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 18) 4294967296))) (or (not (< .cse10 100000000)) (< .cse10 10000000))) (let ((.cse11 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 39) 4294967296))) (or (< .cse11 10000000) (not (< .cse11 100000000)))) (let ((.cse12 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 33) 4294967296))) (or (not (< .cse12 100000000)) (< .cse12 10000000))) (let ((.cse13 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 43) 4294967296))) (or (< .cse13 10000000) (not (< .cse13 100000000)))) (let ((.cse14 (mod (+ 23 |c_ULTIMATE.start_main_~x~0#1|) 4294967296))) (or (< .cse14 10000000) (not (< .cse14 100000000)))) (let ((.cse15 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 31) 4294967296))) (or (not (< .cse15 100000000)) (< .cse15 10000000))) (let ((.cse16 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 36) 4294967296))) (or (< .cse16 10000000) (not (< .cse16 100000000)))) (let ((.cse17 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 16) 4294967296))) (or (not (< .cse17 100000000)) (< .cse17 10000000))) (let ((.cse18 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 30) 4294967296))) (or (< .cse18 10000000) (not (< .cse18 100000000)))) (let ((.cse19 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 29) 4294967296))) (or (< .cse19 10000000) (not (< .cse19 100000000)))) (let ((.cse20 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 25) 4294967296))) (or (not (< .cse20 100000000)) (< .cse20 10000000))) (let ((.cse21 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 48) 4294967296))) (or (not (< .cse21 100000000)) (< .cse21 10000000))) (let ((.cse22 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 49) 4294967296))) (or (< .cse22 10000000) (not (< .cse22 100000000)))) (let ((.cse23 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 51) 4294967296))) (or (not (< .cse23 100000000)) (< .cse23 10000000))) (let ((.cse24 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 24) 4294967296))) (or (not (< .cse24 100000000)) (< .cse24 10000000))) (let ((.cse25 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 37) 4294967296))) (or (< .cse25 10000000) (not (< .cse25 100000000)))) (let ((.cse26 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 45) 4294967296))) (or (not (< .cse26 100000000)) (< .cse26 10000000))) (let ((.cse27 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 44) 4294967296))) (or (< .cse27 10000000) (not (< .cse27 100000000)))) (let ((.cse28 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 34) 4294967296))) (or (not (< .cse28 100000000)) (< .cse28 10000000))) (let ((.cse29 (mod (+ 56 |c_ULTIMATE.start_main_~x~0#1|) 4294967296))) (or (not (< .cse29 100000000)) (< .cse29 10000000))) (let ((.cse30 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 42) 4294967296))) (or (< .cse30 10000000) (not (< .cse30 100000000)))) (let ((.cse31 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 54) 4294967296))) (or (< .cse31 10000000) (not (< .cse31 100000000)))) (let ((.cse32 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 27) 4294967296))) (or (< .cse32 10000000) (not (< .cse32 100000000)))) (let ((.cse33 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 52) 4294967296))) (or (< .cse33 10000000) (not (< .cse33 100000000)))) (let ((.cse34 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 20) 4294967296))) (or (not (< .cse34 100000000)) (< .cse34 10000000))) (let ((.cse35 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 38) 4294967296))) (or (not (< .cse35 100000000)) (< .cse35 10000000))) (let ((.cse36 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 50) 4294967296))) (or (not (< .cse36 100000000)) (< .cse36 10000000))) (let ((.cse37 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 26) 4294967296))) (or (< .cse37 10000000) (not (< .cse37 100000000))))) is different from false [2022-11-21 16:17:13,930 WARN L837 $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| 47) 4294967296))) (or (< .cse4 10000000) (not (< .cse4 100000000)))) (let ((.cse5 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 46) 4294967296))) (or (not (< .cse5 100000000)) (< .cse5 10000000))) (let ((.cse6 (mod (+ 41 |c_ULTIMATE.start_main_~x~0#1|) 4294967296))) (or (not (< .cse6 100000000)) (< .cse6 10000000))) (let ((.cse7 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 35) 4294967296))) (or (< .cse7 10000000) (not (< .cse7 100000000)))) (let ((.cse8 (mod (+ 40 |c_ULTIMATE.start_main_~x~0#1|) 4294967296))) (or (< .cse8 10000000) (not (< .cse8 100000000)))) (let ((.cse9 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 18) 4294967296))) (or (not (< .cse9 100000000)) (< .cse9 10000000))) (let ((.cse10 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 39) 4294967296))) (or (< .cse10 10000000) (not (< .cse10 100000000)))) (let ((.cse11 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 33) 4294967296))) (or (not (< .cse11 100000000)) (< .cse11 10000000))) (let ((.cse12 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 43) 4294967296))) (or (< .cse12 10000000) (not (< .cse12 100000000)))) (let ((.cse13 (mod (+ 23 |c_ULTIMATE.start_main_~x~0#1|) 4294967296))) (or (< .cse13 10000000) (not (< .cse13 100000000)))) (let ((.cse14 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 31) 4294967296))) (or (not (< .cse14 100000000)) (< .cse14 10000000))) (let ((.cse15 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 36) 4294967296))) (or (< .cse15 10000000) (not (< .cse15 100000000)))) (let ((.cse16 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 8) 4294967296))) (or (not (< .cse16 100000000)) (< .cse16 10000000))) (let ((.cse17 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 2) 4294967296))) (or (< .cse17 10000000) (not (< .cse17 100000000)))) (let ((.cse18 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 16) 4294967296))) (or (not (< .cse18 100000000)) (< .cse18 10000000))) (let ((.cse19 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 30) 4294967296))) (or (< .cse19 10000000) (not (< .cse19 100000000)))) (< (mod |c_ULTIMATE.start_main_~x~0#1| 4294967296) 10000000) (let ((.cse20 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 29) 4294967296))) (or (< .cse20 10000000) (not (< .cse20 100000000)))) (let ((.cse21 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 25) 4294967296))) (or (not (< .cse21 100000000)) (< .cse21 10000000))) (let ((.cse22 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 48) 4294967296))) (or (not (< .cse22 100000000)) (< .cse22 10000000))) (let ((.cse23 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 6) 4294967296))) (or (not (< .cse23 100000000)) (< .cse23 10000000))) (let ((.cse24 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 49) 4294967296))) (or (< .cse24 10000000) (not (< .cse24 100000000)))) (let ((.cse25 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 51) 4294967296))) (or (not (< .cse25 100000000)) (< .cse25 10000000))) (let ((.cse26 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 24) 4294967296))) (or (not (< .cse26 100000000)) (< .cse26 10000000))) (let ((.cse27 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 14) 4294967296))) (or (not (< .cse27 100000000)) (< .cse27 10000000))) (let ((.cse28 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 37) 4294967296))) (or (< .cse28 10000000) (not (< .cse28 100000000)))) (let ((.cse29 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 45) 4294967296))) (or (not (< .cse29 100000000)) (< .cse29 10000000))) (let ((.cse30 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 44) 4294967296))) (or (< .cse30 10000000) (not (< .cse30 100000000)))) (let ((.cse31 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 4) 4294967296))) (or (not (< .cse31 100000000)) (< .cse31 10000000))) (let ((.cse32 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 34) 4294967296))) (or (not (< .cse32 100000000)) (< .cse32 10000000))) (let ((.cse33 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 42) 4294967296))) (or (< .cse33 10000000) (not (< .cse33 100000000)))) (let ((.cse34 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 27) 4294967296))) (or (< .cse34 10000000) (not (< .cse34 100000000)))) (let ((.cse35 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 52) 4294967296))) (or (< .cse35 10000000) (not (< .cse35 100000000)))) (let ((.cse36 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 12) 4294967296))) (or (not (< .cse36 100000000)) (< .cse36 10000000))) (let ((.cse37 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 20) 4294967296))) (or (not (< .cse37 100000000)) (< .cse37 10000000))) (let ((.cse38 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 38) 4294967296))) (or (not (< .cse38 100000000)) (< .cse38 10000000))) (let ((.cse39 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 50) 4294967296))) (or (not (< .cse39 100000000)) (< .cse39 10000000))) (let ((.cse40 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 26) 4294967296))) (or (< .cse40 10000000) (not (< .cse40 100000000))))) is different from false [2022-11-21 16:19:06,861 WARN L233 SmtUtils]: Spent 44.46s on a formula simplification. DAG size of input: 215 DAG size of output: 19 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-11-21 16:19:09,491 WARN L837 $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| 32) 4294967296))) (or (not (< .cse1 100000000)) (< .cse1 10000000))) (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| 47) 4294967296))) (or (< .cse3 10000000) (not (< .cse3 100000000)))) (let ((.cse4 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 46) 4294967296))) (or (not (< .cse4 100000000)) (< .cse4 10000000))) (let ((.cse5 (mod (+ 41 |c_ULTIMATE.start_main_~x~0#1|) 4294967296))) (or (not (< .cse5 100000000)) (< .cse5 10000000))) (let ((.cse6 (mod (+ 53 |c_ULTIMATE.start_main_~x~0#1|) 4294967296))) (or (not (< .cse6 100000000)) (< .cse6 10000000))) (let ((.cse7 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 55) 4294967296))) (or (< .cse7 10000000) (not (< .cse7 100000000)))) (let ((.cse8 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 35) 4294967296))) (or (< .cse8 10000000) (not (< .cse8 100000000)))) (let ((.cse9 (mod (+ 40 |c_ULTIMATE.start_main_~x~0#1|) 4294967296))) (or (< .cse9 10000000) (not (< .cse9 100000000)))) (let ((.cse10 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 18) 4294967296))) (or (not (< .cse10 100000000)) (< .cse10 10000000))) (let ((.cse11 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 39) 4294967296))) (or (< .cse11 10000000) (not (< .cse11 100000000)))) (let ((.cse12 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 33) 4294967296))) (or (not (< .cse12 100000000)) (< .cse12 10000000))) (let ((.cse13 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 43) 4294967296))) (or (< .cse13 10000000) (not (< .cse13 100000000)))) (let ((.cse14 (mod (+ 23 |c_ULTIMATE.start_main_~x~0#1|) 4294967296))) (or (< .cse14 10000000) (not (< .cse14 100000000)))) (let ((.cse15 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 31) 4294967296))) (or (not (< .cse15 100000000)) (< .cse15 10000000))) (let ((.cse16 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 36) 4294967296))) (or (< .cse16 10000000) (not (< .cse16 100000000)))) (let ((.cse17 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 16) 4294967296))) (or (not (< .cse17 100000000)) (< .cse17 10000000))) (let ((.cse18 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 30) 4294967296))) (or (< .cse18 10000000) (not (< .cse18 100000000)))) (let ((.cse19 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 29) 4294967296))) (or (< .cse19 10000000) (not (< .cse19 100000000)))) (let ((.cse20 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 25) 4294967296))) (or (not (< .cse20 100000000)) (< .cse20 10000000))) (let ((.cse21 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 48) 4294967296))) (or (not (< .cse21 100000000)) (< .cse21 10000000))) (let ((.cse22 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 49) 4294967296))) (or (< .cse22 10000000) (not (< .cse22 100000000)))) (let ((.cse23 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 51) 4294967296))) (or (not (< .cse23 100000000)) (< .cse23 10000000))) (let ((.cse24 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 24) 4294967296))) (or (not (< .cse24 100000000)) (< .cse24 10000000))) (let ((.cse25 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 14) 4294967296))) (or (not (< .cse25 100000000)) (< .cse25 10000000))) (let ((.cse26 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 37) 4294967296))) (or (< .cse26 10000000) (not (< .cse26 100000000)))) (let ((.cse27 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 45) 4294967296))) (or (not (< .cse27 100000000)) (< .cse27 10000000))) (let ((.cse28 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 44) 4294967296))) (or (< .cse28 10000000) (not (< .cse28 100000000)))) (let ((.cse29 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 34) 4294967296))) (or (not (< .cse29 100000000)) (< .cse29 10000000))) (let ((.cse30 (mod (+ 56 |c_ULTIMATE.start_main_~x~0#1|) 4294967296))) (or (not (< .cse30 100000000)) (< .cse30 10000000))) (let ((.cse31 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 42) 4294967296))) (or (< .cse31 10000000) (not (< .cse31 100000000)))) (let ((.cse32 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 54) 4294967296))) (or (< .cse32 10000000) (not (< .cse32 100000000)))) (let ((.cse33 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 27) 4294967296))) (or (< .cse33 10000000) (not (< .cse33 100000000)))) (let ((.cse34 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 52) 4294967296))) (or (< .cse34 10000000) (not (< .cse34 100000000)))) (let ((.cse35 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 12) 4294967296))) (or (not (< .cse35 100000000)) (< .cse35 10000000))) (let ((.cse36 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 20) 4294967296))) (or (not (< .cse36 100000000)) (< .cse36 10000000))) (let ((.cse37 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 38) 4294967296))) (or (not (< .cse37 100000000)) (< .cse37 10000000))) (let ((.cse38 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 50) 4294967296))) (or (not (< .cse38 100000000)) (< .cse38 10000000))) (let ((.cse39 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 26) 4294967296))) (or (< .cse39 10000000) (not (< .cse39 100000000))))) is different from false [2022-11-21 16:20:57,479 WARN L233 SmtUtils]: Spent 41.63s on a formula simplification. DAG size of input: 280 DAG size of output: 10 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-11-21 16:23:00,914 WARN L233 SmtUtils]: Spent 52.91s on a formula simplification. DAG size of input: 273 DAG size of output: 10 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-11-21 16:23:03,123 WARN L837 $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| 47) 4294967296))) (or (< .cse4 10000000) (not (< .cse4 100000000)))) (let ((.cse5 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 46) 4294967296))) (or (not (< .cse5 100000000)) (< .cse5 10000000))) (let ((.cse6 (mod (+ 41 |c_ULTIMATE.start_main_~x~0#1|) 4294967296))) (or (not (< .cse6 100000000)) (< .cse6 10000000))) (let ((.cse7 (mod (+ 53 |c_ULTIMATE.start_main_~x~0#1|) 4294967296))) (or (not (< .cse7 100000000)) (< .cse7 10000000))) (let ((.cse8 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 55) 4294967296))) (or (< .cse8 10000000) (not (< .cse8 100000000)))) (let ((.cse9 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 35) 4294967296))) (or (< .cse9 10000000) (not (< .cse9 100000000)))) (let ((.cse10 (mod (+ 40 |c_ULTIMATE.start_main_~x~0#1|) 4294967296))) (or (< .cse10 10000000) (not (< .cse10 100000000)))) (let ((.cse11 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 18) 4294967296))) (or (not (< .cse11 100000000)) (< .cse11 10000000))) (let ((.cse12 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 39) 4294967296))) (or (< .cse12 10000000) (not (< .cse12 100000000)))) (let ((.cse13 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 33) 4294967296))) (or (not (< .cse13 100000000)) (< .cse13 10000000))) (let ((.cse14 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 43) 4294967296))) (or (< .cse14 10000000) (not (< .cse14 100000000)))) (let ((.cse15 (mod (+ 23 |c_ULTIMATE.start_main_~x~0#1|) 4294967296))) (or (< .cse15 10000000) (not (< .cse15 100000000)))) (let ((.cse16 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 31) 4294967296))) (or (not (< .cse16 100000000)) (< .cse16 10000000))) (let ((.cse17 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 36) 4294967296))) (or (< .cse17 10000000) (not (< .cse17 100000000)))) (let ((.cse18 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 8) 4294967296))) (or (not (< .cse18 100000000)) (< .cse18 10000000))) (let ((.cse19 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 16) 4294967296))) (or (not (< .cse19 100000000)) (< .cse19 10000000))) (let ((.cse20 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 30) 4294967296))) (or (< .cse20 10000000) (not (< .cse20 100000000)))) (let ((.cse21 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 29) 4294967296))) (or (< .cse21 10000000) (not (< .cse21 100000000)))) (let ((.cse22 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 25) 4294967296))) (or (not (< .cse22 100000000)) (< .cse22 10000000))) (let ((.cse23 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 48) 4294967296))) (or (not (< .cse23 100000000)) (< .cse23 10000000))) (let ((.cse24 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 49) 4294967296))) (or (< .cse24 10000000) (not (< .cse24 100000000)))) (let ((.cse25 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 51) 4294967296))) (or (not (< .cse25 100000000)) (< .cse25 10000000))) (let ((.cse26 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 24) 4294967296))) (or (not (< .cse26 100000000)) (< .cse26 10000000))) (let ((.cse27 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 14) 4294967296))) (or (not (< .cse27 100000000)) (< .cse27 10000000))) (let ((.cse28 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 37) 4294967296))) (or (< .cse28 10000000) (not (< .cse28 100000000)))) (let ((.cse29 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 45) 4294967296))) (or (not (< .cse29 100000000)) (< .cse29 10000000))) (let ((.cse30 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 44) 4294967296))) (or (< .cse30 10000000) (not (< .cse30 100000000)))) (let ((.cse31 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 34) 4294967296))) (or (not (< .cse31 100000000)) (< .cse31 10000000))) (let ((.cse32 (mod (+ 56 |c_ULTIMATE.start_main_~x~0#1|) 4294967296))) (or (not (< .cse32 100000000)) (< .cse32 10000000))) (let ((.cse33 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 42) 4294967296))) (or (< .cse33 10000000) (not (< .cse33 100000000)))) (let ((.cse34 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 54) 4294967296))) (or (< .cse34 10000000) (not (< .cse34 100000000)))) (let ((.cse35 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 27) 4294967296))) (or (< .cse35 10000000) (not (< .cse35 100000000)))) (let ((.cse36 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 52) 4294967296))) (or (< .cse36 10000000) (not (< .cse36 100000000)))) (let ((.cse37 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 12) 4294967296))) (or (not (< .cse37 100000000)) (< .cse37 10000000))) (let ((.cse38 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 20) 4294967296))) (or (not (< .cse38 100000000)) (< .cse38 10000000))) (let ((.cse39 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 38) 4294967296))) (or (not (< .cse39 100000000)) (< .cse39 10000000))) (let ((.cse40 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 50) 4294967296))) (or (not (< .cse40 100000000)) (< .cse40 10000000))) (let ((.cse41 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 26) 4294967296))) (or (< .cse41 10000000) (not (< .cse41 100000000))))) is different from false [2022-11-21 16:23:06,290 WARN L837 $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| 47) 4294967296))) (or (< .cse4 10000000) (not (< .cse4 100000000)))) (let ((.cse5 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 46) 4294967296))) (or (not (< .cse5 100000000)) (< .cse5 10000000))) (let ((.cse6 (mod (+ 41 |c_ULTIMATE.start_main_~x~0#1|) 4294967296))) (or (not (< .cse6 100000000)) (< .cse6 10000000))) (let ((.cse7 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 35) 4294967296))) (or (< .cse7 10000000) (not (< .cse7 100000000)))) (let ((.cse8 (mod (+ 40 |c_ULTIMATE.start_main_~x~0#1|) 4294967296))) (or (< .cse8 10000000) (not (< .cse8 100000000)))) (let ((.cse9 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 18) 4294967296))) (or (not (< .cse9 100000000)) (< .cse9 10000000))) (let ((.cse10 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 39) 4294967296))) (or (< .cse10 10000000) (not (< .cse10 100000000)))) (let ((.cse11 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 33) 4294967296))) (or (not (< .cse11 100000000)) (< .cse11 10000000))) (let ((.cse12 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 43) 4294967296))) (or (< .cse12 10000000) (not (< .cse12 100000000)))) (let ((.cse13 (mod (+ 23 |c_ULTIMATE.start_main_~x~0#1|) 4294967296))) (or (< .cse13 10000000) (not (< .cse13 100000000)))) (let ((.cse14 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 31) 4294967296))) (or (not (< .cse14 100000000)) (< .cse14 10000000))) (let ((.cse15 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 36) 4294967296))) (or (< .cse15 10000000) (not (< .cse15 100000000)))) (let ((.cse16 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 8) 4294967296))) (or (not (< .cse16 100000000)) (< .cse16 10000000))) (let ((.cse17 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 2) 4294967296))) (or (< .cse17 10000000) (not (< .cse17 100000000)))) (let ((.cse18 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 16) 4294967296))) (or (not (< .cse18 100000000)) (< .cse18 10000000))) (let ((.cse19 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 30) 4294967296))) (or (< .cse19 10000000) (not (< .cse19 100000000)))) (< (mod |c_ULTIMATE.start_main_~x~0#1| 4294967296) 10000000) (let ((.cse20 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 29) 4294967296))) (or (< .cse20 10000000) (not (< .cse20 100000000)))) (let ((.cse21 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 25) 4294967296))) (or (not (< .cse21 100000000)) (< .cse21 10000000))) (let ((.cse22 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 48) 4294967296))) (or (not (< .cse22 100000000)) (< .cse22 10000000))) (let ((.cse23 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 6) 4294967296))) (or (not (< .cse23 100000000)) (< .cse23 10000000))) (let ((.cse24 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 24) 4294967296))) (or (not (< .cse24 100000000)) (< .cse24 10000000))) (let ((.cse25 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 14) 4294967296))) (or (not (< .cse25 100000000)) (< .cse25 10000000))) (let ((.cse26 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 37) 4294967296))) (or (< .cse26 10000000) (not (< .cse26 100000000)))) (let ((.cse27 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 45) 4294967296))) (or (not (< .cse27 100000000)) (< .cse27 10000000))) (let ((.cse28 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 44) 4294967296))) (or (< .cse28 10000000) (not (< .cse28 100000000)))) (let ((.cse29 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 4) 4294967296))) (or (not (< .cse29 100000000)) (< .cse29 10000000))) (let ((.cse30 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 34) 4294967296))) (or (not (< .cse30 100000000)) (< .cse30 10000000))) (let ((.cse31 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 42) 4294967296))) (or (< .cse31 10000000) (not (< .cse31 100000000)))) (let ((.cse32 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 27) 4294967296))) (or (< .cse32 10000000) (not (< .cse32 100000000)))) (let ((.cse33 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 12) 4294967296))) (or (not (< .cse33 100000000)) (< .cse33 10000000))) (let ((.cse34 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 20) 4294967296))) (or (not (< .cse34 100000000)) (< .cse34 10000000))) (let ((.cse35 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 38) 4294967296))) (or (not (< .cse35 100000000)) (< .cse35 10000000))) (let ((.cse36 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 26) 4294967296))) (or (< .cse36 10000000) (not (< .cse36 100000000))))) is different from false [2022-11-21 16:24:24,982 WARN L233 SmtUtils]: Spent 14.48s on a formula simplification. DAG size of input: 187 DAG size of output: 19 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-11-21 16:24:27,688 WARN L837 $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| 47) 4294967296))) (or (< .cse4 10000000) (not (< .cse4 100000000)))) (let ((.cse5 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 46) 4294967296))) (or (not (< .cse5 100000000)) (< .cse5 10000000))) (let ((.cse6 (mod (+ 41 |c_ULTIMATE.start_main_~x~0#1|) 4294967296))) (or (not (< .cse6 100000000)) (< .cse6 10000000))) (let ((.cse7 (mod (+ 53 |c_ULTIMATE.start_main_~x~0#1|) 4294967296))) (or (not (< .cse7 100000000)) (< .cse7 10000000))) (let ((.cse8 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 55) 4294967296))) (or (< .cse8 10000000) (not (< .cse8 100000000)))) (let ((.cse9 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 35) 4294967296))) (or (< .cse9 10000000) (not (< .cse9 100000000)))) (let ((.cse10 (mod (+ 40 |c_ULTIMATE.start_main_~x~0#1|) 4294967296))) (or (< .cse10 10000000) (not (< .cse10 100000000)))) (let ((.cse11 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 18) 4294967296))) (or (not (< .cse11 100000000)) (< .cse11 10000000))) (let ((.cse12 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 39) 4294967296))) (or (< .cse12 10000000) (not (< .cse12 100000000)))) (let ((.cse13 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 33) 4294967296))) (or (not (< .cse13 100000000)) (< .cse13 10000000))) (let ((.cse14 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 43) 4294967296))) (or (< .cse14 10000000) (not (< .cse14 100000000)))) (let ((.cse15 (mod (+ 23 |c_ULTIMATE.start_main_~x~0#1|) 4294967296))) (or (< .cse15 10000000) (not (< .cse15 100000000)))) (let ((.cse16 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 31) 4294967296))) (or (not (< .cse16 100000000)) (< .cse16 10000000))) (let ((.cse17 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 36) 4294967296))) (or (< .cse17 10000000) (not (< .cse17 100000000)))) (let ((.cse18 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 8) 4294967296))) (or (not (< .cse18 100000000)) (< .cse18 10000000))) (let ((.cse19 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 16) 4294967296))) (or (not (< .cse19 100000000)) (< .cse19 10000000))) (let ((.cse20 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 30) 4294967296))) (or (< .cse20 10000000) (not (< .cse20 100000000)))) (let ((.cse21 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 29) 4294967296))) (or (< .cse21 10000000) (not (< .cse21 100000000)))) (let ((.cse22 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 25) 4294967296))) (or (not (< .cse22 100000000)) (< .cse22 10000000))) (let ((.cse23 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 48) 4294967296))) (or (not (< .cse23 100000000)) (< .cse23 10000000))) (let ((.cse24 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 6) 4294967296))) (or (not (< .cse24 100000000)) (< .cse24 10000000))) (let ((.cse25 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 49) 4294967296))) (or (< .cse25 10000000) (not (< .cse25 100000000)))) (let ((.cse26 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 51) 4294967296))) (or (not (< .cse26 100000000)) (< .cse26 10000000))) (let ((.cse27 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 24) 4294967296))) (or (not (< .cse27 100000000)) (< .cse27 10000000))) (let ((.cse28 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 14) 4294967296))) (or (not (< .cse28 100000000)) (< .cse28 10000000))) (let ((.cse29 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 37) 4294967296))) (or (< .cse29 10000000) (not (< .cse29 100000000)))) (let ((.cse30 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 45) 4294967296))) (or (not (< .cse30 100000000)) (< .cse30 10000000))) (let ((.cse31 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 44) 4294967296))) (or (< .cse31 10000000) (not (< .cse31 100000000)))) (let ((.cse32 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 4) 4294967296))) (or (not (< .cse32 100000000)) (< .cse32 10000000))) (let ((.cse33 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 34) 4294967296))) (or (not (< .cse33 100000000)) (< .cse33 10000000))) (let ((.cse34 (mod (+ 56 |c_ULTIMATE.start_main_~x~0#1|) 4294967296))) (or (not (< .cse34 100000000)) (< .cse34 10000000))) (let ((.cse35 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 42) 4294967296))) (or (< .cse35 10000000) (not (< .cse35 100000000)))) (let ((.cse36 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 54) 4294967296))) (or (< .cse36 10000000) (not (< .cse36 100000000)))) (let ((.cse37 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 27) 4294967296))) (or (< .cse37 10000000) (not (< .cse37 100000000)))) (let ((.cse38 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 52) 4294967296))) (or (< .cse38 10000000) (not (< .cse38 100000000)))) (let ((.cse39 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 12) 4294967296))) (or (not (< .cse39 100000000)) (< .cse39 10000000))) (let ((.cse40 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 20) 4294967296))) (or (not (< .cse40 100000000)) (< .cse40 10000000))) (let ((.cse41 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 38) 4294967296))) (or (not (< .cse41 100000000)) (< .cse41 10000000))) (let ((.cse42 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 50) 4294967296))) (or (not (< .cse42 100000000)) (< .cse42 10000000))) (let ((.cse43 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 26) 4294967296))) (or (< .cse43 10000000) (not (< .cse43 100000000))))) is different from false [2022-11-21 16:24:31,204 WARN L837 $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| 46) 4294967296))) (or (not (< .cse4 100000000)) (< .cse4 10000000))) (let ((.cse5 (mod (+ 41 |c_ULTIMATE.start_main_~x~0#1|) 4294967296))) (or (not (< .cse5 100000000)) (< .cse5 10000000))) (let ((.cse6 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 35) 4294967296))) (or (< .cse6 10000000) (not (< .cse6 100000000)))) (let ((.cse7 (mod (+ 40 |c_ULTIMATE.start_main_~x~0#1|) 4294967296))) (or (< .cse7 10000000) (not (< .cse7 100000000)))) (let ((.cse8 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 18) 4294967296))) (or (not (< .cse8 100000000)) (< .cse8 10000000))) (let ((.cse9 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 39) 4294967296))) (or (< .cse9 10000000) (not (< .cse9 100000000)))) (let ((.cse10 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 33) 4294967296))) (or (not (< .cse10 100000000)) (< .cse10 10000000))) (let ((.cse11 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 43) 4294967296))) (or (< .cse11 10000000) (not (< .cse11 100000000)))) (let ((.cse12 (mod (+ 23 |c_ULTIMATE.start_main_~x~0#1|) 4294967296))) (or (< .cse12 10000000) (not (< .cse12 100000000)))) (let ((.cse13 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 31) 4294967296))) (or (not (< .cse13 100000000)) (< .cse13 10000000))) (let ((.cse14 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 36) 4294967296))) (or (< .cse14 10000000) (not (< .cse14 100000000)))) (let ((.cse15 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 8) 4294967296))) (or (not (< .cse15 100000000)) (< .cse15 10000000))) (let ((.cse16 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 2) 4294967296))) (or (< .cse16 10000000) (not (< .cse16 100000000)))) (let ((.cse17 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 16) 4294967296))) (or (not (< .cse17 100000000)) (< .cse17 10000000))) (let ((.cse18 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 30) 4294967296))) (or (< .cse18 10000000) (not (< .cse18 100000000)))) (< (mod |c_ULTIMATE.start_main_~x~0#1| 4294967296) 10000000) (let ((.cse19 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 29) 4294967296))) (or (< .cse19 10000000) (not (< .cse19 100000000)))) (let ((.cse20 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 25) 4294967296))) (or (not (< .cse20 100000000)) (< .cse20 10000000))) (let ((.cse21 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 6) 4294967296))) (or (not (< .cse21 100000000)) (< .cse21 10000000))) (let ((.cse22 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 24) 4294967296))) (or (not (< .cse22 100000000)) (< .cse22 10000000))) (let ((.cse23 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 14) 4294967296))) (or (not (< .cse23 100000000)) (< .cse23 10000000))) (let ((.cse24 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 37) 4294967296))) (or (< .cse24 10000000) (not (< .cse24 100000000)))) (let ((.cse25 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 45) 4294967296))) (or (not (< .cse25 100000000)) (< .cse25 10000000))) (let ((.cse26 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 44) 4294967296))) (or (< .cse26 10000000) (not (< .cse26 100000000)))) (let ((.cse27 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 4) 4294967296))) (or (not (< .cse27 100000000)) (< .cse27 10000000))) (let ((.cse28 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 34) 4294967296))) (or (not (< .cse28 100000000)) (< .cse28 10000000))) (let ((.cse29 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 42) 4294967296))) (or (< .cse29 10000000) (not (< .cse29 100000000)))) (let ((.cse30 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 27) 4294967296))) (or (< .cse30 10000000) (not (< .cse30 100000000)))) (let ((.cse31 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 12) 4294967296))) (or (not (< .cse31 100000000)) (< .cse31 10000000))) (let ((.cse32 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 20) 4294967296))) (or (not (< .cse32 100000000)) (< .cse32 10000000))) (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))))) is different from false [2022-11-21 16:25:45,948 WARN L233 SmtUtils]: Spent 9.98s on a formula simplification. DAG size of input: 173 DAG size of output: 19 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-11-21 16:25:48,173 WARN L837 $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| 47) 4294967296))) (or (< .cse4 10000000) (not (< .cse4 100000000)))) (let ((.cse5 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 46) 4294967296))) (or (not (< .cse5 100000000)) (< .cse5 10000000))) (let ((.cse6 (mod (+ 41 |c_ULTIMATE.start_main_~x~0#1|) 4294967296))) (or (not (< .cse6 100000000)) (< .cse6 10000000))) (let ((.cse7 (mod (+ 53 |c_ULTIMATE.start_main_~x~0#1|) 4294967296))) (or (not (< .cse7 100000000)) (< .cse7 10000000))) (let ((.cse8 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 55) 4294967296))) (or (< .cse8 10000000) (not (< .cse8 100000000)))) (let ((.cse9 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 35) 4294967296))) (or (< .cse9 10000000) (not (< .cse9 100000000)))) (let ((.cse10 (mod (+ 40 |c_ULTIMATE.start_main_~x~0#1|) 4294967296))) (or (< .cse10 10000000) (not (< .cse10 100000000)))) (let ((.cse11 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 18) 4294967296))) (or (not (< .cse11 100000000)) (< .cse11 10000000))) (let ((.cse12 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 39) 4294967296))) (or (< .cse12 10000000) (not (< .cse12 100000000)))) (let ((.cse13 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 33) 4294967296))) (or (not (< .cse13 100000000)) (< .cse13 10000000))) (let ((.cse14 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 43) 4294967296))) (or (< .cse14 10000000) (not (< .cse14 100000000)))) (let ((.cse15 (mod (+ 23 |c_ULTIMATE.start_main_~x~0#1|) 4294967296))) (or (< .cse15 10000000) (not (< .cse15 100000000)))) (let ((.cse16 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 31) 4294967296))) (or (not (< .cse16 100000000)) (< .cse16 10000000))) (let ((.cse17 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 36) 4294967296))) (or (< .cse17 10000000) (not (< .cse17 100000000)))) (let ((.cse18 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 8) 4294967296))) (or (not (< .cse18 100000000)) (< .cse18 10000000))) (let ((.cse19 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 2) 4294967296))) (or (< .cse19 10000000) (not (< .cse19 100000000)))) (let ((.cse20 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 16) 4294967296))) (or (not (< .cse20 100000000)) (< .cse20 10000000))) (let ((.cse21 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 30) 4294967296))) (or (< .cse21 10000000) (not (< .cse21 100000000)))) (let ((.cse22 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 29) 4294967296))) (or (< .cse22 10000000) (not (< .cse22 100000000)))) (let ((.cse23 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 25) 4294967296))) (or (not (< .cse23 100000000)) (< .cse23 10000000))) (let ((.cse24 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 48) 4294967296))) (or (not (< .cse24 100000000)) (< .cse24 10000000))) (let ((.cse25 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 6) 4294967296))) (or (not (< .cse25 100000000)) (< .cse25 10000000))) (let ((.cse26 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 49) 4294967296))) (or (< .cse26 10000000) (not (< .cse26 100000000)))) (let ((.cse27 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 51) 4294967296))) (or (not (< .cse27 100000000)) (< .cse27 10000000))) (let ((.cse28 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 24) 4294967296))) (or (not (< .cse28 100000000)) (< .cse28 10000000))) (let ((.cse29 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 14) 4294967296))) (or (not (< .cse29 100000000)) (< .cse29 10000000))) (let ((.cse30 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 37) 4294967296))) (or (< .cse30 10000000) (not (< .cse30 100000000)))) (let ((.cse31 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 45) 4294967296))) (or (not (< .cse31 100000000)) (< .cse31 10000000))) (let ((.cse32 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 44) 4294967296))) (or (< .cse32 10000000) (not (< .cse32 100000000)))) (let ((.cse33 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 4) 4294967296))) (or (not (< .cse33 100000000)) (< .cse33 10000000))) (let ((.cse34 (mod |c_ULTIMATE.start_main_~x~0#1| 4294967296))) (or (not (< .cse34 100000000)) (< .cse34 10000000))) (let ((.cse35 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 34) 4294967296))) (or (not (< .cse35 100000000)) (< .cse35 10000000))) (let ((.cse36 (mod (+ 56 |c_ULTIMATE.start_main_~x~0#1|) 4294967296))) (or (not (< .cse36 100000000)) (< .cse36 10000000))) (let ((.cse37 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 42) 4294967296))) (or (< .cse37 10000000) (not (< .cse37 100000000)))) (let ((.cse38 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 54) 4294967296))) (or (< .cse38 10000000) (not (< .cse38 100000000)))) (let ((.cse39 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 27) 4294967296))) (or (< .cse39 10000000) (not (< .cse39 100000000)))) (let ((.cse40 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 52) 4294967296))) (or (< .cse40 10000000) (not (< .cse40 100000000)))) (let ((.cse41 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 12) 4294967296))) (or (not (< .cse41 100000000)) (< .cse41 10000000))) (let ((.cse42 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 20) 4294967296))) (or (not (< .cse42 100000000)) (< .cse42 10000000))) (let ((.cse43 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 38) 4294967296))) (or (not (< .cse43 100000000)) (< .cse43 10000000))) (let ((.cse44 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 50) 4294967296))) (or (not (< .cse44 100000000)) (< .cse44 10000000))) (let ((.cse45 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 26) 4294967296))) (or (< .cse45 10000000) (not (< .cse45 100000000))))) is different from false