./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_100-1loop_file-87.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 6497de01 Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_eabf0e8a-b300-4069-a284-02f0f7b22cf1/bin/uautomizer-verify-LYvppIcaGC/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_eabf0e8a-b300-4069-a284-02f0f7b22cf1/bin/uautomizer-verify-LYvppIcaGC/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_eabf0e8a-b300-4069-a284-02f0f7b22cf1/bin/uautomizer-verify-LYvppIcaGC/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_eabf0e8a-b300-4069-a284-02f0f7b22cf1/bin/uautomizer-verify-LYvppIcaGC/config/AutomizerReach.xml -i ../../sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_100-1loop_file-87.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_eabf0e8a-b300-4069-a284-02f0f7b22cf1/bin/uautomizer-verify-LYvppIcaGC/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_eabf0e8a-b300-4069-a284-02f0f7b22cf1/bin/uautomizer-verify-LYvppIcaGC --witnessprinter.witness.filename witness --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 ed6472202ab653978e4712f35b92e520ad44b668238671ae7ccc9791eea984a7 --- Real Ultimate output --- This is Ultimate 0.3.0-dev-6497de0 [2024-11-23 23:48:39,475 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-23 23:48:39,584 INFO L114 SettingsManager]: Loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_eabf0e8a-b300-4069-a284-02f0f7b22cf1/bin/uautomizer-verify-LYvppIcaGC/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-11-23 23:48:39,591 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-23 23:48:39,591 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-23 23:48:39,617 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-23 23:48:39,618 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-23 23:48:39,618 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-23 23:48:39,618 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-23 23:48:39,619 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-23 23:48:39,619 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-23 23:48:39,619 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-23 23:48:39,619 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-23 23:48:39,619 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-23 23:48:39,619 INFO L153 SettingsManager]: * Use SBE=true [2024-11-23 23:48:39,620 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-23 23:48:39,620 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-23 23:48:39,620 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-23 23:48:39,620 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-23 23:48:39,620 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-23 23:48:39,620 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-23 23:48:39,620 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-23 23:48:39,620 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-23 23:48:39,620 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-23 23:48:39,621 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-23 23:48:39,621 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-23 23:48:39,621 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2024-11-23 23:48:39,622 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-23 23:48:39,622 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2024-11-23 23:48:39,622 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-23 23:48:39,622 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-23 23:48:39,622 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-23 23:48:39,622 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-23 23:48:39,623 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-23 23:48:39,623 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-23 23:48:39,623 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-23 23:48:39,623 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-23 23:48:39,623 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-23 23:48:39,623 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-23 23:48:39,624 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-23 23:48:39,624 INFO L153 SettingsManager]: * Compute procedure contracts=false [2024-11-23 23:48:39,624 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-23 23:48:39,624 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-23 23:48:39,624 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-23 23:48:39,624 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-23 23:48:39,624 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-23 23:48:39,625 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-23 23:48:39,625 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-23 23:48:39,625 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC 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_eabf0e8a-b300-4069-a284-02f0f7b22cf1/bin/uautomizer-verify-LYvppIcaGC Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness 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 -> ed6472202ab653978e4712f35b92e520ad44b668238671ae7ccc9791eea984a7 [2024-11-23 23:48:39,982 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-23 23:48:39,994 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-23 23:48:40,000 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-23 23:48:40,003 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-23 23:48:40,003 INFO L274 PluginConnector]: CDTParser initialized [2024-11-23 23:48:40,006 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_eabf0e8a-b300-4069-a284-02f0f7b22cf1/bin/uautomizer-verify-LYvppIcaGC/../../sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_100-1loop_file-87.i [2024-11-23 23:48:43,150 INFO L533 CDTParser]: Created temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_eabf0e8a-b300-4069-a284-02f0f7b22cf1/bin/uautomizer-verify-LYvppIcaGC/data/f6b6f01d3/94724e58ad144f8bb20f34ab16e95208/FLAG05e136d6f [2024-11-23 23:48:43,512 INFO L384 CDTParser]: Found 1 translation units. [2024-11-23 23:48:43,513 INFO L180 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_eabf0e8a-b300-4069-a284-02f0f7b22cf1/sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_100-1loop_file-87.i [2024-11-23 23:48:43,528 INFO L427 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_eabf0e8a-b300-4069-a284-02f0f7b22cf1/bin/uautomizer-verify-LYvppIcaGC/data/f6b6f01d3/94724e58ad144f8bb20f34ab16e95208/FLAG05e136d6f [2024-11-23 23:48:43,553 INFO L435 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_eabf0e8a-b300-4069-a284-02f0f7b22cf1/bin/uautomizer-verify-LYvppIcaGC/data/f6b6f01d3/94724e58ad144f8bb20f34ab16e95208 [2024-11-23 23:48:43,559 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-23 23:48:43,561 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-23 23:48:43,563 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-23 23:48:43,565 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-23 23:48:43,574 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-23 23:48:43,575 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.11 11:48:43" (1/1) ... [2024-11-23 23:48:43,579 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3b50b7b4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 11:48:43, skipping insertion in model container [2024-11-23 23:48:43,579 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.11 11:48:43" (1/1) ... [2024-11-23 23:48:43,617 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-23 23:48:43,832 WARN L250 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_eabf0e8a-b300-4069-a284-02f0f7b22cf1/sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_100-1loop_file-87.i[916,929] [2024-11-23 23:48:43,988 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-23 23:48:44,007 INFO L200 MainTranslator]: Completed pre-run [2024-11-23 23:48:44,020 WARN L250 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_eabf0e8a-b300-4069-a284-02f0f7b22cf1/sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_100-1loop_file-87.i[916,929] [2024-11-23 23:48:44,076 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-23 23:48:44,097 INFO L204 MainTranslator]: Completed translation [2024-11-23 23:48:44,097 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 11:48:44 WrapperNode [2024-11-23 23:48:44,098 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-23 23:48:44,099 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-23 23:48:44,099 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-23 23:48:44,099 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-23 23:48:44,106 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 11:48:44" (1/1) ... [2024-11-23 23:48:44,123 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 11:48:44" (1/1) ... [2024-11-23 23:48:44,200 INFO L138 Inliner]: procedures = 26, calls = 47, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 220 [2024-11-23 23:48:44,201 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-23 23:48:44,201 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-23 23:48:44,203 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-23 23:48:44,204 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-23 23:48:44,215 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 11:48:44" (1/1) ... [2024-11-23 23:48:44,216 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 11:48:44" (1/1) ... [2024-11-23 23:48:44,220 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 11:48:44" (1/1) ... [2024-11-23 23:48:44,247 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2024-11-23 23:48:44,247 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 11:48:44" (1/1) ... [2024-11-23 23:48:44,247 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 11:48:44" (1/1) ... [2024-11-23 23:48:44,273 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 11:48:44" (1/1) ... [2024-11-23 23:48:44,276 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 11:48:44" (1/1) ... [2024-11-23 23:48:44,286 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 11:48:44" (1/1) ... [2024-11-23 23:48:44,296 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 11:48:44" (1/1) ... [2024-11-23 23:48:44,298 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 11:48:44" (1/1) ... [2024-11-23 23:48:44,314 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-23 23:48:44,315 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-23 23:48:44,317 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-23 23:48:44,317 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-23 23:48:44,318 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 11:48:44" (1/1) ... [2024-11-23 23:48:44,326 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-23 23:48:44,342 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_eabf0e8a-b300-4069-a284-02f0f7b22cf1/bin/uautomizer-verify-LYvppIcaGC/z3 [2024-11-23 23:48:44,362 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_eabf0e8a-b300-4069-a284-02f0f7b22cf1/bin/uautomizer-verify-LYvppIcaGC/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-11-23 23:48:44,368 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_eabf0e8a-b300-4069-a284-02f0f7b22cf1/bin/uautomizer-verify-LYvppIcaGC/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-11-23 23:48:44,403 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-23 23:48:44,403 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-11-23 23:48:44,403 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-11-23 23:48:44,404 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-11-23 23:48:44,404 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-23 23:48:44,404 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-23 23:48:44,540 INFO L234 CfgBuilder]: Building ICFG [2024-11-23 23:48:44,545 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-23 23:48:45,235 INFO L? ?]: Removed 33 outVars from TransFormulas that were not future-live. [2024-11-23 23:48:45,235 INFO L283 CfgBuilder]: Performing block encoding [2024-11-23 23:48:45,253 INFO L307 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-23 23:48:45,256 INFO L312 CfgBuilder]: Removed 1 assume(true) statements. [2024-11-23 23:48:45,257 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 11:48:45 BoogieIcfgContainer [2024-11-23 23:48:45,257 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-23 23:48:45,260 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-23 23:48:45,260 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-23 23:48:45,267 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-23 23:48:45,267 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 23.11 11:48:43" (1/3) ... [2024-11-23 23:48:45,268 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@385d3eba and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 23.11 11:48:45, skipping insertion in model container [2024-11-23 23:48:45,269 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 11:48:44" (2/3) ... [2024-11-23 23:48:45,270 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@385d3eba and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 23.11 11:48:45, skipping insertion in model container [2024-11-23 23:48:45,270 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 11:48:45" (3/3) ... [2024-11-23 23:48:45,273 INFO L128 eAbstractionObserver]: Analyzing ICFG hardness_loopvsstraightlinecode_100-1loop_file-87.i [2024-11-23 23:48:45,294 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-23 23:48:45,296 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG hardness_loopvsstraightlinecode_100-1loop_file-87.i that has 2 procedures, 93 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2024-11-23 23:48:45,372 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-23 23:48:45,390 INFO L333 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, mAutomataTypeConcurrency=PETRI_NET, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopHeads, 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;@7ea93494, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-23 23:48:45,390 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-23 23:48:45,395 INFO L276 IsEmpty]: Start isEmpty. Operand has 93 states, 56 states have (on average 1.3571428571428572) internal successors, (76), 57 states have internal predecessors, (76), 34 states have call successors, (34), 1 states have call predecessors, (34), 1 states have return successors, (34), 34 states have call predecessors, (34), 34 states have call successors, (34) [2024-11-23 23:48:45,414 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 215 [2024-11-23 23:48:45,415 INFO L210 NwaCegarLoop]: Found error trace [2024-11-23 23:48:45,416 INFO L218 NwaCegarLoop]: trace histogram [34, 34, 34, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-23 23:48:45,416 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-23 23:48:45,423 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-23 23:48:45,424 INFO L85 PathProgramCache]: Analyzing trace with hash -1589540101, now seen corresponding path program 1 times [2024-11-23 23:48:45,434 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-23 23:48:45,435 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [629355357] [2024-11-23 23:48:45,436 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-23 23:48:45,437 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-23 23:48:45,606 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-23 23:48:45,968 INFO L134 CoverageAnalysis]: Checked inductivity of 2244 backedges. 0 proven. 66 refuted. 0 times theorem prover too weak. 2178 trivial. 0 not checked. [2024-11-23 23:48:45,969 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-23 23:48:45,969 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [629355357] [2024-11-23 23:48:45,969 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [629355357] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-23 23:48:45,969 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1374321237] [2024-11-23 23:48:45,970 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-23 23:48:45,974 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-23 23:48:45,974 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_eabf0e8a-b300-4069-a284-02f0f7b22cf1/bin/uautomizer-verify-LYvppIcaGC/z3 [2024-11-23 23:48:45,979 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_eabf0e8a-b300-4069-a284-02f0f7b22cf1/bin/uautomizer-verify-LYvppIcaGC/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-23 23:48:45,982 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_eabf0e8a-b300-4069-a284-02f0f7b22cf1/bin/uautomizer-verify-LYvppIcaGC/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2024-11-23 23:48:46,363 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-23 23:48:46,370 INFO L256 TraceCheckSpWp]: Trace formula consists of 512 conjuncts, 1 conjuncts are in the unsatisfiable core [2024-11-23 23:48:46,386 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-23 23:48:46,456 INFO L134 CoverageAnalysis]: Checked inductivity of 2244 backedges. 66 proven. 0 refuted. 0 times theorem prover too weak. 2178 trivial. 0 not checked. [2024-11-23 23:48:46,456 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-23 23:48:46,456 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1374321237] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-23 23:48:46,456 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-23 23:48:46,457 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [2] total 2 [2024-11-23 23:48:46,459 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [579177800] [2024-11-23 23:48:46,460 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-23 23:48:46,464 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-11-23 23:48:46,465 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-23 23:48:46,491 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-11-23 23:48:46,491 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-23 23:48:46,494 INFO L87 Difference]: Start difference. First operand has 93 states, 56 states have (on average 1.3571428571428572) internal successors, (76), 57 states have internal predecessors, (76), 34 states have call successors, (34), 1 states have call predecessors, (34), 1 states have return successors, (34), 34 states have call predecessors, (34), 34 states have call successors, (34) Second operand has 2 states, 2 states have (on average 24.5) internal successors, (49), 2 states have internal predecessors, (49), 2 states have call successors, (34), 2 states have call predecessors, (34), 1 states have return successors, (34), 1 states have call predecessors, (34), 2 states have call successors, (34) [2024-11-23 23:48:46,546 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-23 23:48:46,546 INFO L93 Difference]: Finished difference Result 183 states and 319 transitions. [2024-11-23 23:48:46,550 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-23 23:48:46,552 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 24.5) internal successors, (49), 2 states have internal predecessors, (49), 2 states have call successors, (34), 2 states have call predecessors, (34), 1 states have return successors, (34), 1 states have call predecessors, (34), 2 states have call successors, (34) Word has length 214 [2024-11-23 23:48:46,552 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-23 23:48:46,561 INFO L225 Difference]: With dead ends: 183 [2024-11-23 23:48:46,562 INFO L226 Difference]: Without dead ends: 89 [2024-11-23 23:48:46,567 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 215 GetRequests, 215 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-23 23:48:46,572 INFO L435 NwaCegarLoop]: 141 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, 141 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 [2024-11-23 23:48:46,573 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 141 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-23 23:48:46,591 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 89 states. [2024-11-23 23:48:46,626 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 89 to 89. [2024-11-23 23:48:46,627 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 89 states, 53 states have (on average 1.3018867924528301) internal successors, (69), 53 states have internal predecessors, (69), 34 states have call successors, (34), 1 states have call predecessors, (34), 1 states have return successors, (34), 34 states have call predecessors, (34), 34 states have call successors, (34) [2024-11-23 23:48:46,634 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 89 states to 89 states and 137 transitions. [2024-11-23 23:48:46,636 INFO L78 Accepts]: Start accepts. Automaton has 89 states and 137 transitions. Word has length 214 [2024-11-23 23:48:46,636 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-23 23:48:46,637 INFO L471 AbstractCegarLoop]: Abstraction has 89 states and 137 transitions. [2024-11-23 23:48:46,637 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 24.5) internal successors, (49), 2 states have internal predecessors, (49), 2 states have call successors, (34), 2 states have call predecessors, (34), 1 states have return successors, (34), 1 states have call predecessors, (34), 2 states have call successors, (34) [2024-11-23 23:48:46,637 INFO L276 IsEmpty]: Start isEmpty. Operand 89 states and 137 transitions. [2024-11-23 23:48:46,642 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 215 [2024-11-23 23:48:46,643 INFO L210 NwaCegarLoop]: Found error trace [2024-11-23 23:48:46,643 INFO L218 NwaCegarLoop]: trace histogram [34, 34, 34, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-23 23:48:46,655 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_eabf0e8a-b300-4069-a284-02f0f7b22cf1/bin/uautomizer-verify-LYvppIcaGC/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2024-11-23 23:48:46,844 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_eabf0e8a-b300-4069-a284-02f0f7b22cf1/bin/uautomizer-verify-LYvppIcaGC/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable0 [2024-11-23 23:48:46,844 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-23 23:48:46,845 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-23 23:48:46,845 INFO L85 PathProgramCache]: Analyzing trace with hash 197666867, now seen corresponding path program 1 times [2024-11-23 23:48:46,845 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-23 23:48:46,846 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [401409858] [2024-11-23 23:48:46,846 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-23 23:48:46,846 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-23 23:48:47,543 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-23 23:48:48,521 INFO L134 CoverageAnalysis]: Checked inductivity of 2244 backedges. 45 proven. 54 refuted. 0 times theorem prover too weak. 2145 trivial. 0 not checked. [2024-11-23 23:48:48,524 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-23 23:48:48,525 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [401409858] [2024-11-23 23:48:48,525 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [401409858] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-23 23:48:48,525 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1367007017] [2024-11-23 23:48:48,525 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-23 23:48:48,525 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-23 23:48:48,525 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_eabf0e8a-b300-4069-a284-02f0f7b22cf1/bin/uautomizer-verify-LYvppIcaGC/z3 [2024-11-23 23:48:48,532 INFO L229 MonitoredProcess]: Starting monitored process 3 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_eabf0e8a-b300-4069-a284-02f0f7b22cf1/bin/uautomizer-verify-LYvppIcaGC/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-23 23:48:48,535 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_eabf0e8a-b300-4069-a284-02f0f7b22cf1/bin/uautomizer-verify-LYvppIcaGC/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2024-11-23 23:48:48,866 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-23 23:48:48,869 INFO L256 TraceCheckSpWp]: Trace formula consists of 512 conjuncts, 6 conjuncts are in the unsatisfiable core [2024-11-23 23:48:48,882 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-23 23:48:49,350 INFO L134 CoverageAnalysis]: Checked inductivity of 2244 backedges. 1143 proven. 54 refuted. 0 times theorem prover too weak. 1047 trivial. 0 not checked. [2024-11-23 23:48:49,353 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2024-11-23 23:48:49,850 INFO L134 CoverageAnalysis]: Checked inductivity of 2244 backedges. 45 proven. 54 refuted. 0 times theorem prover too weak. 2145 trivial. 0 not checked. [2024-11-23 23:48:49,850 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1367007017] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-23 23:48:49,850 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-23 23:48:49,851 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 7 [2024-11-23 23:48:49,851 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1376381311] [2024-11-23 23:48:49,851 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-23 23:48:49,852 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-23 23:48:49,853 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-23 23:48:49,854 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-23 23:48:49,854 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2024-11-23 23:48:49,854 INFO L87 Difference]: Start difference. First operand 89 states and 137 transitions. Second operand has 7 states, 7 states have (on average 8.0) internal successors, (56), 7 states have internal predecessors, (56), 2 states have call successors, (52), 2 states have call predecessors, (52), 4 states have return successors, (53), 2 states have call predecessors, (53), 2 states have call successors, (53) [2024-11-23 23:48:50,296 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-23 23:48:50,297 INFO L93 Difference]: Finished difference Result 183 states and 278 transitions. [2024-11-23 23:48:50,298 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-11-23 23:48:50,299 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 8.0) internal successors, (56), 7 states have internal predecessors, (56), 2 states have call successors, (52), 2 states have call predecessors, (52), 4 states have return successors, (53), 2 states have call predecessors, (53), 2 states have call successors, (53) Word has length 214 [2024-11-23 23:48:50,300 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-23 23:48:50,305 INFO L225 Difference]: With dead ends: 183 [2024-11-23 23:48:50,305 INFO L226 Difference]: Without dead ends: 97 [2024-11-23 23:48:50,306 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 435 GetRequests, 425 SyntacticMatches, 1 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=45, Invalid=65, Unknown=0, NotChecked=0, Total=110 [2024-11-23 23:48:50,307 INFO L435 NwaCegarLoop]: 98 mSDtfsCounter, 157 mSDsluCounter, 126 mSDsCounter, 0 mSdLazyCounter, 186 mSolverCounterSat, 58 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 171 SdHoareTripleChecker+Valid, 224 SdHoareTripleChecker+Invalid, 244 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 58 IncrementalHoareTripleChecker+Valid, 186 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-11-23 23:48:50,307 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [171 Valid, 224 Invalid, 244 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [58 Valid, 186 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-11-23 23:48:50,311 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 97 states. [2024-11-23 23:48:50,344 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 97 to 93. [2024-11-23 23:48:50,346 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 93 states, 56 states have (on average 1.2678571428571428) internal successors, (71), 56 states have internal predecessors, (71), 34 states have call successors, (34), 2 states have call predecessors, (34), 2 states have return successors, (34), 34 states have call predecessors, (34), 34 states have call successors, (34) [2024-11-23 23:48:50,349 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 93 states to 93 states and 139 transitions. [2024-11-23 23:48:50,350 INFO L78 Accepts]: Start accepts. Automaton has 93 states and 139 transitions. Word has length 214 [2024-11-23 23:48:50,352 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-23 23:48:50,353 INFO L471 AbstractCegarLoop]: Abstraction has 93 states and 139 transitions. [2024-11-23 23:48:50,353 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 8.0) internal successors, (56), 7 states have internal predecessors, (56), 2 states have call successors, (52), 2 states have call predecessors, (52), 4 states have return successors, (53), 2 states have call predecessors, (53), 2 states have call successors, (53) [2024-11-23 23:48:50,353 INFO L276 IsEmpty]: Start isEmpty. Operand 93 states and 139 transitions. [2024-11-23 23:48:50,360 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 215 [2024-11-23 23:48:50,361 INFO L210 NwaCegarLoop]: Found error trace [2024-11-23 23:48:50,361 INFO L218 NwaCegarLoop]: trace histogram [34, 34, 34, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-23 23:48:50,375 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_eabf0e8a-b300-4069-a284-02f0f7b22cf1/bin/uautomizer-verify-LYvppIcaGC/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2024-11-23 23:48:50,562 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1,3 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_eabf0e8a-b300-4069-a284-02f0f7b22cf1/bin/uautomizer-verify-LYvppIcaGC/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-23 23:48:50,562 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-23 23:48:50,563 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-23 23:48:50,563 INFO L85 PathProgramCache]: Analyzing trace with hash -823401487, now seen corresponding path program 1 times [2024-11-23 23:48:50,563 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-23 23:48:50,563 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [227664619] [2024-11-23 23:48:50,563 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-23 23:48:50,563 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-23 23:48:50,926 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-23 23:48:53,031 INFO L134 CoverageAnalysis]: Checked inductivity of 2244 backedges. 132 proven. 60 refuted. 0 times theorem prover too weak. 2052 trivial. 0 not checked. [2024-11-23 23:48:53,031 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-23 23:48:53,031 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [227664619] [2024-11-23 23:48:53,031 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [227664619] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-23 23:48:53,032 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [570423084] [2024-11-23 23:48:53,032 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-23 23:48:53,032 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-23 23:48:53,032 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_eabf0e8a-b300-4069-a284-02f0f7b22cf1/bin/uautomizer-verify-LYvppIcaGC/z3 [2024-11-23 23:48:53,034 INFO L229 MonitoredProcess]: Starting monitored process 4 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_eabf0e8a-b300-4069-a284-02f0f7b22cf1/bin/uautomizer-verify-LYvppIcaGC/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-23 23:48:53,038 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_eabf0e8a-b300-4069-a284-02f0f7b22cf1/bin/uautomizer-verify-LYvppIcaGC/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2024-11-23 23:48:53,277 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-23 23:48:53,284 INFO L256 TraceCheckSpWp]: Trace formula consists of 511 conjuncts, 17 conjuncts are in the unsatisfiable core [2024-11-23 23:48:53,290 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-23 23:48:53,872 INFO L134 CoverageAnalysis]: Checked inductivity of 2244 backedges. 1229 proven. 60 refuted. 0 times theorem prover too weak. 955 trivial. 0 not checked. [2024-11-23 23:48:53,872 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2024-11-23 23:48:54,579 INFO L134 CoverageAnalysis]: Checked inductivity of 2244 backedges. 132 proven. 63 refuted. 0 times theorem prover too weak. 2049 trivial. 0 not checked. [2024-11-23 23:48:54,579 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [570423084] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-23 23:48:54,579 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-23 23:48:54,580 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 10, 10] total 19 [2024-11-23 23:48:54,580 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [281627180] [2024-11-23 23:48:54,580 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-23 23:48:54,581 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2024-11-23 23:48:54,581 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-23 23:48:54,583 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2024-11-23 23:48:54,583 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=91, Invalid=251, Unknown=0, NotChecked=0, Total=342 [2024-11-23 23:48:54,584 INFO L87 Difference]: Start difference. First operand 93 states and 139 transitions. Second operand has 19 states, 19 states have (on average 3.8947368421052633) internal successors, (74), 19 states have internal predecessors, (74), 4 states have call successors, (55), 3 states have call predecessors, (55), 7 states have return successors, (57), 4 states have call predecessors, (57), 4 states have call successors, (57) [2024-11-23 23:48:56,114 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-23 23:48:56,114 INFO L93 Difference]: Finished difference Result 307 states and 445 transitions. [2024-11-23 23:48:56,115 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2024-11-23 23:48:56,118 INFO L78 Accepts]: Start accepts. Automaton has has 19 states, 19 states have (on average 3.8947368421052633) internal successors, (74), 19 states have internal predecessors, (74), 4 states have call successors, (55), 3 states have call predecessors, (55), 7 states have return successors, (57), 4 states have call predecessors, (57), 4 states have call successors, (57) Word has length 214 [2024-11-23 23:48:56,119 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-23 23:48:56,121 INFO L225 Difference]: With dead ends: 307 [2024-11-23 23:48:56,121 INFO L226 Difference]: Without dead ends: 217 [2024-11-23 23:48:56,127 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 451 GetRequests, 419 SyntacticMatches, 1 SemanticMatches, 31 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 230 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=287, Invalid=769, Unknown=0, NotChecked=0, Total=1056 [2024-11-23 23:48:56,128 INFO L435 NwaCegarLoop]: 118 mSDtfsCounter, 622 mSDsluCounter, 439 mSDsCounter, 0 mSdLazyCounter, 566 mSolverCounterSat, 366 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 667 SdHoareTripleChecker+Valid, 557 SdHoareTripleChecker+Invalid, 932 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 366 IncrementalHoareTripleChecker+Valid, 566 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2024-11-23 23:48:56,128 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [667 Valid, 557 Invalid, 932 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [366 Valid, 566 Invalid, 0 Unknown, 0 Unchecked, 1.1s Time] [2024-11-23 23:48:56,129 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 217 states. [2024-11-23 23:48:56,189 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 217 to 186. [2024-11-23 23:48:56,190 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 186 states, 112 states have (on average 1.2232142857142858) internal successors, (137), 113 states have internal predecessors, (137), 66 states have call successors, (66), 7 states have call predecessors, (66), 7 states have return successors, (66), 65 states have call predecessors, (66), 66 states have call successors, (66) [2024-11-23 23:48:56,195 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 186 states to 186 states and 269 transitions. [2024-11-23 23:48:56,196 INFO L78 Accepts]: Start accepts. Automaton has 186 states and 269 transitions. Word has length 214 [2024-11-23 23:48:56,197 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-23 23:48:56,197 INFO L471 AbstractCegarLoop]: Abstraction has 186 states and 269 transitions. [2024-11-23 23:48:56,198 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 19 states, 19 states have (on average 3.8947368421052633) internal successors, (74), 19 states have internal predecessors, (74), 4 states have call successors, (55), 3 states have call predecessors, (55), 7 states have return successors, (57), 4 states have call predecessors, (57), 4 states have call successors, (57) [2024-11-23 23:48:56,198 INFO L276 IsEmpty]: Start isEmpty. Operand 186 states and 269 transitions. [2024-11-23 23:48:56,205 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 215 [2024-11-23 23:48:56,206 INFO L210 NwaCegarLoop]: Found error trace [2024-11-23 23:48:56,206 INFO L218 NwaCegarLoop]: trace histogram [34, 34, 34, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-23 23:48:56,220 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_eabf0e8a-b300-4069-a284-02f0f7b22cf1/bin/uautomizer-verify-LYvppIcaGC/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2024-11-23 23:48:56,408 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2,4 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_eabf0e8a-b300-4069-a284-02f0f7b22cf1/bin/uautomizer-verify-LYvppIcaGC/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-23 23:48:56,408 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-23 23:48:56,409 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-23 23:48:56,409 INFO L85 PathProgramCache]: Analyzing trace with hash 1477421103, now seen corresponding path program 1 times [2024-11-23 23:48:56,409 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-23 23:48:56,409 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2050971303] [2024-11-23 23:48:56,409 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-23 23:48:56,410 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-23 23:48:56,918 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2024-11-23 23:48:56,923 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1546300586] [2024-11-23 23:48:56,923 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-23 23:48:56,923 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-23 23:48:56,923 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_eabf0e8a-b300-4069-a284-02f0f7b22cf1/bin/uautomizer-verify-LYvppIcaGC/z3 [2024-11-23 23:48:56,926 INFO L229 MonitoredProcess]: Starting monitored process 5 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_eabf0e8a-b300-4069-a284-02f0f7b22cf1/bin/uautomizer-verify-LYvppIcaGC/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-23 23:48:56,930 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_eabf0e8a-b300-4069-a284-02f0f7b22cf1/bin/uautomizer-verify-LYvppIcaGC/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2024-11-23 23:48:57,250 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-23 23:48:57,259 INFO L256 TraceCheckSpWp]: Trace formula consists of 514 conjuncts, 65 conjuncts are in the unsatisfiable core [2024-11-23 23:48:57,270 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-23 23:49:09,792 INFO L134 CoverageAnalysis]: Checked inductivity of 2244 backedges. 1755 proven. 261 refuted. 0 times theorem prover too weak. 228 trivial. 0 not checked. [2024-11-23 23:49:09,793 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2024-11-23 23:49:23,941 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse13 (= (mod c_~var_1_22~0 c_~var_1_5~0) 0)) (.cse17 (+ c_~var_1_5~0 1)) (.cse8 (div c_~var_1_22~0 c_~var_1_5~0)) (.cse0 (+ |c_ULTIMATE.start_step_~stepLocal_0~0#1| 1))) (let ((.cse6 (forall ((~var_1_6~0 Int)) (or (< |c_ULTIMATE.start_step_~stepLocal_0~0#1| (div c_~var_1_22~0 ~var_1_6~0)) (< c_~var_1_5~0 ~var_1_6~0) (< ~var_1_6~0 0)))) (.cse2 (< c_~var_1_22~0 0)) (.cse4 (forall ((~var_1_6~0 Int)) (let ((.cse31 (div c_~var_1_22~0 ~var_1_6~0))) (or (< .cse0 .cse31) (= .cse31 .cse0) (< 0 (+ ~var_1_6~0 1)))))) (.cse9 (forall ((~var_1_6~0 Int)) (let ((.cse30 (div c_~var_1_22~0 ~var_1_6~0))) (or (< .cse0 .cse30) (< c_~var_1_5~0 ~var_1_6~0) (= .cse30 .cse0))))) (.cse12 (forall ((~var_1_6~0 Int)) (or (< c_~var_1_5~0 ~var_1_6~0) (< |c_ULTIMATE.start_step_~stepLocal_0~0#1| (+ (div c_~var_1_22~0 ~var_1_6~0) 1)) (< ~var_1_6~0 0)))) (.cse7 (< 0 (+ c_~var_1_22~0 1))) (.cse21 (< .cse0 .cse8)) (.cse19 (< 0 .cse17)) (.cse5 (< c_~var_1_5~0 0)) (.cse10 (not .cse13)) (.cse11 (< |c_ULTIMATE.start_step_~stepLocal_0~0#1| .cse8)) (.cse14 (= |c_ULTIMATE.start_step_~stepLocal_0~0#1| .cse8)) (.cse16 (< |c_ULTIMATE.start_step_~stepLocal_0~0#1| (+ .cse8 1)))) (and (forall ((~var_1_6~0 Int)) (let ((.cse1 (div c_~var_1_22~0 ~var_1_6~0))) (or (< .cse0 .cse1) (< c_~var_1_5~0 ~var_1_6~0) (= .cse1 .cse0) (< 0 (+ ~var_1_6~0 1))))) (or (forall ((~var_1_6~0 Int)) (or (< |c_ULTIMATE.start_step_~stepLocal_0~0#1| (div c_~var_1_22~0 ~var_1_6~0)) (< c_~var_1_5~0 ~var_1_6~0))) .cse2) (forall ((~var_1_6~0 Int)) (let ((.cse3 (div c_~var_1_22~0 ~var_1_6~0))) (or (< .cse0 .cse3) (< c_~var_1_5~0 ~var_1_6~0) (= .cse3 .cse0) (not (= (mod c_~var_1_22~0 ~var_1_6~0) 0))))) (or (and .cse4 (or (forall ((~var_1_6~0 Int)) (or (< |c_ULTIMATE.start_step_~stepLocal_0~0#1| (div c_~var_1_22~0 ~var_1_6~0)) (< 0 (+ ~var_1_6~0 1)))) .cse2)) .cse5) (or .cse2 .cse6) (or .cse7 (forall ((~var_1_6~0 Int)) (or (< .cse0 (div c_~var_1_22~0 ~var_1_6~0)) (< 0 (+ ~var_1_6~0 1)) (= (mod c_~var_1_22~0 ~var_1_6~0) 0)))) (or (and (<= .cse0 .cse8) .cse6) .cse2) (or .cse2 .cse9) (or .cse7 (forall ((~var_1_6~0 Int)) (or (< c_~var_1_5~0 ~var_1_6~0) (< |c_ULTIMATE.start_step_~stepLocal_0~0#1| (+ (div c_~var_1_22~0 ~var_1_6~0) 1)) (= (mod c_~var_1_22~0 ~var_1_6~0) 0)))) (forall ((~var_1_6~0 Int)) (or (< |c_ULTIMATE.start_step_~stepLocal_0~0#1| (div c_~var_1_22~0 ~var_1_6~0)) (< c_~var_1_5~0 ~var_1_6~0) (not (= (mod c_~var_1_22~0 ~var_1_6~0) 0)) (< ~var_1_6~0 0))) (or .cse5 .cse10 .cse4) (or .cse5 (let ((.cse15 (and (forall ((~var_1_6~0 Int)) (or (< |c_ULTIMATE.start_step_~stepLocal_0~0#1| (div c_~var_1_22~0 ~var_1_6~0)) (not (= (mod c_~var_1_22~0 ~var_1_6~0) 0)) (< ~var_1_6~0 0))) (forall ((~var_1_6~0 Int)) (or (< ~var_1_6~0 .cse17) (not (= (mod c_~var_1_22~0 ~var_1_6~0) 0))))))) (and (or .cse10 .cse11 .cse12) (or .cse10 .cse11) (or .cse7 .cse13 .cse12) (or (and .cse14 .cse12) .cse11) (or .cse15 .cse16) (or .cse15 .cse11 .cse2) (or .cse15 .cse10 .cse11)))) (forall ((~var_1_6~0 Int)) (or (< |c_ULTIMATE.start_step_~stepLocal_0~0#1| (div c_~var_1_22~0 ~var_1_6~0)) (< c_~var_1_5~0 ~var_1_6~0) (not (= (mod c_~var_1_22~0 ~var_1_6~0) 0)) (< 0 (+ ~var_1_6~0 1)))) (forall ((~var_1_6~0 Int)) (or (< c_~var_1_5~0 ~var_1_6~0) (< |c_ULTIMATE.start_step_~stepLocal_0~0#1| (+ (div c_~var_1_22~0 ~var_1_6~0) 1)))) (or (forall ((~var_1_6~0 Int)) (or (< |c_ULTIMATE.start_step_~stepLocal_0~0#1| (div c_~var_1_22~0 ~var_1_6~0)) (< c_~var_1_5~0 ~var_1_6~0) (< 0 (+ ~var_1_6~0 1)))) .cse2) (forall ((~var_1_6~0 Int)) (let ((.cse18 (div c_~var_1_22~0 ~var_1_6~0))) (or (< |c_ULTIMATE.start_step_~stepLocal_0~0#1| .cse18) (< c_~var_1_5~0 ~var_1_6~0) (= .cse18 |c_ULTIMATE.start_step_~stepLocal_0~0#1|) (< ~var_1_6~0 0)))) (or .cse19 .cse9) (or .cse19 (and (or .cse7 .cse13 .cse4) .cse9)) (forall ((~var_1_6~0 Int)) (or (< |c_ULTIMATE.start_step_~stepLocal_0~0#1| (div c_~var_1_22~0 ~var_1_6~0)) (< c_~var_1_5~0 ~var_1_6~0) (not (= (mod c_~var_1_22~0 ~var_1_6~0) 0)))) (or .cse5 (forall ((~var_1_6~0 Int)) (let ((.cse20 (div c_~var_1_22~0 ~var_1_6~0))) (or (< |c_ULTIMATE.start_step_~stepLocal_0~0#1| .cse20) (< c_~var_1_5~0 ~var_1_6~0) (= .cse20 |c_ULTIMATE.start_step_~stepLocal_0~0#1|))))) (or .cse21 (let ((.cse23 (= .cse8 .cse0)) (.cse22 (forall ((~var_1_6~0 Int)) (or (< |c_ULTIMATE.start_step_~stepLocal_0~0#1| (+ (div c_~var_1_22~0 ~var_1_6~0) 1)) (< ~var_1_6~0 0))))) (and (or (and (or .cse22 .cse23) (or .cse7 .cse13 .cse22)) .cse19) (or .cse23 (and (or .cse10 .cse22) (or .cse22 .cse16))) (or .cse10 .cse23) .cse12 (or .cse13 .cse22 .cse16) (or .cse7 .cse19 .cse13)))) (or (forall ((~var_1_6~0 Int)) (or (< |c_ULTIMATE.start_step_~stepLocal_0~0#1| (div c_~var_1_22~0 ~var_1_6~0)) (not (= (mod c_~var_1_22~0 ~var_1_6~0) 0)) (< 0 (+ ~var_1_6~0 1)))) .cse5) (or .cse7 (let ((.cse27 (forall ((~var_1_6~0 Int)) (or (< |c_ULTIMATE.start_step_~stepLocal_0~0#1| (+ (div c_~var_1_22~0 ~var_1_6~0) 1)) (= (mod c_~var_1_22~0 ~var_1_6~0) 0) (< ~var_1_6~0 0))))) (let ((.cse26 (forall ((~var_1_6~0 Int)) (or (= (mod c_~var_1_22~0 ~var_1_6~0) 0) (< ~var_1_6~0 0)))) (.cse25 (forall ((~var_1_6~0 Int)) (or (< ~var_1_6~0 .cse17) (= (mod c_~var_1_22~0 ~var_1_6~0) 0) (< ~var_1_6~0 0)))) (.cse24 (or .cse16 .cse27)) (.cse28 (or .cse14 .cse27))) (and (or (and .cse24 (or .cse25 .cse16) (or .cse19 (and (or .cse26 .cse21) (or .cse21 .cse27)))) .cse13) (or (and .cse25 .cse27 (or .cse26 .cse19)) .cse10 .cse11) (or .cse11 (and .cse28 (or .cse25 (and .cse10 .cse14 (<= 0 c_~var_1_5~0))) (or .cse10 .cse27) (or .cse19 .cse27))) (or .cse5 (let ((.cse29 (forall ((~var_1_6~0 Int)) (or (< ~var_1_6~0 .cse17) (= (mod c_~var_1_22~0 ~var_1_6~0) 0))))) (and (or (and .cse24 (or .cse16 .cse29)) .cse13) (or (and .cse28 (or .cse14 .cse29)) .cse11) (or .cse10 .cse11 (and .cse27 .cse29))))) (forall ((~var_1_6~0 Int)) (or (< c_~var_1_5~0 ~var_1_6~0) (< |c_ULTIMATE.start_step_~stepLocal_0~0#1| (+ (div c_~var_1_22~0 ~var_1_6~0) 1)) (= (mod c_~var_1_22~0 ~var_1_6~0) 0) (< ~var_1_6~0 0)))))))))) is different from false [2024-11-23 23:49:30,487 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse1 (+ c_~var_1_25~0 c_~var_1_22~0 1)) (.cse15 (+ c_~var_1_5~0 1)) (.cse17 (= (mod c_~var_1_22~0 c_~var_1_5~0) 0)) (.cse0 (+ c_~var_1_25~0 c_~var_1_22~0)) (.cse2 (div c_~var_1_22~0 c_~var_1_5~0))) (let ((.cse13 (< .cse0 (+ .cse2 1))) (.cse9 (< .cse0 .cse2)) (.cse3 (forall ((~var_1_6~0 Int)) (or (< c_~var_1_5~0 ~var_1_6~0) (< .cse0 (div c_~var_1_22~0 ~var_1_6~0)) (< ~var_1_6~0 0)))) (.cse4 (< c_~var_1_22~0 0)) (.cse19 (forall ((~var_1_6~0 Int)) (or (< c_~var_1_5~0 ~var_1_6~0) (< .cse0 (div c_~var_1_22~0 ~var_1_6~0))))) (.cse11 (not .cse17)) (.cse16 (< c_~var_1_5~0 0)) (.cse20 (forall ((~var_1_6~0 Int)) (or (< 0 (+ ~var_1_6~0 1)) (< .cse0 (div c_~var_1_22~0 ~var_1_6~0))))) (.cse5 (< 0 (+ c_~var_1_22~0 1))) (.cse8 (< 0 .cse15)) (.cse18 (< .cse1 .cse2))) (and (forall ((~var_1_6~0 Int)) (or (< c_~var_1_5~0 ~var_1_6~0) (< .cse0 (+ (div c_~var_1_22~0 ~var_1_6~0) 1)) (< ~var_1_6~0 0))) (or (and (<= .cse1 .cse2) .cse3) .cse4) (forall ((~var_1_6~0 Int)) (or (< c_~var_1_5~0 ~var_1_6~0) (not (= (mod c_~var_1_22~0 ~var_1_6~0) 0)) (< .cse0 (div c_~var_1_22~0 ~var_1_6~0)))) (or .cse5 (let ((.cse12 (forall ((~var_1_6~0 Int)) (or (< .cse0 (+ (div c_~var_1_22~0 ~var_1_6~0) 1)) (= (mod c_~var_1_22~0 ~var_1_6~0) 0) (< ~var_1_6~0 0))))) (let ((.cse6 (or .cse9 .cse12)) (.cse7 (forall ((~var_1_6~0 Int)) (or (= (mod c_~var_1_22~0 ~var_1_6~0) 0) (< ~var_1_6~0 0)))) (.cse10 (forall ((~var_1_6~0 Int)) (or (< ~var_1_6~0 .cse15) (= (mod c_~var_1_22~0 ~var_1_6~0) 0) (< ~var_1_6~0 0))))) (and (or (and .cse6 (or .cse7 .cse8 .cse9) (or .cse9 .cse10)) .cse11) (or (and (<= .cse0 .cse2) (or .cse8 .cse9)) .cse10) (or .cse11 .cse9 .cse12) (or .cse13 .cse12) (forall ((~var_1_6~0 Int)) (or (< c_~var_1_5~0 ~var_1_6~0) (< .cse0 (+ (div c_~var_1_22~0 ~var_1_6~0) 1)) (= (mod c_~var_1_22~0 ~var_1_6~0) 0) (< ~var_1_6~0 0))) (or (let ((.cse14 (forall ((~var_1_6~0 Int)) (or (< ~var_1_6~0 .cse15) (= (mod c_~var_1_22~0 ~var_1_6~0) 0))))) (and (or .cse11 (and .cse6 (or .cse9 .cse14))) (or .cse13 .cse14))) .cse16) (or .cse17 (and (or .cse8 (and (or .cse18 .cse12) (or .cse7 .cse18))) (or .cse10 .cse13))) (or .cse8 .cse9 .cse12))))) (or .cse8 .cse19) (or (forall ((~var_1_6~0 Int)) (or (not (= (mod c_~var_1_22~0 ~var_1_6~0) 0)) (< 0 (+ ~var_1_6~0 1)) (< .cse0 (div c_~var_1_22~0 ~var_1_6~0)))) .cse16) (or (forall ((~var_1_6~0 Int)) (or (< .cse0 (+ (div c_~var_1_22~0 ~var_1_6~0) 1)) (< ~var_1_6~0 0))) .cse13) (or .cse16 .cse13) (or .cse5 (forall ((~var_1_6~0 Int)) (or (< .cse1 (div c_~var_1_22~0 ~var_1_6~0)) (< 0 (+ ~var_1_6~0 1)) (= (mod c_~var_1_22~0 ~var_1_6~0) 0)))) (or .cse11 .cse9) (or .cse8 (and (or .cse5 .cse17 .cse20) .cse19)) (forall ((~var_1_6~0 Int)) (or (< c_~var_1_5~0 ~var_1_6~0) (not (= (mod c_~var_1_22~0 ~var_1_6~0) 0)) (< 0 (+ ~var_1_6~0 1)) (< .cse0 (div c_~var_1_22~0 ~var_1_6~0)))) (or .cse3 .cse4) (forall ((~var_1_6~0 Int)) (or (< c_~var_1_5~0 ~var_1_6~0) (< .cse0 (+ (div c_~var_1_22~0 ~var_1_6~0) 1)))) (or .cse4 .cse19) (or .cse5 (forall ((~var_1_6~0 Int)) (or (< c_~var_1_5~0 ~var_1_6~0) (< .cse0 (+ (div c_~var_1_22~0 ~var_1_6~0) 1)) (= (mod c_~var_1_22~0 ~var_1_6~0) 0)))) (forall ((~var_1_6~0 Int)) (or (< c_~var_1_5~0 ~var_1_6~0) (not (= (mod c_~var_1_22~0 ~var_1_6~0) 0)) (< .cse0 (div c_~var_1_22~0 ~var_1_6~0)) (< ~var_1_6~0 0))) (or .cse16 .cse11 .cse20) (or .cse16 .cse20) (forall ((~var_1_6~0 Int)) (or (< c_~var_1_5~0 ~var_1_6~0) (< 0 (+ ~var_1_6~0 1)) (< .cse0 (div c_~var_1_22~0 ~var_1_6~0)))) (or .cse5 .cse8 .cse17 .cse18)))) is different from false [2024-11-23 23:49:35,725 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse10 (= (mod c_~var_1_22~0 c_~var_1_5~0) 0)) (.cse0 (+ c_~var_1_25~0 c_~var_1_22~0))) (let ((.cse3 (forall ((~var_1_6~0 Int)) (or (< c_~var_1_5~0 ~var_1_6~0) (< .cse0 (div c_~var_1_22~0 ~var_1_6~0)) (< ~var_1_6~0 0)))) (.cse4 (< c_~var_1_22~0 0)) (.cse6 (forall ((~var_1_6~0 Int)) (or (< c_~var_1_5~0 ~var_1_6~0) (< .cse0 (div c_~var_1_22~0 ~var_1_6~0))))) (.cse9 (not .cse10)) (.cse7 (< c_~var_1_5~0 0)) (.cse11 (forall ((~var_1_6~0 Int)) (or (< 0 (+ ~var_1_6~0 1)) (< .cse0 (div c_~var_1_22~0 ~var_1_6~0))))) (.cse8 (< 0 (+ c_~var_1_22~0 1))) (.cse5 (< 0 (+ c_~var_1_5~0 1))) (.cse1 (+ c_~var_1_25~0 c_~var_1_22~0 1)) (.cse2 (div c_~var_1_22~0 c_~var_1_5~0))) (and (forall ((~var_1_6~0 Int)) (or (< c_~var_1_5~0 ~var_1_6~0) (< .cse0 (+ (div c_~var_1_22~0 ~var_1_6~0) 1)) (< ~var_1_6~0 0))) (or (and (<= .cse1 .cse2) .cse3) .cse4) (forall ((~var_1_6~0 Int)) (or (< c_~var_1_5~0 ~var_1_6~0) (not (= (mod c_~var_1_22~0 ~var_1_6~0) 0)) (< .cse0 (div c_~var_1_22~0 ~var_1_6~0)))) (or .cse5 .cse6) (or (forall ((~var_1_6~0 Int)) (or (not (= (mod c_~var_1_22~0 ~var_1_6~0) 0)) (< 0 (+ ~var_1_6~0 1)) (< .cse0 (div c_~var_1_22~0 ~var_1_6~0)))) .cse7) (or .cse8 (forall ((~var_1_6~0 Int)) (or (< .cse1 (div c_~var_1_22~0 ~var_1_6~0)) (< 0 (+ ~var_1_6~0 1)) (= (mod c_~var_1_22~0 ~var_1_6~0) 0)))) (or .cse9 (< .cse0 .cse2)) (<= .cse0 .cse2) (or .cse5 (and (or .cse8 .cse10 .cse11) .cse6)) (forall ((~var_1_6~0 Int)) (or (< c_~var_1_5~0 ~var_1_6~0) (not (= (mod c_~var_1_22~0 ~var_1_6~0) 0)) (< 0 (+ ~var_1_6~0 1)) (< .cse0 (div c_~var_1_22~0 ~var_1_6~0)))) (or .cse3 .cse4) (forall ((~var_1_6~0 Int)) (or (< c_~var_1_5~0 ~var_1_6~0) (< .cse0 (+ (div c_~var_1_22~0 ~var_1_6~0) 1)))) (or .cse4 .cse6) (or .cse8 (forall ((~var_1_6~0 Int)) (or (< c_~var_1_5~0 ~var_1_6~0) (< .cse0 (+ (div c_~var_1_22~0 ~var_1_6~0) 1)) (= (mod c_~var_1_22~0 ~var_1_6~0) 0)))) (forall ((~var_1_6~0 Int)) (or (< c_~var_1_5~0 ~var_1_6~0) (not (= (mod c_~var_1_22~0 ~var_1_6~0) 0)) (< .cse0 (div c_~var_1_22~0 ~var_1_6~0)) (< ~var_1_6~0 0))) (or .cse7 .cse9 .cse11) (or .cse7 .cse11) (forall ((~var_1_6~0 Int)) (or (< c_~var_1_5~0 ~var_1_6~0) (< 0 (+ ~var_1_6~0 1)) (< .cse0 (div c_~var_1_22~0 ~var_1_6~0)))) (or .cse8 (forall ((~var_1_6~0 Int)) (or (< c_~var_1_5~0 ~var_1_6~0) (< .cse0 (+ (div c_~var_1_22~0 ~var_1_6~0) 1)) (= (mod c_~var_1_22~0 ~var_1_6~0) 0) (< ~var_1_6~0 0)))) (or .cse8 .cse5 .cse10 (< .cse1 .cse2))))) is different from false [2024-11-23 23:49:49,915 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse16 (mod c_~var_1_8~0 256)) (.cse41 (mod c_~var_1_28~0 65536))) (let ((.cse10 (+ .cse41 c_~var_1_22~0)) (.cse12 (+ c_~var_1_22~0 .cse16))) (let ((.cse5 (= (mod c_~var_1_22~0 c_~var_1_5~0) 0)) (.cse1 (< 32767 .cse41)) (.cse37 (forall ((~var_1_6~0 Int)) (let ((.cse43 (div c_~var_1_22~0 ~var_1_6~0))) (or (< 0 (+ ~var_1_6~0 1)) (< .cse10 .cse43) (< .cse12 .cse43))))) (.cse14 (+ c_~var_1_22~0 1 .cse16)) (.cse3 (div c_~var_1_22~0 c_~var_1_5~0))) (let ((.cse6 (< .cse14 .cse3)) (.cse8 (and (forall ((~var_1_6~0 Int)) (or (< .cse10 (+ (div c_~var_1_22~0 ~var_1_6~0) 65536)) (< 0 (+ ~var_1_6~0 1)))) (or .cse1 .cse37))) (.cse19 (< .cse12 .cse3)) (.cse31 (< .cse10 .cse3)) (.cse29 (<= .cse10 (+ .cse3 65535))) (.cse20 (not .cse5)) (.cse28 (forall ((~var_1_6~0 Int)) (or (< c_~var_1_5~0 ~var_1_6~0) (< .cse10 (+ (div c_~var_1_22~0 ~var_1_6~0) 65536)) (< ~var_1_6~0 0)))) (.cse30 (forall ((~var_1_6~0 Int)) (let ((.cse42 (div c_~var_1_22~0 ~var_1_6~0))) (or (< c_~var_1_5~0 ~var_1_6~0) (< .cse10 .cse42) (< .cse12 .cse42) (< ~var_1_6~0 0))))) (.cse18 (< c_~var_1_22~0 0)) (.cse2 (+ .cse41 c_~var_1_22~0 1)) (.cse15 (mod c_~var_1_28~0 4294967296)) (.cse7 (< c_~var_1_5~0 0)) (.cse4 (< 0 (+ c_~var_1_5~0 1))) (.cse26 (forall ((~var_1_6~0 Int)) (or (< c_~var_1_5~0 ~var_1_6~0) (< .cse10 (+ (div c_~var_1_22~0 ~var_1_6~0) 65536))))) (.cse27 (forall ((~var_1_6~0 Int)) (let ((.cse40 (div c_~var_1_22~0 ~var_1_6~0))) (or (< c_~var_1_5~0 ~var_1_6~0) (< .cse10 .cse40) (< .cse12 .cse40))))) (.cse0 (< 0 (+ c_~var_1_22~0 1))) (.cse9 (forall ((~var_1_6~0 Int)) (or (< c_~var_1_5~0 ~var_1_6~0) (< .cse10 (+ (div c_~var_1_22~0 ~var_1_6~0) 65537)) (= (mod c_~var_1_22~0 ~var_1_6~0) 0))))) (and (or .cse0 .cse1 (< .cse2 .cse3) .cse4 .cse5 .cse6) (or .cse7 .cse8) (or .cse0 (and .cse9 (or .cse1 (forall ((~var_1_6~0 Int)) (let ((.cse11 (+ (div c_~var_1_22~0 ~var_1_6~0) 1))) (or (< c_~var_1_5~0 ~var_1_6~0) (< .cse10 .cse11) (< .cse12 .cse11) (= (mod c_~var_1_22~0 ~var_1_6~0) 0))))))) (forall ((~var_1_6~0 Int)) (or (< c_~var_1_5~0 ~var_1_6~0) (< .cse10 (+ (div c_~var_1_22~0 ~var_1_6~0) 65536)) (not (= (mod c_~var_1_22~0 ~var_1_6~0) 0)))) (or .cse0 .cse1 (forall ((~var_1_6~0 Int)) (let ((.cse13 (div c_~var_1_22~0 ~var_1_6~0))) (or (< .cse2 .cse13) (< 0 (+ ~var_1_6~0 1)) (< .cse14 .cse13) (= (mod c_~var_1_22~0 ~var_1_6~0) 0))))) (forall ((~var_1_6~0 Int)) (or (< c_~var_1_5~0 ~var_1_6~0) (< .cse10 (+ (div c_~var_1_22~0 ~var_1_6~0) 65536)) (not (= (mod c_~var_1_22~0 ~var_1_6~0) 0)) (< 0 (+ ~var_1_6~0 1)))) (or (< .cse15 (+ 1 .cse16)) (let ((.cse17 (forall ((~var_1_6~0 Int)) (or (< c_~var_1_5~0 ~var_1_6~0) (< .cse12 (div c_~var_1_22~0 ~var_1_6~0)) (< ~var_1_6~0 0)))) (.cse21 (forall ((~var_1_6~0 Int)) (or (< 0 (+ ~var_1_6~0 1)) (< .cse12 (div c_~var_1_22~0 ~var_1_6~0))))) (.cse22 (forall ((~var_1_6~0 Int)) (or (< c_~var_1_5~0 ~var_1_6~0) (< .cse12 (div c_~var_1_22~0 ~var_1_6~0)))))) (and (or .cse0 (forall ((~var_1_6~0 Int)) (or (< c_~var_1_5~0 ~var_1_6~0) (< .cse12 (+ (div c_~var_1_22~0 ~var_1_6~0) 1)) (= (mod c_~var_1_22~0 ~var_1_6~0) 0) (< ~var_1_6~0 0)))) (forall ((~var_1_6~0 Int)) (or (< c_~var_1_5~0 ~var_1_6~0) (< 0 (+ ~var_1_6~0 1)) (< .cse12 (div c_~var_1_22~0 ~var_1_6~0)))) (or .cse17 .cse18) (forall ((~var_1_6~0 Int)) (or (< c_~var_1_5~0 ~var_1_6~0) (not (= (mod c_~var_1_22~0 ~var_1_6~0) 0)) (< .cse12 (div c_~var_1_22~0 ~var_1_6~0)) (< ~var_1_6~0 0))) (or .cse19 .cse20) (forall ((~var_1_6~0 Int)) (or (< c_~var_1_5~0 ~var_1_6~0) (not (= (mod c_~var_1_22~0 ~var_1_6~0) 0)) (< .cse12 (div c_~var_1_22~0 ~var_1_6~0)))) (or .cse18 (and .cse17 (<= .cse14 .cse3))) (<= .cse12 .cse3) (or .cse21 .cse7) (or .cse4 .cse22) (forall ((~var_1_6~0 Int)) (or (< c_~var_1_5~0 ~var_1_6~0) (< .cse12 (+ (div c_~var_1_22~0 ~var_1_6~0) 1)))) (or .cse0 .cse4 .cse5 .cse6) (or .cse21 .cse7 .cse20) (or .cse0 (forall ((~var_1_6~0 Int)) (or (< c_~var_1_5~0 ~var_1_6~0) (< .cse12 (+ (div c_~var_1_22~0 ~var_1_6~0) 1)) (= (mod c_~var_1_22~0 ~var_1_6~0) 0)))) (or (forall ((~var_1_6~0 Int)) (or (not (= (mod c_~var_1_22~0 ~var_1_6~0) 0)) (< 0 (+ ~var_1_6~0 1)) (< .cse12 (div c_~var_1_22~0 ~var_1_6~0)))) .cse7) (or .cse4 (and .cse22 (or .cse0 .cse21 .cse5))) (forall ((~var_1_6~0 Int)) (or (< c_~var_1_5~0 ~var_1_6~0) (not (= (mod c_~var_1_22~0 ~var_1_6~0) 0)) (< 0 (+ ~var_1_6~0 1)) (< .cse12 (div c_~var_1_22~0 ~var_1_6~0)))) (forall ((~var_1_6~0 Int)) (or (< c_~var_1_5~0 ~var_1_6~0) (< .cse12 (+ (div c_~var_1_22~0 ~var_1_6~0) 1)) (< ~var_1_6~0 0))) (or .cse18 .cse22) (or .cse0 (forall ((~var_1_6~0 Int)) (or (< 0 (+ ~var_1_6~0 1)) (< .cse14 (div c_~var_1_22~0 ~var_1_6~0)) (= (mod c_~var_1_22~0 ~var_1_6~0) 0))))))) (forall ((~var_1_6~0 Int)) (or (< c_~var_1_5~0 ~var_1_6~0) (< .cse10 (+ (div c_~var_1_22~0 ~var_1_6~0) 65537)))) (or .cse1 (forall ((~var_1_6~0 Int)) (let ((.cse23 (+ (div c_~var_1_22~0 ~var_1_6~0) 1))) (or (< c_~var_1_5~0 ~var_1_6~0) (< .cse10 .cse23) (< .cse12 .cse23))))) (or .cse1 (forall ((~var_1_6~0 Int)) (let ((.cse24 (+ (div c_~var_1_22~0 ~var_1_6~0) 1))) (or (< c_~var_1_5~0 ~var_1_6~0) (< .cse10 .cse24) (< .cse12 .cse24) (< ~var_1_6~0 0))))) (or .cse1 (forall ((~var_1_6~0 Int)) (let ((.cse25 (div c_~var_1_22~0 ~var_1_6~0))) (or (< c_~var_1_5~0 ~var_1_6~0) (not (= (mod c_~var_1_22~0 ~var_1_6~0) 0)) (< .cse10 .cse25) (< .cse12 .cse25) (< ~var_1_6~0 0))))) (forall ((~var_1_6~0 Int)) (or (< c_~var_1_5~0 ~var_1_6~0) (< .cse10 (+ (div c_~var_1_22~0 ~var_1_6~0) 65537)) (< ~var_1_6~0 0))) (or .cse18 (and .cse26 (or .cse1 .cse27))) (or .cse18 (and .cse28 .cse29 (or .cse1 (and .cse30 (or .cse19 .cse31))))) (or .cse7 .cse20 .cse8) (or (and (or .cse19 .cse1 .cse31) .cse29) .cse20) (or .cse1 .cse4 .cse27) (forall ((~var_1_6~0 Int)) (or (< c_~var_1_5~0 ~var_1_6~0) (< .cse10 (+ (div c_~var_1_22~0 ~var_1_6~0) 65536)) (< 0 (+ ~var_1_6~0 1)))) (or .cse1 (forall ((~var_1_6~0 Int)) (let ((.cse32 (div c_~var_1_22~0 ~var_1_6~0))) (or (< c_~var_1_5~0 ~var_1_6~0) (not (= (mod c_~var_1_22~0 ~var_1_6~0) 0)) (< .cse10 .cse32) (< .cse12 .cse32))))) (or .cse1 (forall ((~var_1_6~0 Int)) (let ((.cse33 (div c_~var_1_22~0 ~var_1_6~0))) (or (< c_~var_1_5~0 ~var_1_6~0) (< 0 (+ ~var_1_6~0 1)) (< .cse10 .cse33) (< .cse12 .cse33))))) (or (and .cse28 (or .cse30 .cse1)) .cse18) (or (let ((.cse34 (forall ((~var_1_6~0 Int)) (or (< c_~var_1_5~0 ~var_1_6~0) (< .cse10 (div c_~var_1_22~0 ~var_1_6~0)))))) (and (or .cse0 (forall ((~var_1_6~0 Int)) (or (< c_~var_1_5~0 ~var_1_6~0) (< .cse10 (+ (div c_~var_1_22~0 ~var_1_6~0) 1)) (= (mod c_~var_1_22~0 ~var_1_6~0) 0) (< ~var_1_6~0 0)))) (forall ((~var_1_6~0 Int)) (or (< c_~var_1_5~0 ~var_1_6~0) (not (= (mod c_~var_1_22~0 ~var_1_6~0) 0)) (< .cse10 (div c_~var_1_22~0 ~var_1_6~0)))) (or .cse0 (forall ((~var_1_6~0 Int)) (or (< c_~var_1_5~0 ~var_1_6~0) (< .cse10 (+ (div c_~var_1_22~0 ~var_1_6~0) 1)) (= (mod c_~var_1_22~0 ~var_1_6~0) 0)))) (or .cse34 .cse18) (forall ((~var_1_6~0 Int)) (or (< 0 (+ ~var_1_6~0 1)) (< .cse10 (div c_~var_1_22~0 ~var_1_6~0)))) (or .cse0 (forall ((~var_1_6~0 Int)) (or (< .cse2 (div c_~var_1_22~0 ~var_1_6~0)) (< 0 (+ ~var_1_6~0 1)) (= (mod c_~var_1_22~0 ~var_1_6~0) 0)))) (forall ((~var_1_6~0 Int)) (or (< c_~var_1_5~0 ~var_1_6~0) (not (= (mod c_~var_1_22~0 ~var_1_6~0) 0)) (< .cse10 (div c_~var_1_22~0 ~var_1_6~0)) (< ~var_1_6~0 0))) (forall ((~var_1_6~0 Int)) (or (not (= (mod c_~var_1_22~0 ~var_1_6~0) 0)) (< 0 (+ ~var_1_6~0 1)) (< .cse10 (div c_~var_1_22~0 ~var_1_6~0)))) (forall ((~var_1_6~0 Int)) (or (< c_~var_1_5~0 ~var_1_6~0) (< .cse10 (+ (div c_~var_1_22~0 ~var_1_6~0) 1)))) (or .cse34 .cse4) (forall ((~var_1_6~0 Int)) (or (< c_~var_1_5~0 ~var_1_6~0) (< .cse10 (+ (div c_~var_1_22~0 ~var_1_6~0) 1)) (< ~var_1_6~0 0))))) (< .cse16 .cse15)) (<= .cse10 (+ 65536 .cse3)) (or .cse7 (and (forall ((~var_1_6~0 Int)) (or (< .cse10 (+ (div c_~var_1_22~0 ~var_1_6~0) 65536)) (not (= (mod c_~var_1_22~0 ~var_1_6~0) 0)) (< 0 (+ ~var_1_6~0 1)))) (or .cse1 (forall ((~var_1_6~0 Int)) (let ((.cse35 (div c_~var_1_22~0 ~var_1_6~0))) (or (not (= (mod c_~var_1_22~0 ~var_1_6~0) 0)) (< 0 (+ ~var_1_6~0 1)) (< .cse10 .cse35) (< .cse12 .cse35))))))) (or .cse1 (forall ((~var_1_6~0 Int)) (let ((.cse36 (div c_~var_1_22~0 ~var_1_6~0))) (or (< c_~var_1_5~0 ~var_1_6~0) (not (= (mod c_~var_1_22~0 ~var_1_6~0) 0)) (< 0 (+ ~var_1_6~0 1)) (< .cse10 .cse36) (< .cse12 .cse36))))) (forall ((~var_1_6~0 Int)) (or (< c_~var_1_5~0 ~var_1_6~0) (< .cse10 (+ (div c_~var_1_22~0 ~var_1_6~0) 65536)) (not (= (mod c_~var_1_22~0 ~var_1_6~0) 0)) (< ~var_1_6~0 0))) (or .cse4 (and .cse26 (or .cse1 (and .cse27 (or .cse0 .cse37 .cse5))))) (let ((.cse38 (+ .cse3 1))) (or .cse1 (< .cse10 .cse38) (< .cse12 .cse38))) (or .cse0 (and .cse9 (or .cse1 (forall ((~var_1_6~0 Int)) (let ((.cse39 (+ (div c_~var_1_22~0 ~var_1_6~0) 1))) (or (< c_~var_1_5~0 ~var_1_6~0) (< .cse10 .cse39) (< .cse12 .cse39) (= (mod c_~var_1_22~0 ~var_1_6~0) 0) (< ~var_1_6~0 0)))))))))))) is different from false [2024-11-23 23:50:02,734 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse24 (mod c_~var_1_8~0 256)) (.cse32 (mod c_~var_1_28~0 65536))) (let ((.cse5 (+ .cse32 c_~var_1_22~0)) (.cse3 (= (mod c_~var_1_22~0 c_~var_1_5~0) 0)) (.cse10 (+ c_~var_1_22~0 .cse24)) (.cse12 (+ c_~var_1_22~0 1 .cse24)) (.cse1 (div c_~var_1_22~0 c_~var_1_5~0))) (let ((.cse4 (< .cse12 .cse1)) (.cse17 (< c_~var_1_22~0 0)) (.cse0 (+ .cse32 c_~var_1_22~0 1)) (.cse23 (mod c_~var_1_28~0 4294967296)) (.cse16 (< .cse10 .cse1)) (.cse25 (not .cse3)) (.cse18 (< .cse5 .cse1)) (.cse6 (< 0 (+ c_~var_1_22~0 1))) (.cse7 (forall ((~var_1_6~0 Int)) (or (< c_~var_1_5~0 ~var_1_6~0) (< .cse5 (+ (div c_~var_1_22~0 ~var_1_6~0) 65537)) (= (mod c_~var_1_22~0 ~var_1_6~0) 0)))) (.cse8 (< 32767 .cse32)) (.cse19 (forall ((~var_1_6~0 Int)) (let ((.cse31 (div c_~var_1_22~0 ~var_1_6~0))) (or (< c_~var_1_5~0 ~var_1_6~0) (< .cse5 .cse31) (< .cse10 .cse31))))) (.cse28 (forall ((~var_1_6~0 Int)) (let ((.cse30 (div c_~var_1_22~0 ~var_1_6~0))) (or (< 0 (+ ~var_1_6~0 1)) (< .cse5 .cse30) (< .cse10 .cse30))))) (.cse2 (< 0 (+ c_~var_1_5~0 1)))) (and (or (< .cse0 .cse1) .cse2 .cse3 .cse4) (forall ((~var_1_6~0 Int)) (or (< .cse5 (+ (div c_~var_1_22~0 ~var_1_6~0) 65536)) (< 0 (+ ~var_1_6~0 1)))) (or .cse6 (and .cse7 (or .cse8 (forall ((~var_1_6~0 Int)) (let ((.cse9 (+ (div c_~var_1_22~0 ~var_1_6~0) 1))) (or (< c_~var_1_5~0 ~var_1_6~0) (< .cse5 .cse9) (< .cse10 .cse9) (= (mod c_~var_1_22~0 ~var_1_6~0) 0))))))) (forall ((~var_1_6~0 Int)) (or (< c_~var_1_5~0 ~var_1_6~0) (< .cse5 (+ (div c_~var_1_22~0 ~var_1_6~0) 65536)) (not (= (mod c_~var_1_22~0 ~var_1_6~0) 0)))) (or .cse6 .cse8 (forall ((~var_1_6~0 Int)) (let ((.cse11 (div c_~var_1_22~0 ~var_1_6~0))) (or (< .cse0 .cse11) (< 0 (+ ~var_1_6~0 1)) (< .cse12 .cse11) (= (mod c_~var_1_22~0 ~var_1_6~0) 0))))) (forall ((~var_1_6~0 Int)) (or (< c_~var_1_5~0 ~var_1_6~0) (< .cse5 (+ (div c_~var_1_22~0 ~var_1_6~0) 65537)))) (or .cse8 (forall ((~var_1_6~0 Int)) (let ((.cse13 (+ (div c_~var_1_22~0 ~var_1_6~0) 1))) (or (< c_~var_1_5~0 ~var_1_6~0) (< .cse5 .cse13) (< .cse10 .cse13))))) (or .cse8 (forall ((~var_1_6~0 Int)) (let ((.cse14 (+ (div c_~var_1_22~0 ~var_1_6~0) 1))) (or (< c_~var_1_5~0 ~var_1_6~0) (< .cse5 .cse14) (< .cse10 .cse14) (< ~var_1_6~0 0))))) (or .cse8 (forall ((~var_1_6~0 Int)) (let ((.cse15 (div c_~var_1_22~0 ~var_1_6~0))) (or (< c_~var_1_5~0 ~var_1_6~0) (not (= (mod c_~var_1_22~0 ~var_1_6~0) 0)) (< .cse5 .cse15) (< .cse10 .cse15) (< ~var_1_6~0 0))))) (or .cse16 .cse8 .cse17 .cse18) (forall ((~var_1_6~0 Int)) (or (< .cse5 (+ (div c_~var_1_22~0 ~var_1_6~0) 65536)) (not (= (mod c_~var_1_22~0 ~var_1_6~0) 0)) (< 0 (+ ~var_1_6~0 1)))) (forall ((~var_1_6~0 Int)) (or (< c_~var_1_5~0 ~var_1_6~0) (< .cse5 (+ (div c_~var_1_22~0 ~var_1_6~0) 65537)) (< ~var_1_6~0 0))) (or .cse17 (and (forall ((~var_1_6~0 Int)) (or (< c_~var_1_5~0 ~var_1_6~0) (< .cse5 (+ (div c_~var_1_22~0 ~var_1_6~0) 65536)))) (or .cse8 .cse19))) (or .cse8 .cse2 .cse19) (let ((.cse20 (+ .cse1 1))) (or (< .cse5 .cse20) (< .cse10 .cse20))) (or .cse8 (forall ((~var_1_6~0 Int)) (let ((.cse21 (div c_~var_1_22~0 ~var_1_6~0))) (or (< c_~var_1_5~0 ~var_1_6~0) (not (= (mod c_~var_1_22~0 ~var_1_6~0) 0)) (< .cse5 .cse21) (< .cse10 .cse21))))) (or .cse8 (forall ((~var_1_6~0 Int)) (let ((.cse22 (div c_~var_1_22~0 ~var_1_6~0))) (or (not (= (mod c_~var_1_22~0 ~var_1_6~0) 0)) (< 0 (+ ~var_1_6~0 1)) (< .cse5 .cse22) (< .cse10 .cse22))))) (or (< .cse23 (+ 1 .cse24)) (let ((.cse26 (forall ((~var_1_6~0 Int)) (or (< c_~var_1_5~0 ~var_1_6~0) (< .cse10 (div c_~var_1_22~0 ~var_1_6~0)))))) (and (or .cse2 .cse3 .cse4) (or .cse6 (forall ((~var_1_6~0 Int)) (or (< c_~var_1_5~0 ~var_1_6~0) (< .cse10 (+ (div c_~var_1_22~0 ~var_1_6~0) 1)) (= (mod c_~var_1_22~0 ~var_1_6~0) 0) (< ~var_1_6~0 0)))) (forall ((~var_1_6~0 Int)) (or (< 0 (+ ~var_1_6~0 1)) (< .cse10 (div c_~var_1_22~0 ~var_1_6~0)))) (forall ((~var_1_6~0 Int)) (or (< c_~var_1_5~0 ~var_1_6~0) (not (= (mod c_~var_1_22~0 ~var_1_6~0) 0)) (< .cse10 (div c_~var_1_22~0 ~var_1_6~0)) (< ~var_1_6~0 0))) (forall ((~var_1_6~0 Int)) (or (not (= (mod c_~var_1_22~0 ~var_1_6~0) 0)) (< 0 (+ ~var_1_6~0 1)) (< .cse10 (div c_~var_1_22~0 ~var_1_6~0)))) (or .cse16 .cse25) (forall ((~var_1_6~0 Int)) (or (< c_~var_1_5~0 ~var_1_6~0) (not (= (mod c_~var_1_22~0 ~var_1_6~0) 0)) (< .cse10 (div c_~var_1_22~0 ~var_1_6~0)))) (or .cse16 .cse17) (<= .cse10 .cse1) (or .cse2 .cse26) (forall ((~var_1_6~0 Int)) (or (< c_~var_1_5~0 ~var_1_6~0) (< .cse10 (+ (div c_~var_1_22~0 ~var_1_6~0) 1)))) (or .cse6 (forall ((~var_1_6~0 Int)) (or (< c_~var_1_5~0 ~var_1_6~0) (< .cse10 (+ (div c_~var_1_22~0 ~var_1_6~0) 1)) (= (mod c_~var_1_22~0 ~var_1_6~0) 0)))) (forall ((~var_1_6~0 Int)) (or (< c_~var_1_5~0 ~var_1_6~0) (< .cse10 (+ (div c_~var_1_22~0 ~var_1_6~0) 1)) (< ~var_1_6~0 0))) (or .cse17 .cse26) (or .cse6 (forall ((~var_1_6~0 Int)) (or (< 0 (+ ~var_1_6~0 1)) (< .cse12 (div c_~var_1_22~0 ~var_1_6~0)) (= (mod c_~var_1_22~0 ~var_1_6~0) 0))))))) (or (let ((.cse27 (forall ((~var_1_6~0 Int)) (or (< c_~var_1_5~0 ~var_1_6~0) (< .cse5 (div c_~var_1_22~0 ~var_1_6~0)))))) (and (or .cse6 (forall ((~var_1_6~0 Int)) (or (< c_~var_1_5~0 ~var_1_6~0) (< .cse5 (+ (div c_~var_1_22~0 ~var_1_6~0) 1)) (= (mod c_~var_1_22~0 ~var_1_6~0) 0) (< ~var_1_6~0 0)))) (forall ((~var_1_6~0 Int)) (or (< c_~var_1_5~0 ~var_1_6~0) (not (= (mod c_~var_1_22~0 ~var_1_6~0) 0)) (< .cse5 (div c_~var_1_22~0 ~var_1_6~0)))) (or .cse6 (forall ((~var_1_6~0 Int)) (or (< c_~var_1_5~0 ~var_1_6~0) (< .cse5 (+ (div c_~var_1_22~0 ~var_1_6~0) 1)) (= (mod c_~var_1_22~0 ~var_1_6~0) 0)))) (or .cse27 .cse17) (forall ((~var_1_6~0 Int)) (or (< 0 (+ ~var_1_6~0 1)) (< .cse5 (div c_~var_1_22~0 ~var_1_6~0)))) (or .cse6 (forall ((~var_1_6~0 Int)) (or (< .cse0 (div c_~var_1_22~0 ~var_1_6~0)) (< 0 (+ ~var_1_6~0 1)) (= (mod c_~var_1_22~0 ~var_1_6~0) 0)))) (forall ((~var_1_6~0 Int)) (or (< c_~var_1_5~0 ~var_1_6~0) (not (= (mod c_~var_1_22~0 ~var_1_6~0) 0)) (< .cse5 (div c_~var_1_22~0 ~var_1_6~0)) (< ~var_1_6~0 0))) (forall ((~var_1_6~0 Int)) (or (not (= (mod c_~var_1_22~0 ~var_1_6~0) 0)) (< 0 (+ ~var_1_6~0 1)) (< .cse5 (div c_~var_1_22~0 ~var_1_6~0)))) (forall ((~var_1_6~0 Int)) (or (< c_~var_1_5~0 ~var_1_6~0) (< .cse5 (+ (div c_~var_1_22~0 ~var_1_6~0) 1)))) (or .cse27 .cse2) (forall ((~var_1_6~0 Int)) (or (< c_~var_1_5~0 ~var_1_6~0) (< .cse5 (+ (div c_~var_1_22~0 ~var_1_6~0) 1)) (< ~var_1_6~0 0))))) (< .cse24 .cse23)) (or .cse8 .cse28) (forall ((~var_1_6~0 Int)) (or (< c_~var_1_5~0 ~var_1_6~0) (< .cse5 (+ (div c_~var_1_22~0 ~var_1_6~0) 65536)) (not (= (mod c_~var_1_22~0 ~var_1_6~0) 0)) (< ~var_1_6~0 0))) (or .cse16 .cse25 .cse18) (or .cse6 (and .cse7 (or .cse8 (forall ((~var_1_6~0 Int)) (let ((.cse29 (+ (div c_~var_1_22~0 ~var_1_6~0) 1))) (or (< c_~var_1_5~0 ~var_1_6~0) (< .cse5 .cse29) (< .cse10 .cse29) (= (mod c_~var_1_22~0 ~var_1_6~0) 0) (< ~var_1_6~0 0))))))) (or .cse8 (and .cse19 (or .cse28 .cse3)) .cse2))))) is different from false [2024-11-23 23:50:06,744 WARN L873 $PredicateComparison]: unable to prove that (let ((.cse24 (mod c_~var_1_8~0 256)) (.cse32 (mod c_~var_1_28~0 65536))) (let ((.cse5 (+ .cse32 c_~var_1_22~0)) (.cse3 (= (mod c_~var_1_22~0 c_~var_1_5~0) 0)) (.cse10 (+ c_~var_1_22~0 .cse24)) (.cse12 (+ c_~var_1_22~0 1 .cse24)) (.cse1 (div c_~var_1_22~0 c_~var_1_5~0))) (let ((.cse4 (< .cse12 .cse1)) (.cse17 (< c_~var_1_22~0 0)) (.cse0 (+ .cse32 c_~var_1_22~0 1)) (.cse23 (mod c_~var_1_28~0 4294967296)) (.cse16 (< .cse10 .cse1)) (.cse25 (not .cse3)) (.cse18 (< .cse5 .cse1)) (.cse6 (< 0 (+ c_~var_1_22~0 1))) (.cse7 (forall ((~var_1_6~0 Int)) (or (< c_~var_1_5~0 ~var_1_6~0) (< .cse5 (+ (div c_~var_1_22~0 ~var_1_6~0) 65537)) (= (mod c_~var_1_22~0 ~var_1_6~0) 0)))) (.cse8 (< 32767 .cse32)) (.cse19 (forall ((~var_1_6~0 Int)) (let ((.cse31 (div c_~var_1_22~0 ~var_1_6~0))) (or (< c_~var_1_5~0 ~var_1_6~0) (< .cse5 .cse31) (< .cse10 .cse31))))) (.cse28 (forall ((~var_1_6~0 Int)) (let ((.cse30 (div c_~var_1_22~0 ~var_1_6~0))) (or (< 0 (+ ~var_1_6~0 1)) (< .cse5 .cse30) (< .cse10 .cse30))))) (.cse2 (< 0 (+ c_~var_1_5~0 1)))) (and (or (< .cse0 .cse1) .cse2 .cse3 .cse4) (forall ((~var_1_6~0 Int)) (or (< .cse5 (+ (div c_~var_1_22~0 ~var_1_6~0) 65536)) (< 0 (+ ~var_1_6~0 1)))) (or .cse6 (and .cse7 (or .cse8 (forall ((~var_1_6~0 Int)) (let ((.cse9 (+ (div c_~var_1_22~0 ~var_1_6~0) 1))) (or (< c_~var_1_5~0 ~var_1_6~0) (< .cse5 .cse9) (< .cse10 .cse9) (= (mod c_~var_1_22~0 ~var_1_6~0) 0))))))) (forall ((~var_1_6~0 Int)) (or (< c_~var_1_5~0 ~var_1_6~0) (< .cse5 (+ (div c_~var_1_22~0 ~var_1_6~0) 65536)) (not (= (mod c_~var_1_22~0 ~var_1_6~0) 0)))) (or .cse6 .cse8 (forall ((~var_1_6~0 Int)) (let ((.cse11 (div c_~var_1_22~0 ~var_1_6~0))) (or (< .cse0 .cse11) (< 0 (+ ~var_1_6~0 1)) (< .cse12 .cse11) (= (mod c_~var_1_22~0 ~var_1_6~0) 0))))) (forall ((~var_1_6~0 Int)) (or (< c_~var_1_5~0 ~var_1_6~0) (< .cse5 (+ (div c_~var_1_22~0 ~var_1_6~0) 65537)))) (or .cse8 (forall ((~var_1_6~0 Int)) (let ((.cse13 (+ (div c_~var_1_22~0 ~var_1_6~0) 1))) (or (< c_~var_1_5~0 ~var_1_6~0) (< .cse5 .cse13) (< .cse10 .cse13))))) (or .cse8 (forall ((~var_1_6~0 Int)) (let ((.cse14 (+ (div c_~var_1_22~0 ~var_1_6~0) 1))) (or (< c_~var_1_5~0 ~var_1_6~0) (< .cse5 .cse14) (< .cse10 .cse14) (< ~var_1_6~0 0))))) (or .cse8 (forall ((~var_1_6~0 Int)) (let ((.cse15 (div c_~var_1_22~0 ~var_1_6~0))) (or (< c_~var_1_5~0 ~var_1_6~0) (not (= (mod c_~var_1_22~0 ~var_1_6~0) 0)) (< .cse5 .cse15) (< .cse10 .cse15) (< ~var_1_6~0 0))))) (or .cse16 .cse8 .cse17 .cse18) (forall ((~var_1_6~0 Int)) (or (< .cse5 (+ (div c_~var_1_22~0 ~var_1_6~0) 65536)) (not (= (mod c_~var_1_22~0 ~var_1_6~0) 0)) (< 0 (+ ~var_1_6~0 1)))) (forall ((~var_1_6~0 Int)) (or (< c_~var_1_5~0 ~var_1_6~0) (< .cse5 (+ (div c_~var_1_22~0 ~var_1_6~0) 65537)) (< ~var_1_6~0 0))) (or .cse17 (and (forall ((~var_1_6~0 Int)) (or (< c_~var_1_5~0 ~var_1_6~0) (< .cse5 (+ (div c_~var_1_22~0 ~var_1_6~0) 65536)))) (or .cse8 .cse19))) (or .cse8 .cse2 .cse19) (let ((.cse20 (+ .cse1 1))) (or (< .cse5 .cse20) (< .cse10 .cse20))) (or .cse8 (forall ((~var_1_6~0 Int)) (let ((.cse21 (div c_~var_1_22~0 ~var_1_6~0))) (or (< c_~var_1_5~0 ~var_1_6~0) (not (= (mod c_~var_1_22~0 ~var_1_6~0) 0)) (< .cse5 .cse21) (< .cse10 .cse21))))) (or .cse8 (forall ((~var_1_6~0 Int)) (let ((.cse22 (div c_~var_1_22~0 ~var_1_6~0))) (or (not (= (mod c_~var_1_22~0 ~var_1_6~0) 0)) (< 0 (+ ~var_1_6~0 1)) (< .cse5 .cse22) (< .cse10 .cse22))))) (or (< .cse23 (+ 1 .cse24)) (let ((.cse26 (forall ((~var_1_6~0 Int)) (or (< c_~var_1_5~0 ~var_1_6~0) (< .cse10 (div c_~var_1_22~0 ~var_1_6~0)))))) (and (or .cse2 .cse3 .cse4) (or .cse6 (forall ((~var_1_6~0 Int)) (or (< c_~var_1_5~0 ~var_1_6~0) (< .cse10 (+ (div c_~var_1_22~0 ~var_1_6~0) 1)) (= (mod c_~var_1_22~0 ~var_1_6~0) 0) (< ~var_1_6~0 0)))) (forall ((~var_1_6~0 Int)) (or (< 0 (+ ~var_1_6~0 1)) (< .cse10 (div c_~var_1_22~0 ~var_1_6~0)))) (forall ((~var_1_6~0 Int)) (or (< c_~var_1_5~0 ~var_1_6~0) (not (= (mod c_~var_1_22~0 ~var_1_6~0) 0)) (< .cse10 (div c_~var_1_22~0 ~var_1_6~0)) (< ~var_1_6~0 0))) (forall ((~var_1_6~0 Int)) (or (not (= (mod c_~var_1_22~0 ~var_1_6~0) 0)) (< 0 (+ ~var_1_6~0 1)) (< .cse10 (div c_~var_1_22~0 ~var_1_6~0)))) (or .cse16 .cse25) (forall ((~var_1_6~0 Int)) (or (< c_~var_1_5~0 ~var_1_6~0) (not (= (mod c_~var_1_22~0 ~var_1_6~0) 0)) (< .cse10 (div c_~var_1_22~0 ~var_1_6~0)))) (or .cse16 .cse17) (<= .cse10 .cse1) (or .cse2 .cse26) (forall ((~var_1_6~0 Int)) (or (< c_~var_1_5~0 ~var_1_6~0) (< .cse10 (+ (div c_~var_1_22~0 ~var_1_6~0) 1)))) (or .cse6 (forall ((~var_1_6~0 Int)) (or (< c_~var_1_5~0 ~var_1_6~0) (< .cse10 (+ (div c_~var_1_22~0 ~var_1_6~0) 1)) (= (mod c_~var_1_22~0 ~var_1_6~0) 0)))) (forall ((~var_1_6~0 Int)) (or (< c_~var_1_5~0 ~var_1_6~0) (< .cse10 (+ (div c_~var_1_22~0 ~var_1_6~0) 1)) (< ~var_1_6~0 0))) (or .cse17 .cse26) (or .cse6 (forall ((~var_1_6~0 Int)) (or (< 0 (+ ~var_1_6~0 1)) (< .cse12 (div c_~var_1_22~0 ~var_1_6~0)) (= (mod c_~var_1_22~0 ~var_1_6~0) 0))))))) (or (let ((.cse27 (forall ((~var_1_6~0 Int)) (or (< c_~var_1_5~0 ~var_1_6~0) (< .cse5 (div c_~var_1_22~0 ~var_1_6~0)))))) (and (or .cse6 (forall ((~var_1_6~0 Int)) (or (< c_~var_1_5~0 ~var_1_6~0) (< .cse5 (+ (div c_~var_1_22~0 ~var_1_6~0) 1)) (= (mod c_~var_1_22~0 ~var_1_6~0) 0) (< ~var_1_6~0 0)))) (forall ((~var_1_6~0 Int)) (or (< c_~var_1_5~0 ~var_1_6~0) (not (= (mod c_~var_1_22~0 ~var_1_6~0) 0)) (< .cse5 (div c_~var_1_22~0 ~var_1_6~0)))) (or .cse6 (forall ((~var_1_6~0 Int)) (or (< c_~var_1_5~0 ~var_1_6~0) (< .cse5 (+ (div c_~var_1_22~0 ~var_1_6~0) 1)) (= (mod c_~var_1_22~0 ~var_1_6~0) 0)))) (or .cse27 .cse17) (forall ((~var_1_6~0 Int)) (or (< 0 (+ ~var_1_6~0 1)) (< .cse5 (div c_~var_1_22~0 ~var_1_6~0)))) (or .cse6 (forall ((~var_1_6~0 Int)) (or (< .cse0 (div c_~var_1_22~0 ~var_1_6~0)) (< 0 (+ ~var_1_6~0 1)) (= (mod c_~var_1_22~0 ~var_1_6~0) 0)))) (forall ((~var_1_6~0 Int)) (or (< c_~var_1_5~0 ~var_1_6~0) (not (= (mod c_~var_1_22~0 ~var_1_6~0) 0)) (< .cse5 (div c_~var_1_22~0 ~var_1_6~0)) (< ~var_1_6~0 0))) (forall ((~var_1_6~0 Int)) (or (not (= (mod c_~var_1_22~0 ~var_1_6~0) 0)) (< 0 (+ ~var_1_6~0 1)) (< .cse5 (div c_~var_1_22~0 ~var_1_6~0)))) (forall ((~var_1_6~0 Int)) (or (< c_~var_1_5~0 ~var_1_6~0) (< .cse5 (+ (div c_~var_1_22~0 ~var_1_6~0) 1)))) (or .cse27 .cse2) (forall ((~var_1_6~0 Int)) (or (< c_~var_1_5~0 ~var_1_6~0) (< .cse5 (+ (div c_~var_1_22~0 ~var_1_6~0) 1)) (< ~var_1_6~0 0))))) (< .cse24 .cse23)) (or .cse8 .cse28) (forall ((~var_1_6~0 Int)) (or (< c_~var_1_5~0 ~var_1_6~0) (< .cse5 (+ (div c_~var_1_22~0 ~var_1_6~0) 65536)) (not (= (mod c_~var_1_22~0 ~var_1_6~0) 0)) (< ~var_1_6~0 0))) (or .cse16 .cse25 .cse18) (or .cse6 (and .cse7 (or .cse8 (forall ((~var_1_6~0 Int)) (let ((.cse29 (+ (div c_~var_1_22~0 ~var_1_6~0) 1))) (or (< c_~var_1_5~0 ~var_1_6~0) (< .cse5 .cse29) (< .cse10 .cse29) (= (mod c_~var_1_22~0 ~var_1_6~0) 0) (< ~var_1_6~0 0))))))) (or .cse8 (and .cse19 (or .cse28 .cse3)) .cse2))))) is different from true [2024-11-23 23:50:17,284 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse32 (mod c_~var_1_28~0 65536)) (.cse22 (mod c_~var_1_8~0 256))) (let ((.cse10 (+ c_~var_1_22~0 .cse22)) (.cse5 (+ .cse32 c_~var_1_22~0)) (.cse3 (= (mod c_~var_1_22~0 c_~var_1_5~0) 0)) (.cse12 (+ c_~var_1_22~0 1 .cse22)) (.cse1 (div c_~var_1_22~0 c_~var_1_5~0))) (let ((.cse4 (< .cse12 .cse1)) (.cse0 (+ .cse32 c_~var_1_22~0 1)) (.cse21 (mod c_~var_1_28~0 4294967296)) (.cse24 (not .cse3)) (.cse6 (< 0 (+ c_~var_1_22~0 1))) (.cse7 (forall ((~var_1_6~0 Int)) (or (< c_~var_1_5~0 ~var_1_6~0) (< .cse5 (+ (div c_~var_1_22~0 ~var_1_6~0) 65537)) (= (mod c_~var_1_22~0 ~var_1_6~0) 0)))) (.cse23 (< .cse10 .cse1)) (.cse16 (< c_~var_1_22~0 0)) (.cse28 (< .cse5 .cse1)) (.cse8 (< 32767 .cse32)) (.cse17 (forall ((~var_1_6~0 Int)) (let ((.cse31 (div c_~var_1_22~0 ~var_1_6~0))) (or (< c_~var_1_5~0 ~var_1_6~0) (< .cse5 .cse31) (< .cse10 .cse31))))) (.cse27 (forall ((~var_1_6~0 Int)) (let ((.cse30 (div c_~var_1_22~0 ~var_1_6~0))) (or (< 0 (+ ~var_1_6~0 1)) (< .cse5 .cse30) (< .cse10 .cse30))))) (.cse2 (< 0 (+ c_~var_1_5~0 1)))) (and (or (< .cse0 .cse1) .cse2 .cse3 .cse4) (forall ((~var_1_6~0 Int)) (or (< .cse5 (+ (div c_~var_1_22~0 ~var_1_6~0) 65536)) (< 0 (+ ~var_1_6~0 1)))) (or .cse6 (and .cse7 (or .cse8 (forall ((~var_1_6~0 Int)) (let ((.cse9 (+ (div c_~var_1_22~0 ~var_1_6~0) 1))) (or (< c_~var_1_5~0 ~var_1_6~0) (< .cse5 .cse9) (< .cse10 .cse9) (= (mod c_~var_1_22~0 ~var_1_6~0) 0))))))) (forall ((~var_1_6~0 Int)) (or (< c_~var_1_5~0 ~var_1_6~0) (< .cse5 (+ (div c_~var_1_22~0 ~var_1_6~0) 65536)) (not (= (mod c_~var_1_22~0 ~var_1_6~0) 0)))) (or .cse6 .cse8 (forall ((~var_1_6~0 Int)) (let ((.cse11 (div c_~var_1_22~0 ~var_1_6~0))) (or (< .cse0 .cse11) (< 0 (+ ~var_1_6~0 1)) (< .cse12 .cse11) (= (mod c_~var_1_22~0 ~var_1_6~0) 0))))) (forall ((~var_1_6~0 Int)) (or (< c_~var_1_5~0 ~var_1_6~0) (< .cse5 (+ (div c_~var_1_22~0 ~var_1_6~0) 65537)))) (or .cse8 (forall ((~var_1_6~0 Int)) (let ((.cse13 (+ (div c_~var_1_22~0 ~var_1_6~0) 1))) (or (< c_~var_1_5~0 ~var_1_6~0) (< .cse5 .cse13) (< .cse10 .cse13))))) (or .cse8 (forall ((~var_1_6~0 Int)) (let ((.cse14 (+ (div c_~var_1_22~0 ~var_1_6~0) 1))) (or (< c_~var_1_5~0 ~var_1_6~0) (< .cse5 .cse14) (< .cse10 .cse14) (< ~var_1_6~0 0))))) (or .cse8 (forall ((~var_1_6~0 Int)) (let ((.cse15 (div c_~var_1_22~0 ~var_1_6~0))) (or (< c_~var_1_5~0 ~var_1_6~0) (not (= (mod c_~var_1_22~0 ~var_1_6~0) 0)) (< .cse5 .cse15) (< .cse10 .cse15) (< ~var_1_6~0 0))))) (forall ((~var_1_6~0 Int)) (or (< .cse5 (+ (div c_~var_1_22~0 ~var_1_6~0) 65536)) (not (= (mod c_~var_1_22~0 ~var_1_6~0) 0)) (< 0 (+ ~var_1_6~0 1)))) (forall ((~var_1_6~0 Int)) (or (< c_~var_1_5~0 ~var_1_6~0) (< .cse5 (+ (div c_~var_1_22~0 ~var_1_6~0) 65537)) (< ~var_1_6~0 0))) (or .cse16 (and (forall ((~var_1_6~0 Int)) (or (< c_~var_1_5~0 ~var_1_6~0) (< .cse5 (+ (div c_~var_1_22~0 ~var_1_6~0) 65536)))) (or .cse8 .cse17))) (or .cse8 .cse2 .cse17) (let ((.cse18 (+ .cse1 1))) (or (< .cse5 .cse18) (< .cse10 .cse18))) (or .cse8 (forall ((~var_1_6~0 Int)) (let ((.cse19 (div c_~var_1_22~0 ~var_1_6~0))) (or (< c_~var_1_5~0 ~var_1_6~0) (not (= (mod c_~var_1_22~0 ~var_1_6~0) 0)) (< .cse5 .cse19) (< .cse10 .cse19))))) (or .cse8 (forall ((~var_1_6~0 Int)) (let ((.cse20 (div c_~var_1_22~0 ~var_1_6~0))) (or (not (= (mod c_~var_1_22~0 ~var_1_6~0) 0)) (< 0 (+ ~var_1_6~0 1)) (< .cse5 .cse20) (< .cse10 .cse20))))) (or (< .cse21 (+ 1 .cse22)) (let ((.cse25 (forall ((~var_1_6~0 Int)) (or (< c_~var_1_5~0 ~var_1_6~0) (< .cse10 (div c_~var_1_22~0 ~var_1_6~0)))))) (and (or .cse2 .cse3 .cse4) (or .cse6 (forall ((~var_1_6~0 Int)) (or (< c_~var_1_5~0 ~var_1_6~0) (< .cse10 (+ (div c_~var_1_22~0 ~var_1_6~0) 1)) (= (mod c_~var_1_22~0 ~var_1_6~0) 0) (< ~var_1_6~0 0)))) (forall ((~var_1_6~0 Int)) (or (< 0 (+ ~var_1_6~0 1)) (< .cse10 (div c_~var_1_22~0 ~var_1_6~0)))) (forall ((~var_1_6~0 Int)) (or (< c_~var_1_5~0 ~var_1_6~0) (not (= (mod c_~var_1_22~0 ~var_1_6~0) 0)) (< .cse10 (div c_~var_1_22~0 ~var_1_6~0)) (< ~var_1_6~0 0))) (forall ((~var_1_6~0 Int)) (or (not (= (mod c_~var_1_22~0 ~var_1_6~0) 0)) (< 0 (+ ~var_1_6~0 1)) (< .cse10 (div c_~var_1_22~0 ~var_1_6~0)))) (or .cse23 .cse24) (forall ((~var_1_6~0 Int)) (or (< c_~var_1_5~0 ~var_1_6~0) (not (= (mod c_~var_1_22~0 ~var_1_6~0) 0)) (< .cse10 (div c_~var_1_22~0 ~var_1_6~0)))) (or .cse23 .cse16) (<= .cse10 .cse1) (or .cse2 .cse25) (forall ((~var_1_6~0 Int)) (or (< c_~var_1_5~0 ~var_1_6~0) (< .cse10 (+ (div c_~var_1_22~0 ~var_1_6~0) 1)))) (or .cse6 (forall ((~var_1_6~0 Int)) (or (< c_~var_1_5~0 ~var_1_6~0) (< .cse10 (+ (div c_~var_1_22~0 ~var_1_6~0) 1)) (= (mod c_~var_1_22~0 ~var_1_6~0) 0)))) (forall ((~var_1_6~0 Int)) (or (< c_~var_1_5~0 ~var_1_6~0) (< .cse10 (+ (div c_~var_1_22~0 ~var_1_6~0) 1)) (< ~var_1_6~0 0))) (or .cse16 .cse25) (or .cse6 (forall ((~var_1_6~0 Int)) (or (< 0 (+ ~var_1_6~0 1)) (< .cse12 (div c_~var_1_22~0 ~var_1_6~0)) (= (mod c_~var_1_22~0 ~var_1_6~0) 0))))))) (or (let ((.cse26 (forall ((~var_1_6~0 Int)) (or (< c_~var_1_5~0 ~var_1_6~0) (< .cse5 (div c_~var_1_22~0 ~var_1_6~0)))))) (and (or .cse6 (forall ((~var_1_6~0 Int)) (or (< c_~var_1_5~0 ~var_1_6~0) (< .cse5 (+ (div c_~var_1_22~0 ~var_1_6~0) 1)) (= (mod c_~var_1_22~0 ~var_1_6~0) 0) (< ~var_1_6~0 0)))) (forall ((~var_1_6~0 Int)) (or (< c_~var_1_5~0 ~var_1_6~0) (not (= (mod c_~var_1_22~0 ~var_1_6~0) 0)) (< .cse5 (div c_~var_1_22~0 ~var_1_6~0)))) (or .cse6 (forall ((~var_1_6~0 Int)) (or (< c_~var_1_5~0 ~var_1_6~0) (< .cse5 (+ (div c_~var_1_22~0 ~var_1_6~0) 1)) (= (mod c_~var_1_22~0 ~var_1_6~0) 0)))) (or .cse26 .cse16) (forall ((~var_1_6~0 Int)) (or (< 0 (+ ~var_1_6~0 1)) (< .cse5 (div c_~var_1_22~0 ~var_1_6~0)))) (or .cse6 (forall ((~var_1_6~0 Int)) (or (< .cse0 (div c_~var_1_22~0 ~var_1_6~0)) (< 0 (+ ~var_1_6~0 1)) (= (mod c_~var_1_22~0 ~var_1_6~0) 0)))) (forall ((~var_1_6~0 Int)) (or (< c_~var_1_5~0 ~var_1_6~0) (not (= (mod c_~var_1_22~0 ~var_1_6~0) 0)) (< .cse5 (div c_~var_1_22~0 ~var_1_6~0)) (< ~var_1_6~0 0))) (forall ((~var_1_6~0 Int)) (or (not (= (mod c_~var_1_22~0 ~var_1_6~0) 0)) (< 0 (+ ~var_1_6~0 1)) (< .cse5 (div c_~var_1_22~0 ~var_1_6~0)))) (forall ((~var_1_6~0 Int)) (or (< c_~var_1_5~0 ~var_1_6~0) (< .cse5 (+ (div c_~var_1_22~0 ~var_1_6~0) 1)))) (or .cse26 .cse2) (forall ((~var_1_6~0 Int)) (or (< c_~var_1_5~0 ~var_1_6~0) (< .cse5 (+ (div c_~var_1_22~0 ~var_1_6~0) 1)) (< ~var_1_6~0 0))))) (< .cse22 .cse21)) (or .cse8 .cse27) (forall ((~var_1_6~0 Int)) (or (< c_~var_1_5~0 ~var_1_6~0) (< .cse5 (+ (div c_~var_1_22~0 ~var_1_6~0) 65536)) (not (= (mod c_~var_1_22~0 ~var_1_6~0) 0)) (< ~var_1_6~0 0))) (or .cse23 .cse24 .cse28) (or .cse6 (and .cse7 (or .cse8 (forall ((~var_1_6~0 Int)) (let ((.cse29 (+ (div c_~var_1_22~0 ~var_1_6~0) 1))) (or (< c_~var_1_5~0 ~var_1_6~0) (< .cse5 .cse29) (< .cse10 .cse29) (= (mod c_~var_1_22~0 ~var_1_6~0) 0) (< ~var_1_6~0 0))))))) (or .cse23 .cse16 .cse28) (or .cse8 (and .cse17 (or .cse27 .cse3)) .cse2))))) is different from false [2024-11-23 23:51:11,236 WARN L286 SmtUtils]: Spent 9.45s on a formula simplification. DAG size of input: 180 DAG size of output: 178 (called from [L 388] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2024-11-23 23:52:23,446 WARN L286 SmtUtils]: Spent 16.22s on a formula simplification that was a NOOP. DAG size: 192 (called from [L 388] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2024-11-23 23:54:40,695 WARN L286 SmtUtils]: Spent 23.94s on a formula simplification that was a NOOP. DAG size: 219 (called from [L 388] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2024-11-23 23:57:31,096 WARN L286 SmtUtils]: Spent 23.36s on a formula simplification. DAG size of input: 379 DAG size of output: 322 (called from [L 388] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2024-11-23 23:58:00,517 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse58 (mod c_~var_1_7~0 256)) (.cse4 (mod c_~var_1_18~0 65536))) (let ((.cse64 (mod c_~var_1_8~0 256)) (.cse70 (+ .cse58 .cse4))) (let ((.cse65 (= (mod c_~var_1_36~0 .cse70) 0)) (.cse66 (< 0 (+ c_~var_1_36~0 1))) (.cse68 (div c_~var_1_36~0 .cse70)) (.cse63 (mod (+ 34932 c_~var_1_29~0 .cse64) 65536))) (and (or (let ((.cse61 (mod (+ .cse64 c_~var_1_18~0) 65536))) (let ((.cse7 (+ .cse63 .cse64)) (.cse22 (+ .cse63 .cse61)) (.cse5 (+ .cse63 (- 65536)))) (let ((.cse11 (+ .cse63 .cse58 .cse64)) (.cse27 (forall ((~var_1_6~0 Int)) (let ((.cse62 (+ 65536 (div .cse5 ~var_1_6~0)))) (or (< .cse7 .cse62) (< .cse22 .cse62) (< 0 (+ ~var_1_6~0 1)))))) (.cse23 (< 32767 .cse61)) (.cse10 (* .cse4 100))) (let ((.cse0 (forall ((~var_1_6~0 Int)) (or (< .cse7 (+ 65536 (div .cse5 ~var_1_6~0))) (not (= (mod .cse5 ~var_1_6~0) 0)) (< 0 (+ .cse10 ~var_1_6~0 100))))) (.cse3 (forall ((~var_1_6~0 Int)) (or (< .cse7 (+ (div .cse5 ~var_1_6~0) 65537)) (< 0 (+ .cse10 ~var_1_6~0 100))))) (.cse16 (forall ((~var_1_6~0 Int)) (or (< .cse7 (+ 65536 (div .cse5 ~var_1_6~0))) (< 0 (+ .cse10 ~var_1_6~0 100))))) (.cse17 (forall ((~var_1_6~0 Int)) (or (< .cse7 (+ (div .cse5 ~var_1_6~0) 65537)) (< 0 (+ .cse10 ~var_1_6~0 100)) (= (mod .cse5 ~var_1_6~0) 0)))) (.cse19 (< .cse4 (+ .cse58 1))) (.cse24 (or (forall ((~var_1_6~0 Int)) (let ((.cse60 (+ 65536 (div .cse5 ~var_1_6~0)))) (or (< .cse7 .cse60) (not (= (mod .cse5 ~var_1_6~0) 0)) (< .cse22 .cse60) (< 0 (+ ~var_1_6~0 1))))) .cse23)) (.cse29 (or .cse23 .cse27)) (.cse30 (or (forall ((~var_1_6~0 Int)) (let ((.cse59 (+ 65535 (div .cse5 ~var_1_6~0)))) (or (< .cse7 .cse59) (< .cse22 .cse59) (< 0 (+ ~var_1_6~0 1)) (= (mod .cse5 ~var_1_6~0) 0)))) .cse23)) (.cse18 (< .cse58 .cse4)) (.cse35 (forall ((~var_1_6~0 Int)) (or (< 0 (+ 101 .cse10 ~var_1_6~0)) (< .cse7 (+ 65536 (div .cse5 ~var_1_6~0))) (not (= (mod .cse5 ~var_1_6~0) 0))))) (.cse40 (forall ((~var_1_6~0 Int)) (or (< 0 (+ 101 .cse10 ~var_1_6~0)) (< .cse7 (+ (div .cse5 ~var_1_6~0) 65537)) (= (mod .cse5 ~var_1_6~0) 0)))) (.cse41 (forall ((~var_1_6~0 Int)) (or (< 0 (+ 101 .cse10 ~var_1_6~0)) (< .cse7 (+ 65536 (div .cse5 ~var_1_6~0)))))) (.cse1 (forall ((~var_1_6~0 Int)) (or (< .cse7 (+ 65535 (div .cse5 ~var_1_6~0))) (< 0 (+ ~var_1_6~0 1)) (= (mod .cse5 ~var_1_6~0) 0)))) (.cse43 (forall ((~var_1_6~0 Int)) (or (< 0 (+ 101 .cse10 ~var_1_6~0)) (< .cse7 (+ (div .cse5 ~var_1_6~0) 65537))))) (.cse2 (forall ((~var_1_6~0 Int)) (or (< .cse7 (+ 65536 (div .cse5 ~var_1_6~0))) (not (= (mod .cse5 ~var_1_6~0) 0)) (< 0 (+ ~var_1_6~0 1))))) (.cse8 (forall ((~var_1_6~0 Int)) (or (< .cse7 (+ 65536 (div .cse5 ~var_1_6~0))) (< 0 (+ ~var_1_6~0 1))))) (.cse12 (forall ((~var_1_6~0 Int)) (or (< .cse11 (+ 65535 (div .cse5 ~var_1_6~0))) (< 0 (+ ~var_1_6~0 1)) (= (mod .cse5 ~var_1_6~0) 0)))) (.cse13 (forall ((~var_1_6~0 Int)) (or (not (= (mod .cse5 ~var_1_6~0) 0)) (< .cse11 (+ 65536 (div .cse5 ~var_1_6~0))) (< 0 (+ ~var_1_6~0 1))))) (.cse14 (forall ((~var_1_6~0 Int)) (or (< .cse11 (+ 65536 (div .cse5 ~var_1_6~0))) (< 0 (+ ~var_1_6~0 1))))) (.cse15 (< 0 .cse58))) (and (or (and .cse0 .cse1 .cse2 .cse3 (forall ((v_y_96 Int)) (let ((.cse6 (* v_y_96 100))) (or (< 0 (+ v_y_96 .cse4 1)) (not (= (mod .cse5 .cse6) 0)) (< .cse7 (+ 65536 (div .cse5 .cse6)))))) .cse8 (forall ((v_y_96 Int)) (or (< 0 (+ v_y_96 .cse4 1)) (< .cse7 (+ (div .cse5 (* v_y_96 100)) 65537)))) (forall ((v_y_96 Int)) (let ((.cse9 (* v_y_96 100))) (or (< .cse7 (+ (div .cse5 .cse9) 65535)) (= (mod .cse5 .cse9) 0) (< 0 (+ v_y_96 .cse4 1))))) (or (and (forall ((~var_1_6~0 Int)) (or (< 0 (+ .cse10 ~var_1_6~0 100)) (< .cse11 (+ (div .cse5 ~var_1_6~0) 65537)))) .cse12 (forall ((~var_1_6~0 Int)) (or (< 0 (+ ~var_1_6~0 100)) (< .cse11 (+ 65536 (div .cse5 ~var_1_6~0))))) .cse13 .cse14 (forall ((~var_1_6~0 Int)) (or (< 0 (+ .cse10 ~var_1_6~0 100)) (= (mod .cse5 ~var_1_6~0) 0) (< .cse11 (+ (div .cse5 ~var_1_6~0) 65537)))) (forall ((~var_1_6~0 Int)) (or (not (= (mod .cse5 ~var_1_6~0) 0)) (< 0 (+ .cse10 ~var_1_6~0 100)) (< .cse11 (+ 65536 (div .cse5 ~var_1_6~0)))))) .cse15) .cse16 .cse17) .cse18) (or .cse19 (let ((.cse26 (forall ((~var_1_6~0 Int)) (let ((.cse31 (+ 65536 (div .cse5 ~var_1_6~0)))) (or (< .cse7 .cse31) (< 0 (+ .cse10 ~var_1_6~0 100)) (< .cse22 .cse31)))))) (and (forall ((v_y_93 Int)) (or (< 0 (+ v_y_93 .cse4 1)) (< .cse7 (+ (div .cse5 (* v_y_93 100)) 65537)))) (forall ((v_y_93 Int)) (let ((.cse20 (* v_y_93 100))) (or (< 0 (+ v_y_93 .cse4 1)) (< .cse7 (+ 65536 (div .cse5 .cse20))) (not (= (mod .cse5 .cse20) 0))))) .cse0 .cse1 (or (forall ((~var_1_6~0 Int)) (let ((.cse21 (+ (div .cse5 ~var_1_6~0) 65537))) (or (< .cse7 .cse21) (< 0 (+ .cse10 ~var_1_6~0 100)) (= (mod .cse5 ~var_1_6~0) 0) (< .cse22 .cse21)))) .cse23) .cse24 (forall ((v_y_93 Int)) (let ((.cse25 (* v_y_93 100))) (or (< 0 (+ v_y_93 .cse4 1)) (= (mod .cse5 .cse25) 0) (< .cse7 (+ (div .cse5 .cse25) 65535))))) (or .cse23 (and .cse26 (or .cse27 (forall ((v_y_93 Int)) (or (< 0 (+ v_y_93 .cse4 1)) (= (mod .cse5 (* v_y_93 100)) 0)))))) (or .cse23 (forall ((~var_1_6~0 Int)) (let ((.cse28 (+ (div .cse5 ~var_1_6~0) 65537))) (or (< .cse7 .cse28) (< 0 (+ .cse10 ~var_1_6~0 100)) (< .cse22 .cse28))))) .cse2 .cse3 .cse8 .cse29 (or .cse26 .cse23) .cse30 .cse16 .cse17))) (or .cse19 (let ((.cse34 (forall ((~var_1_6~0 Int)) (let ((.cse49 (+ 65536 (div .cse5 ~var_1_6~0)))) (or (< 0 (+ 101 .cse10 ~var_1_6~0)) (< .cse7 .cse49) (< .cse22 .cse49)))))) (and (or (and (or (forall ((v_z_130 Int) (v_y_130 Int) (v_y_119 Int)) (let ((.cse33 (* v_y_130 100))) (let ((.cse32 (+ .cse33 v_z_130))) (or (< .cse32 0) (< v_z_130 0) (< 99 .cse32) (< 99 v_z_130) (= (mod .cse5 (+ .cse33 v_z_130 (* v_y_119 100))) 0) (= .cse32 0) (< 0 (+ 2 v_y_119 v_y_130 .cse4)))))) .cse27) .cse34) .cse23) .cse35 (or (forall ((~var_1_6~0 Int)) (let ((.cse36 (+ (div .cse5 ~var_1_6~0) 65537))) (or (< 0 (+ 101 .cse10 ~var_1_6~0)) (< .cse7 .cse36) (= (mod .cse5 ~var_1_6~0) 0) (< .cse22 .cse36)))) .cse23) (forall ((v_y_119 Int) (v_z_135 Int) (v_y_135 Int)) (let ((.cse39 (* v_y_135 100))) (let ((.cse37 (+ v_z_135 .cse39 (* v_y_119 100))) (.cse38 (+ v_z_135 .cse39))) (or (< .cse7 (+ 65535 (div .cse5 .cse37))) (< .cse38 0) (= (mod .cse5 .cse37) 0) (< 99 v_z_135) (< v_z_135 0) (< 99 .cse38) (< 0 (+ 2 v_y_135 v_y_119 .cse4)) (= .cse38 0))))) .cse40 .cse41 (or (forall ((~var_1_6~0 Int)) (let ((.cse42 (+ (div .cse5 ~var_1_6~0) 65537))) (or (< 0 (+ 101 .cse10 ~var_1_6~0)) (< .cse7 .cse42) (< .cse22 .cse42)))) .cse23) (or .cse34 .cse23) .cse1 .cse24 .cse43 (forall ((v_z_131 Int) (v_y_119 Int) (v_y_131 Int)) (let ((.cse45 (* v_y_131 100))) (let ((.cse44 (+ .cse45 v_z_131))) (or (= .cse44 0) (< .cse44 0) (< 0 (+ 2 v_y_131 v_y_119 .cse4)) (< 99 .cse44) (< v_z_131 0) (< .cse7 (+ (div .cse5 (+ .cse45 v_z_131 (* v_y_119 100))) 65537)) (< 99 v_z_131))))) .cse2 (forall ((v_y_119 Int) (v_z_124 Int) (v_y_124 Int)) (let ((.cse48 (* v_y_124 100))) (let ((.cse47 (+ v_z_124 .cse48 (* v_y_119 100))) (.cse46 (+ v_z_124 .cse48))) (or (< .cse46 0) (< 0 (+ 2 v_y_119 v_y_124 .cse4)) (< 99 v_z_124) (< .cse7 (+ 65536 (div .cse5 .cse47))) (not (= (mod .cse5 .cse47) 0)) (< 99 .cse46))))) .cse8 .cse29 .cse30))) (or .cse18 (and .cse35 .cse40 .cse41 (forall ((v_z_114 Int) (v_y_114 Int) (v_y_101 Int)) (let ((.cse51 (* v_y_114 100))) (let ((.cse50 (+ .cse51 v_z_114))) (or (< v_z_114 0) (= .cse50 0) (< 99 .cse50) (< .cse50 0) (< .cse7 (+ (div .cse5 (+ .cse51 (* v_y_101 100) v_z_114)) 65537)) (< 99 v_z_114) (< 0 (+ 2 v_y_114 v_y_101 .cse4)))))) .cse1 .cse43 (forall ((v_y_117 Int) (v_z_117 Int) (v_y_101 Int)) (let ((.cse54 (* v_y_117 100))) (let ((.cse52 (+ .cse54 (* v_y_101 100) v_z_117)) (.cse53 (+ .cse54 v_z_117))) (or (not (= (mod .cse5 .cse52) 0)) (< v_z_117 0) (< 0 (+ 2 v_y_117 v_y_101 .cse4)) (< .cse7 (+ 65536 (div .cse5 .cse52))) (= .cse53 0) (< 99 v_z_117) (< .cse53 0) (< 99 .cse53))))) .cse2 .cse8 (or (and (forall ((~var_1_6~0 Int)) (or (< 0 (+ 101 .cse10 ~var_1_6~0)) (< .cse11 (+ (div .cse5 ~var_1_6~0) 65537)))) .cse12 (forall ((~var_1_6~0 Int)) (or (< 0 (+ 101 .cse10 ~var_1_6~0)) (< .cse11 (+ 65536 (div .cse5 ~var_1_6~0))))) (forall ((~var_1_6~0 Int)) (or (< 0 (+ 101 .cse10 ~var_1_6~0)) (not (= (mod .cse5 ~var_1_6~0) 0)) (< .cse11 (+ 65536 (div .cse5 ~var_1_6~0))))) (forall ((~var_1_6~0 Int)) (or (< 0 (+ 101 .cse10 ~var_1_6~0)) (= (mod .cse5 ~var_1_6~0) 0) (< .cse11 (+ (div .cse5 ~var_1_6~0) 65537)))) .cse13 .cse14) .cse15) (forall ((v_z_115 Int) (v_y_115 Int) (v_y_101 Int)) (let ((.cse57 (* v_y_115 100))) (let ((.cse55 (+ .cse57 (* v_y_101 100) v_z_115)) (.cse56 (+ .cse57 v_z_115))) (or (= (mod .cse5 .cse55) 0) (< 99 v_z_115) (< 0 (+ 2 v_y_115 v_y_101 .cse4)) (= .cse56 0) (< .cse7 (+ (div .cse5 .cse55) 65535)) (< v_z_115 0) (< 99 .cse56) (< .cse56 0)))))))))))) (< .cse63 32768) (let ((.cse67 (+ .cse68 65537))) (and (or .cse65 .cse66 (< .cse67 .cse63)) (<= .cse67 .cse63)))) (or (let ((.cse69 (+ .cse68 1))) (and (or .cse65 (< .cse69 .cse63) .cse66) (<= .cse69 .cse63))) (< 32767 .cse63)))))) is different from false [2024-11-23 23:58:04,534 WARN L873 $PredicateComparison]: unable to prove that (let ((.cse58 (mod c_~var_1_7~0 256)) (.cse4 (mod c_~var_1_18~0 65536))) (let ((.cse64 (mod c_~var_1_8~0 256)) (.cse70 (+ .cse58 .cse4))) (let ((.cse65 (= (mod c_~var_1_36~0 .cse70) 0)) (.cse66 (< 0 (+ c_~var_1_36~0 1))) (.cse68 (div c_~var_1_36~0 .cse70)) (.cse63 (mod (+ 34932 c_~var_1_29~0 .cse64) 65536))) (and (or (let ((.cse61 (mod (+ .cse64 c_~var_1_18~0) 65536))) (let ((.cse7 (+ .cse63 .cse64)) (.cse22 (+ .cse63 .cse61)) (.cse5 (+ .cse63 (- 65536)))) (let ((.cse11 (+ .cse63 .cse58 .cse64)) (.cse27 (forall ((~var_1_6~0 Int)) (let ((.cse62 (+ 65536 (div .cse5 ~var_1_6~0)))) (or (< .cse7 .cse62) (< .cse22 .cse62) (< 0 (+ ~var_1_6~0 1)))))) (.cse23 (< 32767 .cse61)) (.cse10 (* .cse4 100))) (let ((.cse0 (forall ((~var_1_6~0 Int)) (or (< .cse7 (+ 65536 (div .cse5 ~var_1_6~0))) (not (= (mod .cse5 ~var_1_6~0) 0)) (< 0 (+ .cse10 ~var_1_6~0 100))))) (.cse3 (forall ((~var_1_6~0 Int)) (or (< .cse7 (+ (div .cse5 ~var_1_6~0) 65537)) (< 0 (+ .cse10 ~var_1_6~0 100))))) (.cse16 (forall ((~var_1_6~0 Int)) (or (< .cse7 (+ 65536 (div .cse5 ~var_1_6~0))) (< 0 (+ .cse10 ~var_1_6~0 100))))) (.cse17 (forall ((~var_1_6~0 Int)) (or (< .cse7 (+ (div .cse5 ~var_1_6~0) 65537)) (< 0 (+ .cse10 ~var_1_6~0 100)) (= (mod .cse5 ~var_1_6~0) 0)))) (.cse19 (< .cse4 (+ .cse58 1))) (.cse24 (or (forall ((~var_1_6~0 Int)) (let ((.cse60 (+ 65536 (div .cse5 ~var_1_6~0)))) (or (< .cse7 .cse60) (not (= (mod .cse5 ~var_1_6~0) 0)) (< .cse22 .cse60) (< 0 (+ ~var_1_6~0 1))))) .cse23)) (.cse29 (or .cse23 .cse27)) (.cse30 (or (forall ((~var_1_6~0 Int)) (let ((.cse59 (+ 65535 (div .cse5 ~var_1_6~0)))) (or (< .cse7 .cse59) (< .cse22 .cse59) (< 0 (+ ~var_1_6~0 1)) (= (mod .cse5 ~var_1_6~0) 0)))) .cse23)) (.cse18 (< .cse58 .cse4)) (.cse35 (forall ((~var_1_6~0 Int)) (or (< 0 (+ 101 .cse10 ~var_1_6~0)) (< .cse7 (+ 65536 (div .cse5 ~var_1_6~0))) (not (= (mod .cse5 ~var_1_6~0) 0))))) (.cse40 (forall ((~var_1_6~0 Int)) (or (< 0 (+ 101 .cse10 ~var_1_6~0)) (< .cse7 (+ (div .cse5 ~var_1_6~0) 65537)) (= (mod .cse5 ~var_1_6~0) 0)))) (.cse41 (forall ((~var_1_6~0 Int)) (or (< 0 (+ 101 .cse10 ~var_1_6~0)) (< .cse7 (+ 65536 (div .cse5 ~var_1_6~0)))))) (.cse1 (forall ((~var_1_6~0 Int)) (or (< .cse7 (+ 65535 (div .cse5 ~var_1_6~0))) (< 0 (+ ~var_1_6~0 1)) (= (mod .cse5 ~var_1_6~0) 0)))) (.cse43 (forall ((~var_1_6~0 Int)) (or (< 0 (+ 101 .cse10 ~var_1_6~0)) (< .cse7 (+ (div .cse5 ~var_1_6~0) 65537))))) (.cse2 (forall ((~var_1_6~0 Int)) (or (< .cse7 (+ 65536 (div .cse5 ~var_1_6~0))) (not (= (mod .cse5 ~var_1_6~0) 0)) (< 0 (+ ~var_1_6~0 1))))) (.cse8 (forall ((~var_1_6~0 Int)) (or (< .cse7 (+ 65536 (div .cse5 ~var_1_6~0))) (< 0 (+ ~var_1_6~0 1))))) (.cse12 (forall ((~var_1_6~0 Int)) (or (< .cse11 (+ 65535 (div .cse5 ~var_1_6~0))) (< 0 (+ ~var_1_6~0 1)) (= (mod .cse5 ~var_1_6~0) 0)))) (.cse13 (forall ((~var_1_6~0 Int)) (or (not (= (mod .cse5 ~var_1_6~0) 0)) (< .cse11 (+ 65536 (div .cse5 ~var_1_6~0))) (< 0 (+ ~var_1_6~0 1))))) (.cse14 (forall ((~var_1_6~0 Int)) (or (< .cse11 (+ 65536 (div .cse5 ~var_1_6~0))) (< 0 (+ ~var_1_6~0 1))))) (.cse15 (< 0 .cse58))) (and (or (and .cse0 .cse1 .cse2 .cse3 (forall ((v_y_96 Int)) (let ((.cse6 (* v_y_96 100))) (or (< 0 (+ v_y_96 .cse4 1)) (not (= (mod .cse5 .cse6) 0)) (< .cse7 (+ 65536 (div .cse5 .cse6)))))) .cse8 (forall ((v_y_96 Int)) (or (< 0 (+ v_y_96 .cse4 1)) (< .cse7 (+ (div .cse5 (* v_y_96 100)) 65537)))) (forall ((v_y_96 Int)) (let ((.cse9 (* v_y_96 100))) (or (< .cse7 (+ (div .cse5 .cse9) 65535)) (= (mod .cse5 .cse9) 0) (< 0 (+ v_y_96 .cse4 1))))) (or (and (forall ((~var_1_6~0 Int)) (or (< 0 (+ .cse10 ~var_1_6~0 100)) (< .cse11 (+ (div .cse5 ~var_1_6~0) 65537)))) .cse12 (forall ((~var_1_6~0 Int)) (or (< 0 (+ ~var_1_6~0 100)) (< .cse11 (+ 65536 (div .cse5 ~var_1_6~0))))) .cse13 .cse14 (forall ((~var_1_6~0 Int)) (or (< 0 (+ .cse10 ~var_1_6~0 100)) (= (mod .cse5 ~var_1_6~0) 0) (< .cse11 (+ (div .cse5 ~var_1_6~0) 65537)))) (forall ((~var_1_6~0 Int)) (or (not (= (mod .cse5 ~var_1_6~0) 0)) (< 0 (+ .cse10 ~var_1_6~0 100)) (< .cse11 (+ 65536 (div .cse5 ~var_1_6~0)))))) .cse15) .cse16 .cse17) .cse18) (or .cse19 (let ((.cse26 (forall ((~var_1_6~0 Int)) (let ((.cse31 (+ 65536 (div .cse5 ~var_1_6~0)))) (or (< .cse7 .cse31) (< 0 (+ .cse10 ~var_1_6~0 100)) (< .cse22 .cse31)))))) (and (forall ((v_y_93 Int)) (or (< 0 (+ v_y_93 .cse4 1)) (< .cse7 (+ (div .cse5 (* v_y_93 100)) 65537)))) (forall ((v_y_93 Int)) (let ((.cse20 (* v_y_93 100))) (or (< 0 (+ v_y_93 .cse4 1)) (< .cse7 (+ 65536 (div .cse5 .cse20))) (not (= (mod .cse5 .cse20) 0))))) .cse0 .cse1 (or (forall ((~var_1_6~0 Int)) (let ((.cse21 (+ (div .cse5 ~var_1_6~0) 65537))) (or (< .cse7 .cse21) (< 0 (+ .cse10 ~var_1_6~0 100)) (= (mod .cse5 ~var_1_6~0) 0) (< .cse22 .cse21)))) .cse23) .cse24 (forall ((v_y_93 Int)) (let ((.cse25 (* v_y_93 100))) (or (< 0 (+ v_y_93 .cse4 1)) (= (mod .cse5 .cse25) 0) (< .cse7 (+ (div .cse5 .cse25) 65535))))) (or .cse23 (and .cse26 (or .cse27 (forall ((v_y_93 Int)) (or (< 0 (+ v_y_93 .cse4 1)) (= (mod .cse5 (* v_y_93 100)) 0)))))) (or .cse23 (forall ((~var_1_6~0 Int)) (let ((.cse28 (+ (div .cse5 ~var_1_6~0) 65537))) (or (< .cse7 .cse28) (< 0 (+ .cse10 ~var_1_6~0 100)) (< .cse22 .cse28))))) .cse2 .cse3 .cse8 .cse29 (or .cse26 .cse23) .cse30 .cse16 .cse17))) (or .cse19 (let ((.cse34 (forall ((~var_1_6~0 Int)) (let ((.cse49 (+ 65536 (div .cse5 ~var_1_6~0)))) (or (< 0 (+ 101 .cse10 ~var_1_6~0)) (< .cse7 .cse49) (< .cse22 .cse49)))))) (and (or (and (or (forall ((v_z_130 Int) (v_y_130 Int) (v_y_119 Int)) (let ((.cse33 (* v_y_130 100))) (let ((.cse32 (+ .cse33 v_z_130))) (or (< .cse32 0) (< v_z_130 0) (< 99 .cse32) (< 99 v_z_130) (= (mod .cse5 (+ .cse33 v_z_130 (* v_y_119 100))) 0) (= .cse32 0) (< 0 (+ 2 v_y_119 v_y_130 .cse4)))))) .cse27) .cse34) .cse23) .cse35 (or (forall ((~var_1_6~0 Int)) (let ((.cse36 (+ (div .cse5 ~var_1_6~0) 65537))) (or (< 0 (+ 101 .cse10 ~var_1_6~0)) (< .cse7 .cse36) (= (mod .cse5 ~var_1_6~0) 0) (< .cse22 .cse36)))) .cse23) (forall ((v_y_119 Int) (v_z_135 Int) (v_y_135 Int)) (let ((.cse39 (* v_y_135 100))) (let ((.cse37 (+ v_z_135 .cse39 (* v_y_119 100))) (.cse38 (+ v_z_135 .cse39))) (or (< .cse7 (+ 65535 (div .cse5 .cse37))) (< .cse38 0) (= (mod .cse5 .cse37) 0) (< 99 v_z_135) (< v_z_135 0) (< 99 .cse38) (< 0 (+ 2 v_y_135 v_y_119 .cse4)) (= .cse38 0))))) .cse40 .cse41 (or (forall ((~var_1_6~0 Int)) (let ((.cse42 (+ (div .cse5 ~var_1_6~0) 65537))) (or (< 0 (+ 101 .cse10 ~var_1_6~0)) (< .cse7 .cse42) (< .cse22 .cse42)))) .cse23) (or .cse34 .cse23) .cse1 .cse24 .cse43 (forall ((v_z_131 Int) (v_y_119 Int) (v_y_131 Int)) (let ((.cse45 (* v_y_131 100))) (let ((.cse44 (+ .cse45 v_z_131))) (or (= .cse44 0) (< .cse44 0) (< 0 (+ 2 v_y_131 v_y_119 .cse4)) (< 99 .cse44) (< v_z_131 0) (< .cse7 (+ (div .cse5 (+ .cse45 v_z_131 (* v_y_119 100))) 65537)) (< 99 v_z_131))))) .cse2 (forall ((v_y_119 Int) (v_z_124 Int) (v_y_124 Int)) (let ((.cse48 (* v_y_124 100))) (let ((.cse47 (+ v_z_124 .cse48 (* v_y_119 100))) (.cse46 (+ v_z_124 .cse48))) (or (< .cse46 0) (< 0 (+ 2 v_y_119 v_y_124 .cse4)) (< 99 v_z_124) (< .cse7 (+ 65536 (div .cse5 .cse47))) (not (= (mod .cse5 .cse47) 0)) (< 99 .cse46))))) .cse8 .cse29 .cse30))) (or .cse18 (and .cse35 .cse40 .cse41 (forall ((v_z_114 Int) (v_y_114 Int) (v_y_101 Int)) (let ((.cse51 (* v_y_114 100))) (let ((.cse50 (+ .cse51 v_z_114))) (or (< v_z_114 0) (= .cse50 0) (< 99 .cse50) (< .cse50 0) (< .cse7 (+ (div .cse5 (+ .cse51 (* v_y_101 100) v_z_114)) 65537)) (< 99 v_z_114) (< 0 (+ 2 v_y_114 v_y_101 .cse4)))))) .cse1 .cse43 (forall ((v_y_117 Int) (v_z_117 Int) (v_y_101 Int)) (let ((.cse54 (* v_y_117 100))) (let ((.cse52 (+ .cse54 (* v_y_101 100) v_z_117)) (.cse53 (+ .cse54 v_z_117))) (or (not (= (mod .cse5 .cse52) 0)) (< v_z_117 0) (< 0 (+ 2 v_y_117 v_y_101 .cse4)) (< .cse7 (+ 65536 (div .cse5 .cse52))) (= .cse53 0) (< 99 v_z_117) (< .cse53 0) (< 99 .cse53))))) .cse2 .cse8 (or (and (forall ((~var_1_6~0 Int)) (or (< 0 (+ 101 .cse10 ~var_1_6~0)) (< .cse11 (+ (div .cse5 ~var_1_6~0) 65537)))) .cse12 (forall ((~var_1_6~0 Int)) (or (< 0 (+ 101 .cse10 ~var_1_6~0)) (< .cse11 (+ 65536 (div .cse5 ~var_1_6~0))))) (forall ((~var_1_6~0 Int)) (or (< 0 (+ 101 .cse10 ~var_1_6~0)) (not (= (mod .cse5 ~var_1_6~0) 0)) (< .cse11 (+ 65536 (div .cse5 ~var_1_6~0))))) (forall ((~var_1_6~0 Int)) (or (< 0 (+ 101 .cse10 ~var_1_6~0)) (= (mod .cse5 ~var_1_6~0) 0) (< .cse11 (+ (div .cse5 ~var_1_6~0) 65537)))) .cse13 .cse14) .cse15) (forall ((v_z_115 Int) (v_y_115 Int) (v_y_101 Int)) (let ((.cse57 (* v_y_115 100))) (let ((.cse55 (+ .cse57 (* v_y_101 100) v_z_115)) (.cse56 (+ .cse57 v_z_115))) (or (= (mod .cse5 .cse55) 0) (< 99 v_z_115) (< 0 (+ 2 v_y_115 v_y_101 .cse4)) (= .cse56 0) (< .cse7 (+ (div .cse5 .cse55) 65535)) (< v_z_115 0) (< 99 .cse56) (< .cse56 0)))))))))))) (< .cse63 32768) (let ((.cse67 (+ .cse68 65537))) (and (or .cse65 .cse66 (< .cse67 .cse63)) (<= .cse67 .cse63)))) (or (let ((.cse69 (+ .cse68 1))) (and (or .cse65 (< .cse69 .cse63) .cse66) (<= .cse69 .cse63))) (< 32767 .cse63)))))) is different from true [2024-11-24 00:00:23,686 INFO L134 CoverageAnalysis]: Checked inductivity of 2244 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2244 trivial. 0 not checked. [2024-11-24 00:00:23,687 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-24 00:00:23,687 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2050971303] [2024-11-24 00:00:23,688 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2024-11-24 00:00:23,688 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1546300586] [2024-11-24 00:00:23,688 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1546300586] provided 1 perfect and 1 imperfect interpolant sequences [2024-11-24 00:00:23,688 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-24 00:00:23,689 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [41] total 52 [2024-11-24 00:00:23,689 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1195434622] [2024-11-24 00:00:23,689 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-24 00:00:23,690 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2024-11-24 00:00:23,690 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-24 00:00:23,691 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2024-11-24 00:00:23,694 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=379, Invalid=1601, Unknown=28, NotChecked=644, Total=2652 [2024-11-24 00:00:23,694 INFO L87 Difference]: Start difference. First operand 186 states and 269 transitions. Second operand has 13 states, 13 states have (on average 3.6153846153846154) internal successors, (47), 13 states have internal predecessors, (47), 1 states have call successors, (34), 1 states have call predecessors, (34), 1 states have return successors, (34), 1 states have call predecessors, (34), 1 states have call successors, (34) [2024-11-24 00:00:28,285 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.02s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [1] [2024-11-24 00:00:32,676 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [1] [2024-11-24 00:00:37,551 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [1] [2024-11-24 00:00:42,491 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.02s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [1] [2024-11-24 00:00:46,642 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [1] [2024-11-24 00:00:50,577 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 3.66s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [1] [2024-11-24 00:00:54,815 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.02s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [1] [2024-11-24 00:00:59,837 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [1] [2024-11-24 00:01:03,852 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [1] [2024-11-24 00:01:07,873 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.02s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [1] [2024-11-24 00:01:12,511 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.02s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [1] [2024-11-24 00:01:16,524 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [1] [2024-11-24 00:01:20,693 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.02s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [1] [2024-11-24 00:01:25,405 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [1] [2024-11-24 00:01:29,417 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [1] [2024-11-24 00:01:34,001 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.02s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [1] [2024-11-24 00:01:38,357 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [1] [2024-11-24 00:01:39,509 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.15s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [1] [2024-11-24 00:01:44,484 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.02s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [1] [2024-11-24 00:01:48,502 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.02s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [1] [2024-11-24 00:01:52,520 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.02s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [1] [2024-11-24 00:01:57,695 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [1] [2024-11-24 00:01:58,909 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.21s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [1] [2024-11-24 00:02:02,098 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.79s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [1] [2024-11-24 00:02:07,863 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.02s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [1] [2024-11-24 00:02:11,888 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.02s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [1] [2024-11-24 00:02:17,037 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [1] [2024-11-24 00:02:21,074 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [1] [2024-11-24 00:02:24,899 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 3.82s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [1] [2024-11-24 00:03:33,794 WARN L286 SmtUtils]: Spent 36.14s on a formula simplification that was a NOOP. DAG size: 478 (called from [L 388] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2024-11-24 00:03:38,122 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [1]