/usr/lib/jvm/java-1.11.0-openjdk-amd64/bin/java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata ./data -s ../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Bitvector.epf -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml -i ../../../trunk/examples/svcomp/hardness-nfm22/hardness_floatingpointinfluence_has-floats_file-9.i -------------------------------------------------------------------------------- This is Ultimate 0.2.4-tmp.fs.bitabs-eval-d9c3e40-m [2023-12-23 19:21:18,783 INFO L188 SettingsManager]: Resetting all preferences to default values... [2023-12-23 19:21:18,850 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Bitvector.epf [2023-12-23 19:21:18,854 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2023-12-23 19:21:18,855 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2023-12-23 19:21:18,876 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2023-12-23 19:21:18,877 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-12-23 19:21:18,877 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-12-23 19:21:18,877 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2023-12-23 19:21:18,880 INFO L153 SettingsManager]: * Use memory slicer=true [2023-12-23 19:21:18,881 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-12-23 19:21:18,881 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-12-23 19:21:18,882 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-12-23 19:21:18,883 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2023-12-23 19:21:18,883 INFO L153 SettingsManager]: * Use SBE=true [2023-12-23 19:21:18,883 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-12-23 19:21:18,883 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2023-12-23 19:21:18,883 INFO L153 SettingsManager]: * sizeof long=4 [2023-12-23 19:21:18,884 INFO L153 SettingsManager]: * sizeof POINTER=4 [2023-12-23 19:21:18,885 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2023-12-23 19:21:18,885 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2023-12-23 19:21:18,885 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-12-23 19:21:18,885 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2023-12-23 19:21:18,885 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2023-12-23 19:21:18,886 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2023-12-23 19:21:18,886 INFO L153 SettingsManager]: * Allow undefined functions=false [2023-12-23 19:21:18,886 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2023-12-23 19:21:18,886 INFO L153 SettingsManager]: * sizeof long double=12 [2023-12-23 19:21:18,886 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2023-12-23 19:21:18,886 INFO L153 SettingsManager]: * Use constant arrays=true [2023-12-23 19:21:18,887 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-12-23 19:21:18,887 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-12-23 19:21:18,887 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2023-12-23 19:21:18,887 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2023-12-23 19:21:18,888 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2023-12-23 19:21:18,888 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-12-23 19:21:18,888 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-12-23 19:21:18,888 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2023-12-23 19:21:18,888 INFO L153 SettingsManager]: * Trace refinement strategy=WOLF [2023-12-23 19:21:18,888 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2023-12-23 19:21:18,888 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2023-12-23 19:21:18,888 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-12-23 19:21:18,889 INFO L153 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2023-12-23 19:21:18,889 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2023-12-23 19:21:18,889 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-12-23 19:21:18,889 INFO L153 SettingsManager]: * Logic for external solver=AUFBV [2023-12-23 19:21:18,889 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release [2023-12-23 19:21:19,100 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-12-23 19:21:19,131 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-12-23 19:21:19,133 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-12-23 19:21:19,134 INFO L270 PluginConnector]: Initializing CDTParser... [2023-12-23 19:21:19,134 INFO L274 PluginConnector]: CDTParser initialized [2023-12-23 19:21:19,135 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/hardness-nfm22/hardness_floatingpointinfluence_has-floats_file-9.i [2023-12-23 19:21:20,213 INFO L533 CDTParser]: Created temporary CDT project at NULL [2023-12-23 19:21:20,369 INFO L384 CDTParser]: Found 1 translation units. [2023-12-23 19:21:20,370 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/hardness-nfm22/hardness_floatingpointinfluence_has-floats_file-9.i [2023-12-23 19:21:20,377 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/a3ad6992e/0bb66f823ac8489fb7bef8104ecb1107/FLAG269d6c284 [2023-12-23 19:21:20,393 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/a3ad6992e/0bb66f823ac8489fb7bef8104ecb1107 [2023-12-23 19:21:20,395 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-12-23 19:21:20,396 INFO L133 ToolchainWalker]: Walking toolchain with 5 elements. [2023-12-23 19:21:20,398 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-12-23 19:21:20,398 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-12-23 19:21:20,401 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2023-12-23 19:21:20,402 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.12 07:21:20" (1/1) ... [2023-12-23 19:21:20,403 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@26b5cc91 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.12 07:21:20, skipping insertion in model container [2023-12-23 19:21:20,403 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.12 07:21:20" (1/1) ... [2023-12-23 19:21:20,427 INFO L177 MainTranslator]: Built tables and reachable declarations [2023-12-23 19:21:20,530 WARN L239 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/hardness-nfm22/hardness_floatingpointinfluence_has-floats_file-9.i[916,929] [2023-12-23 19:21:20,567 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-12-23 19:21:20,594 INFO L202 MainTranslator]: Completed pre-run [2023-12-23 19:21:20,605 WARN L239 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/hardness-nfm22/hardness_floatingpointinfluence_has-floats_file-9.i[916,929] [2023-12-23 19:21:20,648 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-12-23 19:21:20,660 INFO L206 MainTranslator]: Completed translation [2023-12-23 19:21:20,668 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.12 07:21:20 WrapperNode [2023-12-23 19:21:20,679 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-12-23 19:21:20,680 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-12-23 19:21:20,680 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-12-23 19:21:20,680 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2023-12-23 19:21:20,685 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.12 07:21:20" (1/1) ... [2023-12-23 19:21:20,694 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.12 07:21:20" (1/1) ... [2023-12-23 19:21:20,712 INFO L138 Inliner]: procedures = 27, calls = 18, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 81 [2023-12-23 19:21:20,712 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-12-23 19:21:20,713 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-12-23 19:21:20,713 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2023-12-23 19:21:20,713 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2023-12-23 19:21:20,724 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.12 07:21:20" (1/1) ... [2023-12-23 19:21:20,724 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.12 07:21:20" (1/1) ... [2023-12-23 19:21:20,727 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.12 07:21:20" (1/1) ... [2023-12-23 19:21:20,735 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]. [2023-12-23 19:21:20,735 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.12 07:21:20" (1/1) ... [2023-12-23 19:21:20,735 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.12 07:21:20" (1/1) ... [2023-12-23 19:21:20,741 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.12 07:21:20" (1/1) ... [2023-12-23 19:21:20,743 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.12 07:21:20" (1/1) ... [2023-12-23 19:21:20,745 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.12 07:21:20" (1/1) ... [2023-12-23 19:21:20,745 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.12 07:21:20" (1/1) ... [2023-12-23 19:21:20,747 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-12-23 19:21:20,748 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-12-23 19:21:20,748 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2023-12-23 19:21:20,748 INFO L274 PluginConnector]: RCFGBuilder initialized [2023-12-23 19:21:20,749 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.12 07:21:20" (1/1) ... [2023-12-23 19:21:20,752 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2023-12-23 19:21:20,772 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-12-23 19:21:20,792 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2023-12-23 19:21:20,797 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2023-12-23 19:21:20,818 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-12-23 19:21:20,818 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2023-12-23 19:21:20,818 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2023-12-23 19:21:20,819 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2023-12-23 19:21:20,819 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-12-23 19:21:20,820 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-12-23 19:21:20,910 INFO L241 CfgBuilder]: Building ICFG [2023-12-23 19:21:20,913 INFO L267 CfgBuilder]: Building CFG for each procedure with an implementation [2023-12-23 19:21:21,190 INFO L282 CfgBuilder]: Performing block encoding [2023-12-23 19:21:21,235 INFO L304 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-12-23 19:21:21,236 INFO L309 CfgBuilder]: Removed 1 assume(true) statements. [2023-12-23 19:21:21,239 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.12 07:21:21 BoogieIcfgContainer [2023-12-23 19:21:21,239 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-12-23 19:21:21,241 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-12-23 19:21:21,241 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2023-12-23 19:21:21,244 INFO L274 PluginConnector]: TraceAbstraction initialized [2023-12-23 19:21:21,244 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 23.12 07:21:20" (1/3) ... [2023-12-23 19:21:21,244 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@66613447 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 23.12 07:21:21, skipping insertion in model container [2023-12-23 19:21:21,245 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.12 07:21:20" (2/3) ... [2023-12-23 19:21:21,245 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@66613447 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 23.12 07:21:21, skipping insertion in model container [2023-12-23 19:21:21,245 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.12 07:21:21" (3/3) ... [2023-12-23 19:21:21,246 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_floatingpointinfluence_has-floats_file-9.i [2023-12-23 19:21:21,261 INFO L204 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-12-23 19:21:21,262 INFO L163 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2023-12-23 19:21:21,297 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-12-23 19:21:21,303 INFO L357 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mHoare=true, mAutomataTypeConcurrency=PETRI_NET, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=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;@435543e5, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2023-12-23 19:21:21,303 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2023-12-23 19:21:21,307 INFO L276 IsEmpty]: Start isEmpty. Operand has 28 states, 20 states have (on average 1.5) internal successors, (30), 21 states have internal predecessors, (30), 5 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2023-12-23 19:21:21,313 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2023-12-23 19:21:21,314 INFO L187 NwaCegarLoop]: Found error trace [2023-12-23 19:21:21,314 INFO L195 NwaCegarLoop]: trace histogram [5, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-23 19:21:21,315 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-23 19:21:21,321 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-23 19:21:21,321 INFO L85 PathProgramCache]: Analyzing trace with hash 1874091188, now seen corresponding path program 1 times [2023-12-23 19:21:21,335 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-23 19:21:21,336 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [271543377] [2023-12-23 19:21:21,336 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-23 19:21:21,340 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-23 19:21:21,340 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-23 19:21:21,348 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-12-23 19:21:21,349 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Waiting until timeout for monitored process [2023-12-23 19:21:21,468 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-23 19:21:21,471 INFO L262 TraceCheckSpWp]: Trace formula consists of 84 conjuncts, 1 conjunts are in the unsatisfiable core [2023-12-23 19:21:21,475 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-23 19:21:21,493 INFO L134 CoverageAnalysis]: Checked inductivity of 40 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 32 trivial. 0 not checked. [2023-12-23 19:21:21,494 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-23 19:21:21,494 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-23 19:21:21,494 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [271543377] [2023-12-23 19:21:21,495 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [271543377] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-23 19:21:21,495 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-23 19:21:21,495 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-12-23 19:21:21,496 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1418666236] [2023-12-23 19:21:21,496 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-23 19:21:21,499 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2023-12-23 19:21:21,499 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-23 19:21:21,515 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2023-12-23 19:21:21,516 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2023-12-23 19:21:21,517 INFO L87 Difference]: Start difference. First operand has 28 states, 20 states have (on average 1.5) internal successors, (30), 21 states have internal predecessors, (30), 5 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) Second operand has 2 states, 2 states have (on average 9.0) internal successors, (18), 2 states have internal predecessors, (18), 1 states have call successors, (5), 1 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 1 states have call successors, (5) [2023-12-23 19:21:21,566 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-23 19:21:21,567 INFO L93 Difference]: Finished difference Result 52 states and 81 transitions. [2023-12-23 19:21:21,569 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-12-23 19:21:21,570 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 9.0) internal successors, (18), 2 states have internal predecessors, (18), 1 states have call successors, (5), 1 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 1 states have call successors, (5) Word has length 38 [2023-12-23 19:21:21,571 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-23 19:21:21,575 INFO L225 Difference]: With dead ends: 52 [2023-12-23 19:21:21,575 INFO L226 Difference]: Without dead ends: 25 [2023-12-23 19:21:21,581 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 37 GetRequests, 37 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2023-12-23 19:21:21,585 INFO L413 NwaCegarLoop]: 29 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 3 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 29 SdHoareTripleChecker+Invalid, 3 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 3 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-12-23 19:21:21,587 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 29 Invalid, 3 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 3 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-12-23 19:21:21,602 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25 states. [2023-12-23 19:21:21,620 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25 to 25. [2023-12-23 19:21:21,621 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 25 states, 18 states have (on average 1.2222222222222223) internal successors, (22), 18 states have internal predecessors, (22), 5 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2023-12-23 19:21:21,623 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 32 transitions. [2023-12-23 19:21:21,625 INFO L78 Accepts]: Start accepts. Automaton has 25 states and 32 transitions. Word has length 38 [2023-12-23 19:21:21,625 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-23 19:21:21,625 INFO L495 AbstractCegarLoop]: Abstraction has 25 states and 32 transitions. [2023-12-23 19:21:21,625 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 9.0) internal successors, (18), 2 states have internal predecessors, (18), 1 states have call successors, (5), 1 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 1 states have call successors, (5) [2023-12-23 19:21:21,626 INFO L276 IsEmpty]: Start isEmpty. Operand 25 states and 32 transitions. [2023-12-23 19:21:21,629 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2023-12-23 19:21:21,629 INFO L187 NwaCegarLoop]: Found error trace [2023-12-23 19:21:21,629 INFO L195 NwaCegarLoop]: trace histogram [5, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-23 19:21:21,643 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Forceful destruction successful, exit code 0 [2023-12-23 19:21:21,835 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-23 19:21:21,836 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-23 19:21:21,838 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-23 19:21:21,838 INFO L85 PathProgramCache]: Analyzing trace with hash 1769860978, now seen corresponding path program 1 times [2023-12-23 19:21:21,839 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-23 19:21:21,839 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [947664949] [2023-12-23 19:21:21,839 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-23 19:21:21,840 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-23 19:21:21,840 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-23 19:21:21,841 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-12-23 19:21:21,843 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Waiting until timeout for monitored process [2023-12-23 19:21:21,935 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-23 19:21:21,937 INFO L262 TraceCheckSpWp]: Trace formula consists of 84 conjuncts, 6 conjunts are in the unsatisfiable core [2023-12-23 19:21:21,940 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-23 19:21:22,161 INFO L134 CoverageAnalysis]: Checked inductivity of 40 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 40 trivial. 0 not checked. [2023-12-23 19:21:22,161 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-23 19:21:22,161 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-23 19:21:22,165 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [947664949] [2023-12-23 19:21:22,165 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [947664949] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-23 19:21:22,165 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-23 19:21:22,165 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-12-23 19:21:22,165 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1612262882] [2023-12-23 19:21:22,165 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-23 19:21:22,167 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-12-23 19:21:22,167 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-23 19:21:22,168 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-12-23 19:21:22,168 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2023-12-23 19:21:22,168 INFO L87 Difference]: Start difference. First operand 25 states and 32 transitions. Second operand has 5 states, 5 states have (on average 3.2) internal successors, (16), 4 states have internal predecessors, (16), 1 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 1 states have call predecessors, (5), 1 states have call successors, (5) [2023-12-23 19:21:22,353 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-23 19:21:22,354 INFO L93 Difference]: Finished difference Result 73 states and 94 transitions. [2023-12-23 19:21:22,354 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-12-23 19:21:22,355 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 3.2) internal successors, (16), 4 states have internal predecessors, (16), 1 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 1 states have call predecessors, (5), 1 states have call successors, (5) Word has length 38 [2023-12-23 19:21:22,355 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-23 19:21:22,356 INFO L225 Difference]: With dead ends: 73 [2023-12-23 19:21:22,356 INFO L226 Difference]: Without dead ends: 49 [2023-12-23 19:21:22,356 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 39 GetRequests, 34 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2023-12-23 19:21:22,357 INFO L413 NwaCegarLoop]: 24 mSDtfsCounter, 22 mSDsluCounter, 64 mSDsCounter, 0 mSdLazyCounter, 38 mSolverCounterSat, 13 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 22 SdHoareTripleChecker+Valid, 88 SdHoareTripleChecker+Invalid, 51 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 13 IncrementalHoareTripleChecker+Valid, 38 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-12-23 19:21:22,357 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [22 Valid, 88 Invalid, 51 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [13 Valid, 38 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-12-23 19:21:22,358 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 49 states. [2023-12-23 19:21:22,367 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 49 to 43. [2023-12-23 19:21:22,368 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 43 states, 30 states have (on average 1.1666666666666667) internal successors, (35), 30 states have internal predecessors, (35), 10 states have call successors, (10), 2 states have call predecessors, (10), 2 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) [2023-12-23 19:21:22,369 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43 states to 43 states and 55 transitions. [2023-12-23 19:21:22,370 INFO L78 Accepts]: Start accepts. Automaton has 43 states and 55 transitions. Word has length 38 [2023-12-23 19:21:22,370 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-23 19:21:22,370 INFO L495 AbstractCegarLoop]: Abstraction has 43 states and 55 transitions. [2023-12-23 19:21:22,370 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.2) internal successors, (16), 4 states have internal predecessors, (16), 1 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 1 states have call predecessors, (5), 1 states have call successors, (5) [2023-12-23 19:21:22,371 INFO L276 IsEmpty]: Start isEmpty. Operand 43 states and 55 transitions. [2023-12-23 19:21:22,373 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2023-12-23 19:21:22,373 INFO L187 NwaCegarLoop]: Found error trace [2023-12-23 19:21:22,374 INFO L195 NwaCegarLoop]: trace histogram [5, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-23 19:21:22,393 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Forceful destruction successful, exit code 0 [2023-12-23 19:21:22,578 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-23 19:21:22,579 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-23 19:21:22,580 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-23 19:21:22,580 INFO L85 PathProgramCache]: Analyzing trace with hash 960514352, now seen corresponding path program 1 times [2023-12-23 19:21:22,581 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-23 19:21:22,581 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1832119634] [2023-12-23 19:21:22,581 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-23 19:21:22,581 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-23 19:21:22,581 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-23 19:21:22,584 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-12-23 19:21:22,585 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Waiting until timeout for monitored process [2023-12-23 19:21:22,647 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-23 19:21:22,650 INFO L262 TraceCheckSpWp]: Trace formula consists of 85 conjuncts, 19 conjunts are in the unsatisfiable core [2023-12-23 19:21:22,653 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-23 19:22:10,299 INFO L134 CoverageAnalysis]: Checked inductivity of 40 backedges. 12 proven. 0 refuted. 0 times theorem prover too weak. 28 trivial. 0 not checked. [2023-12-23 19:22:10,300 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-23 19:22:10,300 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-23 19:22:10,300 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1832119634] [2023-12-23 19:22:10,300 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1832119634] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-23 19:22:10,300 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-23 19:22:10,300 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2023-12-23 19:22:10,300 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [436621526] [2023-12-23 19:22:10,301 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-23 19:22:10,301 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2023-12-23 19:22:10,301 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-23 19:22:10,301 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2023-12-23 19:22:10,302 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=40, Invalid=116, Unknown=0, NotChecked=0, Total=156 [2023-12-23 19:22:10,302 INFO L87 Difference]: Start difference. First operand 43 states and 55 transitions. Second operand has 13 states, 13 states have (on average 1.4615384615384615) internal successors, (19), 12 states have internal predecessors, (19), 1 states have call successors, (5), 1 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 1 states have call successors, (5) [2023-12-23 19:22:11,056 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-23 19:22:11,056 INFO L93 Difference]: Finished difference Result 63 states and 74 transitions. [2023-12-23 19:22:11,057 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2023-12-23 19:22:11,057 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 1.4615384615384615) internal successors, (19), 12 states have internal predecessors, (19), 1 states have call successors, (5), 1 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 1 states have call successors, (5) Word has length 38 [2023-12-23 19:22:11,057 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-23 19:22:11,058 INFO L225 Difference]: With dead ends: 63 [2023-12-23 19:22:11,058 INFO L226 Difference]: Without dead ends: 61 [2023-12-23 19:22:11,059 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 50 GetRequests, 26 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 120 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=162, Invalid=488, Unknown=0, NotChecked=0, Total=650 [2023-12-23 19:22:11,059 INFO L413 NwaCegarLoop]: 15 mSDtfsCounter, 70 mSDsluCounter, 134 mSDsCounter, 0 mSdLazyCounter, 189 mSolverCounterSat, 26 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 70 SdHoareTripleChecker+Valid, 149 SdHoareTripleChecker+Invalid, 215 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 26 IncrementalHoareTripleChecker+Valid, 189 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2023-12-23 19:22:11,060 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [70 Valid, 149 Invalid, 215 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [26 Valid, 189 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2023-12-23 19:22:11,061 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 61 states. [2023-12-23 19:22:11,066 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 61 to 51. [2023-12-23 19:22:11,066 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 51 states, 37 states have (on average 1.135135135135135) internal successors, (42), 37 states have internal predecessors, (42), 10 states have call successors, (10), 3 states have call predecessors, (10), 3 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) [2023-12-23 19:22:11,067 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 51 states to 51 states and 62 transitions. [2023-12-23 19:22:11,067 INFO L78 Accepts]: Start accepts. Automaton has 51 states and 62 transitions. Word has length 38 [2023-12-23 19:22:11,067 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-23 19:22:11,067 INFO L495 AbstractCegarLoop]: Abstraction has 51 states and 62 transitions. [2023-12-23 19:22:11,067 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 1.4615384615384615) internal successors, (19), 12 states have internal predecessors, (19), 1 states have call successors, (5), 1 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 1 states have call successors, (5) [2023-12-23 19:22:11,067 INFO L276 IsEmpty]: Start isEmpty. Operand 51 states and 62 transitions. [2023-12-23 19:22:11,068 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2023-12-23 19:22:11,068 INFO L187 NwaCegarLoop]: Found error trace [2023-12-23 19:22:11,068 INFO L195 NwaCegarLoop]: trace histogram [5, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-23 19:22:11,088 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Forceful destruction successful, exit code 0 [2023-12-23 19:22:11,273 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-23 19:22:11,273 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-23 19:22:11,274 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-23 19:22:11,274 INFO L85 PathProgramCache]: Analyzing trace with hash 1017772654, now seen corresponding path program 1 times [2023-12-23 19:22:11,276 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-23 19:22:11,276 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1550262831] [2023-12-23 19:22:11,276 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-23 19:22:11,276 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-23 19:22:11,276 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-23 19:22:11,282 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-12-23 19:22:11,283 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (5)] Waiting until timeout for monitored process [2023-12-23 19:22:11,339 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-23 19:22:11,342 INFO L262 TraceCheckSpWp]: Trace formula consists of 84 conjuncts, 19 conjunts are in the unsatisfiable core [2023-12-23 19:22:11,345 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-23 19:22:38,641 INFO L134 CoverageAnalysis]: Checked inductivity of 40 backedges. 12 proven. 0 refuted. 0 times theorem prover too weak. 28 trivial. 0 not checked. [2023-12-23 19:22:38,641 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-23 19:22:38,641 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-23 19:22:38,641 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1550262831] [2023-12-23 19:22:38,641 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1550262831] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-23 19:22:38,642 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-23 19:22:38,642 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2023-12-23 19:22:38,642 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1674810635] [2023-12-23 19:22:38,642 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-23 19:22:38,642 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2023-12-23 19:22:38,642 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-23 19:22:38,643 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2023-12-23 19:22:38,643 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=40, Invalid=116, Unknown=0, NotChecked=0, Total=156 [2023-12-23 19:22:38,643 INFO L87 Difference]: Start difference. First operand 51 states and 62 transitions. Second operand has 13 states, 13 states have (on average 1.4615384615384615) internal successors, (19), 12 states have internal predecessors, (19), 1 states have call successors, (5), 1 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 1 states have call successors, (5) [2023-12-23 19:22:39,524 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-23 19:22:39,524 INFO L93 Difference]: Finished difference Result 61 states and 72 transitions. [2023-12-23 19:22:39,524 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2023-12-23 19:22:39,525 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 1.4615384615384615) internal successors, (19), 12 states have internal predecessors, (19), 1 states have call successors, (5), 1 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 1 states have call successors, (5) Word has length 38 [2023-12-23 19:22:39,525 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-23 19:22:39,526 INFO L225 Difference]: With dead ends: 61 [2023-12-23 19:22:39,526 INFO L226 Difference]: Without dead ends: 59 [2023-12-23 19:22:39,526 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 50 GetRequests, 26 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 118 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=162, Invalid=488, Unknown=0, NotChecked=0, Total=650 [2023-12-23 19:22:39,527 INFO L413 NwaCegarLoop]: 17 mSDtfsCounter, 70 mSDsluCounter, 109 mSDsCounter, 0 mSdLazyCounter, 183 mSolverCounterSat, 36 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 70 SdHoareTripleChecker+Valid, 126 SdHoareTripleChecker+Invalid, 219 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 36 IncrementalHoareTripleChecker+Valid, 183 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2023-12-23 19:22:39,527 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [70 Valid, 126 Invalid, 219 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [36 Valid, 183 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2023-12-23 19:22:39,528 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 59 states. [2023-12-23 19:22:39,532 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 59 to 49. [2023-12-23 19:22:39,532 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 49 states, 35 states have (on average 1.1428571428571428) internal successors, (40), 35 states have internal predecessors, (40), 10 states have call successors, (10), 3 states have call predecessors, (10), 3 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) [2023-12-23 19:22:39,533 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 49 states to 49 states and 60 transitions. [2023-12-23 19:22:39,533 INFO L78 Accepts]: Start accepts. Automaton has 49 states and 60 transitions. Word has length 38 [2023-12-23 19:22:39,533 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-23 19:22:39,533 INFO L495 AbstractCegarLoop]: Abstraction has 49 states and 60 transitions. [2023-12-23 19:22:39,533 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 1.4615384615384615) internal successors, (19), 12 states have internal predecessors, (19), 1 states have call successors, (5), 1 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 1 states have call successors, (5) [2023-12-23 19:22:39,533 INFO L276 IsEmpty]: Start isEmpty. Operand 49 states and 60 transitions. [2023-12-23 19:22:39,534 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 76 [2023-12-23 19:22:39,534 INFO L187 NwaCegarLoop]: Found error trace [2023-12-23 19:22:39,534 INFO L195 NwaCegarLoop]: trace histogram [10, 10, 10, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1] [2023-12-23 19:22:39,544 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (5)] Forceful destruction successful, exit code 0 [2023-12-23 19:22:39,743 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-23 19:22:39,744 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-23 19:22:39,744 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-23 19:22:39,744 INFO L85 PathProgramCache]: Analyzing trace with hash 772996836, now seen corresponding path program 1 times [2023-12-23 19:22:39,749 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-23 19:22:39,749 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [194033808] [2023-12-23 19:22:39,749 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-23 19:22:39,749 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-23 19:22:39,749 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-23 19:22:39,750 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-12-23 19:22:39,752 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (6)] Waiting until timeout for monitored process [2023-12-23 19:22:39,839 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-23 19:22:39,845 INFO L262 TraceCheckSpWp]: Trace formula consists of 142 conjuncts, 10 conjunts are in the unsatisfiable core [2023-12-23 19:22:39,847 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-23 19:22:40,025 INFO L134 CoverageAnalysis]: Checked inductivity of 196 backedges. 116 proven. 0 refuted. 0 times theorem prover too weak. 80 trivial. 0 not checked. [2023-12-23 19:22:40,025 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-23 19:22:40,025 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-23 19:22:40,026 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [194033808] [2023-12-23 19:22:40,026 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [194033808] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-23 19:22:40,026 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-23 19:22:40,026 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2023-12-23 19:22:40,026 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1816522481] [2023-12-23 19:22:40,026 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-23 19:22:40,027 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2023-12-23 19:22:40,027 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-23 19:22:40,027 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2023-12-23 19:22:40,027 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2023-12-23 19:22:40,028 INFO L87 Difference]: Start difference. First operand 49 states and 60 transitions. Second operand has 9 states, 9 states have (on average 3.4444444444444446) internal successors, (31), 8 states have internal predecessors, (31), 2 states have call successors, (10), 2 states have call predecessors, (10), 2 states have return successors, (10), 2 states have call predecessors, (10), 2 states have call successors, (10) [2023-12-23 19:22:40,459 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-23 19:22:40,460 INFO L93 Difference]: Finished difference Result 150 states and 186 transitions. [2023-12-23 19:22:40,461 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2023-12-23 19:22:40,461 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 3.4444444444444446) internal successors, (31), 8 states have internal predecessors, (31), 2 states have call successors, (10), 2 states have call predecessors, (10), 2 states have return successors, (10), 2 states have call predecessors, (10), 2 states have call successors, (10) Word has length 75 [2023-12-23 19:22:40,461 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-23 19:22:40,462 INFO L225 Difference]: With dead ends: 150 [2023-12-23 19:22:40,462 INFO L226 Difference]: Without dead ends: 126 [2023-12-23 19:22:40,463 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 84 GetRequests, 67 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 33 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=122, Invalid=220, Unknown=0, NotChecked=0, Total=342 [2023-12-23 19:22:40,463 INFO L413 NwaCegarLoop]: 42 mSDtfsCounter, 132 mSDsluCounter, 124 mSDsCounter, 0 mSdLazyCounter, 157 mSolverCounterSat, 48 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 132 SdHoareTripleChecker+Valid, 166 SdHoareTripleChecker+Invalid, 205 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 48 IncrementalHoareTripleChecker+Valid, 157 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2023-12-23 19:22:40,464 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [132 Valid, 166 Invalid, 205 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [48 Valid, 157 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2023-12-23 19:22:40,464 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 126 states. [2023-12-23 19:22:40,483 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 126 to 93. [2023-12-23 19:22:40,483 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 93 states, 67 states have (on average 1.1343283582089552) internal successors, (76), 67 states have internal predecessors, (76), 20 states have call successors, (20), 5 states have call predecessors, (20), 5 states have return successors, (20), 20 states have call predecessors, (20), 20 states have call successors, (20) [2023-12-23 19:22:40,484 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 93 states to 93 states and 116 transitions. [2023-12-23 19:22:40,484 INFO L78 Accepts]: Start accepts. Automaton has 93 states and 116 transitions. Word has length 75 [2023-12-23 19:22:40,484 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-23 19:22:40,485 INFO L495 AbstractCegarLoop]: Abstraction has 93 states and 116 transitions. [2023-12-23 19:22:40,485 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 3.4444444444444446) internal successors, (31), 8 states have internal predecessors, (31), 2 states have call successors, (10), 2 states have call predecessors, (10), 2 states have return successors, (10), 2 states have call predecessors, (10), 2 states have call successors, (10) [2023-12-23 19:22:40,485 INFO L276 IsEmpty]: Start isEmpty. Operand 93 states and 116 transitions. [2023-12-23 19:22:40,486 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 76 [2023-12-23 19:22:40,486 INFO L187 NwaCegarLoop]: Found error trace [2023-12-23 19:22:40,486 INFO L195 NwaCegarLoop]: trace histogram [10, 10, 10, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1] [2023-12-23 19:22:40,493 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (6)] Ended with exit code 0 [2023-12-23 19:22:40,691 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-23 19:22:40,691 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-23 19:22:40,692 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-23 19:22:40,692 INFO L85 PathProgramCache]: Analyzing trace with hash -36349790, now seen corresponding path program 1 times [2023-12-23 19:22:40,692 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-23 19:22:40,692 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1844536704] [2023-12-23 19:22:40,692 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-23 19:22:40,693 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-23 19:22:40,693 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-23 19:22:40,694 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-12-23 19:22:40,694 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (7)] Waiting until timeout for monitored process [2023-12-23 19:22:40,771 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-23 19:22:40,775 INFO L262 TraceCheckSpWp]: Trace formula consists of 143 conjuncts, 16 conjunts are in the unsatisfiable core [2023-12-23 19:22:40,777 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-23 19:23:54,735 INFO L134 CoverageAnalysis]: Checked inductivity of 196 backedges. 27 proven. 8 refuted. 0 times theorem prover too weak. 161 trivial. 0 not checked. [2023-12-23 19:23:54,736 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-23 19:25:28,359 WARN L293 SmtUtils]: Spent 15.14s on a formula simplification that was a NOOP. DAG size: 284 (called from [L 391] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-12-23 19:26:31,248 WARN L293 SmtUtils]: Spent 16.52s on a formula simplification that was a NOOP. DAG size: 278 (called from [L 391] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-12-23 19:27:36,922 WARN L293 SmtUtils]: Spent 12.66s on a formula simplification that was a NOOP. DAG size: 237 (called from [L 391] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-12-23 19:28:48,257 WARN L293 SmtUtils]: Spent 10.28s on a formula simplification that was a NOOP. DAG size: 233 (called from [L 391] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-12-23 19:29:04,971 INFO L134 CoverageAnalysis]: Checked inductivity of 196 backedges. 35 proven. 0 refuted. 0 times theorem prover too weak. 161 trivial. 0 not checked. [2023-12-23 19:29:04,972 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-23 19:29:04,972 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1844536704] [2023-12-23 19:29:04,972 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1844536704] provided 1 perfect and 1 imperfect interpolant sequences [2023-12-23 19:29:04,972 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2023-12-23 19:29:04,972 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [11] total 21 [2023-12-23 19:29:04,972 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2094271111] [2023-12-23 19:29:04,972 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-23 19:29:04,973 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2023-12-23 19:29:04,973 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-23 19:29:04,973 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2023-12-23 19:29:04,974 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=97, Invalid=297, Unknown=26, NotChecked=0, Total=420 [2023-12-23 19:29:04,974 INFO L87 Difference]: Start difference. First operand 93 states and 116 transitions. Second operand has 11 states, 11 states have (on average 2.5454545454545454) internal successors, (28), 11 states have internal predecessors, (28), 1 states have call successors, (5), 1 states have call predecessors, (5), 2 states have return successors, (6), 2 states have call predecessors, (6), 1 states have call successors, (6) [2023-12-23 19:29:06,881 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.22s for a HTC check with result INVALID. Formula has sorts [Bool, FloatingPoint, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2023-12-23 19:29:09,436 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.02s for a HTC check with result INVALID. Formula has sorts [Bool, FloatingPoint, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2023-12-23 19:29:10,642 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.10s for a HTC check with result INVALID. Formula has sorts [Bool, FloatingPoint, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2023-12-23 19:29:13,082 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.44s for a HTC check with result INVALID. Formula has sorts [Bool, FloatingPoint, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2023-12-23 19:29:14,322 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.09s for a HTC check with result INVALID. Formula has sorts [Bool, FloatingPoint, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2023-12-23 19:29:16,286 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.86s for a HTC check with result INVALID. Formula has sorts [Bool, FloatingPoint, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2023-12-23 19:29:18,236 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.01s for a HTC check with result INVALID. Formula has sorts [Bool, FloatingPoint, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2023-12-23 19:29:19,393 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.00s for a HTC check with result INVALID. Formula has sorts [Bool, FloatingPoint, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2023-12-23 19:29:20,634 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.13s for a HTC check with result INVALID. Formula has sorts [Bool, FloatingPoint, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2023-12-23 19:29:22,663 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.15s for a HTC check with result INVALID. Formula has sorts [Bool, FloatingPoint, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2023-12-23 19:29:23,966 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.15s for a HTC check with result INVALID. Formula has sorts [Bool, FloatingPoint, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2023-12-23 19:29:25,995 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.91s for a HTC check with result INVALID. Formula has sorts [Bool, FloatingPoint, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2023-12-23 19:29:27,102 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.11s for a HTC check with result INVALID. Formula has sorts [Bool, FloatingPoint, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2023-12-23 19:29:28,775 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.67s for a HTC check with result INVALID. Formula has sorts [Bool, FloatingPoint, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2023-12-23 19:29:30,087 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.16s for a HTC check with result INVALID. Formula has sorts [Bool, FloatingPoint, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2023-12-23 19:29:31,485 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.28s for a HTC check with result INVALID. Formula has sorts [Bool, FloatingPoint, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2023-12-23 19:29:32,779 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.29s for a HTC check with result INVALID. Formula has sorts [Bool, FloatingPoint, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2023-12-23 19:29:33,789 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.01s for a HTC check with result INVALID. Formula has sorts [Bool, FloatingPoint, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2023-12-23 19:29:36,043 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.05s for a HTC check with result INVALID. Formula has sorts [Bool, FloatingPoint, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2023-12-23 19:29:38,177 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.33s for a HTC check with result INVALID. Formula has sorts [Bool, FloatingPoint, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2023-12-23 19:29:42,910 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.33s for a HTC check with result INVALID. Formula has sorts [Bool, FloatingPoint, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2023-12-23 19:29:44,251 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.22s for a HTC check with result INVALID. Formula has sorts [Bool, FloatingPoint, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2023-12-23 19:29:45,366 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.11s for a HTC check with result INVALID. Formula has sorts [Bool, FloatingPoint, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2023-12-23 19:29:46,882 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.52s for a HTC check with result INVALID. Formula has sorts [Bool, FloatingPoint, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2023-12-23 19:29:49,797 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.05s for a HTC check with result INVALID. Formula has sorts [Bool, FloatingPoint, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2023-12-23 19:29:51,271 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.47s for a HTC check with result INVALID. Formula has sorts [Bool, FloatingPoint, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2023-12-23 19:29:53,746 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.15s for a HTC check with result INVALID. Formula has sorts [Bool, FloatingPoint, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2023-12-23 19:30:34,774 WARN L293 SmtUtils]: Spent 28.39s on a formula simplification that was a NOOP. DAG size: 417 (called from [L 391] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-12-23 19:30:39,144 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.03s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2023-12-23 19:31:37,362 WARN L293 SmtUtils]: Spent 49.30s on a formula simplification that was a NOOP. DAG size: 477 (called from [L 391] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-12-23 19:31:41,094 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 3.14s for a HTC check with result INVALID. Formula has sorts [Bool, FloatingPoint, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2023-12-23 19:31:44,822 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 3.73s for a HTC check with result INVALID. Formula has sorts [Bool, FloatingPoint, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2023-12-23 19:33:06,623 WARN L293 SmtUtils]: Spent 1.27m on a formula simplification that was a NOOP. DAG size: 501 (called from [L 391] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-12-23 19:33:08,238 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.61s for a HTC check with result INVALID. Formula has sorts [Bool, FloatingPoint, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2023-12-23 19:33:10,427 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.19s for a HTC check with result INVALID. Formula has sorts [Bool, FloatingPoint, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2023-12-23 19:33:15,244 WARN L876 $PredicateComparison]: unable to prove that (let ((.cse68 ((_ sign_extend 16) c_~last_1_var_1_12~0)) (.cse70 ((_ zero_extend 24) c_~last_1_var_1_1~0))) (let ((.cse80 ((_ sign_extend 16) c_~var_1_12~0)) (.cse69 ((_ zero_extend 24) c_~var_1_3~0)) (.cse67 (bvslt (bvadd .cse68 .cse70) (_ bv10 32)))) (let ((.cse83 (not .cse67)) (.cse53 (forall ((~last_1_var_1_14~0 (_ BitVec 32))) (not (bvsgt (bvadd .cse68 .cse69 (bvneg ~last_1_var_1_14~0)) .cse70)))) (.cse31 (= .cse68 .cse80)) (.cse88 (bvshl (_ bv10 32) .cse80)) (.cse89 (bvneg .cse68))) (let ((.cse121 (fp.eq c_~var_1_11~0 c_~var_1_11~0)) (.cse119 (forall ((~var_1_3~0 (_ BitVec 8))) (let ((.cse333 ((_ zero_extend 24) ~var_1_3~0))) (or (= .cse80 ((_ sign_extend 16) ((_ extract 15 0) (bvadd .cse68 .cse89 .cse333)))) (forall ((~last_1_var_1_14~0 (_ BitVec 32))) (bvsgt (bvadd .cse68 .cse333 (bvneg ~last_1_var_1_14~0)) .cse70)))))) (.cse120 (forall ((~var_1_3~0 (_ BitVec 8))) (let ((.cse332 ((_ zero_extend 24) ~var_1_3~0))) (or (forall ((~last_1_var_1_14~0 (_ BitVec 32))) (not (bvsgt (bvadd .cse68 .cse332 (bvneg ~last_1_var_1_14~0)) .cse70))) (= .cse80 ((_ sign_extend 16) ((_ extract 15 0) (bvadd .cse68 .cse89 .cse332)))))))) (.cse225 (forall ((~last_1_var_1_14~0 (_ BitVec 32)) (~var_1_3~0 (_ BitVec 8))) (let ((.cse330 ((_ zero_extend 24) ~var_1_3~0))) (let ((.cse331 (bvadd .cse68 .cse89 .cse330))) (or (bvsgt (bvadd .cse68 .cse330 (bvneg ~last_1_var_1_14~0)) .cse70) (bvsgt .cse331 .cse70) (= .cse80 ((_ sign_extend 16) ((_ extract 15 0) .cse331))) (not (bvslt .cse88 (bvmul .cse330 c_~var_1_14~0)))))))) (.cse61 (or (forall ((~last_1_var_1_14~0 (_ BitVec 32))) (let ((.cse329 (bvadd .cse68 .cse69 (bvneg ~last_1_var_1_14~0)))) (or (not (bvsgt .cse329 .cse70)) (not (= .cse80 ((_ sign_extend 16) ((_ extract 15 0) .cse329))))))) .cse31 .cse67)) (.cse62 (forall ((~last_1_var_1_14~0 (_ BitVec 32))) (or (not (bvsgt ~last_1_var_1_14~0 .cse68)) (not (bvsgt (bvadd .cse68 .cse69 (bvneg ~last_1_var_1_14~0)) .cse70))))) (.cse64 (or .cse53 .cse31 .cse67)) (.cse224 (bvadd .cse68 .cse89 .cse69)) (.cse209 (fp.eq c_~var_1_10~0 c_~var_1_11~0)) (.cse210 (= ((_ zero_extend 24) c_~var_1_9~0) (_ bv64 32))) (.cse204 (= .cse80 c_~var_1_14~0)) (.cse58 (bvslt .cse88 (bvmul .cse69 c_~var_1_14~0))) (.cse220 (forall ((~last_1_var_1_14~0 (_ BitVec 32)) (~var_1_3~0 (_ BitVec 8))) (let ((.cse327 ((_ zero_extend 24) ~var_1_3~0))) (let ((.cse328 (bvadd .cse68 .cse89 .cse327))) (or (bvsgt (bvadd .cse68 .cse327 (bvneg ~last_1_var_1_14~0)) .cse70) (not (bvsgt .cse328 .cse70)) (not (= .cse80 ((_ sign_extend 16) ((_ extract 15 0) .cse328)))) (not (bvslt .cse88 (bvmul .cse327 c_~var_1_14~0)))))))) (.cse281 (forall ((~last_1_var_1_14~0 (_ BitVec 32)) (~var_1_3~0 (_ BitVec 8))) (let ((.cse326 ((_ zero_extend 24) ~var_1_3~0))) (let ((.cse325 (bvadd .cse68 .cse89 .cse326))) (or (bvsgt .cse325 .cse70) (not (= .cse80 ((_ sign_extend 16) ((_ extract 15 0) .cse325)))) (not (bvsgt (bvadd .cse68 .cse326 (bvneg ~last_1_var_1_14~0)) .cse70)) (bvslt .cse88 (bvmul .cse326 c_~var_1_14~0))))))) (.cse289 (forall ((~last_1_var_1_14~0 (_ BitVec 32)) (~var_1_3~0 (_ BitVec 8))) (let ((.cse324 ((_ zero_extend 24) ~var_1_3~0))) (or (not (= .cse80 ((_ sign_extend 16) ((_ extract 15 0) (bvadd .cse68 .cse89 .cse324))))) (not (bvslt .cse88 (bvmul .cse324 c_~var_1_14~0))) (not (bvsgt (bvadd .cse68 .cse324 (bvneg ~last_1_var_1_14~0)) .cse70)))))) (.cse50 (= ((_ sign_extend 16) ((_ extract 15 0) (bvadd .cse80 c_~var_1_14~0))) ((_ sign_extend 16) c_~var_1_8~0))) (.cse214 (forall ((~last_1_var_1_14~0 (_ BitVec 32)) (~var_1_3~0 (_ BitVec 8))) (let ((.cse323 ((_ zero_extend 24) ~var_1_3~0))) (or (bvsgt (bvadd .cse68 .cse323 (bvneg ~last_1_var_1_14~0)) .cse70) (not (= .cse80 ((_ sign_extend 16) ((_ extract 15 0) (bvadd .cse68 .cse89 .cse323))))) (not (bvslt .cse88 (bvmul .cse323 c_~var_1_14~0))))))) (.cse14 (and .cse83 .cse31)) (.cse230 (forall ((~last_1_var_1_14~0 (_ BitVec 32)) (~var_1_3~0 (_ BitVec 8))) (let ((.cse322 ((_ zero_extend 24) ~var_1_3~0))) (let ((.cse321 (bvadd .cse68 .cse89 .cse322))) (or (bvsgt .cse321 .cse70) (= .cse80 ((_ sign_extend 16) ((_ extract 15 0) .cse321))) (not (bvslt .cse88 (bvmul .cse322 c_~var_1_14~0))) (not (bvsgt (bvadd .cse68 .cse322 (bvneg ~last_1_var_1_14~0)) .cse70)))))))) (let ((.cse0 (= .cse80 ((_ sign_extend 16) ((_ extract 15 0) .cse70)))) (.cse5 (or .cse31 (forall ((~last_1_var_1_14~0 (_ BitVec 32)) (~var_1_3~0 (_ BitVec 8))) (let ((.cse320 ((_ zero_extend 24) ~var_1_3~0))) (let ((.cse319 (bvadd .cse68 .cse320 (bvneg ~last_1_var_1_14~0)))) (or (not (= .cse80 ((_ sign_extend 16) ((_ extract 15 0) .cse319)))) (not (bvslt .cse88 (bvmul .cse320 c_~var_1_14~0))) (not (bvsgt .cse319 .cse70)) (not (bvsgt ~last_1_var_1_14~0 .cse68)))))) .cse67)) (.cse6 (or .cse31 .cse230)) (.cse7 (or (forall ((~last_1_var_1_14~0 (_ BitVec 32)) (~var_1_3~0 (_ BitVec 8))) (let ((.cse317 ((_ zero_extend 24) ~var_1_3~0))) (let ((.cse318 (bvadd .cse68 .cse317 (bvneg ~last_1_var_1_14~0)))) (or (bvsgt (bvadd .cse68 .cse89 .cse317) .cse70) (not (= .cse80 ((_ sign_extend 16) ((_ extract 15 0) .cse318)))) (not (bvsgt .cse318 .cse70)) (not (bvsgt ~last_1_var_1_14~0 .cse68)))))) .cse67)) (.cse8 (or .cse14 (forall ((~last_1_var_1_14~0 (_ BitVec 32)) (~var_1_3~0 (_ BitVec 8))) (let ((.cse316 ((_ zero_extend 24) ~var_1_3~0))) (let ((.cse315 (bvadd .cse68 .cse316 (bvneg ~last_1_var_1_14~0)))) (or (not (= .cse80 ((_ sign_extend 16) ((_ extract 15 0) .cse315)))) (= .cse80 ((_ sign_extend 16) ((_ extract 15 0) (bvadd .cse68 .cse89 .cse316)))) (not (bvsgt .cse315 .cse70)) (bvslt .cse88 (bvmul .cse316 c_~var_1_14~0)) (bvsgt ~last_1_var_1_14~0 .cse68))))))) (.cse9 (or (forall ((~last_1_var_1_14~0 (_ BitVec 32)) (~var_1_3~0 (_ BitVec 8))) (let ((.cse314 ((_ zero_extend 24) ~var_1_3~0))) (or (bvsgt (bvadd .cse68 .cse314 (bvneg ~last_1_var_1_14~0)) .cse70) (= .cse80 ((_ sign_extend 16) ((_ extract 15 0) (bvadd .cse68 .cse89 .cse314)))) (bvslt .cse88 (bvmul .cse314 c_~var_1_14~0))))) .cse14)) (.cse10 (or (forall ((~last_1_var_1_14~0 (_ BitVec 32)) (~var_1_3~0 (_ BitVec 8))) (let ((.cse313 ((_ zero_extend 24) ~var_1_3~0))) (let ((.cse312 (bvadd .cse68 .cse313 (bvneg ~last_1_var_1_14~0)))) (or (not (= .cse80 ((_ sign_extend 16) ((_ extract 15 0) .cse312)))) (not (bvsgt .cse312 .cse70)) (not (bvsgt ~last_1_var_1_14~0 .cse68)) (bvslt .cse88 (bvmul .cse313 c_~var_1_14~0)))))) .cse31 .cse67)) (.cse12 (or (forall ((~last_1_var_1_14~0 (_ BitVec 32)) (~var_1_3~0 (_ BitVec 8))) (let ((.cse310 ((_ zero_extend 24) ~var_1_3~0))) (let ((.cse311 (bvadd .cse68 .cse310 (bvneg ~last_1_var_1_14~0)))) (or (= .cse80 ((_ sign_extend 16) ((_ extract 15 0) (bvadd .cse68 .cse89 .cse310)))) (not (bvsgt .cse311 .cse70)) (bvslt .cse88 (bvmul .cse310 c_~var_1_14~0)) (= .cse80 ((_ sign_extend 16) ((_ extract 15 0) .cse311))))))) .cse14)) (.cse15 (or (forall ((~last_1_var_1_14~0 (_ BitVec 32)) (~var_1_3~0 (_ BitVec 8))) (let ((.cse309 ((_ zero_extend 24) ~var_1_3~0))) (let ((.cse308 (bvadd .cse68 .cse309 (bvneg ~last_1_var_1_14~0)))) (or (not (= .cse80 ((_ sign_extend 16) ((_ extract 15 0) .cse308)))) (= .cse80 ((_ sign_extend 16) ((_ extract 15 0) (bvadd .cse68 .cse89 .cse309)))) (not (bvslt .cse88 (bvmul .cse309 c_~var_1_14~0))) (not (bvsgt .cse308 .cse70)) (bvsgt ~last_1_var_1_14~0 .cse68))))) .cse14)) (.cse16 (or .cse14 (forall ((~last_1_var_1_14~0 (_ BitVec 32)) (~var_1_3~0 (_ BitVec 8))) (let ((.cse306 ((_ zero_extend 24) ~var_1_3~0))) (let ((.cse307 (bvadd .cse68 .cse306 (bvneg ~last_1_var_1_14~0)))) (or (= .cse80 ((_ sign_extend 16) ((_ extract 15 0) (bvadd .cse68 .cse89 .cse306)))) (not (bvslt .cse88 (bvmul .cse306 c_~var_1_14~0))) (not (bvsgt .cse307 .cse70)) (= .cse80 ((_ sign_extend 16) ((_ extract 15 0) .cse307))))))))) (.cse13 (forall ((~last_1_var_1_14~0 (_ BitVec 32)) (~var_1_3~0 (_ BitVec 8))) (let ((.cse305 ((_ zero_extend 24) ~var_1_3~0))) (or (bvsgt (bvadd .cse68 .cse305 (bvneg ~last_1_var_1_14~0)) .cse70) (= .cse80 ((_ sign_extend 16) ((_ extract 15 0) (bvadd .cse68 .cse89 .cse305)))) (not (bvslt .cse88 (bvmul .cse305 c_~var_1_14~0))))))) (.cse206 (and (forall ((~var_1_3~0 (_ BitVec 8))) (let ((.cse301 ((_ zero_extend 24) ~var_1_3~0))) (or (not (= .cse80 ((_ sign_extend 16) ((_ extract 15 0) (bvadd .cse68 .cse89 .cse301))))) (forall ((~last_1_var_1_14~0 (_ BitVec 32))) (bvsgt (bvadd .cse68 .cse301 (bvneg ~last_1_var_1_14~0)) .cse70)) (bvslt .cse88 (bvmul .cse301 c_~var_1_14~0))))) (forall ((~var_1_3~0 (_ BitVec 8))) (let ((.cse302 ((_ zero_extend 24) ~var_1_3~0))) (or (not (= .cse80 ((_ sign_extend 16) ((_ extract 15 0) (bvadd .cse68 .cse89 .cse302))))) (forall ((~last_1_var_1_14~0 (_ BitVec 32))) (bvsgt (bvadd .cse68 .cse302 (bvneg ~last_1_var_1_14~0)) .cse70)) (not (bvslt .cse88 (bvmul .cse302 c_~var_1_14~0)))))) (forall ((~var_1_3~0 (_ BitVec 8))) (let ((.cse303 ((_ zero_extend 24) ~var_1_3~0))) (or (forall ((~last_1_var_1_14~0 (_ BitVec 32))) (not (bvsgt (bvadd .cse68 .cse303 (bvneg ~last_1_var_1_14~0)) .cse70))) (not (= .cse80 ((_ sign_extend 16) ((_ extract 15 0) (bvadd .cse68 .cse89 .cse303))))) (bvslt .cse88 (bvmul .cse303 c_~var_1_14~0))))) (forall ((~var_1_3~0 (_ BitVec 8))) (let ((.cse304 ((_ zero_extend 24) ~var_1_3~0))) (or (forall ((~last_1_var_1_14~0 (_ BitVec 32))) (not (bvsgt (bvadd .cse68 .cse304 (bvneg ~last_1_var_1_14~0)) .cse70))) (not (= .cse80 ((_ sign_extend 16) ((_ extract 15 0) (bvadd .cse68 .cse89 .cse304))))) (not (bvslt .cse88 (bvmul .cse304 c_~var_1_14~0)))))))) (.cse197 (forall ((~var_1_3~0 (_ BitVec 8))) (let ((.cse300 ((_ zero_extend 24) ~var_1_3~0))) (or (not (= .cse80 ((_ sign_extend 16) ((_ extract 15 0) (bvadd .cse68 .cse89 .cse300))))) (not (bvslt .cse88 (bvmul .cse300 c_~var_1_14~0))) (forall ((~last_1_var_1_14~0 (_ BitVec 32))) (or (not (bvsgt (bvadd .cse68 .cse300 (bvneg ~last_1_var_1_14~0)) .cse70)) (not (bvsgt ~last_1_var_1_14~0 .cse68)))))))) (.cse201 (or (forall ((~var_1_3~0 (_ BitVec 8))) (let ((.cse299 ((_ zero_extend 24) ~var_1_3~0))) (or (not (= .cse80 ((_ sign_extend 16) ((_ extract 15 0) (bvadd .cse68 .cse89 .cse299))))) (not (bvslt .cse88 (bvmul .cse299 c_~var_1_14~0)))))) .cse31 .cse67)) (.cse203 (or .cse214 .cse31 .cse67)) (.cse198 (or .cse31 .cse67 (forall ((~last_1_var_1_14~0 (_ BitVec 32)) (~var_1_3~0 (_ BitVec 8))) (let ((.cse298 ((_ zero_extend 24) ~var_1_3~0))) (or (not (= .cse80 ((_ sign_extend 16) ((_ extract 15 0) (bvadd .cse68 .cse89 .cse298))))) (not (bvsgt (bvadd .cse68 .cse298 (bvneg ~last_1_var_1_14~0)) .cse70)) (bvslt .cse88 (bvmul .cse298 c_~var_1_14~0))))))) (.cse199 (forall ((~var_1_3~0 (_ BitVec 8))) (let ((.cse297 ((_ zero_extend 24) ~var_1_3~0))) (or (not (= .cse80 ((_ sign_extend 16) ((_ extract 15 0) (bvadd .cse68 .cse89 .cse297))))) (bvslt .cse88 (bvmul .cse297 c_~var_1_14~0)) (forall ((~last_1_var_1_14~0 (_ BitVec 32))) (or (not (bvsgt (bvadd .cse68 .cse297 (bvneg ~last_1_var_1_14~0)) .cse70)) (not (bvsgt ~last_1_var_1_14~0 .cse68)))))))) (.cse202 (or (forall ((~last_1_var_1_14~0 (_ BitVec 32)) (~var_1_3~0 (_ BitVec 8))) (let ((.cse296 ((_ zero_extend 24) ~var_1_3~0))) (let ((.cse295 (bvadd .cse68 .cse296 (bvneg ~last_1_var_1_14~0)))) (or (not (= .cse80 ((_ sign_extend 16) ((_ extract 15 0) .cse295)))) (not (= .cse80 ((_ sign_extend 16) ((_ extract 15 0) (bvadd .cse68 .cse89 .cse296))))) (not (bvsgt .cse295 .cse70)) (bvslt .cse88 (bvmul .cse296 c_~var_1_14~0)))))) .cse31 .cse67)) (.cse200 (or (forall ((~var_1_3~0 (_ BitVec 8))) (let ((.cse294 ((_ zero_extend 24) ~var_1_3~0))) (or (not (= .cse80 ((_ sign_extend 16) ((_ extract 15 0) (bvadd .cse68 .cse89 .cse294))))) (bvslt .cse88 (bvmul .cse294 c_~var_1_14~0))))) .cse31 .cse67)) (.cse30 (forall ((~last_1_var_1_14~0 (_ BitVec 32)) (~var_1_3~0 (_ BitVec 8))) (let ((.cse292 ((_ zero_extend 24) ~var_1_3~0))) (let ((.cse293 (bvadd .cse68 .cse89 .cse292))) (or (bvsgt (bvadd .cse68 .cse292 (bvneg ~last_1_var_1_14~0)) .cse70) (bvsgt .cse293 .cse70) (not (= .cse80 ((_ sign_extend 16) ((_ extract 15 0) .cse293)))) (not (bvslt .cse88 (bvmul .cse292 c_~var_1_14~0)))))))) (.cse213 (or .cse289 .cse50)) (.cse22 (or (forall ((~last_1_var_1_14~0 (_ BitVec 32)) (~var_1_3~0 (_ BitVec 8))) (let ((.cse291 ((_ zero_extend 24) ~var_1_3~0))) (let ((.cse290 (bvadd .cse68 .cse89 .cse291))) (or (bvsgt .cse290 .cse70) (not (= .cse80 ((_ sign_extend 16) ((_ extract 15 0) .cse290)))) (not (bvslt .cse88 (bvmul .cse291 c_~var_1_14~0))) (not (bvsgt (bvadd .cse68 .cse291 (bvneg ~last_1_var_1_14~0)) .cse70)))))) .cse31)) (.cse23 (or .cse289 .cse31 .cse67)) (.cse24 (or .cse281 .cse31)) (.cse25 (forall ((~var_1_3~0 (_ BitVec 8))) (let ((.cse288 ((_ zero_extend 24) ~var_1_3~0))) (let ((.cse287 (bvadd .cse68 .cse89 .cse288))) (or (bvsgt .cse287 .cse70) (not (= .cse80 ((_ sign_extend 16) ((_ extract 15 0) .cse287)))) (bvslt .cse88 (bvmul .cse288 c_~var_1_14~0)) (forall ((~last_1_var_1_14~0 (_ BitVec 32))) (or (not (bvsgt (bvadd .cse68 .cse288 (bvneg ~last_1_var_1_14~0)) .cse70)) (not (bvsgt ~last_1_var_1_14~0 .cse68))))))))) (.cse26 (or (forall ((~last_1_var_1_14~0 (_ BitVec 32)) (~var_1_3~0 (_ BitVec 8))) (let ((.cse286 ((_ zero_extend 24) ~var_1_3~0))) (or (not (= .cse80 ((_ sign_extend 16) ((_ extract 15 0) (bvadd .cse68 .cse89 .cse286))))) (not (bvslt .cse88 (bvmul .cse286 c_~var_1_14~0))) (not (bvsgt (bvadd .cse68 .cse286 (bvneg ~last_1_var_1_14~0)) .cse70)) (not (bvsgt ~last_1_var_1_14~0 .cse68))))) .cse31)) (.cse27 (or (forall ((~last_1_var_1_14~0 (_ BitVec 32)) (~var_1_3~0 (_ BitVec 8))) (let ((.cse284 ((_ zero_extend 24) ~var_1_3~0))) (let ((.cse285 (bvadd .cse68 .cse89 .cse284))) (or (bvsgt (bvadd .cse68 .cse284 (bvneg ~last_1_var_1_14~0)) .cse70) (not (bvsgt .cse285 .cse70)) (not (= .cse80 ((_ sign_extend 16) ((_ extract 15 0) .cse285)))) (not (bvslt .cse88 (bvmul .cse284 c_~var_1_14~0))) (not (bvsgt ~last_1_var_1_14~0 .cse68)))))) .cse31)) (.cse28 (forall ((~var_1_3~0 (_ BitVec 8))) (let ((.cse283 ((_ zero_extend 24) ~var_1_3~0))) (let ((.cse282 (bvadd .cse68 .cse89 .cse283))) (or (bvsgt .cse282 .cse70) (not (= .cse80 ((_ sign_extend 16) ((_ extract 15 0) .cse282)))) (not (bvslt .cse88 (bvmul .cse283 c_~var_1_14~0))) (forall ((~last_1_var_1_14~0 (_ BitVec 32))) (or (not (bvsgt (bvadd .cse68 .cse283 (bvneg ~last_1_var_1_14~0)) .cse70)) (not (bvsgt ~last_1_var_1_14~0 .cse68))))))))) (.cse29 (or .cse220 .cse31 .cse67)) (.cse32 (or .cse281 .cse83)) (.cse34 (or .cse14 (forall ((~last_1_var_1_14~0 (_ BitVec 32)) (~var_1_3~0 (_ BitVec 8))) (let ((.cse279 ((_ zero_extend 24) ~var_1_3~0))) (let ((.cse280 (bvadd .cse68 .cse89 .cse279))) (or (bvsgt (bvadd .cse68 .cse279 (bvneg ~last_1_var_1_14~0)) .cse70) (bvsgt .cse280 .cse70) (not (= .cse80 ((_ sign_extend 16) ((_ extract 15 0) .cse280)))) (bvslt .cse88 (bvmul .cse279 c_~var_1_14~0)))))))) (.cse35 (or (forall ((~last_1_var_1_14~0 (_ BitVec 32)) (~var_1_3~0 (_ BitVec 8))) (let ((.cse278 ((_ zero_extend 24) ~var_1_3~0))) (let ((.cse277 (bvadd .cse68 .cse278 (bvneg ~last_1_var_1_14~0)))) (or (not (= .cse80 ((_ sign_extend 16) ((_ extract 15 0) .cse277)))) (not (= .cse80 ((_ sign_extend 16) ((_ extract 15 0) (bvadd .cse68 .cse89 .cse278))))) (not (bvslt .cse88 (bvmul .cse278 c_~var_1_14~0))) (not (bvsgt .cse277 .cse70)))))) .cse31 .cse67)) (.cse20 (or .cse31 .cse67 (forall ((~last_1_var_1_14~0 (_ BitVec 32)) (~var_1_3~0 (_ BitVec 8))) (let ((.cse276 ((_ zero_extend 24) ~var_1_3~0))) (let ((.cse274 (bvadd .cse68 .cse89 .cse276)) (.cse275 (bvadd .cse68 .cse276 (bvneg ~last_1_var_1_14~0)))) (or (not (bvsgt .cse274 .cse70)) (not (= .cse80 ((_ sign_extend 16) ((_ extract 15 0) .cse275)))) (not (= .cse80 ((_ sign_extend 16) ((_ extract 15 0) .cse274)))) (not (bvsgt .cse275 .cse70)) (bvslt .cse88 (bvmul .cse276 c_~var_1_14~0)))))))) (.cse21 (or .cse31 .cse67 (forall ((~last_1_var_1_14~0 (_ BitVec 32)) (~var_1_3~0 (_ BitVec 8))) (let ((.cse273 ((_ zero_extend 24) ~var_1_3~0))) (let ((.cse272 (bvadd .cse68 .cse89 .cse273))) (or (not (bvsgt .cse272 .cse70)) (not (= .cse80 ((_ sign_extend 16) ((_ extract 15 0) .cse272)))) (not (bvsgt (bvadd .cse68 .cse273 (bvneg ~last_1_var_1_14~0)) .cse70)) (bvslt .cse88 (bvmul .cse273 c_~var_1_14~0)))))))) (.cse33 (or (forall ((~last_1_var_1_14~0 (_ BitVec 32)) (~var_1_3~0 (_ BitVec 8))) (let ((.cse271 ((_ zero_extend 24) ~var_1_3~0))) (let ((.cse270 (bvadd .cse68 .cse89 .cse271))) (or (not (bvsgt .cse270 .cse70)) (not (= .cse80 ((_ sign_extend 16) ((_ extract 15 0) .cse270)))) (not (bvsgt (bvadd .cse68 .cse271 (bvneg ~last_1_var_1_14~0)) .cse70)) (not (bvsgt ~last_1_var_1_14~0 .cse68)) (bvslt .cse88 (bvmul .cse271 c_~var_1_14~0)))))) .cse14)) (.cse18 (or .cse14 (forall ((~last_1_var_1_14~0 (_ BitVec 32)) (~var_1_3~0 (_ BitVec 8))) (let ((.cse269 ((_ zero_extend 24) ~var_1_3~0))) (or (bvsgt (bvadd .cse68 .cse269 (bvneg ~last_1_var_1_14~0)) .cse70) (not (= .cse80 ((_ sign_extend 16) ((_ extract 15 0) (bvadd .cse68 .cse89 .cse269))))) (not (bvsgt ~last_1_var_1_14~0 .cse68)) (bvslt .cse88 (bvmul .cse269 c_~var_1_14~0))))))) (.cse19 (or .cse31 .cse67 (forall ((~last_1_var_1_14~0 (_ BitVec 32)) (~var_1_3~0 (_ BitVec 8))) (let ((.cse268 ((_ zero_extend 24) ~var_1_3~0))) (or (bvsgt (bvadd .cse68 .cse268 (bvneg ~last_1_var_1_14~0)) .cse70) (not (= .cse80 ((_ sign_extend 16) ((_ extract 15 0) (bvadd .cse68 .cse89 .cse268))))) (bvslt .cse88 (bvmul .cse268 c_~var_1_14~0))))))) (.cse146 (and (forall ((~var_1_3~0 (_ BitVec 8))) (let ((.cse264 ((_ zero_extend 24) ~var_1_3~0))) (or (= .cse80 ((_ sign_extend 16) ((_ extract 15 0) (bvadd .cse68 .cse89 .cse264)))) (forall ((~last_1_var_1_14~0 (_ BitVec 32))) (bvsgt (bvadd .cse68 .cse264 (bvneg ~last_1_var_1_14~0)) .cse70)) (bvslt .cse88 (bvmul .cse264 c_~var_1_14~0))))) (forall ((~var_1_3~0 (_ BitVec 8))) (let ((.cse265 ((_ zero_extend 24) ~var_1_3~0))) (or (forall ((~last_1_var_1_14~0 (_ BitVec 32))) (not (bvsgt (bvadd .cse68 .cse265 (bvneg ~last_1_var_1_14~0)) .cse70))) (= .cse80 ((_ sign_extend 16) ((_ extract 15 0) (bvadd .cse68 .cse89 .cse265)))) (bvslt .cse88 (bvmul .cse265 c_~var_1_14~0))))) (forall ((~var_1_3~0 (_ BitVec 8))) (let ((.cse266 ((_ zero_extend 24) ~var_1_3~0))) (or (forall ((~last_1_var_1_14~0 (_ BitVec 32))) (not (bvsgt (bvadd .cse68 .cse266 (bvneg ~last_1_var_1_14~0)) .cse70))) (= .cse80 ((_ sign_extend 16) ((_ extract 15 0) (bvadd .cse68 .cse89 .cse266)))) (not (bvslt .cse88 (bvmul .cse266 c_~var_1_14~0)))))) (forall ((~var_1_3~0 (_ BitVec 8))) (let ((.cse267 ((_ zero_extend 24) ~var_1_3~0))) (or (= .cse80 ((_ sign_extend 16) ((_ extract 15 0) (bvadd .cse68 .cse89 .cse267)))) (forall ((~last_1_var_1_14~0 (_ BitVec 32))) (bvsgt (bvadd .cse68 .cse267 (bvneg ~last_1_var_1_14~0)) .cse70)) (not (bvslt .cse88 (bvmul .cse267 c_~var_1_14~0)))))))) (.cse59 (not .cse58)) (.cse73 (and .cse209 .cse210 .cse204)) (.cse84 (= .cse69 ((_ zero_extend 24) c_~var_1_1~0))) (.cse43 (bvsgt .cse224 .cse70)) (.cse149 (or .cse53 .cse31)) (.cse72 (forall ((~last_1_var_1_14~0 (_ BitVec 32))) (bvsgt (bvadd .cse68 .cse69 (bvneg ~last_1_var_1_14~0)) .cse70))) (.cse223 (and .cse61 .cse62 .cse64)) (.cse152 (or (forall ((~last_1_var_1_14~0 (_ BitVec 32)) (~var_1_3~0 (_ BitVec 8))) (let ((.cse263 ((_ zero_extend 24) ~var_1_3~0))) (or (bvsgt (bvadd .cse68 .cse263 (bvneg ~last_1_var_1_14~0)) .cse70) (not (bvsgt (bvadd .cse68 .cse89 .cse263) .cse70)) (not (bvslt .cse88 (bvmul .cse263 c_~var_1_14~0))) (not (bvsgt ~last_1_var_1_14~0 .cse68))))) .cse31 .cse67)) (.cse161 (forall ((~last_1_var_1_14~0 (_ BitVec 32)) (~var_1_3~0 (_ BitVec 8))) (let ((.cse262 ((_ zero_extend 24) ~var_1_3~0))) (or (not (bvsgt (bvadd .cse68 .cse89 .cse262) .cse70)) (not (bvslt .cse88 (bvmul .cse262 c_~var_1_14~0))) (not (bvsgt (bvadd .cse68 .cse262 (bvneg ~last_1_var_1_14~0)) .cse70)))))) (.cse208 (and .cse50 .cse83 .cse31)) (.cse153 (or .cse225 .cse31 .cse67)) (.cse155 (or (forall ((~last_1_var_1_14~0 (_ BitVec 32)) (~var_1_3~0 (_ BitVec 8))) (let ((.cse261 ((_ zero_extend 24) ~var_1_3~0))) (let ((.cse259 (bvadd .cse68 .cse89 .cse261)) (.cse260 (bvadd .cse68 .cse261 (bvneg ~last_1_var_1_14~0)))) (or (bvsgt .cse259 .cse70) (not (= .cse80 ((_ sign_extend 16) ((_ extract 15 0) .cse260)))) (= .cse80 ((_ sign_extend 16) ((_ extract 15 0) .cse259))) (not (bvslt .cse88 (bvmul .cse261 c_~var_1_14~0))) (not (bvsgt .cse260 .cse70)))))) .cse31 .cse67)) (.cse156 (or .cse31 .cse230 .cse67)) (.cse11 (forall ((~var_1_3~0 (_ BitVec 8))) (let ((.cse258 ((_ zero_extend 24) ~var_1_3~0))) (let ((.cse257 (bvadd .cse68 .cse89 .cse258))) (or (bvsgt .cse257 .cse70) (= .cse80 ((_ sign_extend 16) ((_ extract 15 0) .cse257))) (not (bvslt .cse88 (bvmul .cse258 c_~var_1_14~0))) (forall ((~last_1_var_1_14~0 (_ BitVec 32))) (or (not (bvsgt (bvadd .cse68 .cse258 (bvneg ~last_1_var_1_14~0)) .cse70)) (not (bvsgt ~last_1_var_1_14~0 .cse68))))))))) (.cse160 (or .cse14 (forall ((~last_1_var_1_14~0 (_ BitVec 32)) (~var_1_3~0 (_ BitVec 8))) (let ((.cse256 ((_ zero_extend 24) ~var_1_3~0))) (or (not (bvsgt (bvadd .cse68 .cse89 .cse256) .cse70)) (not (bvsgt (bvadd .cse68 .cse256 (bvneg ~last_1_var_1_14~0)) .cse70)) (bvslt .cse88 (bvmul .cse256 c_~var_1_14~0))))))) (.cse163 (or .cse31 (forall ((~last_1_var_1_14~0 (_ BitVec 32)) (~var_1_3~0 (_ BitVec 8))) (let ((.cse254 ((_ zero_extend 24) ~var_1_3~0))) (let ((.cse255 (bvadd .cse68 .cse89 .cse254))) (or (bvsgt (bvadd .cse68 .cse254 (bvneg ~last_1_var_1_14~0)) .cse70) (bvsgt .cse255 .cse70) (= .cse80 ((_ sign_extend 16) ((_ extract 15 0) .cse255))) (not (bvslt .cse88 (bvmul .cse254 c_~var_1_14~0))) (not (bvsgt ~last_1_var_1_14~0 .cse68)))))) .cse67)) (.cse164 (or .cse14 (forall ((~last_1_var_1_14~0 (_ BitVec 32)) (~var_1_3~0 (_ BitVec 8))) (let ((.cse253 ((_ zero_extend 24) ~var_1_3~0))) (or (bvsgt (bvadd .cse68 .cse253 (bvneg ~last_1_var_1_14~0)) .cse70) (not (bvsgt (bvadd .cse68 .cse89 .cse253) .cse70)) (not (bvslt .cse88 (bvmul .cse253 c_~var_1_14~0))) (bvsgt ~last_1_var_1_14~0 .cse68)))))) (.cse47 (not .cse50)) (.cse157 (forall ((~var_1_3~0 (_ BitVec 8))) (let ((.cse252 ((_ zero_extend 24) ~var_1_3~0))) (let ((.cse251 (bvadd .cse68 .cse89 .cse252))) (or (bvsgt .cse251 .cse70) (= .cse80 ((_ sign_extend 16) ((_ extract 15 0) .cse251))) (bvslt .cse88 (bvmul .cse252 c_~var_1_14~0)) (forall ((~last_1_var_1_14~0 (_ BitVec 32))) (or (not (bvsgt (bvadd .cse68 .cse252 (bvneg ~last_1_var_1_14~0)) .cse70)) (not (bvsgt ~last_1_var_1_14~0 .cse68))))))))) (.cse159 (or (forall ((~last_1_var_1_14~0 (_ BitVec 32)) (~var_1_3~0 (_ BitVec 8))) (let ((.cse250 ((_ zero_extend 24) ~var_1_3~0))) (let ((.cse248 (bvadd .cse68 .cse89 .cse250)) (.cse249 (bvadd .cse68 .cse250 (bvneg ~last_1_var_1_14~0)))) (or (bvsgt .cse248 .cse70) (not (= .cse80 ((_ sign_extend 16) ((_ extract 15 0) .cse249)))) (= .cse80 ((_ sign_extend 16) ((_ extract 15 0) .cse248))) (not (bvsgt .cse249 .cse70)) (bvslt .cse88 (bvmul .cse250 c_~var_1_14~0)))))) .cse31 .cse67)) (.cse166 (or (forall ((~last_1_var_1_14~0 (_ BitVec 32)) (~var_1_3~0 (_ BitVec 8))) (let ((.cse247 ((_ zero_extend 24) ~var_1_3~0))) (let ((.cse246 (bvadd .cse68 .cse89 .cse247))) (or (bvsgt .cse246 .cse70) (= .cse80 ((_ sign_extend 16) ((_ extract 15 0) .cse246))) (not (bvsgt (bvadd .cse68 .cse247 (bvneg ~last_1_var_1_14~0)) .cse70)) (bvslt .cse88 (bvmul .cse247 c_~var_1_14~0)))))) .cse31 .cse67)) (.cse154 (or (forall ((~last_1_var_1_14~0 (_ BitVec 32)) (~var_1_3~0 (_ BitVec 8))) (let ((.cse245 ((_ zero_extend 24) ~var_1_3~0))) (or (bvsgt (bvadd .cse68 .cse245 (bvneg ~last_1_var_1_14~0)) .cse70) (not (bvsgt (bvadd .cse68 .cse89 .cse245) .cse70)) (not (bvsgt ~last_1_var_1_14~0 .cse68)) (bvslt .cse88 (bvmul .cse245 c_~var_1_14~0))))) .cse31 .cse67)) (.cse162 (or .cse14 (forall ((~last_1_var_1_14~0 (_ BitVec 32)) (~var_1_3~0 (_ BitVec 8))) (let ((.cse244 ((_ zero_extend 24) ~var_1_3~0))) (or (bvsgt (bvadd .cse68 .cse244 (bvneg ~last_1_var_1_14~0)) .cse70) (not (bvsgt (bvadd .cse68 .cse89 .cse244) .cse70)) (bvslt .cse88 (bvmul .cse244 c_~var_1_14~0)) (bvsgt ~last_1_var_1_14~0 .cse68)))))) (.cse158 (or (forall ((~last_1_var_1_14~0 (_ BitVec 32)) (~var_1_3~0 (_ BitVec 8))) (let ((.cse242 ((_ zero_extend 24) ~var_1_3~0))) (let ((.cse243 (bvadd .cse68 .cse89 .cse242))) (or (bvsgt (bvadd .cse68 .cse242 (bvneg ~last_1_var_1_14~0)) .cse70) (bvsgt .cse243 .cse70) (= .cse80 ((_ sign_extend 16) ((_ extract 15 0) .cse243))) (not (bvsgt ~last_1_var_1_14~0 .cse68)) (bvslt .cse88 (bvmul .cse242 c_~var_1_14~0)))))) .cse31 .cse67)) (.cse165 (or (forall ((~last_1_var_1_14~0 (_ BitVec 32)) (~var_1_3~0 (_ BitVec 8))) (let ((.cse240 ((_ zero_extend 24) ~var_1_3~0))) (let ((.cse241 (bvadd .cse68 .cse89 .cse240))) (or (bvsgt (bvadd .cse68 .cse240 (bvneg ~last_1_var_1_14~0)) .cse70) (bvsgt .cse241 .cse70) (= .cse80 ((_ sign_extend 16) ((_ extract 15 0) .cse241))) (bvslt .cse88 (bvmul .cse240 c_~var_1_14~0)))))) .cse31 .cse67)) (.cse196 (and (forall ((~var_1_3~0 (_ BitVec 8))) (let ((.cse239 ((_ zero_extend 24) ~var_1_3~0))) (or (= .cse80 ((_ sign_extend 16) ((_ extract 15 0) (bvadd .cse68 .cse89 .cse239)))) (not (bvslt .cse88 (bvmul .cse239 c_~var_1_14~0)))))) .cse119 .cse120)) (.cse205 (and .cse121 .cse204))) (let ((.cse4 (or .cse196 .cse205)) (.cse93 (or .cse31 (forall ((~last_1_var_1_14~0 (_ BitVec 32)) (~var_1_3~0 (_ BitVec 8))) (let ((.cse238 ((_ zero_extend 24) ~var_1_3~0))) (or (bvsgt (bvadd .cse68 .cse238 (bvneg ~last_1_var_1_14~0)) .cse70) (not (= .cse80 ((_ sign_extend 16) ((_ extract 15 0) (bvadd .cse68 .cse89 .cse238))))) (bvslt .cse88 (bvmul .cse80 .cse238))))) .cse67)) (.cse98 (or (forall ((~last_1_var_1_14~0 (_ BitVec 32)) (~var_1_3~0 (_ BitVec 8))) (let ((.cse236 ((_ zero_extend 24) ~var_1_3~0))) (let ((.cse237 (bvadd .cse68 .cse236 (bvneg ~last_1_var_1_14~0)))) (or (not (bvslt .cse88 (bvmul .cse80 .cse236))) (not (= .cse80 ((_ sign_extend 16) ((_ extract 15 0) .cse237)))) (not (= .cse80 ((_ sign_extend 16) ((_ extract 15 0) (bvadd .cse68 .cse89 .cse236))))) (not (bvsgt .cse237 .cse70)))))) .cse31 .cse67)) (.cse112 (or (forall ((~last_1_var_1_14~0 (_ BitVec 32)) (~var_1_3~0 (_ BitVec 8))) (let ((.cse235 ((_ zero_extend 24) ~var_1_3~0))) (or (not (bvslt .cse88 (bvmul .cse80 .cse235))) (not (= .cse80 ((_ sign_extend 16) ((_ extract 15 0) (bvadd .cse68 .cse89 .cse235))))) (not (bvsgt (bvadd .cse68 .cse235 (bvneg ~last_1_var_1_14~0)) .cse70))))) .cse31 .cse67)) (.cse117 (or .cse121 (and (forall ((~var_1_3~0 (_ BitVec 8))) (let ((.cse231 ((_ zero_extend 24) ~var_1_3~0))) (or (not (= .cse80 ((_ sign_extend 16) ((_ extract 15 0) (bvadd .cse68 .cse89 .cse231))))) (forall ((~last_1_var_1_14~0 (_ BitVec 32))) (bvsgt (bvadd .cse68 .cse231 (bvneg ~last_1_var_1_14~0)) .cse70)) (bvslt .cse88 (bvmul .cse80 .cse231))))) (forall ((~var_1_3~0 (_ BitVec 8))) (let ((.cse232 ((_ zero_extend 24) ~var_1_3~0))) (or (forall ((~last_1_var_1_14~0 (_ BitVec 32))) (not (bvsgt (bvadd .cse68 .cse232 (bvneg ~last_1_var_1_14~0)) .cse70))) (not (= .cse80 ((_ sign_extend 16) ((_ extract 15 0) (bvadd .cse68 .cse89 .cse232))))) (bvslt .cse88 (bvmul .cse80 .cse232))))) (forall ((~var_1_3~0 (_ BitVec 8))) (let ((.cse233 ((_ zero_extend 24) ~var_1_3~0))) (or (not (bvslt .cse88 (bvmul .cse80 .cse233))) (not (= .cse80 ((_ sign_extend 16) ((_ extract 15 0) (bvadd .cse68 .cse89 .cse233))))) (forall ((~last_1_var_1_14~0 (_ BitVec 32))) (bvsgt (bvadd .cse68 .cse233 (bvneg ~last_1_var_1_14~0)) .cse70))))) (forall ((~var_1_3~0 (_ BitVec 8))) (let ((.cse234 ((_ zero_extend 24) ~var_1_3~0))) (or (not (bvslt .cse88 (bvmul .cse80 .cse234))) (forall ((~last_1_var_1_14~0 (_ BitVec 32))) (not (bvsgt (bvadd .cse68 .cse234 (bvneg ~last_1_var_1_14~0)) .cse70))) (not (= .cse80 ((_ sign_extend 16) ((_ extract 15 0) (bvadd .cse68 .cse89 .cse234))))))))))) (.cse36 (let ((.cse229 (and .cse158 .cse165)) (.cse227 (and .cse154 .cse162)) (.cse226 (and .cse157 .cse159 .cse166))) (and .cse152 (or .cse225 .cse50) (or .cse161 .cse208) .cse153 .cse155 (or .cse226 .cse50) (or .cse47 .cse227) .cse156 (or (forall ((~last_1_var_1_14~0 (_ BitVec 32)) (~var_1_3~0 (_ BitVec 8))) (let ((.cse228 ((_ zero_extend 24) ~var_1_3~0))) (or (bvsgt (bvadd .cse68 .cse228 (bvneg ~last_1_var_1_14~0)) .cse70) (not (bvsgt (bvadd .cse68 .cse89 .cse228) .cse70)) (not (bvslt .cse88 (bvmul .cse228 c_~var_1_14~0)))))) .cse50) (or .cse229 .cse50) (or .cse47 .cse229) .cse11 .cse160 .cse163 .cse164 (or .cse227 .cse50) (or .cse47 .cse226) (or .cse50 .cse230)))) (.cse40 (= .cse80 ((_ sign_extend 16) ((_ extract 15 0) .cse224)))) (.cse44 (or .cse223 .cse50)) (.cse46 (or .cse47 .cse223)) (.cse60 (or .cse50 .cse72)) (.cse78 (or .cse43 (and .cse149 .cse62))) (.cse63 (or .cse53 .cse50)) (.cse49 (or .cse84 .cse72)) (.cse45 (or .cse53 .cse84)) (.cse54 (not .cse43)) (.cse66 (forall ((~last_1_var_1_14~0 (_ BitVec 32))) (or (not (bvsgt ~last_1_var_1_14~0 .cse68)) (bvsgt (bvadd .cse68 .cse69 (bvneg ~last_1_var_1_14~0)) .cse70)))) (.cse52 (or .cse31 .cse72 .cse67)) (.cse71 (or (let ((.cse222 (and .cse53 .cse72))) (and (or .cse222 .cse58) (or .cse59 .cse222))) .cse73)) (.cse37 (or .cse146 .cse205)) (.cse85 (let ((.cse219 (and .cse18 .cse19)) (.cse221 (and .cse20 .cse21 .cse33))) (and (or .cse219 .cse50) (or .cse30 (and .cse50 .cse31)) (or .cse47 .cse219) (or .cse50 .cse220) (or .cse221 .cse47) .cse213 .cse22 .cse23 .cse24 .cse25 .cse26 .cse27 .cse28 .cse29 .cse32 .cse34 .cse35 (or .cse221 .cse50)))) (.cse124 (forall ((~var_1_3~0 (_ BitVec 8))) (let ((.cse217 ((_ zero_extend 24) ~var_1_3~0))) (let ((.cse218 (bvadd .cse68 .cse89 .cse217))) (or (not (bvslt .cse88 (bvmul .cse80 .cse217))) (bvsgt .cse218 .cse70) (= .cse80 ((_ sign_extend 16) ((_ extract 15 0) .cse218))) (forall ((~last_1_var_1_14~0 (_ BitVec 32))) (or (not (bvsgt (bvadd .cse68 .cse217 (bvneg ~last_1_var_1_14~0)) .cse70)) (not (bvsgt ~last_1_var_1_14~0 .cse68))))))))) (.cse131 (forall ((~last_1_var_1_14~0 (_ BitVec 32)) (~var_1_3~0 (_ BitVec 8))) (let ((.cse215 ((_ zero_extend 24) ~var_1_3~0))) (let ((.cse216 (bvadd .cse68 .cse89 .cse215))) (or (not (bvslt .cse88 (bvmul .cse80 .cse215))) (bvsgt .cse216 .cse70) (= .cse80 ((_ sign_extend 16) ((_ extract 15 0) .cse216))) (not (bvsgt (bvadd .cse68 .cse215 (bvneg ~last_1_var_1_14~0)) .cse70))))))) (.cse39 (let ((.cse212 (and .cse19 .cse200)) (.cse211 (and .cse198 .cse199 .cse202))) (and (or .cse50 .cse211) .cse197 (or .cse212 .cse50) .cse213 (or .cse214 .cse50) .cse23 (or .cse47 .cse212) (or .cse47 .cse211) .cse201 .cse203 .cse35))) (.cse167 (or .cse73 .cse206)) (.cse41 (not .cse210)) (.cse42 (not .cse209)) (.cse3 (and .cse5 (or .cse50 (forall ((~last_1_var_1_14~0 (_ BitVec 32)) (~var_1_3~0 (_ BitVec 8))) (let ((.cse207 ((_ zero_extend 24) ~var_1_3~0))) (or (= .cse80 ((_ sign_extend 16) ((_ extract 15 0) (bvadd .cse68 .cse89 .cse207)))) (not (bvslt .cse88 (bvmul .cse207 c_~var_1_14~0))) (not (bvsgt (bvadd .cse68 .cse207 (bvneg ~last_1_var_1_14~0)) .cse70)))))) .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse15 .cse16 (or .cse13 .cse208))) (.cse38 (not .cse0)) (.cse17 (or .cse205 .cse206)) (.cse1 (not .cse121)) (.cse2 (not .cse204))) (and (or .cse0 (and (or .cse1 .cse2 .cse3) .cse4)) (or .cse0 (and (or (and .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 (or .cse13 .cse14) .cse15 .cse16) .cse1 .cse2) .cse4)) (or .cse0 (and .cse17 (or (and .cse18 .cse19 .cse20 .cse21 .cse22 .cse23 .cse24 .cse25 .cse26 .cse27 .cse28 .cse29 (or .cse30 .cse31) .cse32 .cse33 .cse34 .cse35) .cse1 .cse2))) (or (and (or .cse36 .cse1 .cse2) .cse37) .cse38) (or (and .cse17 (or .cse39 .cse1 .cse2)) .cse38) (or .cse40 (let ((.cse55 (and .cse83 .cse31 .cse84)) (.cse65 (and .cse50 .cse83 .cse31 .cse84))) (and (or .cse38 (and (or .cse41 .cse42 .cse2 (let ((.cse57 (or .cse14 (forall ((~last_1_var_1_14~0 (_ BitVec 32))) (or (bvsgt ~last_1_var_1_14~0 .cse68) (bvsgt (bvadd .cse68 .cse69 (bvneg ~last_1_var_1_14~0)) .cse70))))) (.cse51 (or .cse66 .cse31 .cse67))) (and (or (and (or .cse43 (and .cse44 .cse45 .cse46)) (or (let ((.cse48 (and .cse51 .cse52))) (and (or .cse47 .cse48) .cse49 (or .cse48 .cse50))) .cse43) (or .cse53 .cse54 .cse55) (or .cse54 (let ((.cse56 (and .cse57 .cse51))) (and .cse49 (or .cse47 .cse56) (or .cse56 .cse50))))) .cse58) (or .cse59 (and (or (and .cse49 .cse57 .cse51 .cse60) .cse54) (or .cse43 (and .cse49 .cse51 .cse60 .cse52)) (or .cse43 (and .cse45 .cse61 .cse62 .cse63 .cse64)) (or .cse53 .cse54 .cse65)))))) .cse71)) (or .cse0 (and (or (and .cse53 .cse59 .cse72) .cse73) (or .cse41 .cse42 (let ((.cse75 (forall ((~last_1_var_1_14~0 (_ BitVec 32))) (let ((.cse82 (bvadd .cse68 .cse69 (bvneg ~last_1_var_1_14~0)))) (or (not (bvsgt ~last_1_var_1_14~0 .cse68)) (not (bvsgt .cse82 .cse70)) (not (= .cse80 ((_ sign_extend 16) ((_ extract 15 0) .cse82))))))))) (let ((.cse74 (or (forall ((~last_1_var_1_14~0 (_ BitVec 32))) (let ((.cse81 (bvadd .cse68 .cse69 (bvneg ~last_1_var_1_14~0)))) (or (= .cse80 ((_ sign_extend 16) ((_ extract 15 0) .cse81))) (not (bvsgt .cse81 .cse70))))) .cse14)) (.cse76 (or .cse14 (forall ((~last_1_var_1_14~0 (_ BitVec 32))) (let ((.cse79 (bvadd .cse68 .cse69 (bvneg ~last_1_var_1_14~0)))) (or (not (bvsgt .cse79 .cse70)) (not (= .cse80 ((_ sign_extend 16) ((_ extract 15 0) .cse79)))) (bvsgt ~last_1_var_1_14~0 .cse68)))))) (.cse77 (or .cse75 .cse31 .cse67))) (and (or .cse58 (and (or .cse55 .cse72) .cse74 .cse45 (or .cse75 .cse43 .cse67) .cse76 .cse77)) (or (and (or .cse65 .cse72) .cse74 .cse78 .cse45 .cse63 .cse76 .cse77) .cse59)))) .cse2)))))) (or .cse0 (and .cse17 (or .cse85 .cse1 .cse2))) (or .cse0 (and (or (let ((.cse90 (forall ((~last_1_var_1_14~0 (_ BitVec 32)) (~var_1_3~0 (_ BitVec 8))) (let ((.cse116 ((_ zero_extend 24) ~var_1_3~0))) (let ((.cse115 (bvadd .cse68 .cse89 .cse116))) (or (bvsgt .cse115 .cse70) (not (= .cse80 ((_ sign_extend 16) ((_ extract 15 0) .cse115)))) (not (bvsgt (bvadd .cse68 .cse116 (bvneg ~last_1_var_1_14~0)) .cse70)) (bvslt .cse88 (bvmul .cse80 .cse116)))))))) (and (or (forall ((~last_1_var_1_14~0 (_ BitVec 32)) (~var_1_3~0 (_ BitVec 8))) (let ((.cse87 ((_ zero_extend 24) ~var_1_3~0))) (let ((.cse86 (bvadd .cse68 .cse89 .cse87))) (or (not (bvsgt .cse86 .cse70)) (not (= .cse80 ((_ sign_extend 16) ((_ extract 15 0) .cse86)))) (not (bvsgt (bvadd .cse68 .cse87 (bvneg ~last_1_var_1_14~0)) .cse70)) (bvslt .cse88 (bvmul .cse80 .cse87)))))) .cse31 .cse67) (or .cse83 .cse90) (or (forall ((~last_1_var_1_14~0 (_ BitVec 32)) (~var_1_3~0 (_ BitVec 8))) (let ((.cse91 ((_ zero_extend 24) ~var_1_3~0))) (let ((.cse92 (bvadd .cse68 .cse89 .cse91))) (or (bvsgt (bvadd .cse68 .cse91 (bvneg ~last_1_var_1_14~0)) .cse70) (bvsgt .cse92 .cse70) (not (= .cse80 ((_ sign_extend 16) ((_ extract 15 0) .cse92)))) (bvslt .cse88 (bvmul .cse80 .cse91)))))) .cse14) .cse93 (forall ((~var_1_3~0 (_ BitVec 8))) (let ((.cse94 ((_ zero_extend 24) ~var_1_3~0))) (let ((.cse95 (bvadd .cse68 .cse89 .cse94))) (or (not (bvslt .cse88 (bvmul .cse80 .cse94))) (bvsgt .cse95 .cse70) (not (= .cse80 ((_ sign_extend 16) ((_ extract 15 0) .cse95)))) (forall ((~last_1_var_1_14~0 (_ BitVec 32))) (or (not (bvsgt (bvadd .cse68 .cse94 (bvneg ~last_1_var_1_14~0)) .cse70)) (not (bvsgt ~last_1_var_1_14~0 .cse68)))))))) (or .cse31 (forall ((~last_1_var_1_14~0 (_ BitVec 32)) (~var_1_3~0 (_ BitVec 8))) (let ((.cse96 ((_ zero_extend 24) ~var_1_3~0))) (let ((.cse97 (bvadd .cse68 .cse89 .cse96))) (or (bvsgt (bvadd .cse68 .cse96 (bvneg ~last_1_var_1_14~0)) .cse70) (not (bvslt .cse88 (bvmul .cse80 .cse96))) (bvsgt .cse97 .cse70) (not (= .cse80 ((_ sign_extend 16) ((_ extract 15 0) .cse97))))))))) (or .cse31 .cse90) .cse98 (or .cse14 (forall ((~last_1_var_1_14~0 (_ BitVec 32)) (~var_1_3~0 (_ BitVec 8))) (let ((.cse100 ((_ zero_extend 24) ~var_1_3~0))) (let ((.cse99 (bvadd .cse68 .cse89 .cse100))) (or (not (bvsgt .cse99 .cse70)) (not (= .cse80 ((_ sign_extend 16) ((_ extract 15 0) .cse99)))) (not (bvsgt (bvadd .cse68 .cse100 (bvneg ~last_1_var_1_14~0)) .cse70)) (not (bvsgt ~last_1_var_1_14~0 .cse68)) (bvslt .cse88 (bvmul .cse80 .cse100))))))) (or (forall ((~last_1_var_1_14~0 (_ BitVec 32)) (~var_1_3~0 (_ BitVec 8))) (let ((.cse101 ((_ zero_extend 24) ~var_1_3~0))) (let ((.cse102 (bvadd .cse68 .cse89 .cse101))) (or (not (bvslt .cse88 (bvmul .cse80 .cse101))) (bvsgt .cse102 .cse70) (not (= .cse80 ((_ sign_extend 16) ((_ extract 15 0) .cse102)))) (not (bvsgt (bvadd .cse68 .cse101 (bvneg ~last_1_var_1_14~0)) .cse70)))))) .cse31) (or (forall ((~last_1_var_1_14~0 (_ BitVec 32)) (~var_1_3~0 (_ BitVec 8))) (let ((.cse105 ((_ zero_extend 24) ~var_1_3~0))) (let ((.cse103 (bvadd .cse68 .cse89 .cse105)) (.cse104 (bvadd .cse68 .cse105 (bvneg ~last_1_var_1_14~0)))) (or (not (bvsgt .cse103 .cse70)) (not (= .cse80 ((_ sign_extend 16) ((_ extract 15 0) .cse104)))) (not (= .cse80 ((_ sign_extend 16) ((_ extract 15 0) .cse103)))) (not (bvsgt .cse104 .cse70)) (bvslt .cse88 (bvmul .cse80 .cse105)))))) .cse31 .cse67) (or .cse14 (forall ((~last_1_var_1_14~0 (_ BitVec 32)) (~var_1_3~0 (_ BitVec 8))) (let ((.cse106 ((_ zero_extend 24) ~var_1_3~0))) (or (bvsgt (bvadd .cse68 .cse106 (bvneg ~last_1_var_1_14~0)) .cse70) (not (= .cse80 ((_ sign_extend 16) ((_ extract 15 0) (bvadd .cse68 .cse89 .cse106))))) (not (bvsgt ~last_1_var_1_14~0 .cse68)) (bvslt .cse88 (bvmul .cse80 .cse106)))))) (forall ((~var_1_3~0 (_ BitVec 8))) (let ((.cse108 ((_ zero_extend 24) ~var_1_3~0))) (let ((.cse107 (bvadd .cse68 .cse89 .cse108))) (or (bvsgt .cse107 .cse70) (not (= .cse80 ((_ sign_extend 16) ((_ extract 15 0) .cse107)))) (forall ((~last_1_var_1_14~0 (_ BitVec 32))) (or (not (bvsgt (bvadd .cse68 .cse108 (bvneg ~last_1_var_1_14~0)) .cse70)) (not (bvsgt ~last_1_var_1_14~0 .cse68)))) (bvslt .cse88 (bvmul .cse80 .cse108)))))) (or .cse31 (forall ((~last_1_var_1_14~0 (_ BitVec 32)) (~var_1_3~0 (_ BitVec 8))) (let ((.cse109 ((_ zero_extend 24) ~var_1_3~0))) (or (not (bvslt .cse88 (bvmul .cse80 .cse109))) (not (= .cse80 ((_ sign_extend 16) ((_ extract 15 0) (bvadd .cse68 .cse89 .cse109))))) (not (bvsgt (bvadd .cse68 .cse109 (bvneg ~last_1_var_1_14~0)) .cse70)) (not (bvsgt ~last_1_var_1_14~0 .cse68)))))) (or (forall ((~last_1_var_1_14~0 (_ BitVec 32)) (~var_1_3~0 (_ BitVec 8))) (let ((.cse110 ((_ zero_extend 24) ~var_1_3~0))) (let ((.cse111 (bvadd .cse68 .cse89 .cse110))) (or (bvsgt (bvadd .cse68 .cse110 (bvneg ~last_1_var_1_14~0)) .cse70) (not (bvslt .cse88 (bvmul .cse80 .cse110))) (not (bvsgt .cse111 .cse70)) (not (= .cse80 ((_ sign_extend 16) ((_ extract 15 0) .cse111)))))))) .cse31 .cse67) .cse112 (or (forall ((~last_1_var_1_14~0 (_ BitVec 32)) (~var_1_3~0 (_ BitVec 8))) (let ((.cse113 ((_ zero_extend 24) ~var_1_3~0))) (let ((.cse114 (bvadd .cse68 .cse89 .cse113))) (or (bvsgt (bvadd .cse68 .cse113 (bvneg ~last_1_var_1_14~0)) .cse70) (not (bvslt .cse88 (bvmul .cse80 .cse113))) (not (bvsgt .cse114 .cse70)) (not (= .cse80 ((_ sign_extend 16) ((_ extract 15 0) .cse114)))) (not (bvsgt ~last_1_var_1_14~0 .cse68)))))) .cse31))) .cse1) .cse117)) (or .cse0 (and (or (and (forall ((~var_1_3~0 (_ BitVec 8))) (let ((.cse118 ((_ zero_extend 24) ~var_1_3~0))) (or (not (bvslt .cse88 (bvmul .cse80 .cse118))) (= .cse80 ((_ sign_extend 16) ((_ extract 15 0) (bvadd .cse68 .cse89 .cse118))))))) .cse119 .cse120) .cse121) (or (and (or (forall ((~last_1_var_1_14~0 (_ BitVec 32)) (~var_1_3~0 (_ BitVec 8))) (let ((.cse123 ((_ zero_extend 24) ~var_1_3~0))) (let ((.cse122 (bvadd .cse68 .cse123 (bvneg ~last_1_var_1_14~0)))) (or (not (= .cse80 ((_ sign_extend 16) ((_ extract 15 0) .cse122)))) (not (bvsgt .cse122 .cse70)) (not (bvsgt ~last_1_var_1_14~0 .cse68)) (bvslt .cse88 (bvmul .cse80 .cse123)))))) .cse31 .cse67) .cse7 .cse124 (or .cse14 (forall ((~last_1_var_1_14~0 (_ BitVec 32)) (~var_1_3~0 (_ BitVec 8))) (let ((.cse126 ((_ zero_extend 24) ~var_1_3~0))) (let ((.cse125 (bvadd .cse68 .cse126 (bvneg ~last_1_var_1_14~0)))) (or (not (= .cse80 ((_ sign_extend 16) ((_ extract 15 0) .cse125)))) (= .cse80 ((_ sign_extend 16) ((_ extract 15 0) (bvadd .cse68 .cse89 .cse126)))) (not (bvsgt .cse125 .cse70)) (bvslt .cse88 (bvmul .cse80 .cse126)) (bvsgt ~last_1_var_1_14~0 .cse68)))))) (or (forall ((~last_1_var_1_14~0 (_ BitVec 32)) (~var_1_3~0 (_ BitVec 8))) (let ((.cse127 ((_ zero_extend 24) ~var_1_3~0))) (let ((.cse128 (bvadd .cse68 .cse127 (bvneg ~last_1_var_1_14~0)))) (or (not (bvslt .cse88 (bvmul .cse80 .cse127))) (not (= .cse80 ((_ sign_extend 16) ((_ extract 15 0) .cse128)))) (= .cse80 ((_ sign_extend 16) ((_ extract 15 0) (bvadd .cse68 .cse89 .cse127)))) (not (bvsgt .cse128 .cse70)) (bvsgt ~last_1_var_1_14~0 .cse68))))) .cse14) (or .cse14 (forall ((~last_1_var_1_14~0 (_ BitVec 32)) (~var_1_3~0 (_ BitVec 8))) (let ((.cse129 ((_ zero_extend 24) ~var_1_3~0))) (let ((.cse130 (bvadd .cse68 .cse129 (bvneg ~last_1_var_1_14~0)))) (or (= .cse80 ((_ sign_extend 16) ((_ extract 15 0) (bvadd .cse68 .cse89 .cse129)))) (not (bvsgt .cse130 .cse70)) (= .cse80 ((_ sign_extend 16) ((_ extract 15 0) .cse130))) (bvslt .cse88 (bvmul .cse80 .cse129))))))) (or .cse131 .cse31) (or .cse14 (forall ((~last_1_var_1_14~0 (_ BitVec 32)) (~var_1_3~0 (_ BitVec 8))) (let ((.cse132 ((_ zero_extend 24) ~var_1_3~0))) (or (bvsgt (bvadd .cse68 .cse132 (bvneg ~last_1_var_1_14~0)) .cse70) (= .cse80 ((_ sign_extend 16) ((_ extract 15 0) (bvadd .cse68 .cse89 .cse132)))) (bvslt .cse88 (bvmul .cse80 .cse132)))))) (or .cse14 (forall ((~last_1_var_1_14~0 (_ BitVec 32)) (~var_1_3~0 (_ BitVec 8))) (let ((.cse133 ((_ zero_extend 24) ~var_1_3~0))) (let ((.cse134 (bvadd .cse68 .cse133 (bvneg ~last_1_var_1_14~0)))) (or (not (bvslt .cse88 (bvmul .cse80 .cse133))) (= .cse80 ((_ sign_extend 16) ((_ extract 15 0) (bvadd .cse68 .cse89 .cse133)))) (not (bvsgt .cse134 .cse70)) (= .cse80 ((_ sign_extend 16) ((_ extract 15 0) .cse134)))))))) (or (forall ((~last_1_var_1_14~0 (_ BitVec 32)) (~var_1_3~0 (_ BitVec 8))) (let ((.cse135 ((_ zero_extend 24) ~var_1_3~0))) (or (bvsgt (bvadd .cse68 .cse135 (bvneg ~last_1_var_1_14~0)) .cse70) (not (bvslt .cse88 (bvmul .cse80 .cse135))) (= .cse80 ((_ sign_extend 16) ((_ extract 15 0) (bvadd .cse68 .cse89 .cse135))))))) .cse14) (or (forall ((~last_1_var_1_14~0 (_ BitVec 32)) (~var_1_3~0 (_ BitVec 8))) (let ((.cse136 ((_ zero_extend 24) ~var_1_3~0))) (let ((.cse137 (bvadd .cse68 .cse136 (bvneg ~last_1_var_1_14~0)))) (or (not (bvslt .cse88 (bvmul .cse80 .cse136))) (not (= .cse80 ((_ sign_extend 16) ((_ extract 15 0) .cse137)))) (not (bvsgt .cse137 .cse70)) (not (bvsgt ~last_1_var_1_14~0 .cse68)))))) .cse31 .cse67)) .cse1))) (or (and (or .cse1 (and (forall ((~var_1_3~0 (_ BitVec 8))) (let ((.cse138 ((_ zero_extend 24) ~var_1_3~0))) (or (not (= .cse80 ((_ sign_extend 16) ((_ extract 15 0) (bvadd .cse68 .cse89 .cse138))))) (forall ((~last_1_var_1_14~0 (_ BitVec 32))) (or (not (bvsgt (bvadd .cse68 .cse138 (bvneg ~last_1_var_1_14~0)) .cse70)) (not (bvsgt ~last_1_var_1_14~0 .cse68)))) (bvslt .cse88 (bvmul .cse80 .cse138))))) (or (forall ((~last_1_var_1_14~0 (_ BitVec 32)) (~var_1_3~0 (_ BitVec 8))) (let ((.cse139 ((_ zero_extend 24) ~var_1_3~0))) (or (not (= .cse80 ((_ sign_extend 16) ((_ extract 15 0) (bvadd .cse68 .cse89 .cse139))))) (not (bvsgt (bvadd .cse68 .cse139 (bvneg ~last_1_var_1_14~0)) .cse70)) (bvslt .cse88 (bvmul .cse80 .cse139))))) .cse31 .cse67) (or (forall ((~var_1_3~0 (_ BitVec 8))) (let ((.cse140 ((_ zero_extend 24) ~var_1_3~0))) (or (not (bvslt .cse88 (bvmul .cse80 .cse140))) (not (= .cse80 ((_ sign_extend 16) ((_ extract 15 0) (bvadd .cse68 .cse89 .cse140)))))))) .cse31 .cse67) (or (forall ((~last_1_var_1_14~0 (_ BitVec 32)) (~var_1_3~0 (_ BitVec 8))) (let ((.cse141 ((_ zero_extend 24) ~var_1_3~0))) (or (bvsgt (bvadd .cse68 .cse141 (bvneg ~last_1_var_1_14~0)) .cse70) (not (bvslt .cse88 (bvmul .cse80 .cse141))) (not (= .cse80 ((_ sign_extend 16) ((_ extract 15 0) (bvadd .cse68 .cse89 .cse141)))))))) .cse31 .cse67) .cse93 (forall ((~var_1_3~0 (_ BitVec 8))) (let ((.cse142 ((_ zero_extend 24) ~var_1_3~0))) (or (not (bvslt .cse88 (bvmul .cse80 .cse142))) (not (= .cse80 ((_ sign_extend 16) ((_ extract 15 0) (bvadd .cse68 .cse89 .cse142))))) (forall ((~last_1_var_1_14~0 (_ BitVec 32))) (or (not (bvsgt (bvadd .cse68 .cse142 (bvneg ~last_1_var_1_14~0)) .cse70)) (not (bvsgt ~last_1_var_1_14~0 .cse68))))))) .cse98 (or (forall ((~last_1_var_1_14~0 (_ BitVec 32)) (~var_1_3~0 (_ BitVec 8))) (let ((.cse144 ((_ zero_extend 24) ~var_1_3~0))) (let ((.cse143 (bvadd .cse68 .cse144 (bvneg ~last_1_var_1_14~0)))) (or (not (= .cse80 ((_ sign_extend 16) ((_ extract 15 0) .cse143)))) (not (= .cse80 ((_ sign_extend 16) ((_ extract 15 0) (bvadd .cse68 .cse89 .cse144))))) (not (bvsgt .cse143 .cse70)) (bvslt .cse88 (bvmul .cse80 .cse144)))))) .cse31 .cse67) (or (forall ((~var_1_3~0 (_ BitVec 8))) (let ((.cse145 ((_ zero_extend 24) ~var_1_3~0))) (or (not (= .cse80 ((_ sign_extend 16) ((_ extract 15 0) (bvadd .cse68 .cse89 .cse145))))) (bvslt .cse88 (bvmul .cse80 .cse145))))) .cse31 .cse67) .cse112)) .cse117) .cse38) (or (and (or .cse146 .cse73) (or .cse41 .cse36 .cse42 .cse2)) .cse38) (or (not .cse40) (and (or .cse38 (and (or .cse41 .cse42 .cse2 (let ((.cse148 (or (forall ((~last_1_var_1_14~0 (_ BitVec 32))) (not (bvsgt ~last_1_var_1_14~0 .cse68))) .cse31 .cse67))) (and (or (let ((.cse147 (and .cse52 .cse148))) (and (or .cse47 .cse147) .cse49 .cse44 .cse45 (or .cse147 .cse50) .cse46)) .cse58) (or .cse59 (and .cse49 .cse60 .cse45 .cse61 .cse62 .cse63 .cse64 .cse52 .cse148))))) .cse71)) (or (and (or (and (or (and (or (and .cse50 .cse31 .cse84) .cse43 .cse72) (or .cse62 .cse31) (or (and .cse49 (or .cse66 .cse31) .cse60 .cse52) .cse54) .cse78 .cse45 .cse61 .cse63 .cse64) .cse59) (or (let ((.cse151 (and (or .cse14 .cse66) .cse52))) (and .cse49 (or .cse43 (and (or .cse53 .cse83) .cse149 .cse45 .cse62)) (or .cse14 .cse43 .cse72) (or (let ((.cse150 (and (or .cse14 .cse62) .cse61 .cse64))) (and (or .cse150 .cse50) .cse45 (or .cse47 .cse150))) .cse54) (or .cse151 .cse47) (or .cse151 .cse50))) .cse58)) .cse41 .cse42 .cse2) .cse71) .cse0))) (or .cse38 (and .cse37 (or .cse1 .cse2 (and .cse152 .cse153 .cse154 .cse155 .cse156 .cse157 .cse11 .cse158 .cse159 .cse160 (or .cse14 .cse161) .cse162 .cse163 .cse164 .cse165 .cse166)))) (or (and (or .cse41 .cse85 .cse42 .cse2) .cse167) .cse0) (or (and (or .cse121 (and (forall ((~var_1_3~0 (_ BitVec 8))) (let ((.cse168 ((_ zero_extend 24) ~var_1_3~0))) (or (not (bvslt .cse88 (bvmul .cse80 .cse168))) (= .cse80 ((_ sign_extend 16) ((_ extract 15 0) (bvadd .cse68 .cse89 .cse168)))) (forall ((~last_1_var_1_14~0 (_ BitVec 32))) (bvsgt (bvadd .cse68 .cse168 (bvneg ~last_1_var_1_14~0)) .cse70))))) (forall ((~var_1_3~0 (_ BitVec 8))) (let ((.cse169 ((_ zero_extend 24) ~var_1_3~0))) (or (= .cse80 ((_ sign_extend 16) ((_ extract 15 0) (bvadd .cse68 .cse89 .cse169)))) (forall ((~last_1_var_1_14~0 (_ BitVec 32))) (bvsgt (bvadd .cse68 .cse169 (bvneg ~last_1_var_1_14~0)) .cse70)) (bvslt .cse88 (bvmul .cse80 .cse169))))) (forall ((~var_1_3~0 (_ BitVec 8))) (let ((.cse170 ((_ zero_extend 24) ~var_1_3~0))) (or (not (bvslt .cse88 (bvmul .cse80 .cse170))) (forall ((~last_1_var_1_14~0 (_ BitVec 32))) (not (bvsgt (bvadd .cse68 .cse170 (bvneg ~last_1_var_1_14~0)) .cse70))) (= .cse80 ((_ sign_extend 16) ((_ extract 15 0) (bvadd .cse68 .cse89 .cse170))))))) (forall ((~var_1_3~0 (_ BitVec 8))) (let ((.cse171 ((_ zero_extend 24) ~var_1_3~0))) (or (forall ((~last_1_var_1_14~0 (_ BitVec 32))) (not (bvsgt (bvadd .cse68 .cse171 (bvneg ~last_1_var_1_14~0)) .cse70))) (= .cse80 ((_ sign_extend 16) ((_ extract 15 0) (bvadd .cse68 .cse89 .cse171)))) (bvslt .cse88 (bvmul .cse80 .cse171))))))) (or .cse1 (and (or .cse14 (forall ((~last_1_var_1_14~0 (_ BitVec 32)) (~var_1_3~0 (_ BitVec 8))) (let ((.cse172 ((_ zero_extend 24) ~var_1_3~0))) (or (bvsgt (bvadd .cse68 .cse172 (bvneg ~last_1_var_1_14~0)) .cse70) (not (bvslt .cse88 (bvmul .cse80 .cse172))) (not (bvsgt (bvadd .cse68 .cse89 .cse172) .cse70)) (bvsgt ~last_1_var_1_14~0 .cse68))))) (or (forall ((~last_1_var_1_14~0 (_ BitVec 32)) (~var_1_3~0 (_ BitVec 8))) (let ((.cse173 ((_ zero_extend 24) ~var_1_3~0))) (or (bvsgt (bvadd .cse68 .cse173 (bvneg ~last_1_var_1_14~0)) .cse70) (not (bvslt .cse88 (bvmul .cse80 .cse173))) (not (bvsgt (bvadd .cse68 .cse89 .cse173) .cse70)) (not (bvsgt ~last_1_var_1_14~0 .cse68))))) .cse31 .cse67) (or .cse14 (forall ((~last_1_var_1_14~0 (_ BitVec 32)) (~var_1_3~0 (_ BitVec 8))) (let ((.cse174 ((_ zero_extend 24) ~var_1_3~0))) (or (not (bvsgt (bvadd .cse68 .cse89 .cse174) .cse70)) (not (bvsgt (bvadd .cse68 .cse174 (bvneg ~last_1_var_1_14~0)) .cse70)) (bvslt .cse88 (bvmul .cse80 .cse174)))))) (or (forall ((~last_1_var_1_14~0 (_ BitVec 32)) (~var_1_3~0 (_ BitVec 8))) (let ((.cse176 ((_ zero_extend 24) ~var_1_3~0))) (let ((.cse175 (bvadd .cse68 .cse89 .cse176))) (or (bvsgt .cse175 .cse70) (= .cse80 ((_ sign_extend 16) ((_ extract 15 0) .cse175))) (not (bvsgt (bvadd .cse68 .cse176 (bvneg ~last_1_var_1_14~0)) .cse70)) (bvslt .cse88 (bvmul .cse80 .cse176)))))) .cse31 .cse67) .cse124 (or (forall ((~last_1_var_1_14~0 (_ BitVec 32)) (~var_1_3~0 (_ BitVec 8))) (let ((.cse177 ((_ zero_extend 24) ~var_1_3~0))) (let ((.cse178 (bvadd .cse68 .cse89 .cse177))) (or (bvsgt (bvadd .cse68 .cse177 (bvneg ~last_1_var_1_14~0)) .cse70) (bvsgt .cse178 .cse70) (= .cse80 ((_ sign_extend 16) ((_ extract 15 0) .cse178))) (not (bvsgt ~last_1_var_1_14~0 .cse68)) (bvslt .cse88 (bvmul .cse80 .cse177)))))) .cse31 .cse67) (or .cse131 .cse31 .cse67) (or (forall ((~last_1_var_1_14~0 (_ BitVec 32)) (~var_1_3~0 (_ BitVec 8))) (let ((.cse179 ((_ zero_extend 24) ~var_1_3~0))) (let ((.cse180 (bvadd .cse68 .cse89 .cse179))) (or (bvsgt (bvadd .cse68 .cse179 (bvneg ~last_1_var_1_14~0)) .cse70) (not (bvslt .cse88 (bvmul .cse80 .cse179))) (bvsgt .cse180 .cse70) (= .cse80 ((_ sign_extend 16) ((_ extract 15 0) .cse180))) (not (bvsgt ~last_1_var_1_14~0 .cse68)))))) .cse31 .cse67) (or (forall ((~last_1_var_1_14~0 (_ BitVec 32)) (~var_1_3~0 (_ BitVec 8))) (let ((.cse181 ((_ zero_extend 24) ~var_1_3~0))) (or (bvsgt (bvadd .cse68 .cse181 (bvneg ~last_1_var_1_14~0)) .cse70) (not (bvsgt (bvadd .cse68 .cse89 .cse181) .cse70)) (not (bvsgt ~last_1_var_1_14~0 .cse68)) (bvslt .cse88 (bvmul .cse80 .cse181))))) .cse31 .cse67) (or .cse14 (forall ((~last_1_var_1_14~0 (_ BitVec 32)) (~var_1_3~0 (_ BitVec 8))) (let ((.cse182 ((_ zero_extend 24) ~var_1_3~0))) (or (not (bvslt .cse88 (bvmul .cse80 .cse182))) (not (bvsgt (bvadd .cse68 .cse89 .cse182) .cse70)) (not (bvsgt (bvadd .cse68 .cse182 (bvneg ~last_1_var_1_14~0)) .cse70)))))) (or (forall ((~last_1_var_1_14~0 (_ BitVec 32)) (~var_1_3~0 (_ BitVec 8))) (let ((.cse183 ((_ zero_extend 24) ~var_1_3~0))) (let ((.cse184 (bvadd .cse68 .cse89 .cse183))) (or (bvsgt (bvadd .cse68 .cse183 (bvneg ~last_1_var_1_14~0)) .cse70) (bvsgt .cse184 .cse70) (= .cse80 ((_ sign_extend 16) ((_ extract 15 0) .cse184))) (bvslt .cse88 (bvmul .cse80 .cse183)))))) .cse31 .cse67) (or (forall ((~last_1_var_1_14~0 (_ BitVec 32)) (~var_1_3~0 (_ BitVec 8))) (let ((.cse185 ((_ zero_extend 24) ~var_1_3~0))) (or (bvsgt (bvadd .cse68 .cse185 (bvneg ~last_1_var_1_14~0)) .cse70) (not (bvsgt (bvadd .cse68 .cse89 .cse185) .cse70)) (bvslt .cse88 (bvmul .cse80 .cse185)) (bvsgt ~last_1_var_1_14~0 .cse68)))) .cse14) (or (forall ((~last_1_var_1_14~0 (_ BitVec 32)) (~var_1_3~0 (_ BitVec 8))) (let ((.cse186 ((_ zero_extend 24) ~var_1_3~0))) (let ((.cse187 (bvadd .cse68 .cse89 .cse186)) (.cse188 (bvadd .cse68 .cse186 (bvneg ~last_1_var_1_14~0)))) (or (not (bvslt .cse88 (bvmul .cse80 .cse186))) (bvsgt .cse187 .cse70) (not (= .cse80 ((_ sign_extend 16) ((_ extract 15 0) .cse188)))) (= .cse80 ((_ sign_extend 16) ((_ extract 15 0) .cse187))) (not (bvsgt .cse188 .cse70)))))) .cse31 .cse67) (or (forall ((~last_1_var_1_14~0 (_ BitVec 32)) (~var_1_3~0 (_ BitVec 8))) (let ((.cse191 ((_ zero_extend 24) ~var_1_3~0))) (let ((.cse189 (bvadd .cse68 .cse89 .cse191)) (.cse190 (bvadd .cse68 .cse191 (bvneg ~last_1_var_1_14~0)))) (or (bvsgt .cse189 .cse70) (not (= .cse80 ((_ sign_extend 16) ((_ extract 15 0) .cse190)))) (= .cse80 ((_ sign_extend 16) ((_ extract 15 0) .cse189))) (not (bvsgt .cse190 .cse70)) (bvslt .cse88 (bvmul .cse80 .cse191)))))) .cse31 .cse67) (or (forall ((~last_1_var_1_14~0 (_ BitVec 32)) (~var_1_3~0 (_ BitVec 8))) (let ((.cse192 ((_ zero_extend 24) ~var_1_3~0))) (let ((.cse193 (bvadd .cse68 .cse89 .cse192))) (or (bvsgt (bvadd .cse68 .cse192 (bvneg ~last_1_var_1_14~0)) .cse70) (not (bvslt .cse88 (bvmul .cse80 .cse192))) (bvsgt .cse193 .cse70) (= .cse80 ((_ sign_extend 16) ((_ extract 15 0) .cse193))))))) .cse31 .cse67) (forall ((~var_1_3~0 (_ BitVec 8))) (let ((.cse195 ((_ zero_extend 24) ~var_1_3~0))) (let ((.cse194 (bvadd .cse68 .cse89 .cse195))) (or (bvsgt .cse194 .cse70) (= .cse80 ((_ sign_extend 16) ((_ extract 15 0) .cse194))) (forall ((~last_1_var_1_14~0 (_ BitVec 32))) (or (not (bvsgt (bvadd .cse68 .cse195 (bvneg ~last_1_var_1_14~0)) .cse70)) (not (bvsgt ~last_1_var_1_14~0 .cse68)))) (bvslt .cse88 (bvmul .cse80 .cse195))))))))) .cse38) (or (and (or .cse41 .cse39 .cse42 .cse2) .cse167) .cse38) (or .cse0 (and (or .cse73 .cse196) (or .cse41 .cse42 .cse2 .cse3))) (or .cse38 (and .cse17 (or (and .cse19 .cse197 .cse198 .cse199 .cse23 .cse200 .cse201 .cse202 .cse203 .cse35) .cse1 .cse2)))))))))) is different from true [2023-12-23 19:33:18,110 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.85s for a HTC check with result INVALID. Formula has sorts [Bool, FloatingPoint, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2023-12-23 19:33:22,264 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.15s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2023-12-23 19:33:27,493 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2023-12-23 19:33:31,635 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.14s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2023-12-23 19:34:22,288 WARN L293 SmtUtils]: Spent 32.74s on a formula simplification that was a NOOP. DAG size: 421 (called from [L 391] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-12-23 19:34:25,270 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.64s for a HTC check with result INVALID. Formula has sorts [Bool, FloatingPoint, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2023-12-23 19:34:26,496 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.22s for a HTC check with result INVALID. Formula has sorts [Bool, FloatingPoint, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2023-12-23 19:34:30,287 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 3.30s for a HTC check with result INVALID. Formula has sorts [Bool, FloatingPoint, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2023-12-23 19:34:34,513 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.20s for a HTC check with result INVALID. Formula has sorts [Bool, FloatingPoint, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2023-12-23 19:34:36,670 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.41s for a HTC check with result INVALID. Formula has sorts [Bool, FloatingPoint, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2023-12-23 19:34:40,291 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.05s for a HTC check with result INVALID. Formula has sorts [Bool, FloatingPoint, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2023-12-23 19:34:42,317 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.60s for a HTC check with result INVALID. Formula has sorts [Bool, FloatingPoint, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2023-12-23 19:34:43,516 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.20s for a HTC check with result INVALID. Formula has sorts [Bool, FloatingPoint, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2023-12-23 19:34:45,089 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.08s for a HTC check with result INVALID. Formula has sorts [Bool, FloatingPoint, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2023-12-23 19:34:46,094 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.00s for a HTC check with result INVALID. Formula has sorts [Bool, FloatingPoint, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2023-12-23 19:34:47,300 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.21s for a HTC check with result INVALID. Formula has sorts [Bool, FloatingPoint, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2023-12-23 19:34:49,378 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.32s for a HTC check with result INVALID. Formula has sorts [Bool, FloatingPoint, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2023-12-23 19:34:50,648 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.27s for a HTC check with result INVALID. Formula has sorts [Bool, FloatingPoint, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2023-12-23 19:34:52,155 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.51s for a HTC check with result INVALID. Formula has sorts [Bool, FloatingPoint, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2023-12-23 19:34:54,201 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.19s for a HTC check with result INVALID. Formula has sorts [Bool, FloatingPoint, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2023-12-23 19:34:55,550 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.20s for a HTC check with result INVALID. Formula has sorts [Bool, FloatingPoint, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2023-12-23 19:34:56,715 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.16s for a HTC check with result INVALID. Formula has sorts [Bool, FloatingPoint, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2023-12-23 19:35:03,592 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.06s for a HTC check with result INVALID. Formula has sorts [Bool, FloatingPoint, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2023-12-23 19:35:06,044 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.25s for a HTC check with result INVALID. Formula has sorts [Bool, FloatingPoint, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2023-12-23 19:35:08,712 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.67s for a HTC check with result INVALID. Formula has sorts [Bool, FloatingPoint, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2023-12-23 19:35:11,246 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.98s for a HTC check with result VALID. Formula has sorts [Bool, FloatingPoint, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2023-12-23 19:35:15,315 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.06s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2023-12-23 19:35:15,680 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-23 19:35:15,680 INFO L93 Difference]: Finished difference Result 131 states and 159 transitions. [2023-12-23 19:35:15,696 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2023-12-23 19:35:15,696 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 2.5454545454545454) internal successors, (28), 11 states have internal predecessors, (28), 1 states have call successors, (5), 1 states have call predecessors, (5), 2 states have return successors, (6), 2 states have call predecessors, (6), 1 states have call successors, (6) Word has length 75 [2023-12-23 19:35:15,697 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-23 19:35:15,698 INFO L225 Difference]: With dead ends: 131 [2023-12-23 19:35:15,698 INFO L226 Difference]: Without dead ends: 129 [2023-12-23 19:35:15,698 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 157 GetRequests, 132 SyntacticMatches, 0 SemanticMatches, 25 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 144 ImplicationChecksByTransitivity, 461.2s TimeCoverageRelationStatistics Valid=142, Invalid=482, Unknown=30, NotChecked=48, Total=702 [2023-12-23 19:35:15,699 INFO L413 NwaCegarLoop]: 26 mSDtfsCounter, 106 mSDsluCounter, 80 mSDsCounter, 0 mSdLazyCounter, 153 mSolverCounterSat, 27 mSolverCounterUnsat, 5 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 123.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 106 SdHoareTripleChecker+Valid, 106 SdHoareTripleChecker+Invalid, 194 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 27 IncrementalHoareTripleChecker+Valid, 153 IncrementalHoareTripleChecker+Invalid, 5 IncrementalHoareTripleChecker+Unknown, 9 IncrementalHoareTripleChecker+Unchecked, 133.7s IncrementalHoareTripleChecker+Time [2023-12-23 19:35:15,699 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [106 Valid, 106 Invalid, 194 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [27 Valid, 153 Invalid, 5 Unknown, 9 Unchecked, 133.7s Time] [2023-12-23 19:35:15,699 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 129 states. [2023-12-23 19:35:15,730 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 129 to 111. [2023-12-23 19:35:15,732 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 111 states, 79 states have (on average 1.1265822784810127) internal successors, (89), 80 states have internal predecessors, (89), 24 states have call successors, (24), 7 states have call predecessors, (24), 7 states have return successors, (24), 23 states have call predecessors, (24), 24 states have call successors, (24) [2023-12-23 19:35:15,736 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 111 states to 111 states and 137 transitions. [2023-12-23 19:35:15,736 INFO L78 Accepts]: Start accepts. Automaton has 111 states and 137 transitions. Word has length 75 [2023-12-23 19:35:15,736 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-23 19:35:15,737 INFO L495 AbstractCegarLoop]: Abstraction has 111 states and 137 transitions. [2023-12-23 19:35:15,737 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 2.5454545454545454) internal successors, (28), 11 states have internal predecessors, (28), 1 states have call successors, (5), 1 states have call predecessors, (5), 2 states have return successors, (6), 2 states have call predecessors, (6), 1 states have call successors, (6) [2023-12-23 19:35:15,737 INFO L276 IsEmpty]: Start isEmpty. Operand 111 states and 137 transitions. [2023-12-23 19:35:15,738 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 76 [2023-12-23 19:35:15,738 INFO L187 NwaCegarLoop]: Found error trace [2023-12-23 19:35:15,738 INFO L195 NwaCegarLoop]: trace histogram [10, 10, 10, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1] [2023-12-23 19:35:15,745 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (7)] Forceful destruction successful, exit code 0 [2023-12-23 19:35:15,942 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-23 19:35:15,943 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-23 19:35:15,944 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-23 19:35:15,944 INFO L85 PathProgramCache]: Analyzing trace with hash 20908512, now seen corresponding path program 1 times [2023-12-23 19:35:15,946 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-23 19:35:15,946 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1550086639] [2023-12-23 19:35:15,946 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-23 19:35:15,946 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-23 19:35:15,946 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-23 19:35:15,950 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-12-23 19:35:15,955 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (8)] Waiting until timeout for monitored process [2023-12-23 19:35:16,039 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-23 19:35:16,043 INFO L262 TraceCheckSpWp]: Trace formula consists of 142 conjuncts, 21 conjunts are in the unsatisfiable core [2023-12-23 19:35:16,046 INFO L285 TraceCheckSpWp]: Computing forward predicates... Received shutdown request... [2023-12-23 19:36:01,532 WARN L340 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (8)] Timeout while monitored process is still running, waiting 1000 ms for graceful end [2023-12-23 19:36:01,541 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2023-12-23 19:36:01,547 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (8)] Ended with exit code 0 [2023-12-23 19:36:01,556 WARN L340 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Timeout while monitored process is still running, waiting 1000 ms for graceful end [2023-12-23 19:36:01,742 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-23 19:36:01,742 WARN L619 AbstractCegarLoop]: Verification canceled: while NwaCegarLoop was analyzing trace of length 76 with TraceHistMax 10,while TraceCheckSpWp was constructing forward predicates,while PredicateComparison was comparing new predicate (quantifier-free) to 14 known predicates. [2023-12-23 19:36:01,746 INFO L445 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1] [2023-12-23 19:36:01,748 INFO L179 ceAbstractionStarter]: Computing trace abstraction results [2023-12-23 19:36:01,750 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 23.12 07:36:01 BoogieIcfgContainer [2023-12-23 19:36:01,750 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2023-12-23 19:36:01,750 INFO L158 Benchmark]: Toolchain (without parser) took 881354.18ms. Allocated memory was 197.1MB in the beginning and 1.2GB in the end (delta: 969.9MB). Free memory was 142.5MB in the beginning and 820.8MB in the end (delta: -678.3MB). Peak memory consumption was 292.6MB. Max. memory is 8.0GB. [2023-12-23 19:36:01,750 INFO L158 Benchmark]: CDTParser took 0.11ms. Allocated memory is still 197.1MB. Free memory is still 146.3MB. There was no memory consumed. Max. memory is 8.0GB. [2023-12-23 19:36:01,750 INFO L158 Benchmark]: CACSL2BoogieTranslator took 281.66ms. Allocated memory is still 197.1MB. Free memory was 142.4MB in the beginning and 129.4MB in the end (delta: 12.9MB). Peak memory consumption was 13.6MB. Max. memory is 8.0GB. [2023-12-23 19:36:01,751 INFO L158 Benchmark]: Boogie Procedure Inliner took 31.94ms. Allocated memory is still 197.1MB. Free memory was 129.4MB in the beginning and 127.4MB in the end (delta: 2.0MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. [2023-12-23 19:36:01,751 INFO L158 Benchmark]: Boogie Preprocessor took 34.66ms. Allocated memory is still 197.1MB. Free memory was 127.4MB in the beginning and 124.7MB in the end (delta: 2.7MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. [2023-12-23 19:36:01,751 INFO L158 Benchmark]: RCFGBuilder took 490.85ms. Allocated memory is still 197.1MB. Free memory was 124.7MB in the beginning and 157.6MB in the end (delta: -32.9MB). Peak memory consumption was 12.5MB. Max. memory is 8.0GB. [2023-12-23 19:36:01,751 INFO L158 Benchmark]: TraceAbstraction took 880508.89ms. Allocated memory was 197.1MB in the beginning and 1.2GB in the end (delta: 969.9MB). Free memory was 156.5MB in the beginning and 820.8MB in the end (delta: -664.2MB). Peak memory consumption was 305.2MB. Max. memory is 8.0GB. [2023-12-23 19:36:01,752 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.11ms. Allocated memory is still 197.1MB. Free memory is still 146.3MB. There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 281.66ms. Allocated memory is still 197.1MB. Free memory was 142.4MB in the beginning and 129.4MB in the end (delta: 12.9MB). Peak memory consumption was 13.6MB. Max. memory is 8.0GB. * Boogie Procedure Inliner took 31.94ms. Allocated memory is still 197.1MB. Free memory was 129.4MB in the beginning and 127.4MB in the end (delta: 2.0MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. * Boogie Preprocessor took 34.66ms. Allocated memory is still 197.1MB. Free memory was 127.4MB in the beginning and 124.7MB in the end (delta: 2.7MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. * RCFGBuilder took 490.85ms. Allocated memory is still 197.1MB. Free memory was 124.7MB in the beginning and 157.6MB in the end (delta: -32.9MB). Peak memory consumption was 12.5MB. Max. memory is 8.0GB. * TraceAbstraction took 880508.89ms. Allocated memory was 197.1MB in the beginning and 1.2GB in the end (delta: 969.9MB). Free memory was 156.5MB in the beginning and 820.8MB in the end (delta: -664.2MB). Peak memory consumption was 305.2MB. Max. memory is 8.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - TimeoutResultAtElement [Line: 19]: Timeout (TraceAbstraction) Unable to prove that a call to reach_error is unreachable (line 19). Cancelled while NwaCegarLoop was analyzing trace of length 76 with TraceHistMax 10,while TraceCheckSpWp was constructing forward predicates,while PredicateComparison was comparing new predicate (quantifier-free) to 14 known predicates. - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 28 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 880.5s, OverallIterations: 7, TraceHistogramMax: 10, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 373.1s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 5 mSolverCounterUnknown, 400 SdHoareTripleChecker+Valid, 134.8s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 400 mSDsluCounter, 664 SdHoareTripleChecker+Invalid, 124.9s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 9 IncrementalHoareTripleChecker+Unchecked, 511 mSDsCounter, 150 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 723 IncrementalHoareTripleChecker+Invalid, 887 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 150 mSolverCounterUnsat, 153 mSDtfsCounter, 723 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 417 GetRequests, 322 SyntacticMatches, 0 SemanticMatches, 95 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 415 ImplicationChecksByTransitivity, 462.9s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=111occurred in iteration=6, InterpolantAutomatonStates: 64, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.1s AutomataMinimizationTime, 6 MinimizatonAttempts, 77 StatesRemovedByMinimization, 5 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.3s SatisfiabilityAnalysisTime, 459.6s InterpolantComputationTime, 302 NumberOfCodeBlocks, 302 NumberOfCodeBlocksAsserted, 6 NumberOfCheckSat, 370 ConstructedInterpolants, 5 QuantifiedInterpolants, 23925 SizeOfPredicates, 77 NumberOfNonLiveVariables, 622 ConjunctsInSsa, 71 ConjunctsInUnsatCore, 7 InterpolantComputations, 6 PerfectInterpolantSequences, 740/748 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate could not prove your program: Timeout Completed graceful shutdown