./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 551b0097 Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_100-1loop_file-87.i -s /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux --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-?-551b009-m [2025-01-09 12:59:49,058 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-01-09 12:59:49,118 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2025-01-09 12:59:49,125 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-01-09 12:59:49,126 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-01-09 12:59:49,146 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-01-09 12:59:49,147 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-01-09 12:59:49,148 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-01-09 12:59:49,148 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-01-09 12:59:49,148 INFO L153 SettingsManager]: * Use memory slicer=true [2025-01-09 12:59:49,149 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-01-09 12:59:49,149 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-01-09 12:59:49,149 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-01-09 12:59:49,149 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-01-09 12:59:49,150 INFO L153 SettingsManager]: * Use SBE=true [2025-01-09 12:59:49,150 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-01-09 12:59:49,150 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-01-09 12:59:49,150 INFO L153 SettingsManager]: * sizeof long=4 [2025-01-09 12:59:49,150 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-01-09 12:59:49,150 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-01-09 12:59:49,150 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-01-09 12:59:49,150 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-01-09 12:59:49,151 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-01-09 12:59:49,151 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-01-09 12:59:49,151 INFO L153 SettingsManager]: * sizeof long double=12 [2025-01-09 12:59:49,151 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-01-09 12:59:49,151 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-01-09 12:59:49,151 INFO L153 SettingsManager]: * Use constant arrays=true [2025-01-09 12:59:49,151 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-01-09 12:59:49,151 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-09 12:59:49,151 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-01-09 12:59:49,152 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-09 12:59:49,152 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 12:59:49,152 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2025-01-09 12:59:49,152 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-09 12:59:49,152 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-01-09 12:59:49,152 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-09 12:59:49,152 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 12:59:49,152 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-01-09 12:59:49,152 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-01-09 12:59:49,152 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-01-09 12:59:49,152 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-01-09 12:59:49,152 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-01-09 12:59:49,153 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-01-09 12:59:49,153 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-01-09 12:59:49,153 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-01-09 12:59:49,153 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-01-09 12:59:49,153 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-01-09 12:59:49,153 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 -> /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux 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 [2025-01-09 12:59:49,385 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-01-09 12:59:49,392 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-01-09 12:59:49,394 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-01-09 12:59:49,395 INFO L270 PluginConnector]: Initializing CDTParser... [2025-01-09 12:59:49,396 INFO L274 PluginConnector]: CDTParser initialized [2025-01-09 12:59:49,397 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_100-1loop_file-87.i [2025-01-09 12:59:50,552 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/93ded1ce0/d96e1308a1f046d09e32a23b951635bd/FLAGb2bff1ae2 [2025-01-09 12:59:50,860 INFO L384 CDTParser]: Found 1 translation units. [2025-01-09 12:59:50,869 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_100-1loop_file-87.i [2025-01-09 12:59:50,877 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/93ded1ce0/d96e1308a1f046d09e32a23b951635bd/FLAGb2bff1ae2 [2025-01-09 12:59:51,168 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/93ded1ce0/d96e1308a1f046d09e32a23b951635bd [2025-01-09 12:59:51,170 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-01-09 12:59:51,172 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-01-09 12:59:51,178 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-01-09 12:59:51,178 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-01-09 12:59:51,181 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-01-09 12:59:51,186 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.01 12:59:51" (1/1) ... [2025-01-09 12:59:51,187 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@8021687 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 12:59:51, skipping insertion in model container [2025-01-09 12:59:51,187 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.01 12:59:51" (1/1) ... [2025-01-09 12:59:51,218 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-01-09 12:59:51,335 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_100-1loop_file-87.i[916,929] [2025-01-09 12:59:51,380 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-09 12:59:51,387 INFO L200 MainTranslator]: Completed pre-run [2025-01-09 12:59:51,393 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_100-1loop_file-87.i[916,929] [2025-01-09 12:59:51,417 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-09 12:59:51,428 INFO L204 MainTranslator]: Completed translation [2025-01-09 12:59:51,429 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 12:59:51 WrapperNode [2025-01-09 12:59:51,429 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-01-09 12:59:51,430 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-01-09 12:59:51,430 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-01-09 12:59:51,430 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-01-09 12:59:51,433 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 12:59:51" (1/1) ... [2025-01-09 12:59:51,440 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 12:59:51" (1/1) ... [2025-01-09 12:59:51,477 INFO L138 Inliner]: procedures = 26, calls = 47, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 218 [2025-01-09 12:59:51,477 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-01-09 12:59:51,478 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-01-09 12:59:51,478 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-01-09 12:59:51,478 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-01-09 12:59:51,484 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 12:59:51" (1/1) ... [2025-01-09 12:59:51,484 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 12:59:51" (1/1) ... [2025-01-09 12:59:51,487 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 12:59:51" (1/1) ... [2025-01-09 12:59:51,503 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]. [2025-01-09 12:59:51,504 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 12:59:51" (1/1) ... [2025-01-09 12:59:51,504 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 12:59:51" (1/1) ... [2025-01-09 12:59:51,518 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 12:59:51" (1/1) ... [2025-01-09 12:59:51,520 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 12:59:51" (1/1) ... [2025-01-09 12:59:51,525 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 12:59:51" (1/1) ... [2025-01-09 12:59:51,530 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 12:59:51" (1/1) ... [2025-01-09 12:59:51,531 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 12:59:51" (1/1) ... [2025-01-09 12:59:51,536 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-01-09 12:59:51,539 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2025-01-09 12:59:51,539 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2025-01-09 12:59:51,539 INFO L274 PluginConnector]: RCFGBuilder initialized [2025-01-09 12:59:51,540 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 12:59:51" (1/1) ... [2025-01-09 12:59:51,546 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 12:59:51,556 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 12:59:51,573 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-01-09 12:59:51,575 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-01-09 12:59:51,592 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-01-09 12:59:51,592 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2025-01-09 12:59:51,592 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2025-01-09 12:59:51,593 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-01-09 12:59:51,593 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-01-09 12:59:51,593 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-01-09 12:59:51,669 INFO L234 CfgBuilder]: Building ICFG [2025-01-09 12:59:51,670 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2025-01-09 12:59:52,013 INFO L? ?]: Removed 33 outVars from TransFormulas that were not future-live. [2025-01-09 12:59:52,013 INFO L283 CfgBuilder]: Performing block encoding [2025-01-09 12:59:52,025 INFO L307 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-01-09 12:59:52,026 INFO L312 CfgBuilder]: Removed 0 assume(true) statements. [2025-01-09 12:59:52,026 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.01 12:59:52 BoogieIcfgContainer [2025-01-09 12:59:52,026 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2025-01-09 12:59:52,028 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-01-09 12:59:52,028 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-01-09 12:59:52,031 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-01-09 12:59:52,032 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 09.01 12:59:51" (1/3) ... [2025-01-09 12:59:52,032 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3384cf9f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.01 12:59:52, skipping insertion in model container [2025-01-09 12:59:52,032 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 12:59:51" (2/3) ... [2025-01-09 12:59:52,032 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3384cf9f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.01 12:59:52, skipping insertion in model container [2025-01-09 12:59:52,032 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.01 12:59:52" (3/3) ... [2025-01-09 12:59:52,033 INFO L128 eAbstractionObserver]: Analyzing ICFG hardness_loopvsstraightlinecode_100-1loop_file-87.i [2025-01-09 12:59:52,048 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-01-09 12:59:52,049 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG hardness_loopvsstraightlinecode_100-1loop_file-87.i that has 2 procedures, 91 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-01-09 12:59:52,091 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-01-09 12:59:52,102 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;@1f288398, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-01-09 12:59:52,102 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-01-09 12:59:52,105 INFO L276 IsEmpty]: Start isEmpty. Operand has 91 states, 54 states have (on average 1.3518518518518519) internal successors, (73), 55 states have internal predecessors, (73), 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) [2025-01-09 12:59:52,116 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 214 [2025-01-09 12:59:52,117 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 12:59:52,118 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] [2025-01-09 12:59:52,118 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 12:59:52,122 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 12:59:52,123 INFO L85 PathProgramCache]: Analyzing trace with hash 1825669721, now seen corresponding path program 1 times [2025-01-09 12:59:52,128 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 12:59:52,128 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [642868614] [2025-01-09 12:59:52,128 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 12:59:52,130 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 12:59:52,220 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 213 statements into 1 equivalence classes. [2025-01-09 12:59:52,237 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 213 of 213 statements. [2025-01-09 12:59:52,238 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 12:59:52,238 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 12:59:52,471 INFO L134 CoverageAnalysis]: Checked inductivity of 2244 backedges. 0 proven. 66 refuted. 0 times theorem prover too weak. 2178 trivial. 0 not checked. [2025-01-09 12:59:52,471 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 12:59:52,471 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [642868614] [2025-01-09 12:59:52,472 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [642868614] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 12:59:52,473 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [928359659] [2025-01-09 12:59:52,474 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 12:59:52,474 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 12:59:52,474 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 12:59:52,476 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-01-09 12:59:52,482 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2025-01-09 12:59:52,577 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 213 statements into 1 equivalence classes. [2025-01-09 12:59:52,682 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 213 of 213 statements. [2025-01-09 12:59:52,682 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 12:59:52,682 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 12:59:52,685 INFO L256 TraceCheckSpWp]: Trace formula consists of 515 conjuncts, 1 conjuncts are in the unsatisfiable core [2025-01-09 12:59:52,695 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 12:59:52,727 INFO L134 CoverageAnalysis]: Checked inductivity of 2244 backedges. 66 proven. 0 refuted. 0 times theorem prover too weak. 2178 trivial. 0 not checked. [2025-01-09 12:59:52,729 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-01-09 12:59:52,729 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [928359659] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 12:59:52,729 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-01-09 12:59:52,730 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [2] total 2 [2025-01-09 12:59:52,732 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [154556161] [2025-01-09 12:59:52,732 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 12:59:52,735 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-01-09 12:59:52,736 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 12:59:52,749 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-01-09 12:59:52,750 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-01-09 12:59:52,751 INFO L87 Difference]: Start difference. First operand has 91 states, 54 states have (on average 1.3518518518518519) internal successors, (73), 55 states have internal predecessors, (73), 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.0) internal successors, (48), 2 states have internal predecessors, (48), 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) [2025-01-09 12:59:52,779 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 12:59:52,780 INFO L93 Difference]: Finished difference Result 179 states and 313 transitions. [2025-01-09 12:59:52,780 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-01-09 12:59:52,782 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 24.0) internal successors, (48), 2 states have internal predecessors, (48), 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 213 [2025-01-09 12:59:52,782 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 12:59:52,787 INFO L225 Difference]: With dead ends: 179 [2025-01-09 12:59:52,787 INFO L226 Difference]: Without dead ends: 88 [2025-01-09 12:59:52,789 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 214 GetRequests, 214 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-01-09 12:59:52,792 INFO L435 NwaCegarLoop]: 139 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, 139 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 [2025-01-09 12:59:52,792 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 139 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 12:59:52,801 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 88 states. [2025-01-09 12:59:52,817 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 88 to 88. [2025-01-09 12:59:52,818 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 88 states, 52 states have (on average 1.3076923076923077) internal successors, (68), 52 states have internal predecessors, (68), 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) [2025-01-09 12:59:52,822 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 88 states to 88 states and 136 transitions. [2025-01-09 12:59:52,823 INFO L78 Accepts]: Start accepts. Automaton has 88 states and 136 transitions. Word has length 213 [2025-01-09 12:59:52,824 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 12:59:52,824 INFO L471 AbstractCegarLoop]: Abstraction has 88 states and 136 transitions. [2025-01-09 12:59:52,824 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 24.0) internal successors, (48), 2 states have internal predecessors, (48), 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) [2025-01-09 12:59:52,824 INFO L276 IsEmpty]: Start isEmpty. Operand 88 states and 136 transitions. [2025-01-09 12:59:52,826 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 214 [2025-01-09 12:59:52,827 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 12:59:52,827 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] [2025-01-09 12:59:52,835 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2025-01-09 12:59:53,031 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable0 [2025-01-09 12:59:53,031 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 12:59:53,032 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 12:59:53,032 INFO L85 PathProgramCache]: Analyzing trace with hash -682090607, now seen corresponding path program 1 times [2025-01-09 12:59:53,032 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 12:59:53,032 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1963940913] [2025-01-09 12:59:53,033 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 12:59:53,033 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 12:59:53,061 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 213 statements into 1 equivalence classes. [2025-01-09 12:59:53,328 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 213 of 213 statements. [2025-01-09 12:59:53,328 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 12:59:53,328 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 12:59:53,804 INFO L134 CoverageAnalysis]: Checked inductivity of 2244 backedges. 45 proven. 54 refuted. 0 times theorem prover too weak. 2145 trivial. 0 not checked. [2025-01-09 12:59:53,804 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 12:59:53,804 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1963940913] [2025-01-09 12:59:53,804 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1963940913] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 12:59:53,804 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2131757643] [2025-01-09 12:59:53,805 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 12:59:53,805 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 12:59:53,805 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 12:59:53,807 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-01-09 12:59:53,813 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2025-01-09 12:59:53,885 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 213 statements into 1 equivalence classes. [2025-01-09 12:59:53,954 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 213 of 213 statements. [2025-01-09 12:59:53,955 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 12:59:53,955 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 12:59:53,957 INFO L256 TraceCheckSpWp]: Trace formula consists of 515 conjuncts, 6 conjuncts are in the unsatisfiable core [2025-01-09 12:59:53,965 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 12:59:54,184 INFO L134 CoverageAnalysis]: Checked inductivity of 2244 backedges. 1143 proven. 54 refuted. 0 times theorem prover too weak. 1047 trivial. 0 not checked. [2025-01-09 12:59:54,185 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-09 12:59:54,455 INFO L134 CoverageAnalysis]: Checked inductivity of 2244 backedges. 45 proven. 54 refuted. 0 times theorem prover too weak. 2145 trivial. 0 not checked. [2025-01-09 12:59:54,456 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2131757643] provided 0 perfect and 2 imperfect interpolant sequences [2025-01-09 12:59:54,456 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-01-09 12:59:54,456 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 7 [2025-01-09 12:59:54,456 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2015409662] [2025-01-09 12:59:54,456 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-01-09 12:59:54,458 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-01-09 12:59:54,459 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 12:59:54,460 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-01-09 12:59:54,460 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2025-01-09 12:59:54,461 INFO L87 Difference]: Start difference. First operand 88 states and 136 transitions. Second operand has 7 states, 7 states have (on average 7.857142857142857) internal successors, (55), 7 states have internal predecessors, (55), 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) [2025-01-09 12:59:54,758 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 12:59:54,760 INFO L93 Difference]: Finished difference Result 181 states and 276 transitions. [2025-01-09 12:59:54,762 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-01-09 12:59:54,762 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 7.857142857142857) internal successors, (55), 7 states have internal predecessors, (55), 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 213 [2025-01-09 12:59:54,763 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 12:59:54,766 INFO L225 Difference]: With dead ends: 181 [2025-01-09 12:59:54,766 INFO L226 Difference]: Without dead ends: 96 [2025-01-09 12:59:54,767 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 433 GetRequests, 423 SyntacticMatches, 1 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=45, Invalid=65, Unknown=0, NotChecked=0, Total=110 [2025-01-09 12:59:54,769 INFO L435 NwaCegarLoop]: 97 mSDtfsCounter, 109 mSDsluCounter, 124 mSDsCounter, 0 mSdLazyCounter, 189 mSolverCounterSat, 34 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 123 SdHoareTripleChecker+Valid, 221 SdHoareTripleChecker+Invalid, 223 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 34 IncrementalHoareTripleChecker+Valid, 189 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-01-09 12:59:54,770 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [123 Valid, 221 Invalid, 223 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [34 Valid, 189 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-01-09 12:59:54,770 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 96 states. [2025-01-09 12:59:54,783 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 96 to 92. [2025-01-09 12:59:54,784 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 92 states, 55 states have (on average 1.2727272727272727) internal successors, (70), 55 states have internal predecessors, (70), 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) [2025-01-09 12:59:54,785 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 92 states to 92 states and 138 transitions. [2025-01-09 12:59:54,785 INFO L78 Accepts]: Start accepts. Automaton has 92 states and 138 transitions. Word has length 213 [2025-01-09 12:59:54,786 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 12:59:54,786 INFO L471 AbstractCegarLoop]: Abstraction has 92 states and 138 transitions. [2025-01-09 12:59:54,786 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 7.857142857142857) internal successors, (55), 7 states have internal predecessors, (55), 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) [2025-01-09 12:59:54,786 INFO L276 IsEmpty]: Start isEmpty. Operand 92 states and 138 transitions. [2025-01-09 12:59:54,788 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 214 [2025-01-09 12:59:54,789 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 12:59:54,789 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] [2025-01-09 12:59:54,799 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2025-01-09 12:59:54,993 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1,3 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 12:59:54,993 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 12:59:54,994 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 12:59:54,994 INFO L85 PathProgramCache]: Analyzing trace with hash -1703158961, now seen corresponding path program 1 times [2025-01-09 12:59:54,994 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 12:59:54,994 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [466414101] [2025-01-09 12:59:54,994 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 12:59:54,994 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 12:59:55,011 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 213 statements into 1 equivalence classes. [2025-01-09 12:59:55,330 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 213 of 213 statements. [2025-01-09 12:59:55,330 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 12:59:55,330 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unknown [2025-01-09 12:59:55,334 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [188714044] [2025-01-09 12:59:55,334 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 12:59:55,335 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 12:59:55,335 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 12:59:55,336 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-01-09 12:59:55,342 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2025-01-09 12:59:55,404 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 213 statements into 1 equivalence classes. [2025-01-09 12:59:55,507 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 213 of 213 statements. [2025-01-09 12:59:55,507 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 12:59:55,507 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 12:59:55,510 INFO L256 TraceCheckSpWp]: Trace formula consists of 514 conjuncts, 46 conjuncts are in the unsatisfiable core [2025-01-09 12:59:55,516 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 13:00:00,317 INFO L134 CoverageAnalysis]: Checked inductivity of 2244 backedges. 1698 proven. 273 refuted. 0 times theorem prover too weak. 273 trivial. 0 not checked. [2025-01-09 13:00:00,317 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-09 13:00:09,561 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 [2025-01-09 13:00:14,790 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse1 (+ c_~var_1_25~0 c_~var_1_22~0 1)) (.cse16 (+ c_~var_1_5~0 1)) (.cse18 (= (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 ((.cse12 (<= .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)))) (.cse14 (< .cse0 (+ .cse2 1))) (.cse4 (< c_~var_1_22~0 0)) (.cse20 (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 (< .cse0 .cse2)) (.cse21 (forall ((~var_1_6~0 Int)) (or (< .cse0 (+ (div c_~var_1_22~0 ~var_1_6~0) 1)) (< ~var_1_6~0 0)))) (.cse11 (not .cse18)) (.cse17 (< c_~var_1_5~0 0)) (.cse23 (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 .cse16)) (.cse19 (< .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 ((.cse13 (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 .cse13)) (.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 .cse16) (= (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 .cse12 (or .cse8 .cse9)) .cse10) (or .cse11 .cse9 .cse13) (or .cse14 .cse13) (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 ((.cse15 (forall ((~var_1_6~0 Int)) (or (< ~var_1_6~0 .cse16) (= (mod c_~var_1_22~0 ~var_1_6~0) 0))))) (and (or .cse11 (and .cse6 (or .cse9 .cse15))) (or .cse14 .cse15))) .cse17) (or .cse18 (and (or .cse8 (and (or .cse19 .cse13) (or .cse7 .cse19))) (or .cse10 .cse14))) (or .cse8 .cse9 .cse13))))) (or .cse8 .cse20) (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)))) .cse17) (or .cse21 .cse14) (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 .cse21 .cse11 .cse9) (or (let ((.cse22 (and (or (forall ((~var_1_6~0 Int)) (or (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))) .cse9) (or .cse9 (forall ((~var_1_6~0 Int)) (or (< ~var_1_6~0 .cse16) (not (= (mod c_~var_1_22~0 ~var_1_6~0) 0)))))))) (and (or .cse11 .cse22) (or .cse22 .cse4) .cse12)) .cse17) (or .cse8 (and (or .cse5 .cse18 .cse23) .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)) (< 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 .cse21 .cse18 .cse14) (or .cse4 .cse20) (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 .cse8 (and (or .cse21 .cse9) (or .cse5 .cse21 .cse18 .cse19))) (or .cse17 .cse11 .cse23) (or .cse17 .cse23) (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 .cse18 .cse19)))) is different from false [2025-01-09 13:00:19,468 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 [2025-01-09 13:00:30,081 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse36 (mod c_~var_1_8~0 256)) (.cse37 (mod c_~var_1_28~0 65536))) (let ((.cse38 (mod c_~var_1_28~0 4294967296)) (.cse1 (+ .cse37 c_~var_1_22~0)) (.cse4 (+ c_~var_1_22~0 .cse36)) (.cse21 (div c_~var_1_22~0 c_~var_1_5~0))) (let ((.cse35 (+ .cse21 1)) (.cse32 (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) (< .cse1 .cse40) (< .cse4 .cse40))))) (.cse31 (forall ((~var_1_6~0 Int)) (or (< c_~var_1_5~0 ~var_1_6~0) (< .cse1 (div c_~var_1_22~0 ~var_1_6~0))))) (.cse29 (forall ((~var_1_6~0 Int)) (or (< c_~var_1_5~0 ~var_1_6~0) (< .cse4 (div c_~var_1_22~0 ~var_1_6~0))))) (.cse0 (< 32767 .cse37)) (.cse30 (forall ((~var_1_6~0 Int)) (or (< 0 (+ ~var_1_6~0 1)) (< .cse1 (div c_~var_1_22~0 ~var_1_6~0))))) (.cse2 (< .cse36 .cse38)) (.cse33 (forall ((~var_1_6~0 Int)) (let ((.cse39 (div c_~var_1_22~0 ~var_1_6~0))) (or (< 0 (+ ~var_1_6~0 1)) (< .cse1 .cse39) (< .cse4 .cse39))))) (.cse27 (forall ((~var_1_6~0 Int)) (or (< 0 (+ ~var_1_6~0 1)) (< .cse4 (div c_~var_1_22~0 ~var_1_6~0))))) (.cse7 (< .cse38 (+ 1 .cse36))) (.cse14 (< .cse4 .cse21)) (.cse16 (< .cse1 .cse21)) (.cse28 (= (mod c_~var_1_22~0 c_~var_1_5~0) 0))) (let ((.cse12 (not .cse28)) (.cse15 (or .cse14 .cse16)) (.cse18 (< c_~var_1_22~0 0)) (.cse10 (and (forall ((~var_1_6~0 Int)) (or (< .cse1 (+ (div c_~var_1_22~0 ~var_1_6~0) 65536)) (< 0 (+ ~var_1_6~0 1)))) (or .cse0 (and (or .cse30 .cse2) .cse33)) (or .cse27 .cse7))) (.cse11 (< c_~var_1_5~0 0)) (.cse23 (+ .cse37 c_~var_1_22~0 1)) (.cse20 (+ c_~var_1_22~0 1 .cse36)) (.cse6 (< 0 (+ c_~var_1_22~0 1))) (.cse8 (or (forall ((~var_1_6~0 Int)) (or (< c_~var_1_5~0 ~var_1_6~0) (< .cse1 (+ (div c_~var_1_22~0 ~var_1_6~0) 65537)) (= (mod c_~var_1_22~0 ~var_1_6~0) 0))) .cse2)) (.cse17 (and (forall ((~var_1_6~0 Int)) (or (< c_~var_1_5~0 ~var_1_6~0) (< .cse1 (+ (div c_~var_1_22~0 ~var_1_6~0) 65536)))) (or .cse0 (and .cse32 (or .cse31 .cse2))) (or .cse7 .cse29))) (.cse26 (< 0 (+ c_~var_1_5~0 1))) (.cse13 (< .cse4 .cse35))) (and (or .cse0 (and (or (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)) (< .cse1 (div c_~var_1_22~0 ~var_1_6~0)) (< ~var_1_6~0 0))) .cse2) (forall ((~var_1_6~0 Int)) (let ((.cse3 (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)) (< .cse1 .cse3) (< .cse4 .cse3) (< ~var_1_6~0 0)))))) (or .cse2 (forall ((~var_1_6~0 Int)) (or (< c_~var_1_5~0 ~var_1_6~0) (< .cse1 (+ (div c_~var_1_22~0 ~var_1_6~0) 1)) (< ~var_1_6~0 0)))) (forall ((~var_1_6~0 Int)) (or (< c_~var_1_5~0 ~var_1_6~0) (< .cse1 (+ (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 (and (forall ((~var_1_6~0 Int)) (let ((.cse5 (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)) (< .cse1 .cse5) (< .cse4 .cse5)))) (or .cse2 (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)) (< .cse1 (div c_~var_1_22~0 ~var_1_6~0))))))) (or .cse6 (and (or .cse7 (forall ((~var_1_6~0 Int)) (or (< c_~var_1_5~0 ~var_1_6~0) (< .cse4 (+ (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 (< c_~var_1_5~0 ~var_1_6~0) (< .cse1 (+ (div c_~var_1_22~0 ~var_1_6~0) 1)) (= (mod c_~var_1_22~0 ~var_1_6~0) 0))) .cse2) .cse8)) (or .cse7 (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)) (< .cse4 (div c_~var_1_22~0 ~var_1_6~0))))) (or .cse7 (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)) (< .cse4 (div c_~var_1_22~0 ~var_1_6~0))))) (or .cse0 (and (forall ((~var_1_6~0 Int)) (let ((.cse9 (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)) (< .cse1 .cse9) (< .cse4 .cse9)))) (or (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)) (< .cse1 (div c_~var_1_22~0 ~var_1_6~0)))) .cse2))) (or .cse10 .cse11 .cse12) (or (forall ((~var_1_6~0 Int)) (or (< c_~var_1_5~0 ~var_1_6~0) (< 0 (+ ~var_1_6~0 1)) (< .cse4 (div c_~var_1_22~0 ~var_1_6~0)))) .cse7) (forall ((~var_1_6~0 Int)) (or (< .cse1 (+ (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 (forall ((~var_1_6~0 Int)) (or (< c_~var_1_5~0 ~var_1_6~0) (< .cse1 (+ (div c_~var_1_22~0 ~var_1_6~0) 65537)) (< ~var_1_6~0 0))) .cse2) (or .cse7 .cse13) (or (and (or .cse14 .cse7) (or .cse0 (and .cse15 (or .cse16 .cse2)))) .cse12) (or .cse7 (forall ((~var_1_6~0 Int)) (or (< c_~var_1_5~0 ~var_1_6~0) (< .cse4 (+ (div c_~var_1_22~0 ~var_1_6~0) 1)) (< ~var_1_6~0 0)))) (or .cse17 .cse18) (or (and (or .cse0 (and (forall ((~var_1_6~0 Int)) (let ((.cse19 (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)) (< .cse1 .cse19) (< .cse4 .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)) (< .cse1 (div c_~var_1_22~0 ~var_1_6~0)))) .cse2))) (or .cse7 (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)) (< .cse4 (div c_~var_1_22~0 ~var_1_6~0)))))) .cse11) (forall ((~var_1_6~0 Int)) (or (< c_~var_1_5~0 ~var_1_6~0) (< .cse1 (+ (div c_~var_1_22~0 ~var_1_6~0) 65536)) (< 0 (+ ~var_1_6~0 1)))) (or (forall ((~var_1_6~0 Int)) (or (< c_~var_1_5~0 ~var_1_6~0) (< .cse1 (+ (div c_~var_1_22~0 ~var_1_6~0) 65537)))) .cse2) (or (forall ((~var_1_6~0 Int)) (or (< c_~var_1_5~0 ~var_1_6~0) (< .cse1 (+ (div c_~var_1_22~0 ~var_1_6~0) 1)))) .cse2) (or (and (or .cse7 (and (forall ((~var_1_6~0 Int)) (or (< c_~var_1_5~0 ~var_1_6~0) (< .cse4 (div c_~var_1_22~0 ~var_1_6~0)) (< ~var_1_6~0 0))) (<= .cse20 .cse21))) (or .cse0 (and (forall ((~var_1_6~0 Int)) (let ((.cse22 (div c_~var_1_22~0 ~var_1_6~0))) (or (< c_~var_1_5~0 ~var_1_6~0) (< .cse1 .cse22) (< .cse4 .cse22) (< ~var_1_6~0 0)))) .cse15))) .cse18) (or .cse6 (and (or .cse0 (forall ((~var_1_6~0 Int)) (let ((.cse24 (div c_~var_1_22~0 ~var_1_6~0))) (or (< .cse23 .cse24) (< 0 (+ ~var_1_6~0 1)) (< .cse20 .cse24) (= (mod c_~var_1_22~0 ~var_1_6~0) 0))))) (or .cse7 (forall ((~var_1_6~0 Int)) (or (< 0 (+ ~var_1_6~0 1)) (< .cse20 (div c_~var_1_22~0 ~var_1_6~0)) (= (mod c_~var_1_22~0 ~var_1_6~0) 0)))))) (or .cse10 .cse11) (or (and (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) (< 0 (+ ~var_1_6~0 1)) (< .cse1 .cse25) (< .cse4 .cse25)))) (or (forall ((~var_1_6~0 Int)) (or (< c_~var_1_5~0 ~var_1_6~0) (< 0 (+ ~var_1_6~0 1)) (< .cse1 (div c_~var_1_22~0 ~var_1_6~0)))) .cse2)) .cse0) (or .cse7 (forall ((~var_1_6~0 Int)) (or (< c_~var_1_5~0 ~var_1_6~0) (< .cse4 (+ (div c_~var_1_22~0 ~var_1_6~0) 1))))) (or .cse26 (and (or .cse7 (and (or .cse27 .cse28) .cse29)) (or .cse0 (and (or (and (or .cse30 .cse28) .cse31) .cse2) .cse32 (or .cse33 .cse28))))) (or .cse26 .cse28 (let ((.cse34 (< .cse20 .cse21))) (and (or (< .cse23 .cse21) .cse34) (or .cse7 .cse34)))) (or .cse6 (and (or (forall ((~var_1_6~0 Int)) (or (< c_~var_1_5~0 ~var_1_6~0) (< .cse4 (+ (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))) .cse7) .cse8 (or (forall ((~var_1_6~0 Int)) (or (< c_~var_1_5~0 ~var_1_6~0) (< .cse1 (+ (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))) .cse2))) (forall ((~var_1_6~0 Int)) (or (< c_~var_1_5~0 ~var_1_6~0) (< .cse1 (+ (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 .cse17 .cse26) (or .cse0 (< .cse1 .cse35) .cse13) (or .cse7 (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)) (< .cse4 (div c_~var_1_22~0 ~var_1_6~0)) (< ~var_1_6~0 0))))))))) is different from false [2025-01-09 13:00:34,092 WARN L873 $PredicateComparison]: unable to prove that (let ((.cse36 (mod c_~var_1_8~0 256)) (.cse37 (mod c_~var_1_28~0 65536))) (let ((.cse38 (mod c_~var_1_28~0 4294967296)) (.cse1 (+ .cse37 c_~var_1_22~0)) (.cse4 (+ c_~var_1_22~0 .cse36)) (.cse21 (div c_~var_1_22~0 c_~var_1_5~0))) (let ((.cse35 (+ .cse21 1)) (.cse32 (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) (< .cse1 .cse40) (< .cse4 .cse40))))) (.cse31 (forall ((~var_1_6~0 Int)) (or (< c_~var_1_5~0 ~var_1_6~0) (< .cse1 (div c_~var_1_22~0 ~var_1_6~0))))) (.cse29 (forall ((~var_1_6~0 Int)) (or (< c_~var_1_5~0 ~var_1_6~0) (< .cse4 (div c_~var_1_22~0 ~var_1_6~0))))) (.cse0 (< 32767 .cse37)) (.cse30 (forall ((~var_1_6~0 Int)) (or (< 0 (+ ~var_1_6~0 1)) (< .cse1 (div c_~var_1_22~0 ~var_1_6~0))))) (.cse2 (< .cse36 .cse38)) (.cse33 (forall ((~var_1_6~0 Int)) (let ((.cse39 (div c_~var_1_22~0 ~var_1_6~0))) (or (< 0 (+ ~var_1_6~0 1)) (< .cse1 .cse39) (< .cse4 .cse39))))) (.cse27 (forall ((~var_1_6~0 Int)) (or (< 0 (+ ~var_1_6~0 1)) (< .cse4 (div c_~var_1_22~0 ~var_1_6~0))))) (.cse7 (< .cse38 (+ 1 .cse36))) (.cse14 (< .cse4 .cse21)) (.cse16 (< .cse1 .cse21)) (.cse28 (= (mod c_~var_1_22~0 c_~var_1_5~0) 0))) (let ((.cse12 (not .cse28)) (.cse15 (or .cse14 .cse16)) (.cse18 (< c_~var_1_22~0 0)) (.cse10 (and (forall ((~var_1_6~0 Int)) (or (< .cse1 (+ (div c_~var_1_22~0 ~var_1_6~0) 65536)) (< 0 (+ ~var_1_6~0 1)))) (or .cse0 (and (or .cse30 .cse2) .cse33)) (or .cse27 .cse7))) (.cse11 (< c_~var_1_5~0 0)) (.cse23 (+ .cse37 c_~var_1_22~0 1)) (.cse20 (+ c_~var_1_22~0 1 .cse36)) (.cse6 (< 0 (+ c_~var_1_22~0 1))) (.cse8 (or (forall ((~var_1_6~0 Int)) (or (< c_~var_1_5~0 ~var_1_6~0) (< .cse1 (+ (div c_~var_1_22~0 ~var_1_6~0) 65537)) (= (mod c_~var_1_22~0 ~var_1_6~0) 0))) .cse2)) (.cse17 (and (forall ((~var_1_6~0 Int)) (or (< c_~var_1_5~0 ~var_1_6~0) (< .cse1 (+ (div c_~var_1_22~0 ~var_1_6~0) 65536)))) (or .cse0 (and .cse32 (or .cse31 .cse2))) (or .cse7 .cse29))) (.cse26 (< 0 (+ c_~var_1_5~0 1))) (.cse13 (< .cse4 .cse35))) (and (or .cse0 (and (or (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)) (< .cse1 (div c_~var_1_22~0 ~var_1_6~0)) (< ~var_1_6~0 0))) .cse2) (forall ((~var_1_6~0 Int)) (let ((.cse3 (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)) (< .cse1 .cse3) (< .cse4 .cse3) (< ~var_1_6~0 0)))))) (or .cse2 (forall ((~var_1_6~0 Int)) (or (< c_~var_1_5~0 ~var_1_6~0) (< .cse1 (+ (div c_~var_1_22~0 ~var_1_6~0) 1)) (< ~var_1_6~0 0)))) (forall ((~var_1_6~0 Int)) (or (< c_~var_1_5~0 ~var_1_6~0) (< .cse1 (+ (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 (and (forall ((~var_1_6~0 Int)) (let ((.cse5 (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)) (< .cse1 .cse5) (< .cse4 .cse5)))) (or .cse2 (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)) (< .cse1 (div c_~var_1_22~0 ~var_1_6~0))))))) (or .cse6 (and (or .cse7 (forall ((~var_1_6~0 Int)) (or (< c_~var_1_5~0 ~var_1_6~0) (< .cse4 (+ (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 (< c_~var_1_5~0 ~var_1_6~0) (< .cse1 (+ (div c_~var_1_22~0 ~var_1_6~0) 1)) (= (mod c_~var_1_22~0 ~var_1_6~0) 0))) .cse2) .cse8)) (or .cse7 (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)) (< .cse4 (div c_~var_1_22~0 ~var_1_6~0))))) (or .cse7 (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)) (< .cse4 (div c_~var_1_22~0 ~var_1_6~0))))) (or .cse0 (and (forall ((~var_1_6~0 Int)) (let ((.cse9 (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)) (< .cse1 .cse9) (< .cse4 .cse9)))) (or (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)) (< .cse1 (div c_~var_1_22~0 ~var_1_6~0)))) .cse2))) (or .cse10 .cse11 .cse12) (or (forall ((~var_1_6~0 Int)) (or (< c_~var_1_5~0 ~var_1_6~0) (< 0 (+ ~var_1_6~0 1)) (< .cse4 (div c_~var_1_22~0 ~var_1_6~0)))) .cse7) (forall ((~var_1_6~0 Int)) (or (< .cse1 (+ (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 (forall ((~var_1_6~0 Int)) (or (< c_~var_1_5~0 ~var_1_6~0) (< .cse1 (+ (div c_~var_1_22~0 ~var_1_6~0) 65537)) (< ~var_1_6~0 0))) .cse2) (or .cse7 .cse13) (or (and (or .cse14 .cse7) (or .cse0 (and .cse15 (or .cse16 .cse2)))) .cse12) (or .cse7 (forall ((~var_1_6~0 Int)) (or (< c_~var_1_5~0 ~var_1_6~0) (< .cse4 (+ (div c_~var_1_22~0 ~var_1_6~0) 1)) (< ~var_1_6~0 0)))) (or .cse17 .cse18) (or (and (or .cse0 (and (forall ((~var_1_6~0 Int)) (let ((.cse19 (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)) (< .cse1 .cse19) (< .cse4 .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)) (< .cse1 (div c_~var_1_22~0 ~var_1_6~0)))) .cse2))) (or .cse7 (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)) (< .cse4 (div c_~var_1_22~0 ~var_1_6~0)))))) .cse11) (forall ((~var_1_6~0 Int)) (or (< c_~var_1_5~0 ~var_1_6~0) (< .cse1 (+ (div c_~var_1_22~0 ~var_1_6~0) 65536)) (< 0 (+ ~var_1_6~0 1)))) (or (forall ((~var_1_6~0 Int)) (or (< c_~var_1_5~0 ~var_1_6~0) (< .cse1 (+ (div c_~var_1_22~0 ~var_1_6~0) 65537)))) .cse2) (or (forall ((~var_1_6~0 Int)) (or (< c_~var_1_5~0 ~var_1_6~0) (< .cse1 (+ (div c_~var_1_22~0 ~var_1_6~0) 1)))) .cse2) (or (and (or .cse7 (and (forall ((~var_1_6~0 Int)) (or (< c_~var_1_5~0 ~var_1_6~0) (< .cse4 (div c_~var_1_22~0 ~var_1_6~0)) (< ~var_1_6~0 0))) (<= .cse20 .cse21))) (or .cse0 (and (forall ((~var_1_6~0 Int)) (let ((.cse22 (div c_~var_1_22~0 ~var_1_6~0))) (or (< c_~var_1_5~0 ~var_1_6~0) (< .cse1 .cse22) (< .cse4 .cse22) (< ~var_1_6~0 0)))) .cse15))) .cse18) (or .cse6 (and (or .cse0 (forall ((~var_1_6~0 Int)) (let ((.cse24 (div c_~var_1_22~0 ~var_1_6~0))) (or (< .cse23 .cse24) (< 0 (+ ~var_1_6~0 1)) (< .cse20 .cse24) (= (mod c_~var_1_22~0 ~var_1_6~0) 0))))) (or .cse7 (forall ((~var_1_6~0 Int)) (or (< 0 (+ ~var_1_6~0 1)) (< .cse20 (div c_~var_1_22~0 ~var_1_6~0)) (= (mod c_~var_1_22~0 ~var_1_6~0) 0)))))) (or .cse10 .cse11) (or (and (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) (< 0 (+ ~var_1_6~0 1)) (< .cse1 .cse25) (< .cse4 .cse25)))) (or (forall ((~var_1_6~0 Int)) (or (< c_~var_1_5~0 ~var_1_6~0) (< 0 (+ ~var_1_6~0 1)) (< .cse1 (div c_~var_1_22~0 ~var_1_6~0)))) .cse2)) .cse0) (or .cse7 (forall ((~var_1_6~0 Int)) (or (< c_~var_1_5~0 ~var_1_6~0) (< .cse4 (+ (div c_~var_1_22~0 ~var_1_6~0) 1))))) (or .cse26 (and (or .cse7 (and (or .cse27 .cse28) .cse29)) (or .cse0 (and (or (and (or .cse30 .cse28) .cse31) .cse2) .cse32 (or .cse33 .cse28))))) (or .cse26 .cse28 (let ((.cse34 (< .cse20 .cse21))) (and (or (< .cse23 .cse21) .cse34) (or .cse7 .cse34)))) (or .cse6 (and (or (forall ((~var_1_6~0 Int)) (or (< c_~var_1_5~0 ~var_1_6~0) (< .cse4 (+ (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))) .cse7) .cse8 (or (forall ((~var_1_6~0 Int)) (or (< c_~var_1_5~0 ~var_1_6~0) (< .cse1 (+ (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))) .cse2))) (forall ((~var_1_6~0 Int)) (or (< c_~var_1_5~0 ~var_1_6~0) (< .cse1 (+ (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 .cse17 .cse26) (or .cse0 (< .cse1 .cse35) .cse13) (or .cse7 (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)) (< .cse4 (div c_~var_1_22~0 ~var_1_6~0)) (< ~var_1_6~0 0))))))))) is different from true [2025-01-09 13:00:42,010 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse31 (mod c_~var_1_8~0 256)) (.cse32 (mod c_~var_1_28~0 65536))) (let ((.cse1 (+ .cse32 c_~var_1_22~0)) (.cse34 (mod c_~var_1_28~0 4294967296)) (.cse3 (+ c_~var_1_22~0 .cse31)) (.cse29 (div c_~var_1_22~0 c_~var_1_5~0))) (let ((.cse17 (< .cse3 .cse29)) (.cse21 (+ .cse29 1)) (.cse10 (< .cse34 (+ 1 .cse31))) (.cse26 (forall ((~var_1_6~0 Int)) (or (< c_~var_1_5~0 ~var_1_6~0) (< .cse3 (div c_~var_1_22~0 ~var_1_6~0))))) (.cse0 (< 32767 .cse32)) (.cse28 (forall ((~var_1_6~0 Int)) (let ((.cse35 (div c_~var_1_22~0 ~var_1_6~0))) (or (< c_~var_1_5~0 ~var_1_6~0) (< .cse1 .cse35) (< .cse3 .cse35))))) (.cse27 (forall ((~var_1_6~0 Int)) (or (< c_~var_1_5~0 ~var_1_6~0) (< .cse1 (div c_~var_1_22~0 ~var_1_6~0))))) (.cse4 (< .cse31 .cse34))) (let ((.cse6 (or .cse0 (and .cse28 (or .cse27 .cse4)))) (.cse7 (or .cse10 .cse26)) (.cse19 (< .cse3 .cse21)) (.cse20 (< c_~var_1_22~0 0)) (.cse16 (or .cse17 .cse10)) (.cse18 (< .cse1 .cse29)) (.cse12 (forall ((~var_1_6~0 Int)) (or (< 0 (+ ~var_1_6~0 1)) (< .cse1 (div c_~var_1_22~0 ~var_1_6~0))))) (.cse13 (forall ((~var_1_6~0 Int)) (let ((.cse33 (div c_~var_1_22~0 ~var_1_6~0))) (or (< 0 (+ ~var_1_6~0 1)) (< .cse1 .cse33) (< .cse3 .cse33))))) (.cse25 (forall ((~var_1_6~0 Int)) (or (< 0 (+ ~var_1_6~0 1)) (< .cse3 (div c_~var_1_22~0 ~var_1_6~0))))) (.cse8 (< 0 (+ c_~var_1_5~0 1))) (.cse15 (= (mod c_~var_1_22~0 c_~var_1_5~0) 0)) (.cse22 (+ .cse32 c_~var_1_22~0 1)) (.cse24 (+ c_~var_1_22~0 1 .cse31)) (.cse9 (< 0 (+ c_~var_1_22~0 1))) (.cse11 (or (forall ((~var_1_6~0 Int)) (or (< c_~var_1_5~0 ~var_1_6~0) (< .cse1 (+ (div c_~var_1_22~0 ~var_1_6~0) 65537)) (= (mod c_~var_1_22~0 ~var_1_6~0) 0))) .cse4))) (and (or .cse0 (and (forall ((~var_1_6~0 Int)) (let ((.cse2 (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)) (< .cse1 .cse2) (< .cse3 .cse2)))) (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)) (< .cse1 (div c_~var_1_22~0 ~var_1_6~0)))) .cse4))) (or .cse0 (and (or (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)) (< .cse1 (div c_~var_1_22~0 ~var_1_6~0)) (< ~var_1_6~0 0))) .cse4) (forall ((~var_1_6~0 Int)) (let ((.cse5 (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)) (< .cse1 .cse5) (< .cse3 .cse5) (< ~var_1_6~0 0)))))) (or .cse4 (forall ((~var_1_6~0 Int)) (or (< c_~var_1_5~0 ~var_1_6~0) (< .cse1 (+ (div c_~var_1_22~0 ~var_1_6~0) 1)) (< ~var_1_6~0 0)))) (forall ((~var_1_6~0 Int)) (or (< .cse1 (+ (div c_~var_1_22~0 ~var_1_6~0) 65536)) (< 0 (+ ~var_1_6~0 1)))) (forall ((~var_1_6~0 Int)) (or (< c_~var_1_5~0 ~var_1_6~0) (< .cse1 (+ (div c_~var_1_22~0 ~var_1_6~0) 65536)) (not (= (mod c_~var_1_22~0 ~var_1_6~0) 0)))) (or (and .cse6 .cse7) .cse8) (or .cse9 (and (or .cse10 (forall ((~var_1_6~0 Int)) (or (< c_~var_1_5~0 ~var_1_6~0) (< .cse3 (+ (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 (< c_~var_1_5~0 ~var_1_6~0) (< .cse1 (+ (div c_~var_1_22~0 ~var_1_6~0) 1)) (= (mod c_~var_1_22~0 ~var_1_6~0) 0))) .cse4) .cse11)) (or .cse10 (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)) (< .cse3 (div c_~var_1_22~0 ~var_1_6~0))))) (or .cse0 (and (or .cse12 .cse4) .cse13)) (or .cse0 (and (forall ((~var_1_6~0 Int)) (let ((.cse14 (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)) (< .cse1 .cse14) (< .cse3 .cse14)))) (or (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)) (< .cse1 (div c_~var_1_22~0 ~var_1_6~0)))) .cse4))) (forall ((~var_1_6~0 Int)) (or (< .cse1 (+ (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 (not .cse15) (and .cse16 (or .cse17 .cse18))) (or (forall ((~var_1_6~0 Int)) (or (< c_~var_1_5~0 ~var_1_6~0) (< .cse1 (+ (div c_~var_1_22~0 ~var_1_6~0) 65537)) (< ~var_1_6~0 0))) .cse4) (or .cse10 .cse19) (or .cse10 (forall ((~var_1_6~0 Int)) (or (< c_~var_1_5~0 ~var_1_6~0) (< .cse3 (+ (div c_~var_1_22~0 ~var_1_6~0) 1)) (< ~var_1_6~0 0)))) (or (and (forall ((~var_1_6~0 Int)) (or (< c_~var_1_5~0 ~var_1_6~0) (< .cse1 (+ (div c_~var_1_22~0 ~var_1_6~0) 65536)))) .cse6 .cse7) .cse20) (or (< .cse1 .cse21) .cse19) (or .cse20 (and .cse16 (or .cse17 .cse0 .cse18))) (or (forall ((~var_1_6~0 Int)) (or (< c_~var_1_5~0 ~var_1_6~0) (< .cse1 (+ (div c_~var_1_22~0 ~var_1_6~0) 65537)))) .cse4) (or (forall ((~var_1_6~0 Int)) (or (< c_~var_1_5~0 ~var_1_6~0) (< .cse1 (+ (div c_~var_1_22~0 ~var_1_6~0) 1)))) .cse4) (or .cse9 (and (or .cse0 (forall ((~var_1_6~0 Int)) (let ((.cse23 (div c_~var_1_22~0 ~var_1_6~0))) (or (< .cse22 .cse23) (< 0 (+ ~var_1_6~0 1)) (< .cse24 .cse23) (= (mod c_~var_1_22~0 ~var_1_6~0) 0))))) (or .cse10 (forall ((~var_1_6~0 Int)) (or (< 0 (+ ~var_1_6~0 1)) (< .cse24 (div c_~var_1_22~0 ~var_1_6~0)) (= (mod c_~var_1_22~0 ~var_1_6~0) 0)))))) (or .cse10 (forall ((~var_1_6~0 Int)) (or (< c_~var_1_5~0 ~var_1_6~0) (< .cse3 (+ (div c_~var_1_22~0 ~var_1_6~0) 1))))) (or .cse8 (and (or .cse10 (and (or .cse25 .cse15) .cse26)) (or .cse0 (and (or (and (or .cse12 .cse15) .cse27) .cse4) .cse28 (or .cse13 .cse15))))) (or .cse25 .cse10) (or .cse8 .cse15 (let ((.cse30 (< .cse24 .cse29))) (and (or (< .cse22 .cse29) .cse30) (or .cse10 .cse30)))) (or .cse9 (and (or (forall ((~var_1_6~0 Int)) (or (< c_~var_1_5~0 ~var_1_6~0) (< .cse3 (+ (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))) .cse10) .cse11 (or (forall ((~var_1_6~0 Int)) (or (< c_~var_1_5~0 ~var_1_6~0) (< .cse1 (+ (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))) .cse4))) (forall ((~var_1_6~0 Int)) (or (< c_~var_1_5~0 ~var_1_6~0) (< .cse1 (+ (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 .cse10 (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)) (< .cse3 (div c_~var_1_22~0 ~var_1_6~0))))) (or .cse10 (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)) (< .cse3 (div c_~var_1_22~0 ~var_1_6~0)) (< ~var_1_6~0 0))))))))) is different from false [2025-01-09 13:00:49,549 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse29 (mod c_~var_1_8~0 256)) (.cse30 (mod c_~var_1_28~0 65536))) (let ((.cse1 (+ .cse30 c_~var_1_22~0)) (.cse3 (+ c_~var_1_22~0 .cse29)) (.cse33 (mod c_~var_1_28~0 4294967296)) (.cse27 (div c_~var_1_22~0 c_~var_1_5~0))) (let ((.cse19 (+ .cse27 1)) (.cse10 (< .cse33 (+ 1 .cse29))) (.cse24 (forall ((~var_1_6~0 Int)) (or (< c_~var_1_5~0 ~var_1_6~0) (< .cse3 (div c_~var_1_22~0 ~var_1_6~0))))) (.cse0 (< 32767 .cse30)) (.cse26 (forall ((~var_1_6~0 Int)) (let ((.cse34 (div c_~var_1_22~0 ~var_1_6~0))) (or (< c_~var_1_5~0 ~var_1_6~0) (< .cse1 .cse34) (< .cse3 .cse34))))) (.cse25 (forall ((~var_1_6~0 Int)) (or (< c_~var_1_5~0 ~var_1_6~0) (< .cse1 (div c_~var_1_22~0 ~var_1_6~0))))) (.cse4 (< .cse29 .cse33))) (let ((.cse6 (or .cse0 (and .cse26 (or .cse25 .cse4)))) (.cse7 (or .cse10 .cse24)) (.cse17 (< .cse3 .cse19)) (.cse16 (let ((.cse32 (< .cse3 .cse27))) (and (or .cse32 .cse10) (or .cse32 (< .cse1 .cse27))))) (.cse18 (< c_~var_1_22~0 0)) (.cse12 (forall ((~var_1_6~0 Int)) (or (< 0 (+ ~var_1_6~0 1)) (< .cse1 (div c_~var_1_22~0 ~var_1_6~0))))) (.cse13 (forall ((~var_1_6~0 Int)) (let ((.cse31 (div c_~var_1_22~0 ~var_1_6~0))) (or (< 0 (+ ~var_1_6~0 1)) (< .cse1 .cse31) (< .cse3 .cse31))))) (.cse23 (forall ((~var_1_6~0 Int)) (or (< 0 (+ ~var_1_6~0 1)) (< .cse3 (div c_~var_1_22~0 ~var_1_6~0))))) (.cse8 (< 0 (+ c_~var_1_5~0 1))) (.cse15 (= (mod c_~var_1_22~0 c_~var_1_5~0) 0)) (.cse20 (+ .cse30 c_~var_1_22~0 1)) (.cse22 (+ c_~var_1_22~0 1 .cse29)) (.cse9 (< 0 (+ c_~var_1_22~0 1))) (.cse11 (or (forall ((~var_1_6~0 Int)) (or (< c_~var_1_5~0 ~var_1_6~0) (< .cse1 (+ (div c_~var_1_22~0 ~var_1_6~0) 65537)) (= (mod c_~var_1_22~0 ~var_1_6~0) 0))) .cse4))) (and (or .cse0 (and (forall ((~var_1_6~0 Int)) (let ((.cse2 (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)) (< .cse1 .cse2) (< .cse3 .cse2)))) (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)) (< .cse1 (div c_~var_1_22~0 ~var_1_6~0)))) .cse4))) (or .cse0 (and (or (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)) (< .cse1 (div c_~var_1_22~0 ~var_1_6~0)) (< ~var_1_6~0 0))) .cse4) (forall ((~var_1_6~0 Int)) (let ((.cse5 (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)) (< .cse1 .cse5) (< .cse3 .cse5) (< ~var_1_6~0 0)))))) (or .cse4 (forall ((~var_1_6~0 Int)) (or (< c_~var_1_5~0 ~var_1_6~0) (< .cse1 (+ (div c_~var_1_22~0 ~var_1_6~0) 1)) (< ~var_1_6~0 0)))) (forall ((~var_1_6~0 Int)) (or (< .cse1 (+ (div c_~var_1_22~0 ~var_1_6~0) 65536)) (< 0 (+ ~var_1_6~0 1)))) (forall ((~var_1_6~0 Int)) (or (< c_~var_1_5~0 ~var_1_6~0) (< .cse1 (+ (div c_~var_1_22~0 ~var_1_6~0) 65536)) (not (= (mod c_~var_1_22~0 ~var_1_6~0) 0)))) (or (and .cse6 .cse7) .cse8) (or .cse9 (and (or .cse10 (forall ((~var_1_6~0 Int)) (or (< c_~var_1_5~0 ~var_1_6~0) (< .cse3 (+ (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 (< c_~var_1_5~0 ~var_1_6~0) (< .cse1 (+ (div c_~var_1_22~0 ~var_1_6~0) 1)) (= (mod c_~var_1_22~0 ~var_1_6~0) 0))) .cse4) .cse11)) (or .cse10 (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)) (< .cse3 (div c_~var_1_22~0 ~var_1_6~0))))) (or .cse0 (and (or .cse12 .cse4) .cse13)) (or .cse0 (and (forall ((~var_1_6~0 Int)) (let ((.cse14 (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)) (< .cse1 .cse14) (< .cse3 .cse14)))) (or (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)) (< .cse1 (div c_~var_1_22~0 ~var_1_6~0)))) .cse4))) (forall ((~var_1_6~0 Int)) (or (< .cse1 (+ (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 (not .cse15) .cse16) (or (forall ((~var_1_6~0 Int)) (or (< c_~var_1_5~0 ~var_1_6~0) (< .cse1 (+ (div c_~var_1_22~0 ~var_1_6~0) 65537)) (< ~var_1_6~0 0))) .cse4) (or .cse10 .cse17) (or .cse10 (forall ((~var_1_6~0 Int)) (or (< c_~var_1_5~0 ~var_1_6~0) (< .cse3 (+ (div c_~var_1_22~0 ~var_1_6~0) 1)) (< ~var_1_6~0 0)))) (or (and (forall ((~var_1_6~0 Int)) (or (< c_~var_1_5~0 ~var_1_6~0) (< .cse1 (+ (div c_~var_1_22~0 ~var_1_6~0) 65536)))) .cse6 .cse7) .cse18) (or (< .cse1 .cse19) .cse17) (or .cse16 .cse18) (or (forall ((~var_1_6~0 Int)) (or (< c_~var_1_5~0 ~var_1_6~0) (< .cse1 (+ (div c_~var_1_22~0 ~var_1_6~0) 65537)))) .cse4) (or (forall ((~var_1_6~0 Int)) (or (< c_~var_1_5~0 ~var_1_6~0) (< .cse1 (+ (div c_~var_1_22~0 ~var_1_6~0) 1)))) .cse4) (or .cse9 (and (or .cse0 (forall ((~var_1_6~0 Int)) (let ((.cse21 (div c_~var_1_22~0 ~var_1_6~0))) (or (< .cse20 .cse21) (< 0 (+ ~var_1_6~0 1)) (< .cse22 .cse21) (= (mod c_~var_1_22~0 ~var_1_6~0) 0))))) (or .cse10 (forall ((~var_1_6~0 Int)) (or (< 0 (+ ~var_1_6~0 1)) (< .cse22 (div c_~var_1_22~0 ~var_1_6~0)) (= (mod c_~var_1_22~0 ~var_1_6~0) 0)))))) (or .cse10 (forall ((~var_1_6~0 Int)) (or (< c_~var_1_5~0 ~var_1_6~0) (< .cse3 (+ (div c_~var_1_22~0 ~var_1_6~0) 1))))) (or .cse8 (and (or .cse10 (and (or .cse23 .cse15) .cse24)) (or .cse0 (and (or (and (or .cse12 .cse15) .cse25) .cse4) .cse26 (or .cse13 .cse15))))) (or .cse23 .cse10) (or .cse8 .cse15 (let ((.cse28 (< .cse22 .cse27))) (and (or (< .cse20 .cse27) .cse28) (or .cse10 .cse28)))) (or .cse9 (and (or (forall ((~var_1_6~0 Int)) (or (< c_~var_1_5~0 ~var_1_6~0) (< .cse3 (+ (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))) .cse10) .cse11 (or (forall ((~var_1_6~0 Int)) (or (< c_~var_1_5~0 ~var_1_6~0) (< .cse1 (+ (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))) .cse4))) (forall ((~var_1_6~0 Int)) (or (< c_~var_1_5~0 ~var_1_6~0) (< .cse1 (+ (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 .cse10 (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)) (< .cse3 (div c_~var_1_22~0 ~var_1_6~0))))) (or .cse10 (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)) (< .cse3 (div c_~var_1_22~0 ~var_1_6~0)) (< ~var_1_6~0 0))))))))) is different from false