/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_Default.epf --cacsl2boogietranslator.use.bitabs.translation true -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml -i ../../../trunk/examples/svcomp/hardness-nfm22/hardness_loopvsstraightlinecode_100-while_file-26.i -------------------------------------------------------------------------------- This is Ultimate 0.2.4-tmp.fs.bitabs-eval-d9c3e40-m [2023-12-19 11:26:59,867 INFO L188 SettingsManager]: Resetting all preferences to default values... [2023-12-19 11:26:59,917 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf [2023-12-19 11:26:59,920 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2023-12-19 11:26:59,920 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2023-12-19 11:26:59,946 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2023-12-19 11:26:59,947 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-12-19 11:26:59,947 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-12-19 11:26:59,948 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2023-12-19 11:26:59,951 INFO L153 SettingsManager]: * Use memory slicer=true [2023-12-19 11:26:59,952 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-12-19 11:26:59,952 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-12-19 11:26:59,952 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-12-19 11:26:59,952 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2023-12-19 11:26:59,953 INFO L153 SettingsManager]: * Use SBE=true [2023-12-19 11:26:59,953 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-12-19 11:26:59,953 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2023-12-19 11:26:59,953 INFO L153 SettingsManager]: * sizeof long=4 [2023-12-19 11:26:59,953 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2023-12-19 11:26:59,953 INFO L153 SettingsManager]: * sizeof POINTER=4 [2023-12-19 11:26:59,954 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2023-12-19 11:26:59,955 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2023-12-19 11:26:59,955 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-12-19 11:26:59,956 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2023-12-19 11:26:59,956 INFO L153 SettingsManager]: * Allow undefined functions=false [2023-12-19 11:26:59,956 INFO L153 SettingsManager]: * sizeof long double=12 [2023-12-19 11:26:59,956 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2023-12-19 11:26:59,956 INFO L153 SettingsManager]: * Use constant arrays=true [2023-12-19 11:26:59,956 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-12-19 11:26:59,957 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-12-19 11:26:59,957 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2023-12-19 11:26:59,957 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2023-12-19 11:26:59,958 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2023-12-19 11:26:59,958 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-12-19 11:26:59,958 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-12-19 11:26:59,958 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2023-12-19 11:26:59,958 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2023-12-19 11:26:59,958 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2023-12-19 11:26:59,958 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2023-12-19 11:26:59,958 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-12-19 11:26:59,958 INFO L153 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2023-12-19 11:26:59,959 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2023-12-19 11:26:59,959 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-12-19 11:26:59,959 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 Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Use bitabs translation -> true [2023-12-19 11:27:00,132 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-12-19 11:27:00,149 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-12-19 11:27:00,151 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-12-19 11:27:00,152 INFO L270 PluginConnector]: Initializing CDTParser... [2023-12-19 11:27:00,152 INFO L274 PluginConnector]: CDTParser initialized [2023-12-19 11:27:00,153 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/hardness-nfm22/hardness_loopvsstraightlinecode_100-while_file-26.i [2023-12-19 11:27:01,156 INFO L533 CDTParser]: Created temporary CDT project at NULL [2023-12-19 11:27:01,326 INFO L384 CDTParser]: Found 1 translation units. [2023-12-19 11:27:01,326 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/hardness-nfm22/hardness_loopvsstraightlinecode_100-while_file-26.i [2023-12-19 11:27:01,332 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/a88815422/8e31f9f5855c42a5a562679b4a856766/FLAG77edd069b [2023-12-19 11:27:01,351 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/a88815422/8e31f9f5855c42a5a562679b4a856766 [2023-12-19 11:27:01,353 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-12-19 11:27:01,354 INFO L133 ToolchainWalker]: Walking toolchain with 5 elements. [2023-12-19 11:27:01,354 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-12-19 11:27:01,355 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-12-19 11:27:01,359 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2023-12-19 11:27:01,359 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 19.12 11:27:01" (1/1) ... [2023-12-19 11:27:01,360 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@1b82c7b4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.12 11:27:01, skipping insertion in model container [2023-12-19 11:27:01,360 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 19.12 11:27:01" (1/1) ... [2023-12-19 11:27:01,386 INFO L177 MainTranslator]: Built tables and reachable declarations [2023-12-19 11:27:01,482 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_loopvsstraightlinecode_100-while_file-26.i[916,929] [2023-12-19 11:27:01,542 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-12-19 11:27:01,554 INFO L202 MainTranslator]: Completed pre-run [2023-12-19 11:27:01,564 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_loopvsstraightlinecode_100-while_file-26.i[916,929] [2023-12-19 11:27:01,618 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-12-19 11:27:01,631 INFO L206 MainTranslator]: Completed translation [2023-12-19 11:27:01,631 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.12 11:27:01 WrapperNode [2023-12-19 11:27:01,631 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-12-19 11:27:01,632 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-12-19 11:27:01,632 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-12-19 11:27:01,632 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2023-12-19 11:27:01,638 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.12 11:27:01" (1/1) ... [2023-12-19 11:27:01,649 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.12 11:27:01" (1/1) ... [2023-12-19 11:27:01,694 INFO L138 Inliner]: procedures = 26, calls = 43, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 232 [2023-12-19 11:27:01,695 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-12-19 11:27:01,696 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-12-19 11:27:01,696 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2023-12-19 11:27:01,696 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2023-12-19 11:27:01,704 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.12 11:27:01" (1/1) ... [2023-12-19 11:27:01,704 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.12 11:27:01" (1/1) ... [2023-12-19 11:27:01,708 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.12 11:27:01" (1/1) ... [2023-12-19 11:27:01,724 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-19 11:27:01,725 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.12 11:27:01" (1/1) ... [2023-12-19 11:27:01,725 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.12 11:27:01" (1/1) ... [2023-12-19 11:27:01,733 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.12 11:27:01" (1/1) ... [2023-12-19 11:27:01,747 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.12 11:27:01" (1/1) ... [2023-12-19 11:27:01,749 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.12 11:27:01" (1/1) ... [2023-12-19 11:27:01,751 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.12 11:27:01" (1/1) ... [2023-12-19 11:27:01,756 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-12-19 11:27:01,757 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-12-19 11:27:01,757 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2023-12-19 11:27:01,757 INFO L274 PluginConnector]: RCFGBuilder initialized [2023-12-19 11:27:01,758 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.12 11:27:01" (1/1) ... [2023-12-19 11:27:01,768 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2023-12-19 11:27:01,776 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-12-19 11:27:01,796 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-19 11:27:01,809 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-19 11:27:01,819 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-12-19 11:27:01,819 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2023-12-19 11:27:01,819 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2023-12-19 11:27:01,819 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2023-12-19 11:27:01,820 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-12-19 11:27:01,820 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-12-19 11:27:01,900 INFO L241 CfgBuilder]: Building ICFG [2023-12-19 11:27:01,904 INFO L267 CfgBuilder]: Building CFG for each procedure with an implementation [2023-12-19 11:27:02,383 INFO L282 CfgBuilder]: Performing block encoding [2023-12-19 11:27:02,410 INFO L304 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-12-19 11:27:02,410 INFO L309 CfgBuilder]: Removed 1 assume(true) statements. [2023-12-19 11:27:02,410 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.12 11:27:02 BoogieIcfgContainer [2023-12-19 11:27:02,410 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-12-19 11:27:02,413 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-12-19 11:27:02,413 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2023-12-19 11:27:02,415 INFO L274 PluginConnector]: TraceAbstraction initialized [2023-12-19 11:27:02,415 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 19.12 11:27:01" (1/3) ... [2023-12-19 11:27:02,416 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@66d00e5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 19.12 11:27:02, skipping insertion in model container [2023-12-19 11:27:02,416 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.12 11:27:01" (2/3) ... [2023-12-19 11:27:02,416 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@66d00e5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 19.12 11:27:02, skipping insertion in model container [2023-12-19 11:27:02,416 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.12 11:27:02" (3/3) ... [2023-12-19 11:27:02,417 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_loopvsstraightlinecode_100-while_file-26.i [2023-12-19 11:27:02,430 INFO L204 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-12-19 11:27:02,430 INFO L163 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2023-12-19 11:27:02,471 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-12-19 11:27:02,477 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;@5f13fdff, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2023-12-19 11:27:02,477 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2023-12-19 11:27:02,481 INFO L276 IsEmpty]: Start isEmpty. Operand has 94 states, 61 states have (on average 1.4918032786885247) internal successors, (91), 62 states have internal predecessors, (91), 30 states have call successors, (30), 1 states have call predecessors, (30), 1 states have return successors, (30), 30 states have call predecessors, (30), 30 states have call successors, (30) [2023-12-19 11:27:02,510 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 194 [2023-12-19 11:27:02,510 INFO L187 NwaCegarLoop]: Found error trace [2023-12-19 11:27:02,511 INFO L195 NwaCegarLoop]: trace histogram [30, 30, 30, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-19 11:27:02,512 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-19 11:27:02,529 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-19 11:27:02,530 INFO L85 PathProgramCache]: Analyzing trace with hash 228631936, now seen corresponding path program 1 times [2023-12-19 11:27:02,536 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-19 11:27:02,536 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [37763192] [2023-12-19 11:27:02,536 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-19 11:27:02,536 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-19 11:27:02,670 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 11:27:02,780 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-19 11:27:02,781 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [37763192] [2023-12-19 11:27:02,781 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: Unsupported non-linear arithmetic [2023-12-19 11:27:02,781 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [209974039] [2023-12-19 11:27:02,782 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-19 11:27:02,782 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-19 11:27:02,782 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-12-19 11:27:02,785 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-12-19 11:27:02,791 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2023-12-19 11:27:02,938 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 11:27:02,942 INFO L262 TraceCheckSpWp]: Trace formula consists of 467 conjuncts, 1 conjunts are in the unsatisfiable core [2023-12-19 11:27:02,953 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-19 11:27:02,996 INFO L134 CoverageAnalysis]: Checked inductivity of 1740 backedges. 58 proven. 0 refuted. 0 times theorem prover too weak. 1682 trivial. 0 not checked. [2023-12-19 11:27:02,997 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-19 11:27:02,997 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [209974039] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-19 11:27:02,997 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-19 11:27:02,997 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-12-19 11:27:02,999 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1572276098] [2023-12-19 11:27:02,999 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-19 11:27:03,010 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2023-12-19 11:27:03,011 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-19 11:27:03,035 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2023-12-19 11:27:03,036 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2023-12-19 11:27:03,038 INFO L87 Difference]: Start difference. First operand has 94 states, 61 states have (on average 1.4918032786885247) internal successors, (91), 62 states have internal predecessors, (91), 30 states have call successors, (30), 1 states have call predecessors, (30), 1 states have return successors, (30), 30 states have call predecessors, (30), 30 states have call successors, (30) Second operand has 2 states, 2 states have (on average 24.0) internal successors, (48), 2 states have internal predecessors, (48), 2 states have call successors, (30), 2 states have call predecessors, (30), 1 states have return successors, (30), 1 states have call predecessors, (30), 2 states have call successors, (30) [2023-12-19 11:27:03,078 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-19 11:27:03,078 INFO L93 Difference]: Finished difference Result 185 states and 330 transitions. [2023-12-19 11:27:03,079 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-12-19 11:27:03,080 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 24.0) internal successors, (48), 2 states have internal predecessors, (48), 2 states have call successors, (30), 2 states have call predecessors, (30), 1 states have return successors, (30), 1 states have call predecessors, (30), 2 states have call successors, (30) Word has length 193 [2023-12-19 11:27:03,080 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-19 11:27:03,087 INFO L225 Difference]: With dead ends: 185 [2023-12-19 11:27:03,087 INFO L226 Difference]: Without dead ends: 92 [2023-12-19 11:27:03,092 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 192 GetRequests, 192 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-19 11:27:03,095 INFO L413 NwaCegarLoop]: 143 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, 143 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-19 11:27:03,096 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 143 Invalid, 3 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 3 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-12-19 11:27:03,108 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 92 states. [2023-12-19 11:27:03,136 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 92 to 92. [2023-12-19 11:27:03,137 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 92 states, 60 states have (on average 1.4333333333333333) internal successors, (86), 60 states have internal predecessors, (86), 30 states have call successors, (30), 1 states have call predecessors, (30), 1 states have return successors, (30), 30 states have call predecessors, (30), 30 states have call successors, (30) [2023-12-19 11:27:03,139 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 92 states to 92 states and 146 transitions. [2023-12-19 11:27:03,139 INFO L78 Accepts]: Start accepts. Automaton has 92 states and 146 transitions. Word has length 193 [2023-12-19 11:27:03,140 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-19 11:27:03,140 INFO L495 AbstractCegarLoop]: Abstraction has 92 states and 146 transitions. [2023-12-19 11:27:03,140 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 24.0) internal successors, (48), 2 states have internal predecessors, (48), 2 states have call successors, (30), 2 states have call predecessors, (30), 1 states have return successors, (30), 1 states have call predecessors, (30), 2 states have call successors, (30) [2023-12-19 11:27:03,140 INFO L276 IsEmpty]: Start isEmpty. Operand 92 states and 146 transitions. [2023-12-19 11:27:03,142 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 194 [2023-12-19 11:27:03,143 INFO L187 NwaCegarLoop]: Found error trace [2023-12-19 11:27:03,143 INFO L195 NwaCegarLoop]: trace histogram [30, 30, 30, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-19 11:27:03,151 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2023-12-19 11:27:03,351 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable0 [2023-12-19 11:27:03,353 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-19 11:27:03,353 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-19 11:27:03,354 INFO L85 PathProgramCache]: Analyzing trace with hash -728940540, now seen corresponding path program 1 times [2023-12-19 11:27:03,354 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-19 11:27:03,354 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [579501040] [2023-12-19 11:27:03,354 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-19 11:27:03,354 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-19 11:27:03,430 ERROR L246 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2023-12-19 11:27:03,430 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1822130948] [2023-12-19 11:27:03,430 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-19 11:27:03,431 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-19 11:27:03,431 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-12-19 11:27:03,441 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-12-19 11:27:03,472 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2023-12-19 11:27:03,594 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 11:27:03,596 INFO L262 TraceCheckSpWp]: Trace formula consists of 467 conjuncts, 4 conjunts are in the unsatisfiable core [2023-12-19 11:27:03,617 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-19 11:27:03,687 INFO L134 CoverageAnalysis]: Checked inductivity of 1740 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1740 trivial. 0 not checked. [2023-12-19 11:27:03,687 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-19 11:27:03,687 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-19 11:27:03,687 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [579501040] [2023-12-19 11:27:03,687 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2023-12-19 11:27:03,687 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1822130948] [2023-12-19 11:27:03,687 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1822130948] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-19 11:27:03,688 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-19 11:27:03,688 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-12-19 11:27:03,688 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1333550174] [2023-12-19 11:27:03,688 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-19 11:27:03,690 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-12-19 11:27:03,690 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-19 11:27:03,691 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-12-19 11:27:03,692 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2023-12-19 11:27:03,692 INFO L87 Difference]: Start difference. First operand 92 states and 146 transitions. Second operand has 4 states, 4 states have (on average 11.5) internal successors, (46), 4 states have internal predecessors, (46), 1 states have call successors, (30), 1 states have call predecessors, (30), 1 states have return successors, (30), 1 states have call predecessors, (30), 1 states have call successors, (30) [2023-12-19 11:27:03,877 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-19 11:27:03,877 INFO L93 Difference]: Finished difference Result 269 states and 427 transitions. [2023-12-19 11:27:03,881 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-12-19 11:27:03,882 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 11.5) internal successors, (46), 4 states have internal predecessors, (46), 1 states have call successors, (30), 1 states have call predecessors, (30), 1 states have return successors, (30), 1 states have call predecessors, (30), 1 states have call successors, (30) Word has length 193 [2023-12-19 11:27:03,882 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-19 11:27:03,884 INFO L225 Difference]: With dead ends: 269 [2023-12-19 11:27:03,884 INFO L226 Difference]: Without dead ends: 178 [2023-12-19 11:27:03,884 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 192 GetRequests, 190 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2023-12-19 11:27:03,885 INFO L413 NwaCegarLoop]: 138 mSDtfsCounter, 126 mSDsluCounter, 187 mSDsCounter, 0 mSdLazyCounter, 90 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 126 SdHoareTripleChecker+Valid, 325 SdHoareTripleChecker+Invalid, 95 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 90 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-12-19 11:27:03,886 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [126 Valid, 325 Invalid, 95 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 90 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-12-19 11:27:03,886 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 178 states. [2023-12-19 11:27:03,895 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 178 to 110. [2023-12-19 11:27:03,895 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 110 states, 78 states have (on average 1.4743589743589745) internal successors, (115), 78 states have internal predecessors, (115), 30 states have call successors, (30), 1 states have call predecessors, (30), 1 states have return successors, (30), 30 states have call predecessors, (30), 30 states have call successors, (30) [2023-12-19 11:27:03,901 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 110 states to 110 states and 175 transitions. [2023-12-19 11:27:03,901 INFO L78 Accepts]: Start accepts. Automaton has 110 states and 175 transitions. Word has length 193 [2023-12-19 11:27:03,903 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-19 11:27:03,903 INFO L495 AbstractCegarLoop]: Abstraction has 110 states and 175 transitions. [2023-12-19 11:27:03,903 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 11.5) internal successors, (46), 4 states have internal predecessors, (46), 1 states have call successors, (30), 1 states have call predecessors, (30), 1 states have return successors, (30), 1 states have call predecessors, (30), 1 states have call successors, (30) [2023-12-19 11:27:03,903 INFO L276 IsEmpty]: Start isEmpty. Operand 110 states and 175 transitions. [2023-12-19 11:27:03,905 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 195 [2023-12-19 11:27:03,905 INFO L187 NwaCegarLoop]: Found error trace [2023-12-19 11:27:03,905 INFO L195 NwaCegarLoop]: trace histogram [30, 30, 30, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-19 11:27:03,914 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2023-12-19 11:27:04,111 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable1 [2023-12-19 11:27:04,112 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-19 11:27:04,112 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-19 11:27:04,112 INFO L85 PathProgramCache]: Analyzing trace with hash -1712222014, now seen corresponding path program 1 times [2023-12-19 11:27:04,112 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-19 11:27:04,113 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1541250376] [2023-12-19 11:27:04,113 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-19 11:27:04,113 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-19 11:27:04,155 ERROR L246 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2023-12-19 11:27:04,156 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1240165932] [2023-12-19 11:27:04,156 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-19 11:27:04,156 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-19 11:27:04,156 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-12-19 11:27:04,173 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-12-19 11:27:04,174 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2023-12-19 11:27:04,300 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 11:27:04,303 INFO L262 TraceCheckSpWp]: Trace formula consists of 469 conjuncts, 7 conjunts are in the unsatisfiable core [2023-12-19 11:27:04,306 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-19 11:27:04,650 INFO L134 CoverageAnalysis]: Checked inductivity of 1740 backedges. 29 proven. 87 refuted. 0 times theorem prover too weak. 1624 trivial. 0 not checked. [2023-12-19 11:27:04,651 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-19 11:27:04,874 INFO L134 CoverageAnalysis]: Checked inductivity of 1740 backedges. 0 proven. 87 refuted. 0 times theorem prover too weak. 1653 trivial. 0 not checked. [2023-12-19 11:27:04,875 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-19 11:27:04,875 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1541250376] [2023-12-19 11:27:04,875 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2023-12-19 11:27:04,875 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1240165932] [2023-12-19 11:27:04,875 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1240165932] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-19 11:27:04,875 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-12-19 11:27:04,875 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 10 [2023-12-19 11:27:04,875 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1826707779] [2023-12-19 11:27:04,875 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-12-19 11:27:04,876 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2023-12-19 11:27:04,876 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-19 11:27:04,877 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2023-12-19 11:27:04,877 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=63, Unknown=0, NotChecked=0, Total=90 [2023-12-19 11:27:04,877 INFO L87 Difference]: Start difference. First operand 110 states and 175 transitions. Second operand has 10 states, 10 states have (on average 8.4) internal successors, (84), 10 states have internal predecessors, (84), 3 states have call successors, (59), 2 states have call predecessors, (59), 4 states have return successors, (60), 2 states have call predecessors, (60), 3 states have call successors, (60) [2023-12-19 11:27:05,204 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-19 11:27:05,205 INFO L93 Difference]: Finished difference Result 281 states and 437 transitions. [2023-12-19 11:27:05,205 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2023-12-19 11:27:05,205 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 8.4) internal successors, (84), 10 states have internal predecessors, (84), 3 states have call successors, (59), 2 states have call predecessors, (59), 4 states have return successors, (60), 2 states have call predecessors, (60), 3 states have call successors, (60) Word has length 194 [2023-12-19 11:27:05,209 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-19 11:27:05,210 INFO L225 Difference]: With dead ends: 281 [2023-12-19 11:27:05,210 INFO L226 Difference]: Without dead ends: 172 [2023-12-19 11:27:05,211 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 396 GetRequests, 379 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 25 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=112, Invalid=230, Unknown=0, NotChecked=0, Total=342 [2023-12-19 11:27:05,212 INFO L413 NwaCegarLoop]: 134 mSDtfsCounter, 155 mSDsluCounter, 279 mSDsCounter, 0 mSdLazyCounter, 339 mSolverCounterSat, 21 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 156 SdHoareTripleChecker+Valid, 413 SdHoareTripleChecker+Invalid, 360 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 21 IncrementalHoareTripleChecker+Valid, 339 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-12-19 11:27:05,213 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [156 Valid, 413 Invalid, 360 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [21 Valid, 339 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2023-12-19 11:27:05,213 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 172 states. [2023-12-19 11:27:05,227 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 172 to 167. [2023-12-19 11:27:05,227 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 167 states, 128 states have (on average 1.4453125) internal successors, (185), 129 states have internal predecessors, (185), 34 states have call successors, (34), 4 states have call predecessors, (34), 4 states have return successors, (34), 33 states have call predecessors, (34), 34 states have call successors, (34) [2023-12-19 11:27:05,229 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 167 states to 167 states and 253 transitions. [2023-12-19 11:27:05,229 INFO L78 Accepts]: Start accepts. Automaton has 167 states and 253 transitions. Word has length 194 [2023-12-19 11:27:05,229 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-19 11:27:05,229 INFO L495 AbstractCegarLoop]: Abstraction has 167 states and 253 transitions. [2023-12-19 11:27:05,230 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 8.4) internal successors, (84), 10 states have internal predecessors, (84), 3 states have call successors, (59), 2 states have call predecessors, (59), 4 states have return successors, (60), 2 states have call predecessors, (60), 3 states have call successors, (60) [2023-12-19 11:27:05,230 INFO L276 IsEmpty]: Start isEmpty. Operand 167 states and 253 transitions. [2023-12-19 11:27:05,232 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 195 [2023-12-19 11:27:05,232 INFO L187 NwaCegarLoop]: Found error trace [2023-12-19 11:27:05,232 INFO L195 NwaCegarLoop]: trace histogram [30, 30, 30, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-19 11:27:05,249 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2023-12-19 11:27:05,440 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-19 11:27:05,440 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-19 11:27:05,441 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-19 11:27:05,441 INFO L85 PathProgramCache]: Analyzing trace with hash 994397380, now seen corresponding path program 1 times [2023-12-19 11:27:05,441 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-19 11:27:05,441 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1212799932] [2023-12-19 11:27:05,441 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-19 11:27:05,441 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-19 11:27:05,493 ERROR L246 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2023-12-19 11:27:05,518 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1342330709] [2023-12-19 11:27:05,518 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-19 11:27:05,518 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-19 11:27:05,518 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-12-19 11:27:05,520 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-12-19 11:27:05,527 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2023-12-19 11:27:05,631 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 11:27:05,633 INFO L262 TraceCheckSpWp]: Trace formula consists of 469 conjuncts, 9 conjunts are in the unsatisfiable core [2023-12-19 11:27:05,636 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-19 11:27:05,764 INFO L134 CoverageAnalysis]: Checked inductivity of 1740 backedges. 857 proven. 33 refuted. 0 times theorem prover too weak. 850 trivial. 0 not checked. [2023-12-19 11:27:05,764 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-19 11:27:05,949 INFO L134 CoverageAnalysis]: Checked inductivity of 1740 backedges. 54 proven. 33 refuted. 0 times theorem prover too weak. 1653 trivial. 0 not checked. [2023-12-19 11:27:05,949 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-19 11:27:05,950 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1212799932] [2023-12-19 11:27:05,950 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2023-12-19 11:27:05,950 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1342330709] [2023-12-19 11:27:05,950 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1342330709] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-19 11:27:05,950 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-12-19 11:27:05,950 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 14 [2023-12-19 11:27:05,950 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1378621039] [2023-12-19 11:27:05,950 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-12-19 11:27:05,951 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2023-12-19 11:27:05,951 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-19 11:27:05,952 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2023-12-19 11:27:05,952 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=42, Invalid=140, Unknown=0, NotChecked=0, Total=182 [2023-12-19 11:27:05,952 INFO L87 Difference]: Start difference. First operand 167 states and 253 transitions. Second operand has 14 states, 14 states have (on average 5.071428571428571) internal successors, (71), 14 states have internal predecessors, (71), 3 states have call successors, (41), 2 states have call predecessors, (41), 4 states have return successors, (42), 3 states have call predecessors, (42), 3 states have call successors, (42) [2023-12-19 11:27:06,825 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-19 11:27:06,825 INFO L93 Difference]: Finished difference Result 749 states and 1130 transitions. [2023-12-19 11:27:06,825 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2023-12-19 11:27:06,826 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 5.071428571428571) internal successors, (71), 14 states have internal predecessors, (71), 3 states have call successors, (41), 2 states have call predecessors, (41), 4 states have return successors, (42), 3 states have call predecessors, (42), 3 states have call successors, (42) Word has length 194 [2023-12-19 11:27:06,827 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-19 11:27:06,833 INFO L225 Difference]: With dead ends: 749 [2023-12-19 11:27:06,833 INFO L226 Difference]: Without dead ends: 583 [2023-12-19 11:27:06,834 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 410 GetRequests, 376 SyntacticMatches, 0 SemanticMatches, 34 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 237 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=302, Invalid=958, Unknown=0, NotChecked=0, Total=1260 [2023-12-19 11:27:06,840 INFO L413 NwaCegarLoop]: 146 mSDtfsCounter, 611 mSDsluCounter, 631 mSDsCounter, 0 mSdLazyCounter, 1003 mSolverCounterSat, 236 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 631 SdHoareTripleChecker+Valid, 777 SdHoareTripleChecker+Invalid, 1239 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 236 IncrementalHoareTripleChecker+Valid, 1003 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2023-12-19 11:27:06,841 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [631 Valid, 777 Invalid, 1239 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [236 Valid, 1003 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2023-12-19 11:27:06,845 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 583 states. [2023-12-19 11:27:06,892 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 583 to 339. [2023-12-19 11:27:06,893 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 339 states, 260 states have (on average 1.4307692307692308) internal successors, (372), 262 states have internal predecessors, (372), 68 states have call successors, (68), 10 states have call predecessors, (68), 10 states have return successors, (68), 66 states have call predecessors, (68), 68 states have call successors, (68) [2023-12-19 11:27:06,895 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 339 states to 339 states and 508 transitions. [2023-12-19 11:27:06,896 INFO L78 Accepts]: Start accepts. Automaton has 339 states and 508 transitions. Word has length 194 [2023-12-19 11:27:06,897 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-19 11:27:06,897 INFO L495 AbstractCegarLoop]: Abstraction has 339 states and 508 transitions. [2023-12-19 11:27:06,897 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 5.071428571428571) internal successors, (71), 14 states have internal predecessors, (71), 3 states have call successors, (41), 2 states have call predecessors, (41), 4 states have return successors, (42), 3 states have call predecessors, (42), 3 states have call successors, (42) [2023-12-19 11:27:06,897 INFO L276 IsEmpty]: Start isEmpty. Operand 339 states and 508 transitions. [2023-12-19 11:27:06,899 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 195 [2023-12-19 11:27:06,899 INFO L187 NwaCegarLoop]: Found error trace [2023-12-19 11:27:06,899 INFO L195 NwaCegarLoop]: trace histogram [30, 30, 30, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-19 11:27:06,909 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2023-12-19 11:27:07,105 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-19 11:27:07,105 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-19 11:27:07,106 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-19 11:27:07,106 INFO L85 PathProgramCache]: Analyzing trace with hash -694546362, now seen corresponding path program 1 times [2023-12-19 11:27:07,106 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-19 11:27:07,106 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [649595540] [2023-12-19 11:27:07,106 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-19 11:27:07,106 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-19 11:27:07,146 ERROR L246 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2023-12-19 11:27:07,146 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1583101452] [2023-12-19 11:27:07,146 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-19 11:27:07,146 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-19 11:27:07,146 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-12-19 11:27:07,150 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-12-19 11:27:07,175 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2023-12-19 11:27:07,277 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 11:27:07,280 INFO L262 TraceCheckSpWp]: Trace formula consists of 469 conjuncts, 15 conjunts are in the unsatisfiable core [2023-12-19 11:27:07,283 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-19 11:27:07,545 INFO L134 CoverageAnalysis]: Checked inductivity of 1740 backedges. 1034 proven. 84 refuted. 0 times theorem prover too weak. 622 trivial. 0 not checked. [2023-12-19 11:27:07,545 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-19 11:27:07,797 INFO L134 CoverageAnalysis]: Checked inductivity of 1740 backedges. 84 proven. 87 refuted. 0 times theorem prover too weak. 1569 trivial. 0 not checked. [2023-12-19 11:27:07,797 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-19 11:27:07,797 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [649595540] [2023-12-19 11:27:07,797 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2023-12-19 11:27:07,798 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1583101452] [2023-12-19 11:27:07,798 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1583101452] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-19 11:27:07,798 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-12-19 11:27:07,798 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10] total 16 [2023-12-19 11:27:07,798 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [921752438] [2023-12-19 11:27:07,798 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-12-19 11:27:07,799 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2023-12-19 11:27:07,799 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-19 11:27:07,799 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2023-12-19 11:27:07,800 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=183, Unknown=0, NotChecked=0, Total=240 [2023-12-19 11:27:07,800 INFO L87 Difference]: Start difference. First operand 339 states and 508 transitions. Second operand has 16 states, 16 states have (on average 5.25) internal successors, (84), 16 states have internal predecessors, (84), 3 states have call successors, (53), 3 states have call predecessors, (53), 7 states have return successors, (54), 3 states have call predecessors, (54), 3 states have call successors, (54) [2023-12-19 11:27:08,816 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-19 11:27:08,817 INFO L93 Difference]: Finished difference Result 1000 states and 1452 transitions. [2023-12-19 11:27:08,817 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 40 states. [2023-12-19 11:27:08,817 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 16 states have (on average 5.25) internal successors, (84), 16 states have internal predecessors, (84), 3 states have call successors, (53), 3 states have call predecessors, (53), 7 states have return successors, (54), 3 states have call predecessors, (54), 3 states have call successors, (54) Word has length 194 [2023-12-19 11:27:08,818 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-19 11:27:08,820 INFO L225 Difference]: With dead ends: 1000 [2023-12-19 11:27:08,820 INFO L226 Difference]: Without dead ends: 662 [2023-12-19 11:27:08,822 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 423 GetRequests, 374 SyntacticMatches, 2 SemanticMatches, 47 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 604 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=584, Invalid=1768, Unknown=0, NotChecked=0, Total=2352 [2023-12-19 11:27:08,822 INFO L413 NwaCegarLoop]: 144 mSDtfsCounter, 397 mSDsluCounter, 605 mSDsCounter, 0 mSdLazyCounter, 922 mSolverCounterSat, 187 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 404 SdHoareTripleChecker+Valid, 749 SdHoareTripleChecker+Invalid, 1109 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 187 IncrementalHoareTripleChecker+Valid, 922 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2023-12-19 11:27:08,822 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [404 Valid, 749 Invalid, 1109 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [187 Valid, 922 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2023-12-19 11:27:08,823 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 662 states. [2023-12-19 11:27:08,845 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 662 to 287. [2023-12-19 11:27:08,845 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 287 states, 204 states have (on average 1.3088235294117647) internal successors, (267), 206 states have internal predecessors, (267), 68 states have call successors, (68), 14 states have call predecessors, (68), 14 states have return successors, (68), 66 states have call predecessors, (68), 68 states have call successors, (68) [2023-12-19 11:27:08,846 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 287 states to 287 states and 403 transitions. [2023-12-19 11:27:08,846 INFO L78 Accepts]: Start accepts. Automaton has 287 states and 403 transitions. Word has length 194 [2023-12-19 11:27:08,847 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-19 11:27:08,847 INFO L495 AbstractCegarLoop]: Abstraction has 287 states and 403 transitions. [2023-12-19 11:27:08,847 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 16 states have (on average 5.25) internal successors, (84), 16 states have internal predecessors, (84), 3 states have call successors, (53), 3 states have call predecessors, (53), 7 states have return successors, (54), 3 states have call predecessors, (54), 3 states have call successors, (54) [2023-12-19 11:27:08,847 INFO L276 IsEmpty]: Start isEmpty. Operand 287 states and 403 transitions. [2023-12-19 11:27:08,848 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 196 [2023-12-19 11:27:08,848 INFO L187 NwaCegarLoop]: Found error trace [2023-12-19 11:27:08,849 INFO L195 NwaCegarLoop]: trace histogram [30, 30, 30, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-19 11:27:08,872 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2023-12-19 11:27:09,054 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-19 11:27:09,055 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-19 11:27:09,055 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-19 11:27:09,055 INFO L85 PathProgramCache]: Analyzing trace with hash 28931626, now seen corresponding path program 1 times [2023-12-19 11:27:09,055 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-19 11:27:09,055 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2072172668] [2023-12-19 11:27:09,055 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-19 11:27:09,055 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-19 11:27:09,083 ERROR L246 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2023-12-19 11:27:09,083 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [384113112] [2023-12-19 11:27:09,083 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-19 11:27:09,083 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-19 11:27:09,083 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-12-19 11:27:09,084 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-12-19 11:27:09,105 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2023-12-19 11:27:09,212 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 11:27:09,216 INFO L262 TraceCheckSpWp]: Trace formula consists of 471 conjuncts, 8 conjunts are in the unsatisfiable core [2023-12-19 11:27:09,221 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-19 11:27:09,397 INFO L134 CoverageAnalysis]: Checked inductivity of 1740 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1740 trivial. 0 not checked. [2023-12-19 11:27:09,398 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-19 11:27:09,398 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-19 11:27:09,398 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2072172668] [2023-12-19 11:27:09,398 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2023-12-19 11:27:09,398 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [384113112] [2023-12-19 11:27:09,398 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [384113112] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-19 11:27:09,398 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-19 11:27:09,398 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-12-19 11:27:09,398 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [439035653] [2023-12-19 11:27:09,398 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-19 11:27:09,399 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-12-19 11:27:09,399 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-19 11:27:09,399 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-12-19 11:27:09,399 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2023-12-19 11:27:09,399 INFO L87 Difference]: Start difference. First operand 287 states and 403 transitions. Second operand has 5 states, 5 states have (on average 9.6) internal successors, (48), 4 states have internal predecessors, (48), 1 states have call successors, (30), 1 states have call predecessors, (30), 1 states have return successors, (30), 1 states have call predecessors, (30), 1 states have call successors, (30) [2023-12-19 11:27:09,529 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-19 11:27:09,529 INFO L93 Difference]: Finished difference Result 757 states and 1063 transitions. [2023-12-19 11:27:09,530 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-12-19 11:27:09,530 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 9.6) internal successors, (48), 4 states have internal predecessors, (48), 1 states have call successors, (30), 1 states have call predecessors, (30), 1 states have return successors, (30), 1 states have call predecessors, (30), 1 states have call successors, (30) Word has length 195 [2023-12-19 11:27:09,530 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-19 11:27:09,532 INFO L225 Difference]: With dead ends: 757 [2023-12-19 11:27:09,532 INFO L226 Difference]: Without dead ends: 471 [2023-12-19 11:27:09,533 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 196 GetRequests, 191 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-19 11:27:09,533 INFO L413 NwaCegarLoop]: 161 mSDtfsCounter, 129 mSDsluCounter, 351 mSDsCounter, 0 mSdLazyCounter, 84 mSolverCounterSat, 61 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 129 SdHoareTripleChecker+Valid, 512 SdHoareTripleChecker+Invalid, 145 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 61 IncrementalHoareTripleChecker+Valid, 84 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-12-19 11:27:09,533 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [129 Valid, 512 Invalid, 145 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [61 Valid, 84 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-12-19 11:27:09,534 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 471 states. [2023-12-19 11:27:09,560 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 471 to 429. [2023-12-19 11:27:09,561 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 429 states, 305 states have (on average 1.3049180327868852) internal successors, (398), 308 states have internal predecessors, (398), 102 states have call successors, (102), 21 states have call predecessors, (102), 21 states have return successors, (102), 99 states have call predecessors, (102), 102 states have call successors, (102) [2023-12-19 11:27:09,563 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 429 states to 429 states and 602 transitions. [2023-12-19 11:27:09,563 INFO L78 Accepts]: Start accepts. Automaton has 429 states and 602 transitions. Word has length 195 [2023-12-19 11:27:09,563 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-19 11:27:09,563 INFO L495 AbstractCegarLoop]: Abstraction has 429 states and 602 transitions. [2023-12-19 11:27:09,563 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 9.6) internal successors, (48), 4 states have internal predecessors, (48), 1 states have call successors, (30), 1 states have call predecessors, (30), 1 states have return successors, (30), 1 states have call predecessors, (30), 1 states have call successors, (30) [2023-12-19 11:27:09,564 INFO L276 IsEmpty]: Start isEmpty. Operand 429 states and 602 transitions. [2023-12-19 11:27:09,565 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 196 [2023-12-19 11:27:09,565 INFO L187 NwaCegarLoop]: Found error trace [2023-12-19 11:27:09,565 INFO L195 NwaCegarLoop]: trace histogram [30, 30, 30, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-19 11:27:09,573 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0 [2023-12-19 11:27:09,771 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5,7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-19 11:27:09,771 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-19 11:27:09,771 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-19 11:27:09,772 INFO L85 PathProgramCache]: Analyzing trace with hash 169480236, now seen corresponding path program 1 times [2023-12-19 11:27:09,772 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-19 11:27:09,772 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1694806245] [2023-12-19 11:27:09,772 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-19 11:27:09,772 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-19 11:27:09,795 ERROR L246 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2023-12-19 11:27:09,795 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1544375072] [2023-12-19 11:27:09,795 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-19 11:27:09,795 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-19 11:27:09,795 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-12-19 11:27:09,797 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-12-19 11:27:09,799 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2023-12-19 11:27:09,957 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 11:27:09,959 INFO L262 TraceCheckSpWp]: Trace formula consists of 468 conjuncts, 17 conjunts are in the unsatisfiable core [2023-12-19 11:27:09,963 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-19 11:27:10,271 INFO L134 CoverageAnalysis]: Checked inductivity of 1740 backedges. 950 proven. 36 refuted. 0 times theorem prover too weak. 754 trivial. 0 not checked. [2023-12-19 11:27:10,271 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-19 11:27:10,679 INFO L134 CoverageAnalysis]: Checked inductivity of 1740 backedges. 132 proven. 39 refuted. 0 times theorem prover too weak. 1569 trivial. 0 not checked. [2023-12-19 11:27:10,680 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-19 11:27:10,680 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1694806245] [2023-12-19 11:27:10,680 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2023-12-19 11:27:10,680 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1544375072] [2023-12-19 11:27:10,680 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1544375072] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-19 11:27:10,680 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-12-19 11:27:10,680 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 12] total 20 [2023-12-19 11:27:10,680 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [424760382] [2023-12-19 11:27:10,680 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-12-19 11:27:10,681 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 20 states [2023-12-19 11:27:10,681 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-19 11:27:10,681 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2023-12-19 11:27:10,682 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=103, Invalid=277, Unknown=0, NotChecked=0, Total=380 [2023-12-19 11:27:10,682 INFO L87 Difference]: Start difference. First operand 429 states and 602 transitions. Second operand has 20 states, 20 states have (on average 5.1) internal successors, (102), 20 states have internal predecessors, (102), 6 states have call successors, (60), 4 states have call predecessors, (60), 8 states have return successors, (60), 6 states have call predecessors, (60), 6 states have call successors, (60) [2023-12-19 11:27:12,205 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-19 11:27:12,207 INFO L93 Difference]: Finished difference Result 1875 states and 2626 transitions. [2023-12-19 11:27:12,208 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 37 states. [2023-12-19 11:27:12,212 INFO L78 Accepts]: Start accepts. Automaton has has 20 states, 20 states have (on average 5.1) internal successors, (102), 20 states have internal predecessors, (102), 6 states have call successors, (60), 4 states have call predecessors, (60), 8 states have return successors, (60), 6 states have call predecessors, (60), 6 states have call successors, (60) Word has length 195 [2023-12-19 11:27:12,213 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-19 11:27:12,218 INFO L225 Difference]: With dead ends: 1875 [2023-12-19 11:27:12,218 INFO L226 Difference]: Without dead ends: 1447 [2023-12-19 11:27:12,220 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 419 GetRequests, 375 SyntacticMatches, 0 SemanticMatches, 44 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 599 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=578, Invalid=1492, Unknown=0, NotChecked=0, Total=2070 [2023-12-19 11:27:12,220 INFO L413 NwaCegarLoop]: 166 mSDtfsCounter, 625 mSDsluCounter, 1121 mSDsCounter, 0 mSdLazyCounter, 1679 mSolverCounterSat, 255 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 671 SdHoareTripleChecker+Valid, 1287 SdHoareTripleChecker+Invalid, 1934 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 255 IncrementalHoareTripleChecker+Valid, 1679 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2023-12-19 11:27:12,221 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [671 Valid, 1287 Invalid, 1934 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [255 Valid, 1679 Invalid, 0 Unknown, 0 Unchecked, 1.1s Time] [2023-12-19 11:27:12,222 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1447 states. [2023-12-19 11:27:12,313 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1447 to 587. [2023-12-19 11:27:12,314 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 587 states, 418 states have (on average 1.291866028708134) internal successors, (540), 422 states have internal predecessors, (540), 136 states have call successors, (136), 32 states have call predecessors, (136), 32 states have return successors, (136), 132 states have call predecessors, (136), 136 states have call successors, (136) [2023-12-19 11:27:12,316 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 587 states to 587 states and 812 transitions. [2023-12-19 11:27:12,316 INFO L78 Accepts]: Start accepts. Automaton has 587 states and 812 transitions. Word has length 195 [2023-12-19 11:27:12,317 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-19 11:27:12,317 INFO L495 AbstractCegarLoop]: Abstraction has 587 states and 812 transitions. [2023-12-19 11:27:12,317 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 20 states, 20 states have (on average 5.1) internal successors, (102), 20 states have internal predecessors, (102), 6 states have call successors, (60), 4 states have call predecessors, (60), 8 states have return successors, (60), 6 states have call predecessors, (60), 6 states have call successors, (60) [2023-12-19 11:27:12,317 INFO L276 IsEmpty]: Start isEmpty. Operand 587 states and 812 transitions. [2023-12-19 11:27:12,319 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 196 [2023-12-19 11:27:12,319 INFO L187 NwaCegarLoop]: Found error trace [2023-12-19 11:27:12,319 INFO L195 NwaCegarLoop]: trace histogram [30, 30, 30, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-19 11:27:12,326 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Forceful destruction successful, exit code 0 [2023-12-19 11:27:12,526 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-19 11:27:12,526 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-19 11:27:12,526 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-19 11:27:12,526 INFO L85 PathProgramCache]: Analyzing trace with hash -1635958098, now seen corresponding path program 1 times [2023-12-19 11:27:12,527 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-19 11:27:12,529 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1956652283] [2023-12-19 11:27:12,529 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-19 11:27:12,529 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-19 11:27:12,550 ERROR L246 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2023-12-19 11:27:12,550 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [648373336] [2023-12-19 11:27:12,550 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-19 11:27:12,551 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-19 11:27:12,551 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-12-19 11:27:12,552 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-12-19 11:27:12,576 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2023-12-19 11:27:12,669 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 11:27:12,672 INFO L262 TraceCheckSpWp]: Trace formula consists of 466 conjuncts, 33 conjunts are in the unsatisfiable core [2023-12-19 11:27:12,676 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-19 11:27:39,459 INFO L134 CoverageAnalysis]: Checked inductivity of 1740 backedges. 593 proven. 69 refuted. 0 times theorem prover too weak. 1078 trivial. 0 not checked. [2023-12-19 11:27:39,459 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-19 11:31:18,611 WARN L293 SmtUtils]: Spent 15.82s on a formula simplification that was a NOOP. DAG size: 196 (called from [L 391] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-12-19 11:32:17,241 WARN L293 SmtUtils]: Spent 32.31s on a formula simplification. DAG size of input: 199 DAG size of output: 199 (called from [L 391] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-12-19 11:32:57,134 WARN L293 SmtUtils]: Spent 21.55s on a formula simplification that was a NOOP. DAG size: 163 (called from [L 391] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-12-19 11:35:41,768 WARN L293 SmtUtils]: Spent 1.73m on a formula simplification. DAG size of input: 413 DAG size of output: 298 (called from [L 391] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-12-19 11:39:10,115 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse2 (mod c_~var_1_30~0 256))) (let ((.cse4 (mod c_~var_1_1~0 65536)) (.cse3 (mod (* 65535 .cse2) 65536)) (.cse8 (mod c_~var_1_34~0 256))) (let ((.cse223 (+ .cse2 .cse8 1)) (.cse358 (* 65536 (div (+ (- 1) (* (- 1) .cse4) .cse3 .cse2 .cse8) 65536)))) (let ((.cse325 (< .cse3 (+ .cse4 .cse358 1))) (.cse9 (< .cse4 .cse3)) (.cse327 (forall ((v_z_142 Int)) (< (+ (div .cse2 (+ v_z_142 .cse2)) .cse3) (+ .cse4 .cse358 65537)))) (.cse342 (forall ((v_z_113 Int)) (or (< v_z_113 0) (< (div .cse2 (+ v_z_113 .cse2)) .cse223)))) (.cse1 (= .cse4 .cse8))) (let ((.cse355 (* (div (+ (- 1) .cse8) 65536) 65536)) (.cse349 (+ c_~var_1_16~0 .cse2)) (.cse139 (or .cse342 .cse1)) (.cse140 (or .cse325 .cse9 .cse327 .cse1))) (let ((.cse53 (< c_~var_1_16~0 .cse8)) (.cse125 (< .cse8 (+ c_~var_1_16~0 2))) (.cse324 (and .cse139 .cse140)) (.cse101 (< c_~var_1_16~0 0)) (.cse64 (< 32766 .cse349)) (.cse341 (mod .cse349 65536)) (.cse347 (* (- 1) .cse8)) (.cse354 (mod (+ 65535 .cse2 .cse8) 65536)) (.cse345 (mod (+ c_~var_1_16~0 c_~var_1_15~0) 256)) (.cse81 (< 65534 c_~var_1_16~0)) (.cse351 (<= .cse8 (+ c_~var_1_16~0 1))) (.cse55 (< (+ .cse355 32767) .cse349)) (.cse357 (< .cse2 1))) (let ((.cse17 (+ .cse4 2)) (.cse326 (and .cse351 (or .cse55 .cse357))) (.cse343 (and .cse351 (or .cse81 .cse357))) (.cse344 (= (+ 256 c_~var_1_12~0) .cse345)) (.cse0 (< 65534 .cse349)) (.cse111 (< (+ 65534 .cse8) c_~var_1_16~0)) (.cse346 (* (- 1) .cse2)) (.cse352 (< .cse354 (+ .cse8 1))) (.cse350 (* 65536 (div (+ .cse2 .cse8 (- 65537)) 65536))) (.cse353 (* 65536 (div (+ (- 1) .cse347 .cse354) 65536))) (.cse54 (< .cse341 32768)) (.cse210 (or .cse342 .cse64 .cse1)) (.cse212 (or .cse324 .cse101)) (.cse213 (or .cse325 .cse64 .cse9 .cse327 .cse1)) (.cse115 (< (+ 98303 (* 65536 (div (+ .cse8 (- 65537)) 65536))) .cse349)) (.cse214 (or .cse325 .cse9 .cse327 .cse1 .cse125)) (.cse216 (or .cse324 .cse53)) (.cse348 (* 65536 (div (+ (- 32769) .cse2 .cse8) 65536)))) (let ((.cse225 (= (mod c_~var_1_9~0 256) 0)) (.cse218 (= (mod c_~var_1_27~0 256) 0)) (.cse167 (< (+ 131071 .cse348) .cse349)) (.cse80 (or .cse54 (let ((.cse356 (< 0 (+ c_~var_1_16~0 32770 .cse2)))) (and (or .cse356 .cse342 .cse1) (or .cse55 .cse342 .cse1) .cse210 (or .cse325 .cse356 .cse9 .cse327 .cse1) (or .cse342 .cse1 .cse125) (or .cse325 .cse55 .cse9 .cse327 .cse1) .cse212 .cse213 (or .cse325 .cse9 .cse115 .cse327 .cse1) .cse214 .cse216)))) (.cse91 (< (+ (* (div (+ 65535 .cse347) 65536) 65536) .cse355 32767) .cse349)) (.cse82 (< (+ .cse350 .cse353 131071) c_~var_1_16~0)) (.cse87 (and (<= (+ 131072 (* 65536 (div (+ (- 131073) .cse2 .cse8) 65536)) (* 65536 (div (+ .cse346 32767 .cse347 .cse354) 65536))) c_~var_1_16~0) (or .cse81 .cse352))) (.cse132 (< (+ 32766 .cse353) (+ c_~var_1_16~0 (* (div (+ .cse346 .cse347) 65536) 65536) .cse2))) (.cse107 (and .cse351 (or .cse352 .cse111))) (.cse32 (< 65534 .cse4)) (.cse68 (< (+ .cse350 65535) c_~var_1_16~0)) (.cse136 (or .cse0 .cse342 .cse1)) (.cse137 (or (not .cse344) (< 127 .cse345))) (.cse141 (< .cse349 32768)) (.cse142 (or .cse342 .cse1 (< (+ (* 65536 (div (+ .cse346 65535 .cse347) 65536)) 131071 .cse348 (* (div (+ 32767 .cse2) 65536) 65536)) .cse349))) (.cse144 (or .cse325 (< 0 (+ c_~var_1_16~0 (* 65536 (div (+ (- 32768) .cse346) 65536)) 2 .cse2)) .cse9 .cse327 .cse1)) (.cse145 (or .cse325 .cse0 .cse9 .cse327 .cse1)) (.cse146 (<= 10 .cse8)) (.cse147 (or .cse344 (and (= .cse345 c_~var_1_12~0) (<= .cse345 127)))) (.cse209 (or .cse342 .cse1 .cse343)) (.cse211 (or .cse325 .cse9 .cse327 .cse1 .cse343)) (.cse215 (or .cse342 .cse326 .cse1)) (.cse106 (< 32767 .cse341)) (.cse23 (< .cse3 .cse17)) (.cse14 (+ .cse4 65538)) (.cse11 (< .cse3 (+ .cse4 1))) (.cse6 (+ .cse3 65535)) (.cse18 (< .cse4 1)) (.cse15 (+ .cse4 65535))) (and (or (let ((.cse220 (< (+ 65534 .cse3) .cse4))) (let ((.cse217 (or (forall ((v_z_113 Int)) (< (div .cse2 (+ v_z_113 .cse2)) .cse223)) (< .cse4 (+ .cse3 .cse2 .cse8 1)))) (.cse219 (or .cse220 (forall ((v_z_113 Int)) (let ((.cse224 (div .cse2 (+ v_z_113 .cse2)))) (or (< v_z_113 0) (< (+ .cse224 .cse3) (+ .cse4 (* 65536 (div (+ .cse2 .cse8) 65536)) 2)) (< .cse224 .cse223))))))) (let ((.cse50 (< .cse4 (+ .cse3 1))) (.cse138 (or (and .cse217 .cse218 .cse219) .cse1)) (.cse143 (and .cse217 .cse218 .cse219 (let ((.cse221 (div (+ .cse3 .cse2 .cse8) 65536))) (or .cse220 (< 0 .cse221) (forall ((v_z_113 Int)) (let ((.cse222 (div .cse2 (+ v_z_113 .cse2)))) (or (< .cse222 .cse223) (< (+ .cse222 .cse3) (+ .cse4 2 (* 65536 .cse221))))))))))) (and (or (and (or .cse0 (let ((.cse12 (forall ((v_z_1563 Int)) (or (< v_z_1563 0) (< .cse4 (+ .cse3 v_z_1563 .cse8 1)) (< .cse2 v_z_1563) (forall ((v_z_113 Int)) (or (< v_z_113 0) (< (div .cse2 (+ v_z_113 v_z_1563)) (+ v_z_1563 .cse8 1)))) (= .cse2 v_z_1563))))) (and (or .cse1 (and (or (forall ((v_z_142 Int) (v_y_1150 Int) (v_z_1563 Int)) (let ((.cse5 (* 65536 v_y_1150))) (let ((.cse7 (+ .cse4 .cse5))) (or (< v_z_1563 0) (< (+ (div .cse2 (+ v_z_142 v_z_1563)) .cse3) (+ .cse4 .cse5 1)) (< .cse6 .cse7) (< .cse7 (+ .cse3 v_z_1563 .cse8)) (< v_z_142 0) (= .cse2 v_z_1563))))) .cse9) (or (forall ((v_z_142 Int) (v_y_1150 Int) (v_z_1563 Int)) (let ((.cse10 (* 65536 v_y_1150))) (or (< v_z_1563 0) (< (+ (div .cse2 (+ v_z_142 v_z_1563)) .cse3) (+ .cse4 .cse10 65537)) (< .cse3 (+ .cse4 .cse10 1)) (< v_z_142 0) (< (+ .cse4 65536 .cse10) (+ .cse3 v_z_1563 .cse8))))) .cse11))) (or (and .cse12 (forall ((v_z_1563 Int)) (or (< v_z_1563 0) (< .cse2 v_z_1563) (forall ((v_z_113 Int)) (let ((.cse13 (div .cse2 (+ v_z_113 v_z_1563)))) (or (< v_z_113 0) (< .cse13 (+ v_z_1563 .cse8 1)) (< (+ .cse13 .cse3) .cse14)))) (= .cse2 v_z_1563))) (forall ((v_z_1563 Int)) (or (< v_z_1563 0) (< .cse2 v_z_1563) (< .cse15 (+ .cse3 v_z_1563 .cse8)) (forall ((v_z_113 Int)) (let ((.cse16 (div .cse2 (+ v_z_113 v_z_1563)))) (or (< v_z_113 0) (< (+ .cse16 .cse3) .cse17) (< .cse16 (+ v_z_1563 .cse8 1))))) (= .cse2 v_z_1563))) (or .cse18 (forall ((v_z_113 Int) (v_z_1563 Int)) (let ((.cse19 (div .cse2 (+ v_z_113 v_z_1563)))) (or (< v_z_113 0) (< v_z_1563 0) (< .cse15 (+ .cse3 v_z_1563 .cse8)) (< .cse19 (+ v_z_1563 .cse8 1)) (= .cse2 v_z_1563) (< (+ .cse19 .cse3) 65537)))))) .cse1) (or .cse1 (and (or .cse11 (forall ((v_z_1563 Int)) (or (< v_z_1563 0) (< .cse2 v_z_1563) (forall ((v_y_1149 Int)) (let ((.cse20 (* 65536 v_y_1149))) (or (< (+ .cse4 65536 .cse20) (+ .cse3 v_z_1563 .cse8)) (< .cse3 (+ .cse4 .cse20 1)) (forall ((v_z_142 Int)) (or (< (+ (div .cse2 (+ v_z_142 v_z_1563)) .cse3) (+ .cse4 .cse20 65537)) (< v_z_142 0)))))) (= .cse2 v_z_1563)))) (or .cse9 (forall ((v_z_1563 Int)) (or (< v_z_1563 0) (< .cse2 v_z_1563) (forall ((v_y_1149 Int)) (let ((.cse22 (* 65536 v_y_1149))) (let ((.cse21 (+ .cse4 .cse22))) (or (< .cse21 (+ .cse3 v_z_1563 .cse8)) (forall ((v_z_142 Int)) (or (< (+ (div .cse2 (+ v_z_142 v_z_1563)) .cse3) (+ .cse4 .cse22 1)) (< v_z_142 0))) (< .cse6 .cse21))))) (= .cse2 v_z_1563)))))) (or (and .cse12 (or .cse23 (forall ((v_y_1151 Int) (v_z_113 Int) (v_z_1563 Int)) (let ((.cse24 (div .cse2 (+ v_z_113 v_z_1563))) (.cse25 (* 65536 v_y_1151))) (or (< v_z_113 0) (< v_z_1563 0) (< (+ .cse24 .cse3) (+ .cse4 65538 .cse25)) (< .cse24 (+ v_z_1563 .cse8 1)) (< (+ .cse25 65535) (+ v_z_1563 .cse8)) (< .cse3 (+ .cse25 1)))))) (forall ((v_z_1563 Int)) (or (< v_z_1563 0) (forall ((v_z_113 Int)) (let ((.cse27 (div .cse2 (+ v_z_113 v_z_1563)))) (or (< v_z_113 0) (forall ((v_y_1151 Int)) (let ((.cse26 (* 65536 v_y_1151))) (or (< 0 v_y_1151) (< (+ .cse4 .cse26 65535) (+ .cse3 v_z_1563 .cse8)) (< (+ .cse27 .cse3) (+ .cse4 2 .cse26)) (< (+ .cse26 65535) (+ v_z_1563 .cse8))))) (< .cse27 (+ v_z_1563 .cse8 1))))) (< .cse2 v_z_1563) (= .cse2 v_z_1563))) (or .cse18 (forall ((v_y_1151 Int) (v_z_113 Int) (v_z_1563 Int)) (let ((.cse29 (div .cse2 (+ v_z_113 v_z_1563))) (.cse28 (* 65536 v_y_1151))) (or (< v_z_113 0) (< v_z_1563 0) (< (+ .cse4 .cse28 65535) (+ .cse3 v_z_1563 .cse8)) (< .cse29 (+ v_z_1563 .cse8 1)) (< (+ .cse28 65535) (+ v_z_1563 .cse8)) (< .cse3 (+ .cse28 1)) (< (+ .cse29 .cse3) (+ .cse28 65537)))))) (or (forall ((v_y_1151 Int) (v_z_113 Int) (v_z_1563 Int)) (let ((.cse30 (* 65536 v_y_1151)) (.cse31 (div .cse2 (+ v_z_113 v_z_1563)))) (or (< v_z_113 0) (< v_z_1563 0) (< 0 v_y_1151) (< (+ .cse30 65535) (+ .cse3 v_z_1563 .cse8)) (< (+ .cse31 .cse3) (+ .cse4 2 .cse30)) (< .cse31 (+ v_z_1563 .cse8 1)) (= .cse2 v_z_1563)))) .cse32) (or .cse23 (forall ((v_y_1151 Int) (v_z_113 Int) (v_z_1563 Int)) (let ((.cse33 (div .cse2 (+ v_z_113 v_z_1563))) (.cse34 (* 65536 v_y_1151))) (or (< v_z_113 0) (< v_z_1563 0) (< 0 v_y_1151) (< (+ .cse33 .cse3) (+ .cse4 65538 .cse34)) (< .cse33 (+ v_z_1563 .cse8 1)) (< (+ .cse34 65535) (+ v_z_1563 .cse8))))))) .cse1)))) (or (and (or (and (or (forall ((v_z_1558 Int) (v_z_142 Int) (v_y_1146 Int)) (let ((.cse35 (* 65536 v_y_1146))) (or (< (+ .cse4 65536 .cse35) (+ .cse3 v_z_1558 .cse8)) (< .cse3 (+ .cse4 .cse35 1)) (< (+ (div .cse2 (+ v_z_142 v_z_1558)) .cse3) (+ .cse4 .cse35 65537)) (< v_z_1558 0) (< v_z_142 0)))) .cse11) (or .cse9 (forall ((v_z_142 Int) (v_z_1554 Int) (v_y_1146 Int)) (let ((.cse36 (* 65536 v_y_1146))) (let ((.cse37 (+ .cse4 .cse36))) (or (< (+ (div .cse2 (+ v_z_142 v_z_1554)) .cse3) (+ .cse4 .cse36 1)) (< .cse6 .cse37) (< v_z_1554 0) (< v_z_142 0) (< .cse37 (+ .cse3 v_z_1554 .cse8)) (= .cse2 v_z_1554))))))) .cse1) (or .cse1 (and (or (forall ((v_z_142 Int) (v_z_1548 Int) (v_y_1145 Int)) (let ((.cse39 (* 65536 v_y_1145))) (let ((.cse38 (+ .cse4 .cse39))) (or (< .cse6 .cse38) (< .cse38 (+ .cse3 v_z_1548 .cse8)) (= .cse2 v_z_1548) (< v_z_142 0) (< (+ (div .cse2 (+ v_z_142 v_z_1548)) .cse3) (+ .cse4 .cse39 1)) (< v_z_1548 0))))) .cse9) (or (forall ((v_z_142 Int) (v_y_1145 Int) (v_z_1541 Int)) (let ((.cse40 (* 65536 v_y_1145))) (or (< (+ .cse4 65536 .cse40) (+ .cse3 v_z_1541 .cse8)) (< .cse3 (+ .cse4 .cse40 1)) (< v_z_1541 0) (< v_z_142 0) (< (+ (div .cse2 (+ v_z_142 v_z_1541)) .cse3) (+ .cse4 .cse40 65537))))) .cse11))) (or .cse1 (and (or .cse18 (forall ((v_z_113 Int) (v_z_1561 Int)) (let ((.cse41 (div .cse2 (+ v_z_113 v_z_1561)))) (or (< (+ .cse41 .cse3) 65537) (< v_z_113 0) (= .cse2 v_z_1561) (< .cse41 (+ v_z_1561 .cse8 1)) (< v_z_1561 0) (< .cse15 (+ .cse3 v_z_1561 .cse8)))))) (forall ((v_z_1561 Int)) (or (= .cse2 v_z_1561) (forall ((v_z_113 Int)) (let ((.cse42 (div .cse2 (+ v_z_113 v_z_1561)))) (or (< v_z_113 0) (< (+ .cse42 .cse3) .cse17) (< .cse42 (+ v_z_1561 .cse8 1))))) (< .cse2 v_z_1561) (< v_z_1561 0) (< .cse15 (+ .cse3 v_z_1561 .cse8)))) (forall ((v_z_1561 Int)) (or (= .cse2 v_z_1561) (< .cse4 (+ .cse3 v_z_1561 .cse8 1)) (forall ((v_z_113 Int)) (or (< v_z_113 0) (< (div .cse2 (+ v_z_113 v_z_1561)) (+ v_z_1561 .cse8 1)))) (< .cse2 v_z_1561) (< v_z_1561 0))) (forall ((v_z_1561 Int)) (or (forall ((v_z_113 Int)) (let ((.cse43 (div .cse2 (+ v_z_113 v_z_1561)))) (or (< v_z_113 0) (< (+ .cse43 .cse3) .cse14) (< .cse43 (+ v_z_1561 .cse8 1))))) (= .cse2 v_z_1561) (< .cse2 v_z_1561) (< v_z_1561 0))))) (or (and (or (forall ((v_z_1525 Int) (v_z_113 Int) (v_y_1147 Int)) (let ((.cse45 (* 65536 v_y_1147)) (.cse44 (div .cse2 (+ v_z_113 v_z_1525)))) (or (< v_z_113 0) (= .cse2 v_z_1525) (< 0 v_y_1147) (< (+ .cse44 .cse3) (+ .cse45 .cse4 2)) (< (+ .cse45 65535) (+ .cse3 v_z_1525 .cse8)) (< .cse44 (+ v_z_1525 .cse8 1)) (< v_z_1525 0)))) .cse32) (forall ((v_z_113 Int) (v_y_1147 Int) (v_z_1509 Int)) (let ((.cse47 (* 65536 v_y_1147)) (.cse46 (div .cse2 (+ v_z_113 v_z_1509)))) (or (< v_z_113 0) (= .cse2 v_z_1509) (< (+ .cse46 .cse3) (+ .cse47 .cse4 2)) (< 0 v_y_1147) (< (+ .cse47 65535) (+ v_z_1509 .cse8)) (< (+ .cse47 .cse4 65535) (+ .cse3 v_z_1509 .cse8)) (< .cse46 (+ v_z_1509 .cse8 1)) (< v_z_1509 0)))) (or .cse18 (forall ((v_z_1520 Int) (v_z_113 Int) (v_y_1147 Int)) (let ((.cse49 (div .cse2 (+ v_z_113 v_z_1520))) (.cse48 (* 65536 v_y_1147))) (or (= .cse2 v_z_1520) (< v_z_113 0) (< (+ .cse48 .cse4 65535) (+ .cse3 v_z_1520 .cse8)) (< 0 v_y_1147) (< (+ .cse49 .cse3) (+ .cse48 65537)) (< v_z_1520 0) (< .cse49 (+ v_z_1520 .cse8 1)) (< (+ .cse48 65535) (+ v_z_1520 .cse8)))))) (or (forall ((v_z_1505 Int) (v_z_113 Int)) (or (< v_z_113 0) (< (div .cse2 (+ v_z_113 v_z_1505)) (+ v_z_1505 .cse8 1)) (= .cse2 v_z_1505) (< v_z_1505 0) (< .cse4 (+ .cse3 v_z_1505 .cse8 1)))) .cse50) (or .cse23 (forall ((v_z_1515 Int) (v_z_113 Int) (v_y_1147 Int)) (let ((.cse52 (div .cse2 (+ v_z_113 v_z_1515))) (.cse51 (* 65536 v_y_1147))) (or (< v_z_113 0) (< (+ .cse51 65535) (+ v_z_1515 .cse8)) (< (+ .cse3 .cse52) (+ .cse51 .cse4 65538)) (< v_z_1515 0) (< .cse52 (+ v_z_1515 .cse8 1)) (< .cse3 (+ .cse51 .cse4 2))))))) .cse1)) .cse53)) .cse54) (or (and (or .cse55 (and (or .cse23 (forall ((v_z_113 Int) (v_z_1584 Int)) (let ((.cse56 (div .cse2 (+ v_z_113 v_z_1584)))) (or (< v_z_113 0) (< (+ .cse56 .cse3) .cse14) (< .cse56 (+ v_z_1584 .cse8 1)) (< v_z_1584 0))))) (or .cse32 (forall ((v_z_113 Int) (v_z_1584 Int)) (let ((.cse57 (div .cse2 (+ v_z_113 v_z_1584)))) (or (< v_z_113 0) (= .cse2 v_z_1584) (< 65535 (+ .cse3 v_z_1584 .cse8)) (< .cse57 (+ v_z_1584 .cse8 1)) (< (+ .cse57 .cse3) .cse17) (< v_z_1584 0))))) (forall ((v_z_1584 Int)) (or (= .cse2 v_z_1584) (< .cse4 (+ .cse3 v_z_1584 .cse8 1)) (forall ((v_z_113 Int)) (or (< v_z_113 0) (< (div .cse2 (+ v_z_113 v_z_1584)) (+ v_z_1584 .cse8 1)))) (< .cse2 v_z_1584) (< v_z_1584 0))) (forall ((v_z_1584 Int)) (or (= .cse2 v_z_1584) (< .cse15 (+ .cse3 v_z_1584 .cse8)) (< .cse2 v_z_1584) (forall ((v_z_113 Int)) (let ((.cse58 (div .cse2 (+ v_z_113 v_z_1584)))) (or (< v_z_113 0) (< .cse58 (+ v_z_1584 .cse8 1)) (< (+ .cse58 .cse3) 65537)))) (< v_z_1584 0)))) .cse1) (or (and (or .cse1 (and (or .cse9 (forall ((v_z_142 Int) (v_z_1621 Int) (v_y_1169 Int)) (let ((.cse60 (* 65536 v_y_1169))) (let ((.cse59 (+ .cse4 .cse60))) (or (< v_z_1621 0) (< .cse6 .cse59) (< v_z_142 0) (< .cse59 (+ .cse3 v_z_1621 .cse8)) (< (+ (div .cse2 (+ v_z_142 v_z_1621)) .cse3) (+ .cse4 .cse60 1)) (= .cse2 v_z_1621)))))) (or .cse11 (forall ((v_z_142 Int) (v_z_1621 Int) (v_y_1169 Int)) (let ((.cse61 (* 65536 v_y_1169))) (or (< v_z_1621 0) (< (+ .cse4 .cse61 65536) (+ .cse3 v_z_1621 .cse8)) (< .cse3 (+ .cse4 .cse61 1)) (< (+ (div .cse2 (+ v_z_142 v_z_1621)) .cse3) (+ .cse4 .cse61 65537)) (< v_z_142 0))))))) (or (and (forall ((v_z_1623 Int)) (or (< .cse2 v_z_1623) (forall ((v_z_113 Int)) (or (< v_z_113 0) (< (div .cse2 (+ v_z_113 v_z_1623)) (+ v_z_1623 .cse8 1)))) (= .cse2 v_z_1623) (< .cse4 (+ .cse3 v_z_1623 .cse8 1)) (< v_z_1623 0))) (forall ((v_z_1623 Int)) (or (forall ((v_z_113 Int)) (let ((.cse62 (div .cse2 (+ v_z_113 v_z_1623)))) (or (< v_z_113 0) (< .cse62 (+ v_z_1623 .cse8 1)) (< (+ .cse62 .cse3) .cse17)))) (< .cse2 v_z_1623) (= .cse2 v_z_1623) (< v_z_1623 0) (< .cse15 (+ .cse3 v_z_1623 .cse8)))) (or .cse23 (forall ((v_z_1623 Int) (v_z_113 Int)) (let ((.cse63 (div .cse2 (+ v_z_113 v_z_1623)))) (or (< v_z_113 0) (< .cse63 (+ v_z_1623 .cse8 1)) (< v_z_1623 0) (< (+ .cse63 .cse3) .cse14)))))) .cse1)) .cse53) (or .cse64 .cse1 (and (or .cse11 (forall ((v_z_142 Int) (v_y_1173 Int) (v_z_1597 Int)) (let ((.cse65 (* 65536 v_y_1173))) (or (< v_z_1597 0) (< .cse3 (+ .cse4 .cse65 1)) (< v_z_142 0) (< (+ (div .cse2 (+ v_z_142 v_z_1597)) .cse3) (+ .cse4 .cse65 65537)) (< (+ .cse4 65536 .cse65) (+ .cse3 v_z_1597 .cse8)))))) (or .cse9 (forall ((v_z_142 Int) (v_y_1173 Int) (v_z_1597 Int)) (let ((.cse67 (* 65536 v_y_1173))) (let ((.cse66 (+ .cse4 .cse67))) (or (< v_z_1597 0) (< .cse66 (+ .cse3 v_z_1597 .cse8)) (< (+ (div .cse2 (+ v_z_142 v_z_1597)) .cse3) (+ .cse4 .cse67 1)) (< .cse6 .cse66) (< v_z_142 0) (= .cse2 v_z_1597)))))))) (or .cse68 .cse1 (and (forall ((v_z_113 Int) (v_z_1577 Int)) (let ((.cse69 (div .cse2 (+ v_z_113 v_z_1577)))) (or (< v_z_113 0) (< v_z_1577 0) (< .cse69 (+ v_z_1577 .cse8 1)) (< .cse15 (+ .cse3 v_z_1577 .cse8)) (= .cse2 v_z_1577) (< (+ .cse3 .cse69) .cse17)))) (forall ((v_z_113 Int) (v_z_1573 Int)) (let ((.cse70 (div .cse2 (+ v_z_113 v_z_1573)))) (or (< v_z_113 0) (< v_z_1573 0) (< .cse70 (+ v_z_1573 .cse8 1)) (= .cse2 v_z_1573) (< (+ .cse3 .cse70) .cse14)))) (forall ((v_z_113 Int) (v_z_1570 Int)) (or (< v_z_1570 0) (< v_z_113 0) (< .cse4 (+ .cse3 v_z_1570 .cse8 1)) (< (div .cse2 (+ v_z_113 v_z_1570)) (+ v_z_1570 .cse8 1)) (= .cse2 v_z_1570))))) (or .cse68 .cse1 (and (or .cse9 (forall ((v_z_142 Int) (v_y_1175 Int) (v_z_1583 Int)) (let ((.cse72 (* 65536 v_y_1175))) (let ((.cse71 (+ .cse4 .cse72))) (or (< .cse71 (+ .cse3 v_z_1583 .cse8)) (< (+ (div .cse2 (+ v_z_142 v_z_1583)) .cse3) (+ .cse4 .cse72 1)) (< v_z_142 0) (< v_z_1583 0) (< .cse6 .cse71) (= .cse2 v_z_1583)))))) (or (forall ((v_z_142 Int) (v_y_1175 Int) (v_z_1583 Int)) (let ((.cse73 (* 65536 v_y_1175))) (or (< (+ .cse4 65536 .cse73) (+ .cse3 v_z_1583 .cse8)) (< .cse3 (+ .cse4 .cse73 1)) (< v_z_142 0) (< v_z_1583 0) (< (+ (div .cse2 (+ v_z_142 v_z_1583)) .cse3) (+ .cse4 .cse73 65537))))) .cse11))) (or .cse55 .cse1 (and (or .cse9 (forall ((v_z_142 Int) (v_y_1176 Int) (v_z_1595 Int)) (let ((.cse75 (* 65536 v_y_1176))) (let ((.cse74 (+ .cse4 .cse75))) (or (< .cse6 .cse74) (= .cse2 v_z_1595) (< .cse74 (+ .cse3 v_z_1595 .cse8)) (< v_z_142 0) (< v_z_1595 0) (< (+ (div .cse2 (+ v_z_142 v_z_1595)) .cse3) (+ .cse4 .cse75 1))))))) (or .cse11 (forall ((v_z_142 Int) (v_y_1176 Int) (v_z_1588 Int)) (let ((.cse76 (* 65536 v_y_1176))) (or (< v_z_1588 0) (< (+ (div .cse2 (+ v_z_142 v_z_1588)) .cse3) (+ .cse4 .cse76 65537)) (< .cse3 (+ .cse4 .cse76 1)) (< (+ .cse4 65536 .cse76) (+ .cse3 v_z_1588 .cse8)) (< v_z_142 0))))))) (or (and (forall ((v_z_1604 Int) (v_z_113 Int)) (let ((.cse77 (div .cse2 (+ v_z_113 v_z_1604)))) (or (< v_z_113 0) (= .cse2 v_z_1604) (< v_z_1604 0) (< .cse77 (+ v_z_1604 .cse8 1)) (< (+ .cse3 .cse77) .cse17) (< 65535 (+ .cse3 v_z_1604 .cse8))))) (or .cse23 (forall ((v_z_113 Int) (v_z_1611 Int)) (let ((.cse78 (div .cse2 (+ v_z_113 v_z_1611)))) (or (< v_z_113 0) (< .cse78 (+ v_z_1611 .cse8 1)) (< (+ .cse78 .cse3) .cse14) (< v_z_1611 0))))) (forall ((v_z_113 Int) (v_z_1608 Int)) (or (< v_z_113 0) (= .cse2 v_z_1608) (< .cse4 (+ .cse3 v_z_1608 .cse8 1)) (< (div .cse2 (+ v_z_113 v_z_1608)) (+ v_z_1608 .cse8 1)) (< v_z_1608 0))) (or .cse18 (forall ((v_z_1613 Int) (v_z_113 Int)) (let ((.cse79 (div .cse2 (+ v_z_113 v_z_1613)))) (or (< v_z_113 0) (< .cse15 (+ .cse3 v_z_1613 .cse8)) (< v_z_1613 0) (= .cse2 v_z_1613) (< .cse79 (+ v_z_1613 .cse8 1)) (< (+ .cse79 .cse3) 65537)))))) .cse64 .cse1)) .cse54) .cse80 (or (let ((.cse92 (forall ((v_z_1624 Int)) (or (forall ((v_z_113 Int)) (or (< v_z_113 0) (< (div .cse2 (+ v_z_113 v_z_1624)) (+ v_z_1624 .cse8 1)))) (< .cse4 (+ .cse3 v_z_1624 .cse8 1)) (< .cse2 v_z_1624) (< v_z_1624 0) (= .cse2 v_z_1624)))) (.cse93 (forall ((v_z_1624 Int)) (or (< .cse2 v_z_1624) (< v_z_1624 0) (= .cse2 v_z_1624) (forall ((v_z_113 Int)) (let ((.cse105 (div .cse2 (+ v_z_113 v_z_1624)))) (or (< v_z_113 0) (< (+ .cse105 .cse3) .cse17) (< .cse105 (+ v_z_1624 .cse8 1))))) (< .cse15 (+ .cse3 v_z_1624 .cse8))))) (.cse94 (or .cse23 (forall ((v_z_1624 Int) (v_z_113 Int)) (let ((.cse104 (div .cse2 (+ v_z_113 v_z_1624)))) (or (< v_z_113 0) (< v_z_1624 0) (< (+ .cse104 .cse3) .cse14) (< .cse104 (+ v_z_1624 .cse8 1)))))))) (let ((.cse83 (and .cse92 (or (forall ((v_z_1624 Int) (v_z_113 Int)) (let ((.cse103 (div .cse2 (+ v_z_113 v_z_1624)))) (or (< v_z_113 0) (< 65535 (+ .cse3 v_z_1624 .cse8)) (< v_z_1624 0) (= .cse2 v_z_1624) (< (+ .cse103 .cse3) .cse17) (< .cse103 (+ v_z_1624 .cse8 1))))) .cse32) .cse93 .cse94))) (and (or .cse81 .cse82 .cse83 .cse1) (or (and (or (forall ((v_z_1624 Int) (v_z_142 Int) (v_y_1180 Int)) (let ((.cse84 (* 65536 v_y_1180))) (or (< .cse3 (+ .cse4 .cse84 1)) (< v_z_1624 0) (< v_z_142 0) (< (+ .cse4 65536 .cse84) (+ .cse3 v_z_1624 .cse8)) (< (+ .cse3 (div .cse2 (+ v_z_142 v_z_1624))) (+ .cse4 .cse84 65537))))) .cse11) (or (forall ((v_z_1624 Int) (v_z_142 Int) (v_y_1180 Int)) (let ((.cse86 (* 65536 v_y_1180))) (let ((.cse85 (+ .cse4 .cse86))) (or (< .cse85 (+ .cse3 v_z_1624 .cse8)) (< .cse6 .cse85) (< (+ .cse3 (div .cse2 (+ v_z_142 v_z_1624))) (+ .cse4 .cse86 1)) (< v_z_1624 0) (= .cse2 v_z_1624) (< v_z_142 0))))) .cse9)) .cse1 .cse87) (or .cse81 .cse1 (and (or .cse11 (forall ((v_z_1624 Int) (v_y_1181 Int) (v_z_142 Int)) (let ((.cse88 (* 65536 v_y_1181))) (or (< (+ .cse3 (div .cse2 (+ v_z_142 v_z_1624))) (+ .cse4 65537 .cse88)) (< v_z_1624 0) (< .cse3 (+ .cse4 1 .cse88)) (< v_z_142 0) (< (+ .cse4 65536 .cse88) (+ .cse3 v_z_1624 .cse8)))))) (or (forall ((v_y_1181 Int) (v_z_1624 Int) (v_z_142 Int)) (let ((.cse90 (* 65536 v_y_1181))) (let ((.cse89 (+ .cse4 .cse90))) (or (< .cse6 .cse89) (< v_z_1624 0) (= .cse2 v_z_1624) (< v_z_142 0) (< (+ .cse3 (div .cse2 (+ v_z_142 v_z_1624))) (+ .cse4 1 .cse90)) (< .cse89 (+ .cse3 v_z_1624 .cse8)))))) .cse9))) (or .cse91 (and .cse92 .cse93 .cse94) .cse1) (or .cse55 .cse1 (and (or (forall ((v_z_1624 Int) (v_z_142 Int) (v_y_1184 Int)) (let ((.cse95 (* 65536 v_y_1184))) (or (< v_z_1624 0) (< .cse3 (+ .cse95 .cse4 1)) (< v_z_142 0) (< (+ .cse3 (div .cse2 (+ v_z_142 v_z_1624))) (+ .cse95 .cse4 65537)) (< (+ .cse95 .cse4 65536) (+ .cse3 v_z_1624 .cse8))))) .cse11) (or .cse9 (forall ((v_z_1624 Int) (v_z_142 Int) (v_y_1184 Int)) (let ((.cse97 (* 65536 v_y_1184))) (let ((.cse96 (+ .cse97 .cse4))) (or (< v_z_1624 0) (= .cse2 v_z_1624) (< .cse6 .cse96) (< .cse96 (+ .cse3 v_z_1624 .cse8)) (< v_z_142 0) (< (+ .cse3 (div .cse2 (+ v_z_142 v_z_1624))) (+ .cse97 .cse4 1))))))))) (or (and (or .cse83 .cse1) (or .cse1 (and (or (forall ((v_z_1624 Int) (v_y_1182 Int) (v_z_142 Int)) (let ((.cse99 (* 65536 v_y_1182))) (let ((.cse98 (+ .cse4 .cse99))) (or (< .cse6 .cse98) (< (+ .cse3 (div .cse2 (+ v_z_142 v_z_1624))) (+ .cse4 .cse99 1)) (< .cse98 (+ .cse3 v_z_1624 .cse8)) (< v_z_1624 0) (= .cse2 v_z_1624) (< v_z_142 0))))) .cse9) (or (forall ((v_z_1624 Int) (v_z_142 Int) (v_y_1182 Int)) (let ((.cse100 (* 65536 v_y_1182))) (or (< .cse3 (+ .cse4 .cse100 1)) (< (+ .cse3 (div .cse2 (+ v_z_142 v_z_1624))) (+ .cse4 .cse100 65537)) (< v_z_1624 0) (< v_z_142 0) (< (+ .cse4 .cse100 65536) (+ .cse3 v_z_1624 .cse8))))) .cse11)))) .cse101) (or .cse81 (and .cse92 .cse93 (or .cse18 (forall ((v_z_1624 Int) (v_z_113 Int)) (let ((.cse102 (div .cse2 (+ v_z_113 v_z_1624)))) (or (< v_z_113 0) (< v_z_1624 0) (= .cse2 v_z_1624) (< (+ .cse102 .cse3) 65537) (< .cse15 (+ .cse3 v_z_1624 .cse8)) (< .cse102 (+ v_z_1624 .cse8 1)))))) .cse94) .cse1)))) .cse106) (or .cse54 (and (or .cse107 .cse1 (and (or (forall ((v_z_1821 Int) (v_z_113 Int)) (let ((.cse108 (div .cse2 (+ v_z_113 v_z_1821)))) (or (< v_z_113 0) (< v_z_1821 0) (= .cse2 v_z_1821) (< (+ .cse108 .cse3) .cse17) (< .cse108 (+ v_z_1821 .cse8 1)) (< 65535 (+ .cse3 v_z_1821 .cse8))))) .cse32) (forall ((v_z_113 Int) (v_z_1826 Int)) (let ((.cse109 (div .cse2 (+ v_z_113 v_z_1826)))) (or (< v_z_113 0) (< (+ .cse109 .cse3) .cse17) (< .cse109 (+ v_z_1826 .cse8 1)) (< v_z_1826 0) (< .cse15 (+ .cse3 v_z_1826 .cse8)) (= .cse2 v_z_1826)))) (forall ((v_z_1813 Int) (v_z_113 Int)) (or (< v_z_113 0) (< (div .cse2 (+ v_z_113 v_z_1813)) (+ v_z_1813 .cse8 1)) (= .cse2 v_z_1813) (< v_z_1813 0) (< .cse4 (+ .cse3 v_z_1813 .cse8 1)))) (or .cse23 (forall ((v_z_113 Int) (v_z_1819 Int)) (let ((.cse110 (div .cse2 (+ v_z_113 v_z_1819)))) (or (< v_z_113 0) (< .cse110 (+ v_z_1819 .cse8 1)) (< v_z_1819 0) (< (+ .cse110 .cse3) .cse14))))))) (or .cse111 .cse1 (and (or (forall ((v_z_142 Int) (v_z_1837 Int) (v_y_1191 Int)) (let ((.cse112 (* 65536 v_y_1191))) (or (< (+ (div .cse2 (+ v_z_142 v_z_1837)) .cse3) (+ .cse4 .cse112 65537)) (< .cse3 (+ .cse4 .cse112 1)) (< (+ .cse4 .cse112 65536) (+ .cse3 v_z_1837 .cse8)) (< v_z_142 0) (< v_z_1837 0)))) .cse11) (or .cse9 (forall ((v_z_142 Int) (v_z_1834 Int) (v_y_1191 Int)) (let ((.cse114 (* 65536 v_y_1191))) (let ((.cse113 (+ .cse4 .cse114))) (or (< .cse6 .cse113) (< (+ .cse3 (div .cse2 (+ v_z_142 v_z_1834))) (+ .cse4 .cse114 1)) (< .cse113 (+ .cse3 v_z_1834 .cse8)) (= .cse2 v_z_1834) (< v_z_142 0) (< v_z_1834 0)))))))) (or .cse115 .cse1 (and (or .cse11 (forall ((v_z_1921 Int) (v_z_142 Int) (v_y_1188 Int)) (let ((.cse116 (* 65536 v_y_1188))) (or (< (+ (div .cse2 (+ v_z_142 v_z_1921)) .cse3) (+ .cse4 .cse116 65537)) (< .cse3 (+ .cse4 .cse116 1)) (< (+ .cse4 65536 .cse116) (+ .cse3 v_z_1921 .cse8)) (< v_z_1921 0) (< v_z_142 0))))) (or (forall ((v_z_142 Int) (v_y_1188 Int) (v_z_1916 Int)) (let ((.cse118 (* 65536 v_y_1188))) (let ((.cse117 (+ .cse4 .cse118))) (or (< v_z_1916 0) (< .cse117 (+ .cse3 v_z_1916 .cse8)) (< (+ (div .cse2 (+ v_z_142 v_z_1916)) .cse3) (+ .cse4 .cse118 1)) (< .cse6 .cse117) (= .cse2 v_z_1916) (< v_z_142 0))))) .cse9))) (or (and (or (and (or (forall ((v_z_1910 Int) (v_z_142 Int) (v_y_1189 Int)) (let ((.cse120 (* 65536 v_y_1189))) (let ((.cse119 (+ .cse120 .cse4))) (or (< v_z_1910 0) (= .cse2 v_z_1910) (< .cse6 .cse119) (< (+ .cse3 (div .cse2 (+ v_z_142 v_z_1910))) (+ .cse120 .cse4 1)) (< .cse119 (+ .cse3 v_z_1910 .cse8)) (< v_z_142 0))))) .cse9) (or (forall ((v_z_142 Int) (v_y_1189 Int) (v_z_1906 Int)) (let ((.cse121 (* 65536 v_y_1189))) (or (< (+ .cse3 (div .cse2 (+ v_z_142 v_z_1906))) (+ .cse121 .cse4 65537)) (< v_z_1906 0) (< v_z_142 0) (< (+ .cse121 .cse4 65536) (+ .cse3 v_z_1906 .cse8)) (< .cse3 (+ .cse121 .cse4 1))))) .cse11)) .cse1) (or (and (forall ((v_z_113 Int) (v_z_1890 Int)) (or (< v_z_113 0) (< .cse4 (+ .cse3 v_z_1890 .cse8 1)) (< v_z_1890 0) (= .cse2 v_z_1890) (< (div .cse2 (+ v_z_113 v_z_1890)) (+ v_z_1890 .cse8 1)))) (forall ((v_z_1895 Int) (v_z_113 Int)) (let ((.cse122 (div .cse2 (+ v_z_113 v_z_1895)))) (or (< v_z_113 0) (< .cse122 (+ v_z_1895 .cse8 1)) (= .cse2 v_z_1895) (< v_z_1895 0) (< (+ .cse122 .cse3) .cse14)))) (or .cse18 (forall ((v_z_1898 Int) (v_z_113 Int)) (let ((.cse123 (div .cse2 (+ v_z_113 v_z_1898)))) (or (< v_z_1898 0) (< v_z_113 0) (< (+ .cse3 .cse123) 65537) (< .cse123 (+ v_z_1898 .cse8 1)) (< .cse15 (+ .cse3 v_z_1898 .cse8)) (= .cse2 v_z_1898))))) (forall ((v_z_113 Int) (v_z_1886 Int)) (let ((.cse124 (div .cse2 (+ v_z_113 v_z_1886)))) (or (< .cse124 (+ v_z_1886 .cse8 1)) (< v_z_113 0) (= .cse2 v_z_1886) (< 65535 (+ .cse3 v_z_1886 .cse8)) (< v_z_1886 0) (< (+ .cse124 .cse3) .cse17))))) .cse1)) .cse101) (or .cse1 .cse125 (and (or .cse23 (forall ((v_z_113 Int) (v_z_1847 Int)) (let ((.cse126 (div .cse2 (+ v_z_113 v_z_1847)))) (or (< v_z_113 0) (< v_z_1847 0) (< (+ .cse126 .cse3) .cse14) (< .cse126 (+ v_z_1847 .cse8 1)))))) (forall ((v_z_113 Int) (v_z_1858 Int)) (let ((.cse127 (div .cse2 (+ v_z_113 v_z_1858)))) (or (< v_z_113 0) (< (+ .cse127 .cse3) .cse17) (= .cse2 v_z_1858) (< v_z_1858 0) (< .cse15 (+ .cse3 v_z_1858 .cse8)) (< .cse127 (+ v_z_1858 .cse8 1))))) (or (forall ((v_z_113 Int) (v_z_1852 Int)) (let ((.cse128 (div .cse2 (+ v_z_113 v_z_1852)))) (or (< v_z_113 0) (< v_z_1852 0) (< 65535 (+ .cse3 v_z_1852 .cse8)) (< (+ .cse3 .cse128) .cse17) (= .cse2 v_z_1852) (< .cse128 (+ v_z_1852 .cse8 1))))) .cse32) (forall ((v_z_1846 Int) (v_z_113 Int)) (or (< v_z_113 0) (= .cse2 v_z_1846) (< (div .cse2 (+ v_z_113 v_z_1846)) (+ v_z_1846 .cse8 1)) (< v_z_1846 0) (< .cse4 (+ .cse3 v_z_1846 .cse8 1)))))) (or (and (or (forall ((v_z_142 Int) (v_y_1187 Int) (v_z_1808 Int)) (let ((.cse129 (* 65536 v_y_1187))) (or (< (+ .cse4 65536 .cse129) (+ .cse3 v_z_1808 .cse8)) (< .cse3 (+ .cse4 .cse129 1)) (< v_z_1808 0) (< v_z_142 0) (< (+ (div .cse2 (+ v_z_142 v_z_1808)) .cse3) (+ .cse4 .cse129 65537))))) .cse11) (or .cse9 (forall ((v_z_142 Int) (v_y_1187 Int) (v_z_1804 Int)) (let ((.cse131 (* 65536 v_y_1187))) (let ((.cse130 (+ .cse4 .cse131))) (or (< .cse6 .cse130) (< (+ (div .cse2 (+ v_z_142 v_z_1804)) .cse3) (+ .cse4 .cse131 1)) (= .cse2 v_z_1804) (< .cse130 (+ .cse3 v_z_1804 .cse8)) (< v_z_142 0) (< v_z_1804 0))))))) .cse1 .cse132) (or .cse111 (and (forall ((v_z_1865 Int) (v_z_113 Int)) (or (< v_z_113 0) (= .cse2 v_z_1865) (< v_z_1865 0) (< .cse4 (+ .cse3 v_z_1865 .cse8 1)) (< (div .cse2 (+ v_z_113 v_z_1865)) (+ v_z_1865 .cse8 1)))) (or (forall ((v_z_113 Int) (v_z_1872 Int)) (let ((.cse133 (div .cse2 (+ v_z_113 v_z_1872)))) (or (= .cse2 v_z_1872) (< v_z_113 0) (< v_z_1872 0) (< .cse133 (+ v_z_1872 .cse8 1)) (< (+ .cse133 .cse3) .cse17) (< 65535 (+ .cse3 v_z_1872 .cse8))))) .cse32) (forall ((v_z_1868 Int) (v_z_113 Int)) (let ((.cse134 (div .cse2 (+ v_z_113 v_z_1868)))) (or (< v_z_113 0) (< v_z_1868 0) (< .cse134 (+ v_z_1868 .cse8 1)) (< (+ .cse134 .cse3) .cse14) (= .cse2 v_z_1868)))) (forall ((v_z_1879 Int) (v_z_113 Int)) (let ((.cse135 (div .cse2 (+ v_z_113 v_z_1879)))) (or (< v_z_113 0) (< .cse135 (+ v_z_1879 .cse8 1)) (= .cse2 v_z_1879) (< .cse15 (+ .cse3 v_z_1879 .cse8)) (< v_z_1879 0) (< (+ .cse3 .cse135) .cse17))))) .cse1))) (or (and .cse136 .cse137 (or (and .cse138 .cse139 .cse140) .cse141) .cse142 (or .cse0 .cse143 .cse1) .cse144 .cse145 .cse146 .cse147) .cse106) (or (and (or (and (or (and (forall ((v_z_1722 Int) (v_z_113 Int) (v_y_1156 Int)) (let ((.cse149 (div .cse2 (+ v_z_113 v_z_1722))) (.cse148 (* 65536 v_y_1156))) (or (< v_z_113 0) (< v_z_1722 0) (= .cse2 v_z_1722) (< (+ .cse148 65535) (+ v_z_1722 .cse8)) (< 0 v_y_1156) (< (+ .cse4 .cse148 65535) (+ .cse3 v_z_1722 .cse8)) (< .cse149 (+ v_z_1722 .cse8 1)) (< (+ .cse149 .cse3) (+ .cse4 2 .cse148))))) (or .cse23 (forall ((v_z_113 Int) (v_y_1156 Int) (v_z_1728 Int)) (let ((.cse150 (div .cse2 (+ v_z_113 v_z_1728))) (.cse151 (* 65536 v_y_1156))) (or (< v_z_113 0) (< (+ .cse150 .cse3) (+ .cse4 65538 .cse151)) (< .cse150 (+ v_z_1728 .cse8 1)) (< 0 v_y_1156) (< (+ .cse151 65535) (+ v_z_1728 .cse8)) (< v_z_1728 0))))) (or .cse18 (forall ((v_z_113 Int) (v_z_1720 Int) (v_y_1156 Int)) (let ((.cse153 (div .cse2 (+ v_z_113 v_z_1720))) (.cse152 (* 65536 v_y_1156))) (or (< v_z_113 0) (< (+ .cse152 65535) (+ v_z_1720 .cse8)) (< .cse153 (+ v_z_1720 .cse8 1)) (< (+ .cse4 .cse152 65535) (+ .cse3 v_z_1720 .cse8)) (< v_z_1720 0) (< .cse3 (+ .cse152 1)) (< (+ .cse3 .cse153) (+ .cse152 65537)))))) (or (forall ((v_z_113 Int) (v_y_1156 Int) (v_z_1738 Int)) (let ((.cse154 (* 65536 v_y_1156)) (.cse155 (div .cse2 (+ v_z_113 v_z_1738)))) (or (< v_z_113 0) (< v_z_1738 0) (< (+ .cse154 65535) (+ v_z_1738 .cse8)) (< (+ .cse155 .cse3) (+ .cse4 65538 .cse154)) (< .cse3 (+ .cse154 1)) (< .cse155 (+ v_z_1738 .cse8 1))))) .cse23) (forall ((v_z_1711 Int) (v_z_113 Int)) (or (< v_z_113 0) (< v_z_1711 0) (< .cse4 (+ .cse3 v_z_1711 .cse8 1)) (< (div .cse2 (+ v_z_113 v_z_1711)) (+ v_z_1711 .cse8 1)) (= .cse2 v_z_1711))) (or .cse32 (forall ((v_z_1735 Int) (v_z_113 Int) (v_y_1156 Int)) (let ((.cse156 (div .cse2 (+ v_z_113 v_z_1735))) (.cse157 (* 65536 v_y_1156))) (or (< v_z_113 0) (= .cse2 v_z_1735) (< 0 v_y_1156) (< .cse156 (+ v_z_1735 .cse8 1)) (< v_z_1735 0) (< (+ .cse157 65535) (+ .cse3 v_z_1735 .cse8)) (< (+ .cse156 .cse3) (+ .cse4 2 .cse157))))))) .cse1) (or (and (or .cse9 (forall ((v_z_1708 Int)) (or (forall ((v_y_1154 Int)) (let ((.cse159 (* 65536 v_y_1154))) (let ((.cse158 (+ .cse4 .cse159))) (or (< .cse158 (+ .cse3 v_z_1708 .cse8)) (< .cse6 .cse158) (forall ((v_z_142 Int)) (or (< (+ (div .cse2 (+ v_z_142 v_z_1708)) .cse3) (+ .cse4 .cse159 1)) (< v_z_142 0))))))) (< .cse2 v_z_1708) (< v_z_1708 0) (= .cse2 v_z_1708)))) (or (forall ((v_z_1708 Int)) (or (< .cse2 v_z_1708) (forall ((v_y_1154 Int)) (let ((.cse160 (* 65536 v_y_1154))) (or (< .cse3 (+ .cse4 .cse160 1)) (forall ((v_z_142 Int)) (or (< (+ (div .cse2 (+ v_z_142 v_z_1708)) .cse3) (+ .cse4 .cse160 65537)) (< v_z_142 0))) (< (+ .cse4 65536 .cse160) (+ .cse3 v_z_1708 .cse8))))) (< v_z_1708 0) (= .cse2 v_z_1708))) .cse11)) .cse1) (or (and (or (forall ((v_z_142 Int) (v_y_1155 Int) (v_z_1680 Int)) (let ((.cse162 (* 65536 v_y_1155))) (let ((.cse161 (+ .cse4 .cse162))) (or (< .cse161 (+ .cse3 v_z_1680 .cse8)) (< (+ (div .cse2 (+ v_z_142 v_z_1680)) .cse3) (+ .cse4 .cse162 1)) (= .cse2 v_z_1680) (< .cse6 .cse161) (< v_z_142 0) (< v_z_1680 0))))) .cse9) (or .cse11 (forall ((v_z_142 Int) (v_y_1155 Int) (v_z_1684 Int)) (let ((.cse163 (* 65536 v_y_1155))) (or (< v_z_1684 0) (< v_z_142 0) (< (+ (div .cse2 (+ v_z_142 v_z_1684)) .cse3) (+ .cse4 .cse163 65537)) (< .cse3 (+ .cse4 .cse163 1)) (< (+ .cse4 65536 .cse163) (+ .cse3 v_z_1684 .cse8))))))) .cse1) (or .cse1 (and (forall ((v_z_1702 Int) (v_z_113 Int)) (let ((.cse164 (div .cse2 (+ v_z_113 v_z_1702)))) (or (< v_z_113 0) (< .cse15 (+ .cse3 v_z_1702 .cse8)) (= .cse2 v_z_1702) (< v_z_1702 0) (< .cse164 (+ v_z_1702 .cse8 1)) (< (+ .cse164 .cse3) .cse17)))) (or .cse32 (forall ((v_z_1697 Int) (v_z_113 Int)) (let ((.cse165 (div .cse2 (+ v_z_113 v_z_1697)))) (or (< v_z_113 0) (< 65535 (+ .cse3 v_z_1697 .cse8)) (= .cse2 v_z_1697) (< .cse165 (+ v_z_1697 .cse8 1)) (< v_z_1697 0) (< (+ .cse165 .cse3) .cse17))))) (or .cse23 (forall ((v_z_113 Int) (v_z_1693 Int)) (let ((.cse166 (div .cse2 (+ v_z_113 v_z_1693)))) (or (< v_z_113 0) (< v_z_1693 0) (< (+ .cse166 .cse3) .cse14) (< .cse166 (+ v_z_1693 .cse8 1)))))) (forall ((v_z_113 Int) (v_z_1690 Int)) (or (< v_z_113 0) (= .cse2 v_z_1690) (< v_z_1690 0) (< (div .cse2 (+ v_z_113 v_z_1690)) (+ v_z_1690 .cse8 1)) (< .cse4 (+ .cse3 v_z_1690 .cse8 1))))))) .cse141) (or .cse1 .cse167 (and (or (forall ((v_z_142 Int) (v_z_1630 Int) (v_y_1153 Int)) (let ((.cse168 (* 65536 v_y_1153))) (or (< (+ (div .cse2 (+ v_z_142 v_z_1630)) .cse3) (+ .cse4 .cse168 65537)) (< (+ .cse4 65536 .cse168) (+ .cse3 v_z_1630 .cse8)) (< .cse3 (+ .cse4 .cse168 1)) (< v_z_142 0) (< v_z_1630 0)))) .cse11) (or (forall ((v_z_1635 Int) (v_z_142 Int) (v_y_1153 Int)) (let ((.cse169 (* 65536 v_y_1153))) (let ((.cse170 (+ .cse4 .cse169))) (or (< (+ (div .cse2 (+ v_z_142 v_z_1635)) .cse3) (+ .cse4 .cse169 1)) (= .cse2 v_z_1635) (< .cse170 (+ .cse3 v_z_1635 .cse8)) (< .cse6 .cse170) (< v_z_1635 0) (< v_z_142 0))))) .cse9))) (or .cse0 (and (forall ((v_z_1663 Int) (v_z_113 Int)) (or (< v_z_113 0) (= .cse2 v_z_1663) (< (div .cse2 (+ v_z_113 v_z_1663)) (+ v_z_1663 .cse8 1)) (< .cse4 (+ .cse3 v_z_1663 .cse8 1)) (< v_z_1663 0))) (forall ((v_z_113 Int) (v_z_1671 Int)) (let ((.cse171 (div .cse2 (+ v_z_113 v_z_1671)))) (or (< v_z_113 0) (< .cse171 (+ v_z_1671 .cse8 1)) (= .cse2 v_z_1671) (< v_z_1671 0) (< .cse15 (+ .cse3 v_z_1671 .cse8)) (< (+ .cse171 .cse3) .cse17)))) (forall ((v_z_1667 Int) (v_z_113 Int)) (let ((.cse172 (div .cse2 (+ v_z_113 v_z_1667)))) (or (< v_z_113 0) (< v_z_1667 0) (< .cse172 (+ v_z_1667 .cse8 1)) (< (+ .cse172 .cse3) .cse14) (= .cse2 v_z_1667))))) .cse1) (or .cse0 .cse1 (and (or (forall ((v_z_142 Int) (v_z_1751 Int) (v_y_1158 Int)) (let ((.cse173 (* 65536 v_y_1158))) (let ((.cse174 (+ .cse4 .cse173))) (or (< (+ (div .cse2 (+ v_z_142 v_z_1751)) .cse3) (+ .cse4 .cse173 1)) (= .cse2 v_z_1751) (< v_z_1751 0) (< .cse6 .cse174) (< v_z_142 0) (< .cse174 (+ .cse3 v_z_1751 .cse8)))))) .cse9) (or (forall ((v_z_142 Int) (v_y_1158 Int) (v_z_1759 Int)) (let ((.cse175 (* 65536 v_y_1158))) (or (< (+ (div .cse2 (+ v_z_142 v_z_1759)) .cse3) (+ .cse4 .cse175 65537)) (< (+ .cse4 65536 .cse175) (+ .cse3 v_z_1759 .cse8)) (< .cse3 (+ .cse4 .cse175 1)) (< v_z_1759 0) (< v_z_142 0)))) .cse11))) (or .cse1 (and (or (forall ((v_z_113 Int) (v_z_1651 Int)) (let ((.cse176 (div .cse2 (+ v_z_113 v_z_1651)))) (or (< v_z_113 0) (< 65535 (+ .cse3 v_z_1651 .cse8)) (< .cse176 (+ v_z_1651 .cse8 1)) (< v_z_1651 0) (= .cse2 v_z_1651) (< (+ .cse176 .cse3) .cse17)))) .cse32) (forall ((v_z_113 Int) (v_z_1644 Int)) (or (< v_z_1644 0) (< v_z_113 0) (< (div .cse2 (+ v_z_113 v_z_1644)) (+ v_z_1644 .cse8 1)) (= .cse2 v_z_1644) (< .cse4 (+ .cse3 v_z_1644 .cse8 1)))) (forall ((v_z_1656 Int) (v_z_113 Int)) (let ((.cse177 (div .cse2 (+ v_z_113 v_z_1656)))) (or (< v_z_113 0) (< .cse177 (+ v_z_1656 .cse8 1)) (= .cse2 v_z_1656) (< (+ .cse177 .cse3) .cse17) (< .cse15 (+ .cse3 v_z_1656 .cse8)) (< v_z_1656 0)))) (forall ((v_z_1646 Int) (v_z_113 Int)) (let ((.cse178 (div .cse2 (+ v_z_113 v_z_1646)))) (or (< v_z_113 0) (= .cse2 v_z_1646) (< .cse178 (+ v_z_1646 .cse8 1)) (< v_z_1646 0) (< (+ .cse178 .cse3) .cse14))))) .cse167) (or .cse0 (and (or (forall ((v_z_142 Int) (v_y_1161 Int) (v_z_1639 Int)) (let ((.cse179 (* 65536 v_y_1161))) (or (< .cse3 (+ .cse4 .cse179 1)) (< v_z_1639 0) (< v_z_142 0) (< (+ (div .cse2 (+ v_z_142 v_z_1639)) .cse3) (+ .cse4 .cse179 65537)) (< (+ .cse4 65536 .cse179) (+ .cse3 v_z_1639 .cse8))))) .cse11) (or .cse9 (forall ((v_z_142 Int) (v_y_1161 Int) (v_z_1639 Int)) (let ((.cse181 (* 65536 v_y_1161))) (let ((.cse180 (+ .cse4 .cse181))) (or (= .cse2 v_z_1639) (< .cse180 (+ .cse3 v_z_1639 .cse8)) (< v_z_1639 0) (< .cse6 .cse180) (< v_z_142 0) (< (+ (div .cse2 (+ v_z_142 v_z_1639)) .cse3) (+ .cse4 .cse181 1)))))))) .cse1) (or .cse0 (and (or .cse23 (forall ((v_z_1785 Int) (v_z_113 Int) (v_y_1159 Int)) (let ((.cse183 (div .cse2 (+ v_z_113 v_z_1785))) (.cse182 (* 65536 v_y_1159))) (or (< v_z_113 0) (< .cse3 (+ .cse4 2 .cse182)) (< (+ .cse3 .cse183) (+ .cse4 65538 .cse182)) (< .cse183 (+ v_z_1785 .cse8 1)) (< (+ .cse182 65535) (+ v_z_1785 .cse8)) (< v_z_1785 0))))) (or (forall ((v_z_1769 Int) (v_z_113 Int)) (or (< v_z_113 0) (< v_z_1769 0) (= .cse2 v_z_1769) (< .cse4 (+ .cse3 v_z_1769 .cse8 1)) (< (div .cse2 (+ v_z_113 v_z_1769)) (+ v_z_1769 .cse8 1)))) .cse50) (or .cse23 (forall ((v_z_113 Int) (v_z_1773 Int) (v_y_1159 Int)) (let ((.cse184 (div .cse2 (+ v_z_113 v_z_1773))) (.cse185 (* 65536 v_y_1159))) (or (< v_z_113 0) (< .cse184 (+ v_z_1773 .cse8 1)) (< (+ .cse184 .cse3) (+ .cse4 65538 .cse185)) (< v_z_1773 0) (< .cse3 (+ .cse185 1)) (< (+ .cse185 65535) (+ v_z_1773 .cse8)))))) (forall ((v_z_113 Int) (v_z_1780 Int) (v_y_1159 Int)) (let ((.cse186 (div .cse2 (+ v_z_113 v_z_1780))) (.cse187 (* 65536 v_y_1159))) (or (< v_z_113 0) (= .cse2 v_z_1780) (< 0 v_y_1159) (< .cse186 (+ v_z_1780 .cse8 1)) (< v_z_1780 0) (< (+ .cse186 .cse3) (+ .cse4 2 .cse187)) (< (+ .cse187 65535) (+ v_z_1780 .cse8)) (< (+ .cse4 .cse187 65535) (+ .cse3 v_z_1780 .cse8))))) (or .cse18 (forall ((v_z_113 Int) (v_z_1791 Int) (v_y_1159 Int)) (let ((.cse188 (div .cse2 (+ v_z_113 v_z_1791))) (.cse189 (* 65536 v_y_1159))) (or (< v_z_113 0) (< .cse188 (+ v_z_1791 .cse8 1)) (< (+ .cse189 65535) (+ v_z_1791 .cse8)) (< v_z_1791 0) (< (+ .cse4 .cse189 65535) (+ .cse3 v_z_1791 .cse8)) (< .cse3 (+ .cse189 1)) (< (+ .cse188 .cse3) (+ .cse189 65537)))))) (or (forall ((v_z_1789 Int) (v_z_113 Int) (v_y_1159 Int)) (let ((.cse190 (* 65536 v_y_1159)) (.cse191 (div .cse2 (+ v_z_113 v_z_1789)))) (or (< v_z_113 0) (< 0 v_y_1159) (= .cse2 v_z_1789) (< v_z_1789 0) (< (+ .cse190 65535) (+ .cse3 v_z_1789 .cse8)) (< (+ .cse3 .cse191) (+ .cse4 2 .cse190)) (< .cse191 (+ v_z_1789 .cse8 1))))) .cse32)) .cse1)) .cse106) (or .cse54 (and (or .cse0 (and .cse137 .cse138 .cse139 .cse146 .cse147 .cse140)) (or (and .cse137 (or .cse143 .cse1) .cse139 .cse146 .cse147 .cse140) .cse53))) (or (and (or (and (or (and (forall ((v_z_113 Int) (v_z_1951 Int)) (let ((.cse192 (div .cse2 (+ v_z_113 v_z_1951)))) (or (< v_z_113 0) (< (+ .cse192 .cse3) .cse17) (= .cse2 v_z_1951) (< .cse192 (+ v_z_1951 .cse8 1)) (< .cse15 (+ .cse3 v_z_1951 .cse8)) (< v_z_1951 0)))) (forall ((v_z_113 Int) (v_z_1940 Int)) (or (< v_z_113 0) (= .cse2 v_z_1940) (< v_z_1940 0) (< .cse4 (+ .cse3 v_z_1940 .cse8 1)) (< (div .cse2 (+ v_z_113 v_z_1940)) (+ v_z_1940 .cse8 1)))) (or .cse18 (forall ((v_z_113 Int) (v_z_1952 Int)) (let ((.cse193 (div .cse2 (+ v_z_113 v_z_1952)))) (or (< v_z_113 0) (< .cse15 (+ .cse3 v_z_1952 .cse8)) (< .cse193 (+ v_z_1952 .cse8 1)) (< (+ .cse193 .cse3) 65537) (= .cse2 v_z_1952) (< v_z_1952 0))))) (or .cse23 (forall ((v_z_1943 Int) (v_z_113 Int)) (let ((.cse194 (div .cse2 (+ v_z_113 v_z_1943)))) (or (< v_z_113 0) (< (+ .cse3 .cse194) .cse14) (< v_z_1943 0) (< .cse194 (+ v_z_1943 .cse8 1))))))) .cse1) (or (and (or (forall ((v_z_142 Int) (v_y_1163 Int) (v_z_1930 Int)) (let ((.cse195 (* 65536 v_y_1163))) (or (< (+ (div .cse2 (+ v_z_142 v_z_1930)) .cse3) (+ .cse4 .cse195 65537)) (< .cse3 (+ .cse4 .cse195 1)) (< (+ .cse4 65536 .cse195) (+ .cse3 v_z_1930 .cse8)) (< v_z_142 0) (< v_z_1930 0)))) .cse11) (or (forall ((v_z_142 Int) (v_z_1933 Int) (v_y_1163 Int)) (let ((.cse197 (* 65536 v_y_1163))) (let ((.cse196 (+ .cse4 .cse197))) (or (< v_z_1933 0) (< .cse196 (+ .cse3 v_z_1933 .cse8)) (= .cse2 v_z_1933) (< v_z_142 0) (< (+ (div .cse2 (+ v_z_142 v_z_1933)) .cse3) (+ .cse4 .cse197 1)) (< .cse6 .cse196))))) .cse9)) .cse1)) .cse53) (or (and (forall ((v_z_1987 Int)) (or (= .cse2 v_z_1987) (< .cse2 v_z_1987) (< v_z_1987 0) (forall ((v_z_113 Int)) (let ((.cse198 (div .cse2 (+ v_z_113 v_z_1987)))) (or (< v_z_113 0) (< .cse198 (+ v_z_1987 .cse8 1)) (< (+ .cse3 .cse198) .cse17)))) (< .cse15 (+ .cse3 v_z_1987 .cse8)))) (or .cse23 (forall ((v_z_1987 Int) (v_z_113 Int)) (let ((.cse199 (div .cse2 (+ v_z_113 v_z_1987)))) (or (< v_z_113 0) (< .cse199 (+ v_z_1987 .cse8 1)) (< v_z_1987 0) (< (+ .cse3 .cse199) .cse14))))) (forall ((v_z_1987 Int)) (or (= .cse2 v_z_1987) (< .cse2 v_z_1987) (< .cse4 (+ .cse3 v_z_1987 .cse8 1)) (forall ((v_z_113 Int)) (or (< v_z_113 0) (< (div .cse2 (+ v_z_113 v_z_1987)) (+ v_z_1987 .cse8 1)))) (< v_z_1987 0)))) .cse64 .cse1) (or .cse68 .cse1 (and (or (forall ((v_z_142 Int) (v_z_1995 Int) (v_y_1168 Int)) (let ((.cse200 (* 65536 v_y_1168))) (or (< (+ .cse4 65536 .cse200) (+ .cse3 v_z_1995 .cse8)) (< (+ (div .cse2 (+ v_z_142 v_z_1995)) .cse3) (+ .cse4 .cse200 65537)) (< v_z_142 0) (< v_z_1995 0) (< .cse3 (+ .cse4 .cse200 1))))) .cse11) (or .cse9 (forall ((v_z_142 Int) (v_y_1168 Int) (v_z_1991 Int)) (let ((.cse202 (* 65536 v_y_1168))) (let ((.cse201 (+ .cse4 .cse202))) (or (< .cse6 .cse201) (= .cse2 v_z_1991) (< v_z_1991 0) (< (+ (div .cse2 (+ v_z_142 v_z_1991)) .cse3) (+ .cse4 .cse202 1)) (< v_z_142 0) (< .cse201 (+ .cse3 v_z_1991 .cse8))))))))) (or .cse68 (and (forall ((v_z_113 Int) (v_z_1960 Int)) (or (< v_z_113 0) (< (div .cse2 (+ v_z_113 v_z_1960)) (+ v_z_1960 .cse8 1)) (= .cse2 v_z_1960) (< .cse4 (+ .cse3 v_z_1960 .cse8 1)) (< v_z_1960 0))) (forall ((v_z_1964 Int) (v_z_113 Int)) (let ((.cse203 (div .cse2 (+ v_z_113 v_z_1964)))) (or (< v_z_113 0) (< (+ .cse203 .cse3) .cse14) (< v_z_1964 0) (= .cse2 v_z_1964) (< .cse203 (+ v_z_1964 .cse8 1))))) (or (forall ((v_z_1967 Int) (v_z_113 Int)) (let ((.cse204 (div .cse2 (+ v_z_113 v_z_1967)))) (or (< v_z_113 0) (< v_z_1967 0) (< (+ .cse204 .cse3) .cse17) (< 65535 (+ .cse3 v_z_1967 .cse8)) (< .cse204 (+ v_z_1967 .cse8 1)) (= .cse2 v_z_1967)))) .cse32) (forall ((v_z_113 Int) (v_z_1973 Int)) (let ((.cse205 (div .cse2 (+ v_z_113 v_z_1973)))) (or (< v_z_113 0) (< .cse15 (+ .cse3 v_z_1973 .cse8)) (< (+ .cse205 .cse3) .cse17) (< .cse205 (+ v_z_1973 .cse8 1)) (= .cse2 v_z_1973) (< v_z_1973 0))))) .cse1) (or .cse64 (and (or (forall ((v_z_142 Int) (v_z_1986 Int) (v_y_1166 Int)) (let ((.cse206 (* 65536 v_y_1166))) (or (< (+ (div .cse2 (+ v_z_142 v_z_1986)) .cse3) (+ .cse4 .cse206 65537)) (< .cse3 (+ .cse4 .cse206 1)) (< v_z_1986 0) (< (+ .cse4 65536 .cse206) (+ .cse3 v_z_1986 .cse8)) (< v_z_142 0)))) .cse11) (or .cse9 (forall ((v_z_142 Int) (v_y_1166 Int) (v_z_1981 Int)) (let ((.cse207 (* 65536 v_y_1166))) (let ((.cse208 (+ .cse4 .cse207))) (or (= .cse2 v_z_1981) (< (+ (div .cse2 (+ v_z_142 v_z_1981)) .cse3) (+ .cse4 .cse207 1)) (< .cse208 (+ .cse3 v_z_1981 .cse8)) (< .cse6 .cse208) (< v_z_142 0) (< v_z_1981 0))))))) .cse1)) .cse106) (or .cse106 (and .cse209 .cse210 .cse211 .cse212 .cse213 .cse214 .cse215 .cse216)))))) (and .cse218 .cse225)) (or (not .cse225) (not .cse218) (and (or .cse54 (let ((.cse226 (and .cse137 .cse139 .cse146 .cse147 .cse140))) (and (or .cse0 .cse226) (or .cse226 .cse53)))) (or (and (or (and (or (forall ((v_z_142 Int) (v_y_1031 Int) (v_z_1486 Int)) (let ((.cse227 (* 65536 v_y_1031))) (or (< (+ (div .cse2 (+ v_z_142 v_z_1486)) .cse3) (+ .cse4 .cse227 65537)) (< v_z_142 0) (< v_z_1486 0) (< (+ .cse4 .cse227 65536) (+ .cse3 v_z_1486 .cse8)) (< .cse3 (+ .cse4 .cse227 1))))) .cse11) (or (forall ((v_z_142 Int) (v_y_1031 Int) (v_z_1487 Int)) (let ((.cse229 (* 65536 v_y_1031))) (let ((.cse228 (+ .cse4 .cse229))) (or (= .cse2 v_z_1487) (< .cse228 (+ .cse3 v_z_1487 .cse8)) (< .cse6 .cse228) (< v_z_142 0) (< v_z_1487 0) (< (+ (div .cse2 (+ v_z_142 v_z_1487)) .cse3) (+ .cse4 .cse229 1)))))) .cse9)) .cse1 .cse167) (or .cse0 .cse1 (and (or (forall ((v_z_142 Int) (v_z_1473 Int) (v_y_1035 Int)) (let ((.cse230 (* 65536 v_y_1035))) (or (< (+ (div .cse2 (+ v_z_142 v_z_1473)) .cse3) (+ .cse4 .cse230 65537)) (< (+ .cse4 65536 .cse230) (+ .cse3 v_z_1473 .cse8)) (< .cse3 (+ .cse4 .cse230 1)) (< v_z_142 0) (< v_z_1473 0)))) .cse11) (or .cse9 (forall ((v_z_142 Int) (v_y_1035 Int) (v_z_1475 Int)) (let ((.cse231 (* 65536 v_y_1035))) (let ((.cse232 (+ .cse4 .cse231))) (or (< (+ (div .cse2 (+ v_z_142 v_z_1475)) .cse3) (+ .cse4 .cse231 1)) (= .cse2 v_z_1475) (< v_z_1475 0) (< .cse6 .cse232) (< v_z_142 0) (< .cse232 (+ .cse3 v_z_1475 .cse8))))))))) (or (and (or (forall ((v_z_113 Int) (v_z_1463 Int)) (let ((.cse233 (div .cse2 (+ v_z_113 v_z_1463)))) (or (< v_z_113 0) (< 65535 (+ .cse3 v_z_1463 .cse8)) (< v_z_1463 0) (< (+ .cse233 .cse3) .cse17) (= .cse2 v_z_1463) (< .cse233 (+ v_z_1463 .cse8 1))))) .cse32) (forall ((v_z_113 Int) (v_z_1464 Int)) (let ((.cse234 (div .cse2 (+ v_z_113 v_z_1464)))) (or (< v_z_113 0) (= .cse2 v_z_1464) (< .cse234 (+ v_z_1464 .cse8 1)) (< (+ .cse234 .cse3) .cse17) (< .cse15 (+ .cse3 v_z_1464 .cse8)) (< v_z_1464 0)))) (forall ((v_z_1455 Int) (v_z_113 Int)) (let ((.cse235 (div .cse2 (+ v_z_113 v_z_1455)))) (or (< v_z_113 0) (= .cse2 v_z_1455) (< v_z_1455 0) (< .cse235 (+ v_z_1455 .cse8 1)) (< (+ .cse235 .cse3) .cse14)))) (forall ((v_z_113 Int) (v_z_1451 Int)) (or (< v_z_113 0) (< (div .cse2 (+ v_z_113 v_z_1451)) (+ v_z_1451 .cse8 1)) (< .cse4 (+ .cse3 v_z_1451 .cse8 1)) (< v_z_1451 0) (= .cse2 v_z_1451)))) .cse1 .cse167) (or .cse141 (and (or (and (or (forall ((v_z_142 Int) (v_y_1033 Int) (v_z_1480 Int)) (let ((.cse237 (* 65536 v_y_1033))) (let ((.cse236 (+ .cse237 .cse4))) (or (< .cse6 .cse236) (< .cse236 (+ .cse3 v_z_1480 .cse8)) (= .cse2 v_z_1480) (< v_z_1480 0) (< (+ (div .cse2 (+ v_z_142 v_z_1480)) .cse3) (+ .cse237 .cse4 1)) (< v_z_142 0))))) .cse9) (or (forall ((v_z_142 Int) (v_y_1033 Int) (v_z_1480 Int)) (let ((.cse238 (* 65536 v_y_1033))) (or (< .cse3 (+ .cse238 .cse4 1)) (< v_z_1480 0) (< (+ .cse238 .cse4 65536) (+ .cse3 v_z_1480 .cse8)) (< (+ (div .cse2 (+ v_z_142 v_z_1480)) .cse3) (+ .cse238 .cse4 65537)) (< v_z_142 0)))) .cse11)) .cse1) (or (and (forall ((v_z_1480 Int)) (or (forall ((v_z_113 Int)) (let ((.cse239 (div .cse2 (+ v_z_113 v_z_1480)))) (or (< (+ .cse239 .cse3) .cse17) (< .cse239 (+ v_z_1480 .cse8 1)) (< v_z_113 0)))) (= .cse2 v_z_1480) (< v_z_1480 0) (< .cse2 v_z_1480) (< .cse15 (+ .cse3 v_z_1480 .cse8)))) (forall ((v_z_1480 Int)) (or (forall ((v_z_113 Int)) (or (< (div .cse2 (+ v_z_113 v_z_1480)) (+ v_z_1480 .cse8 1)) (< v_z_113 0))) (< .cse4 (+ .cse3 v_z_1480 .cse8 1)) (= .cse2 v_z_1480) (< v_z_1480 0) (< .cse2 v_z_1480))) (forall ((v_z_1480 Int)) (or (forall ((v_z_113 Int)) (let ((.cse240 (div .cse2 (+ v_z_113 v_z_1480)))) (or (< .cse240 (+ v_z_1480 .cse8 1)) (< v_z_113 0) (< (+ .cse240 .cse3) .cse14)))) (= .cse2 v_z_1480) (< v_z_1480 0) (< .cse2 v_z_1480)))) .cse1))) (or .cse0 (and (forall ((v_z_1491 Int)) (or (forall ((v_z_113 Int)) (let ((.cse241 (div .cse2 (+ v_z_113 v_z_1491)))) (or (< v_z_113 0) (< .cse241 (+ v_z_1491 .cse8 1)) (< (+ .cse241 .cse3) .cse17)))) (< .cse15 (+ .cse3 v_z_1491 .cse8)) (= .cse2 v_z_1491) (< .cse2 v_z_1491) (< v_z_1491 0))) (or .cse23 (forall ((v_z_113 Int) (v_z_1491 Int)) (let ((.cse242 (div .cse2 (+ v_z_113 v_z_1491)))) (or (< v_z_113 0) (< .cse242 (+ v_z_1491 .cse8 1)) (< (+ .cse242 .cse3) .cse14) (< v_z_1491 0))))) (forall ((v_z_1491 Int)) (or (< .cse4 (+ .cse3 v_z_1491 .cse8 1)) (= .cse2 v_z_1491) (< .cse2 v_z_1491) (< v_z_1491 0) (forall ((v_z_113 Int)) (or (< v_z_113 0) (< (div .cse2 (+ v_z_113 v_z_1491)) (+ v_z_1491 .cse8 1))))))) .cse1)) .cse106) .cse80 (or .cse106 (let ((.cse250 (or .cse23 (forall ((v_z_113 Int) (v_z_1199 Int)) (let ((.cse261 (div .cse2 (+ v_z_113 v_z_1199)))) (or (< v_z_113 0) (< .cse261 (+ v_z_1199 .cse8 1)) (< v_z_1199 0) (< (+ .cse261 .cse3) .cse14)))))) (.cse251 (forall ((v_z_1199 Int)) (or (forall ((v_z_113 Int)) (or (< v_z_113 0) (< (div .cse2 (+ v_z_113 v_z_1199)) (+ v_z_1199 .cse8 1)))) (< .cse4 (+ .cse3 v_z_1199 .cse8 1)) (< v_z_1199 0) (< .cse2 v_z_1199) (= .cse2 v_z_1199)))) (.cse252 (forall ((v_z_1199 Int)) (or (forall ((v_z_113 Int)) (let ((.cse260 (div .cse2 (+ v_z_113 v_z_1199)))) (or (< v_z_113 0) (< (+ .cse260 .cse3) .cse17) (< .cse260 (+ v_z_1199 .cse8 1))))) (< v_z_1199 0) (< .cse2 v_z_1199) (= .cse2 v_z_1199) (< .cse15 (+ .cse3 v_z_1199 .cse8)))))) (let ((.cse243 (and (or .cse18 (forall ((v_z_113 Int) (v_z_1199 Int)) (let ((.cse259 (div .cse2 (+ v_z_113 v_z_1199)))) (or (< v_z_113 0) (< .cse259 (+ v_z_1199 .cse8 1)) (< v_z_1199 0) (= .cse2 v_z_1199) (< (+ .cse259 .cse3) 65537) (< .cse15 (+ .cse3 v_z_1199 .cse8)))))) .cse250 .cse251 .cse252))) (and (or .cse91 .cse243 .cse1) (or .cse55 .cse1 (and (or .cse9 (forall ((v_z_142 Int) (v_y_1058 Int) (v_z_1199 Int)) (let ((.cse244 (* 65536 v_y_1058))) (let ((.cse245 (+ .cse4 .cse244))) (or (< (+ (div .cse2 (+ v_z_142 v_z_1199)) .cse3) (+ .cse4 .cse244 1)) (< .cse6 .cse245) (< v_z_1199 0) (= .cse2 v_z_1199) (< v_z_142 0) (< .cse245 (+ .cse3 v_z_1199 .cse8))))))) (or .cse11 (forall ((v_z_142 Int) (v_y_1058 Int) (v_z_1199 Int)) (let ((.cse246 (* 65536 v_y_1058))) (or (< .cse3 (+ .cse4 .cse246 1)) (< v_z_1199 0) (< (+ .cse4 65536 .cse246) (+ .cse3 v_z_1199 .cse8)) (< v_z_142 0) (< (+ (div .cse2 (+ v_z_142 v_z_1199)) .cse3) (+ .cse4 .cse246 65537)))))))) (or (and (or .cse243 .cse1) (or (and (or (forall ((v_z_142 Int) (v_y_1056 Int) (v_z_1199 Int)) (let ((.cse247 (* 65536 v_y_1056))) (or (< v_z_1199 0) (< .cse3 (+ .cse247 .cse4 1)) (< (+ (div .cse2 (+ v_z_142 v_z_1199)) .cse3) (+ .cse247 .cse4 65537)) (< v_z_142 0) (< (+ .cse247 .cse4 65536) (+ .cse3 v_z_1199 .cse8))))) .cse11) (or .cse9 (forall ((v_z_142 Int) (v_y_1056 Int) (v_z_1199 Int)) (let ((.cse249 (* 65536 v_y_1056))) (let ((.cse248 (+ .cse249 .cse4))) (or (< .cse248 (+ .cse3 v_z_1199 .cse8)) (< v_z_1199 0) (= .cse2 v_z_1199) (< (+ (div .cse2 (+ v_z_142 v_z_1199)) .cse3) (+ .cse249 .cse4 1)) (< v_z_142 0) (< .cse6 .cse248))))))) .cse1)) .cse101) (or .cse81 (and .cse250 .cse251 .cse252) .cse82 .cse1) (or .cse243 .cse81 .cse1) (or (and (or (forall ((v_z_142 Int) (v_y_1054 Int) (v_z_1199 Int)) (let ((.cse253 (* 65536 v_y_1054))) (or (< (+ (div .cse2 (+ v_z_142 v_z_1199)) .cse3) (+ .cse4 65537 .cse253)) (< (+ .cse4 65536 .cse253) (+ .cse3 v_z_1199 .cse8)) (< v_z_1199 0) (< v_z_142 0) (< .cse3 (+ .cse4 1 .cse253))))) .cse11) (or (forall ((v_z_142 Int) (v_y_1054 Int) (v_z_1199 Int)) (let ((.cse254 (* 65536 v_y_1054))) (let ((.cse255 (+ .cse4 .cse254))) (or (< (+ (div .cse2 (+ v_z_142 v_z_1199)) .cse3) (+ .cse4 1 .cse254)) (< v_z_1199 0) (< .cse255 (+ .cse3 v_z_1199 .cse8)) (= .cse2 v_z_1199) (< v_z_142 0) (< .cse6 .cse255))))) .cse9)) .cse1 .cse87) (or (and (or (forall ((v_z_142 Int) (v_y_1055 Int) (v_z_1199 Int)) (let ((.cse256 (* 65536 v_y_1055))) (or (< v_z_1199 0) (< (+ .cse4 .cse256 65536) (+ .cse3 v_z_1199 .cse8)) (< v_z_142 0) (< .cse3 (+ .cse4 .cse256 1)) (< (+ (div .cse2 (+ v_z_142 v_z_1199)) .cse3) (+ .cse4 .cse256 65537))))) .cse11) (or .cse9 (forall ((v_z_142 Int) (v_y_1055 Int) (v_z_1199 Int)) (let ((.cse258 (* 65536 v_y_1055))) (let ((.cse257 (+ .cse4 .cse258))) (or (< v_z_1199 0) (< .cse6 .cse257) (< (+ (div .cse2 (+ v_z_142 v_z_1199)) .cse3) (+ .cse4 .cse258 1)) (= .cse2 v_z_1199) (< v_z_142 0) (< .cse257 (+ .cse3 v_z_1199 .cse8)))))))) .cse81 .cse1))))) (or (and (or .cse68 .cse1 (and (forall ((v_z_113 Int) (v_z_1281 Int)) (let ((.cse262 (div .cse2 (+ v_z_113 v_z_1281)))) (or (< v_z_113 0) (= .cse2 v_z_1281) (< (+ .cse262 .cse3) .cse17) (< v_z_1281 0) (< .cse15 (+ .cse3 v_z_1281 .cse8)) (< .cse262 (+ v_z_1281 .cse8 1))))) (forall ((v_z_113 Int) (v_z_1273 Int)) (or (< v_z_113 0) (< v_z_1273 0) (= .cse2 v_z_1273) (< .cse4 (+ .cse3 v_z_1273 .cse8 1)) (< (div .cse2 (+ v_z_113 v_z_1273)) (+ v_z_1273 .cse8 1)))) (forall ((v_z_113 Int) (v_z_1276 Int)) (let ((.cse263 (div .cse2 (+ v_z_113 v_z_1276)))) (or (< v_z_113 0) (= .cse2 v_z_1276) (< (+ .cse263 .cse3) .cse14) (< v_z_1276 0) (< .cse263 (+ v_z_1276 .cse8 1))))))) (or (and (or .cse11 (forall ((v_z_142 Int) (v_y_1040 Int) (v_z_1287 Int)) (let ((.cse264 (* 65536 v_y_1040))) (or (< v_z_1287 0) (< .cse3 (+ .cse4 .cse264 1)) (< (+ (div .cse2 (+ v_z_142 v_z_1287)) .cse3) (+ .cse4 .cse264 65537)) (< v_z_142 0) (< (+ .cse4 65536 .cse264) (+ .cse3 v_z_1287 .cse8)))))) (or .cse9 (forall ((v_z_142 Int) (v_y_1040 Int) (v_z_1294 Int)) (let ((.cse266 (* 65536 v_y_1040))) (let ((.cse265 (+ .cse4 .cse266))) (or (< .cse265 (+ .cse3 v_z_1294 .cse8)) (< (+ (div .cse2 (+ v_z_142 v_z_1294)) .cse3) (+ .cse4 .cse266 1)) (< v_z_1294 0) (< .cse6 .cse265) (< v_z_142 0) (= .cse2 v_z_1294))))))) .cse64 .cse1) (or (and (or (forall ((v_z_142 Int) (v_y_1042 Int) (v_z_1310 Int)) (let ((.cse267 (* 65536 v_y_1042))) (or (< (+ (div .cse2 (+ v_z_142 v_z_1310)) .cse3) (+ .cse267 .cse4 65537)) (< v_z_1310 0) (< .cse3 (+ .cse267 .cse4 1)) (< v_z_142 0) (< (+ .cse267 .cse4 65536) (+ .cse3 v_z_1310 .cse8))))) .cse11) (or (forall ((v_z_142 Int) (v_y_1042 Int) (v_z_1310 Int)) (let ((.cse269 (* 65536 v_y_1042))) (let ((.cse268 (+ .cse269 .cse4))) (or (< .cse268 (+ .cse3 v_z_1310 .cse8)) (= .cse2 v_z_1310) (< v_z_1310 0) (< .cse6 .cse268) (< (+ (div .cse2 (+ v_z_142 v_z_1310)) .cse3) (+ .cse269 .cse4 1)) (< v_z_142 0))))) .cse9)) .cse68 .cse1) (or .cse64 .cse1 (and (forall ((v_z_113 Int) (v_z_1299 Int)) (or (< v_z_113 0) (= .cse2 v_z_1299) (< v_z_1299 0) (< (div .cse2 (+ v_z_113 v_z_1299)) (+ v_z_1299 .cse8 1)) (< .cse4 (+ .cse3 v_z_1299 .cse8 1)))) (forall ((v_z_1301 Int) (v_z_113 Int)) (let ((.cse270 (div .cse2 (+ v_z_113 v_z_1301)))) (or (< v_z_113 0) (< .cse270 (+ v_z_1301 .cse8 1)) (= .cse2 v_z_1301) (< (+ .cse270 .cse3) .cse14) (< v_z_1301 0)))) (forall ((v_z_1307 Int) (v_z_113 Int)) (let ((.cse271 (div .cse2 (+ v_z_113 v_z_1307)))) (or (< v_z_113 0) (< (+ .cse271 .cse3) .cse17) (< .cse271 (+ v_z_1307 .cse8 1)) (< .cse15 (+ .cse3 v_z_1307 .cse8)) (< v_z_1307 0) (= .cse2 v_z_1307)))))) (or (and (or (and (or (forall ((v_z_142 Int) (v_z_1317 Int) (v_y_1037 Int)) (let ((.cse272 (* 65536 v_y_1037))) (or (< (+ .cse4 65536 .cse272) (+ .cse3 v_z_1317 .cse8)) (< (+ (div .cse2 (+ v_z_142 v_z_1317)) .cse3) (+ .cse4 .cse272 65537)) (< .cse3 (+ .cse4 .cse272 1)) (< v_z_1317 0) (< v_z_142 0)))) .cse11) (or .cse9 (forall ((v_z_142 Int) (v_z_1323 Int) (v_y_1037 Int)) (let ((.cse273 (* 65536 v_y_1037))) (let ((.cse274 (+ .cse4 .cse273))) (or (< (+ (div .cse2 (+ v_z_142 v_z_1323)) .cse3) (+ .cse4 .cse273 1)) (< v_z_1323 0) (< .cse6 .cse274) (< .cse274 (+ .cse3 v_z_1323 .cse8)) (= .cse2 v_z_1323) (< v_z_142 0))))))) .cse1) (or (and (forall ((v_z_1328 Int) (v_z_113 Int)) (let ((.cse275 (div .cse2 (+ v_z_113 v_z_1328)))) (or (< .cse275 (+ v_z_1328 .cse8 1)) (< v_z_113 0) (< (+ .cse3 .cse275) .cse17) (= .cse2 v_z_1328) (< v_z_1328 0) (< 65535 (+ .cse3 v_z_1328 .cse8))))) (or .cse18 (forall ((v_z_1339 Int) (v_z_113 Int)) (let ((.cse276 (div .cse2 (+ v_z_113 v_z_1339)))) (or (< v_z_113 0) (< v_z_1339 0) (< .cse15 (+ .cse3 v_z_1339 .cse8)) (< .cse276 (+ v_z_1339 .cse8 1)) (< (+ .cse276 .cse3) 65537) (= .cse2 v_z_1339))))) (or .cse23 (forall ((v_z_113 Int) (v_z_1335 Int)) (let ((.cse277 (div .cse2 (+ v_z_113 v_z_1335)))) (or (< v_z_113 0) (< .cse277 (+ v_z_1335 .cse8 1)) (< (+ .cse277 .cse3) .cse14) (< v_z_1335 0))))) (forall ((v_z_1334 Int) (v_z_113 Int)) (or (< v_z_113 0) (< (div .cse2 (+ v_z_113 v_z_1334)) (+ v_z_1334 .cse8 1)) (< .cse4 (+ .cse3 v_z_1334 .cse8 1)) (= .cse2 v_z_1334) (< v_z_1334 0)))) .cse1)) .cse53)) .cse106) (or (and (or .cse1 (and (or .cse9 (forall ((v_z_142 Int) (v_y_1061 Int) (v_z_1263 Int)) (let ((.cse278 (* 65536 v_y_1061))) (let ((.cse279 (+ .cse4 .cse278))) (or (< v_z_1263 0) (< (+ (div .cse2 (+ v_z_142 v_z_1263)) .cse3) (+ .cse4 .cse278 1)) (< .cse279 (+ .cse3 v_z_1263 .cse8)) (= .cse2 v_z_1263) (< .cse6 .cse279) (< v_z_142 0)))))) (or (forall ((v_z_142 Int) (v_y_1061 Int) (v_z_1264 Int)) (let ((.cse280 (* 65536 v_y_1061))) (or (< v_z_1264 0) (< (+ (div .cse2 (+ v_z_142 v_z_1264)) .cse3) (+ .cse4 .cse280 65537)) (< .cse3 (+ .cse4 .cse280 1)) (< v_z_142 0) (< (+ .cse4 .cse280 65536) (+ .cse3 v_z_1264 .cse8))))) .cse11)) .cse132) (or .cse111 (and (forall ((v_z_113 Int) (v_z_1214 Int)) (or (< v_z_113 0) (< .cse4 (+ .cse3 v_z_1214 .cse8 1)) (< (div .cse2 (+ v_z_113 v_z_1214)) (+ v_z_1214 .cse8 1)) (< v_z_1214 0) (= .cse2 v_z_1214))) (forall ((v_z_1207 Int) (v_z_113 Int)) (let ((.cse281 (div .cse2 (+ v_z_113 v_z_1207)))) (or (< v_z_113 0) (< v_z_1207 0) (= .cse2 v_z_1207) (< (+ .cse281 .cse3) .cse17) (< .cse281 (+ v_z_1207 .cse8 1)) (< 65535 (+ .cse3 v_z_1207 .cse8))))) (or .cse23 (forall ((v_z_113 Int) (v_z_1215 Int)) (let ((.cse282 (div .cse2 (+ v_z_113 v_z_1215)))) (or (< v_z_113 0) (< (+ .cse282 .cse3) .cse14) (< .cse282 (+ v_z_1215 .cse8 1)) (< v_z_1215 0))))) (or (forall ((v_z_1219 Int) (v_z_113 Int)) (let ((.cse283 (div .cse2 (+ v_z_113 v_z_1219)))) (or (< v_z_113 0) (= .cse2 v_z_1219) (< .cse15 (+ .cse3 v_z_1219 .cse8)) (< (+ .cse283 .cse3) 65537) (< v_z_1219 0) (< .cse283 (+ v_z_1219 .cse8 1))))) .cse18)) .cse1) (or .cse107 (and (forall ((v_z_1202 Int)) (or (< .cse15 (+ .cse3 v_z_1202 .cse8)) (= .cse2 v_z_1202) (< v_z_1202 0) (< .cse2 v_z_1202) (forall ((v_z_113 Int)) (let ((.cse284 (div .cse2 (+ v_z_113 v_z_1202)))) (or (< v_z_113 0) (< .cse284 (+ v_z_1202 .cse8 1)) (< (+ .cse284 .cse3) .cse17)))))) (forall ((v_z_1202 Int)) (or (= .cse2 v_z_1202) (< v_z_1202 0) (forall ((v_z_113 Int)) (let ((.cse285 (div .cse2 (+ v_z_113 v_z_1202)))) (or (< v_z_113 0) (< .cse285 (+ v_z_1202 .cse8 1)) (< (+ .cse285 .cse3) .cse14)))) (< .cse2 v_z_1202))) (forall ((v_z_1202 Int)) (or (< .cse4 (+ .cse3 v_z_1202 .cse8 1)) (= .cse2 v_z_1202) (< v_z_1202 0) (< .cse2 v_z_1202) (forall ((v_z_113 Int)) (or (< v_z_113 0) (< (div .cse2 (+ v_z_113 v_z_1202)) (+ v_z_1202 .cse8 1)))))) (or .cse18 (forall ((v_z_1202 Int) (v_z_113 Int)) (let ((.cse286 (div .cse2 (+ v_z_113 v_z_1202)))) (or (< v_z_113 0) (< (+ .cse286 .cse3) 65537) (< .cse286 (+ v_z_1202 .cse8 1)) (< .cse15 (+ .cse3 v_z_1202 .cse8)) (= .cse2 v_z_1202) (< v_z_1202 0)))))) .cse1) (or .cse115 .cse1 (and (or (forall ((v_z_142 Int) (v_y_1062 Int) (v_z_1224 Int)) (let ((.cse287 (* 65536 v_y_1062))) (or (< .cse3 (+ .cse4 .cse287 1)) (< (+ .cse4 65536 .cse287) (+ .cse3 v_z_1224 .cse8)) (< v_z_142 0) (< (+ (div .cse2 (+ v_z_142 v_z_1224)) .cse3) (+ .cse4 .cse287 65537)) (< v_z_1224 0)))) .cse11) (or (forall ((v_z_142 Int) (v_y_1062 Int) (v_z_1224 Int)) (let ((.cse288 (* 65536 v_y_1062))) (let ((.cse289 (+ .cse4 .cse288))) (or (< (+ (div .cse2 (+ v_z_142 v_z_1224)) .cse3) (+ .cse4 .cse288 1)) (< .cse289 (+ .cse3 v_z_1224 .cse8)) (< .cse6 .cse289) (= .cse2 v_z_1224) (< v_z_142 0) (< v_z_1224 0))))) .cse9))) (or .cse111 .cse1 (and (or (forall ((v_z_142 Int) (v_y_1065 Int) (v_z_1250 Int)) (let ((.cse291 (* 65536 v_y_1065))) (let ((.cse290 (+ .cse4 .cse291))) (or (< .cse6 .cse290) (< .cse290 (+ .cse3 v_z_1250 .cse8)) (< v_z_1250 0) (= .cse2 v_z_1250) (< (+ (div .cse2 (+ v_z_142 v_z_1250)) .cse3) (+ .cse4 .cse291 1)) (< v_z_142 0))))) .cse9) (or (forall ((v_z_142 Int) (v_z_1256 Int) (v_y_1065 Int)) (let ((.cse292 (* 65536 v_y_1065))) (or (< .cse3 (+ .cse4 .cse292 1)) (< v_z_1256 0) (< v_z_142 0) (< (+ (div .cse2 (+ v_z_142 v_z_1256)) .cse3) (+ .cse4 .cse292 65537)) (< (+ .cse4 .cse292 65536) (+ .cse3 v_z_1256 .cse8))))) .cse11))) (or .cse1 .cse125 (and (or (forall ((v_z_113 Int) (v_z_1237 Int)) (let ((.cse293 (div .cse2 (+ v_z_113 v_z_1237)))) (or (< v_z_113 0) (< 65535 (+ .cse3 v_z_1237 .cse8)) (< .cse293 (+ v_z_1237 .cse8 1)) (= .cse2 v_z_1237) (< (+ .cse293 .cse3) .cse17) (< v_z_1237 0)))) .cse32) (or .cse23 (forall ((v_z_113 Int) (v_z_1233 Int)) (let ((.cse294 (div .cse2 (+ v_z_113 v_z_1233)))) (or (< v_z_113 0) (< .cse294 (+ v_z_1233 .cse8 1)) (< (+ .cse3 .cse294) .cse14) (< v_z_1233 0))))) (forall ((v_z_113 Int) (v_z_1231 Int)) (or (< v_z_113 0) (< v_z_1231 0) (< (div .cse2 (+ v_z_113 v_z_1231)) (+ v_z_1231 .cse8 1)) (= .cse2 v_z_1231) (< .cse4 (+ .cse3 v_z_1231 .cse8 1)))) (forall ((v_z_113 Int) (v_z_1243 Int)) (let ((.cse295 (div .cse2 (+ v_z_113 v_z_1243)))) (or (< v_z_113 0) (< v_z_1243 0) (< (+ .cse295 .cse3) .cse17) (= .cse2 v_z_1243) (< .cse295 (+ v_z_1243 .cse8 1)) (< .cse15 (+ .cse3 v_z_1243 .cse8))))))) (or (and (or (and (forall ((v_z_1246 Int)) (or (< .cse15 (+ .cse3 v_z_1246 .cse8)) (= .cse2 v_z_1246) (forall ((v_z_113 Int)) (let ((.cse296 (div .cse2 (+ v_z_113 v_z_1246)))) (or (< v_z_113 0) (< .cse296 (+ v_z_1246 .cse8 1)) (< (+ .cse296 .cse3) .cse17)))) (< .cse2 v_z_1246) (< v_z_1246 0))) (or (forall ((v_z_1246 Int) (v_z_113 Int)) (let ((.cse297 (div .cse2 (+ v_z_113 v_z_1246)))) (or (< v_z_113 0) (< .cse297 (+ v_z_1246 .cse8 1)) (= .cse2 v_z_1246) (< (+ .cse297 .cse3) .cse17) (< 65535 (+ .cse3 v_z_1246 .cse8)) (< v_z_1246 0)))) .cse32) (forall ((v_z_1246 Int)) (or (= .cse2 v_z_1246) (forall ((v_z_113 Int)) (let ((.cse298 (div .cse2 (+ v_z_113 v_z_1246)))) (or (< v_z_113 0) (< .cse298 (+ v_z_1246 .cse8 1)) (< (+ .cse298 .cse3) .cse14)))) (< .cse2 v_z_1246) (< v_z_1246 0))) (forall ((v_z_1246 Int)) (or (= .cse2 v_z_1246) (forall ((v_z_113 Int)) (or (< v_z_113 0) (< (div .cse2 (+ v_z_113 v_z_1246)) (+ v_z_1246 .cse8 1)))) (< .cse4 (+ .cse3 v_z_1246 .cse8 1)) (< .cse2 v_z_1246) (< v_z_1246 0)))) .cse1) (or .cse1 (and (or .cse9 (forall ((v_z_142 Int) (v_y_1063 Int) (v_z_1246 Int)) (let ((.cse299 (* 65536 v_y_1063))) (let ((.cse300 (+ .cse4 .cse299))) (or (= .cse2 v_z_1246) (< (+ .cse3 (div .cse2 (+ v_z_142 v_z_1246))) (+ .cse4 .cse299 1)) (< .cse300 (+ .cse3 v_z_1246 .cse8)) (< .cse6 .cse300) (< v_z_142 0) (< v_z_1246 0)))))) (or .cse11 (forall ((v_z_142 Int) (v_y_1063 Int) (v_z_1246 Int)) (let ((.cse301 (* 65536 v_y_1063))) (or (< (+ .cse3 (div .cse2 (+ v_z_142 v_z_1246))) (+ .cse4 .cse301 65537)) (< v_z_142 0) (< .cse3 (+ .cse4 .cse301 1)) (< (+ .cse4 65536 .cse301) (+ .cse3 v_z_1246 .cse8)) (< v_z_1246 0)))))))) .cse101)) .cse54) (or (and (or .cse55 .cse1 (and (or .cse9 (forall ((v_z_142 Int) (v_y_1050 Int) (v_z_1431 Int)) (let ((.cse303 (* 65536 v_y_1050))) (let ((.cse302 (+ .cse303 .cse4))) (or (< v_z_1431 0) (< .cse6 .cse302) (= .cse2 v_z_1431) (< v_z_142 0) (< (+ (div .cse2 (+ v_z_142 v_z_1431)) .cse3) (+ .cse303 .cse4 1)) (< .cse302 (+ .cse3 v_z_1431 .cse8))))))) (or (forall ((v_z_142 Int) (v_z_1425 Int) (v_y_1050 Int)) (let ((.cse304 (* 65536 v_y_1050))) (or (< .cse3 (+ .cse304 .cse4 1)) (< v_z_1425 0) (< (+ .cse304 .cse4 65536) (+ .cse3 v_z_1425 .cse8)) (< (+ .cse3 (div .cse2 (+ v_z_142 v_z_1425))) (+ .cse304 .cse4 65537)) (< v_z_142 0)))) .cse11))) (or .cse68 (and (or (forall ((v_z_142 Int) (v_z_1357 Int) (v_y_1049 Int)) (let ((.cse305 (* 65536 v_y_1049))) (let ((.cse306 (+ .cse4 .cse305))) (or (< (+ .cse3 (div .cse2 (+ v_z_142 v_z_1357))) (+ .cse4 .cse305 1)) (< .cse306 (+ .cse3 v_z_1357 .cse8)) (< .cse6 .cse306) (< v_z_1357 0) (< v_z_142 0) (= .cse2 v_z_1357))))) .cse9) (or (forall ((v_z_142 Int) (v_z_1351 Int) (v_y_1049 Int)) (let ((.cse307 (* 65536 v_y_1049))) (or (< v_z_1351 0) (< v_z_142 0) (< .cse3 (+ .cse4 .cse307 1)) (< (+ .cse4 65536 .cse307) (+ .cse3 v_z_1351 .cse8)) (< (+ (div .cse2 (+ v_z_142 v_z_1351)) .cse3) (+ .cse4 .cse307 65537))))) .cse11)) .cse1) (or (and (or .cse1 (and (forall ((v_z_113 Int) (v_z_1364 Int)) (or (< v_z_113 0) (< v_z_1364 0) (= .cse2 v_z_1364) (< .cse4 (+ .cse3 v_z_1364 .cse8 1)) (< (div .cse2 (+ v_z_113 v_z_1364)) (+ v_z_1364 .cse8 1)))) (or (forall ((v_z_113 Int) (v_z_1373 Int)) (let ((.cse308 (div .cse2 (+ v_z_113 v_z_1373)))) (or (< v_z_113 0) (< 65535 (+ .cse3 v_z_1373 .cse8)) (= .cse2 v_z_1373) (< (+ .cse308 .cse3) .cse17) (< .cse308 (+ v_z_1373 .cse8 1)) (< v_z_1373 0)))) .cse32) (forall ((v_z_113 Int) (v_z_1366 Int)) (let ((.cse309 (div .cse2 (+ v_z_113 v_z_1366)))) (or (< v_z_113 0) (< (+ .cse309 .cse3) .cse14) (< v_z_1366 0) (= .cse2 v_z_1366) (< .cse309 (+ v_z_1366 .cse8 1))))) (forall ((v_z_113 Int) (v_z_1379 Int)) (let ((.cse310 (div .cse2 (+ v_z_113 v_z_1379)))) (or (< v_z_113 0) (< .cse15 (+ .cse3 v_z_1379 .cse8)) (< v_z_1379 0) (< (+ .cse310 .cse3) .cse17) (= .cse2 v_z_1379) (< .cse310 (+ v_z_1379 .cse8 1))))))) (or (and (or .cse9 (forall ((v_z_142 Int) (v_y_1043 Int) (v_z_1384 Int)) (let ((.cse311 (* 65536 v_y_1043))) (let ((.cse312 (+ .cse4 .cse311))) (or (< (+ (div .cse2 (+ v_z_142 v_z_1384)) .cse3) (+ .cse4 .cse311 1)) (< .cse6 .cse312) (< v_z_1384 0) (< v_z_142 0) (= .cse2 v_z_1384) (< .cse312 (+ .cse3 v_z_1384 .cse8))))))) (or (forall ((v_z_142 Int) (v_z_1388 Int) (v_y_1043 Int)) (let ((.cse313 (* 65536 v_y_1043))) (or (< v_z_1388 0) (< .cse3 (+ .cse4 .cse313 1)) (< v_z_142 0) (< (+ .cse3 (div .cse2 (+ v_z_142 v_z_1388))) (+ .cse4 .cse313 65537)) (< (+ .cse4 65536 .cse313) (+ .cse3 v_z_1388 .cse8))))) .cse11)) .cse1)) .cse53) (or .cse68 .cse1 (and (or .cse23 (forall ((v_z_113 Int) (v_z_1391 Int)) (let ((.cse314 (div .cse2 (+ v_z_113 v_z_1391)))) (or (< v_z_113 0) (< .cse314 (+ v_z_1391 .cse8 1)) (< (+ .cse314 .cse3) .cse14) (< v_z_1391 0))))) (forall ((v_z_1391 Int)) (or (< .cse2 v_z_1391) (forall ((v_z_113 Int)) (or (< v_z_113 0) (< (div .cse2 (+ v_z_113 v_z_1391)) (+ v_z_1391 .cse8 1)))) (< .cse4 (+ .cse3 v_z_1391 .cse8 1)) (= .cse2 v_z_1391) (< v_z_1391 0))) (forall ((v_z_1391 Int)) (or (< .cse2 v_z_1391) (forall ((v_z_113 Int)) (let ((.cse315 (div .cse2 (+ v_z_113 v_z_1391)))) (or (< v_z_113 0) (< .cse315 (+ v_z_1391 .cse8 1)) (< (+ .cse315 .cse3) .cse17)))) (< .cse15 (+ .cse3 v_z_1391 .cse8)) (= .cse2 v_z_1391) (< v_z_1391 0))))) (or .cse64 (and (or (forall ((v_z_142 Int) (v_z_1416 Int) (v_y_1047 Int)) (let ((.cse316 (* 65536 v_y_1047))) (or (< (+ (div .cse2 (+ v_z_142 v_z_1416)) .cse3) (+ .cse4 .cse316 65537)) (< .cse3 (+ .cse4 .cse316 1)) (< v_z_1416 0) (< (+ .cse4 65536 .cse316) (+ .cse3 v_z_1416 .cse8)) (< v_z_142 0)))) .cse11) (or .cse9 (forall ((v_z_142 Int) (v_y_1047 Int) (v_z_1418 Int)) (let ((.cse318 (* 65536 v_y_1047))) (let ((.cse317 (+ .cse4 .cse318))) (or (< .cse317 (+ .cse3 v_z_1418 .cse8)) (< v_z_1418 0) (< v_z_142 0) (< .cse6 .cse317) (= .cse2 v_z_1418) (< (+ (div .cse2 (+ v_z_142 v_z_1418)) .cse3) (+ .cse4 .cse318 1)))))))) .cse1) (or .cse55 .cse1 (and (forall ((v_z_1436 Int) (v_z_113 Int)) (or (< v_z_113 0) (< v_z_1436 0) (= .cse2 v_z_1436) (< (div .cse2 (+ v_z_113 v_z_1436)) (+ v_z_1436 .cse8 1)) (< .cse4 (+ .cse3 v_z_1436 .cse8 1)))) (forall ((v_z_113 Int) (v_z_1443 Int)) (let ((.cse319 (div .cse2 (+ v_z_113 v_z_1443)))) (or (< v_z_113 0) (< (+ .cse3 .cse319) .cse17) (< v_z_1443 0) (< .cse319 (+ v_z_1443 .cse8 1)) (< .cse15 (+ .cse3 v_z_1443 .cse8)) (= .cse2 v_z_1443)))) (forall ((v_z_1439 Int) (v_z_113 Int)) (let ((.cse320 (div .cse2 (+ v_z_113 v_z_1439)))) (or (< v_z_113 0) (< (+ .cse320 .cse3) .cse14) (< .cse320 (+ v_z_1439 .cse8 1)) (< v_z_1439 0) (= .cse2 v_z_1439)))))) (or .cse64 (and (forall ((v_z_113 Int) (v_z_1395 Int)) (or (< v_z_113 0) (< v_z_1395 0) (= .cse2 v_z_1395) (< .cse4 (+ .cse3 v_z_1395 .cse8 1)) (< (div .cse2 (+ v_z_113 v_z_1395)) (+ v_z_1395 .cse8 1)))) (or .cse23 (forall ((v_z_113 Int) (v_z_1398 Int)) (let ((.cse321 (div .cse2 (+ v_z_113 v_z_1398)))) (or (< v_z_113 0) (< (+ .cse3 .cse321) .cse14) (< .cse321 (+ v_z_1398 .cse8 1)) (< v_z_1398 0))))) (forall ((v_z_1406 Int) (v_z_113 Int)) (let ((.cse322 (div .cse2 (+ v_z_113 v_z_1406)))) (or (< v_z_113 0) (= .cse2 v_z_1406) (< .cse322 (+ v_z_1406 .cse8 1)) (< v_z_1406 0) (< .cse15 (+ .cse3 v_z_1406 .cse8)) (< (+ .cse322 .cse3) .cse17)))) (or .cse18 (forall ((v_z_113 Int) (v_z_1407 Int)) (let ((.cse323 (div .cse2 (+ v_z_113 v_z_1407)))) (or (< v_z_1407 0) (< v_z_113 0) (< .cse15 (+ .cse3 v_z_1407 .cse8)) (= .cse2 v_z_1407) (< (+ .cse323 .cse3) 65537) (< .cse323 (+ v_z_1407 .cse8 1))))))) .cse1)) .cse54) (or (and .cse136 .cse137 (or .cse324 .cse141) .cse142 .cse144 .cse145 .cse146 .cse147) .cse106) (or (and .cse209 (or .cse325 .cse9 .cse326 .cse327 .cse1) .cse210 .cse211 .cse212 .cse213 .cse215 .cse216) .cse106) (or (let ((.cse328 (forall ((v_z_1345 Int)) (or (< .cse2 v_z_1345) (< 65535 (+ .cse3 v_z_1345 .cse8)) (= .cse2 v_z_1345) (forall ((v_z_113 Int)) (let ((.cse340 (div .cse2 (+ v_z_113 v_z_1345)))) (or (< v_z_113 0) (< .cse340 (+ v_z_1345 .cse8 1)) (< (+ .cse340 .cse3) .cse17)))) (< v_z_1345 0)))) (.cse329 (forall ((v_z_1345 Int)) (or (< .cse2 v_z_1345) (forall ((v_z_113 Int)) (or (< v_z_113 0) (< (div .cse2 (+ v_z_113 v_z_1345)) (+ v_z_1345 .cse8 1)))) (= .cse2 v_z_1345) (< v_z_1345 0) (< .cse4 (+ .cse3 v_z_1345 .cse8 1))))) (.cse331 (or .cse18 (forall ((v_z_1345 Int) (v_z_113 Int)) (let ((.cse339 (div .cse2 (+ v_z_113 v_z_1345)))) (or (< v_z_113 0) (< (+ .cse339 .cse3) 65537) (< .cse339 (+ v_z_1345 .cse8 1)) (= .cse2 v_z_1345) (< .cse15 (+ .cse3 v_z_1345 .cse8)) (< v_z_1345 0))))))) (and (or (and (or (and .cse328 .cse329 (or .cse23 (forall ((v_z_1345 Int) (v_z_113 Int)) (let ((.cse330 (div .cse2 (+ v_z_113 v_z_1345)))) (or (< v_z_113 0) (< .cse330 (+ v_z_1345 .cse8 1)) (< (+ .cse330 .cse3) .cse14) (< v_z_1345 0))))) .cse331) .cse1) (or (and (or (forall ((v_z_142 Int) (v_z_1345 Int) (v_y_1069 Int)) (let ((.cse332 (* 65536 v_y_1069))) (or (< (+ (div .cse2 (+ v_z_142 v_z_1345)) .cse3) (+ .cse332 .cse4 65537)) (< (+ .cse332 .cse4 65536) (+ .cse3 v_z_1345 .cse8)) (< .cse3 (+ .cse332 .cse4 1)) (< v_z_142 0) (< v_z_1345 0)))) .cse11) (or (forall ((v_z_142 Int) (v_z_1345 Int) (v_y_1069 Int)) (let ((.cse334 (* 65536 v_y_1069))) (let ((.cse333 (+ .cse334 .cse4))) (or (< .cse333 (+ .cse3 v_z_1345 .cse8)) (= .cse2 v_z_1345) (< (+ (div .cse2 (+ v_z_142 v_z_1345)) .cse3) (+ .cse334 .cse4 1)) (< .cse6 .cse333) (< v_z_142 0) (< v_z_1345 0))))) .cse9)) .cse1)) .cse53) (or .cse0 (and (or .cse1 (and .cse328 (forall ((v_z_1345 Int)) (or (< .cse2 v_z_1345) (forall ((v_z_113 Int)) (let ((.cse335 (div .cse2 (+ v_z_113 v_z_1345)))) (or (< v_z_113 0) (< .cse335 (+ v_z_1345 .cse8 1)) (< (+ .cse335 .cse3) .cse14)))) (= .cse2 v_z_1345) (< v_z_1345 0))) .cse329 .cse331)) (or (and (or (forall ((v_z_142 Int) (v_z_1345 Int) (v_y_1067 Int)) (let ((.cse336 (* 65536 v_y_1067))) (or (< v_z_142 0) (< .cse3 (+ .cse4 .cse336 1)) (< (+ (div .cse2 (+ v_z_142 v_z_1345)) .cse3) (+ .cse4 .cse336 65537)) (< v_z_1345 0) (< (+ .cse4 65536 .cse336) (+ .cse3 v_z_1345 .cse8))))) .cse11) (or .cse9 (forall ((v_z_142 Int) (v_z_1345 Int) (v_y_1067 Int)) (let ((.cse338 (* 65536 v_y_1067))) (let ((.cse337 (+ .cse4 .cse338))) (or (< .cse6 .cse337) (= .cse2 v_z_1345) (< .cse337 (+ .cse3 v_z_1345 .cse8)) (< v_z_142 0) (< v_z_1345 0) (< (+ (div .cse2 (+ v_z_142 v_z_1345)) .cse3) (+ .cse4 .cse338 1)))))))) .cse1))))) .cse54)))))))))))) is different from false [2023-12-19 11:39:51,762 WARN L249 Executor]: External (MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1) with exit command (exit)) stderr output: (error "out of memory") [2023-12-19 11:39:51,763 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-19 11:39:51,763 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1956652283] [2023-12-19 11:39:51,763 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2023-12-19 11:39:51,763 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [648373336] [2023-12-19 11:39:51,763 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Forceful destruction successful, exit code 101 [2023-12-19 11:39:51,763 WARN L320 FreeRefinementEngine]: Global settings require throwing the following exception [2023-12-19 11:39:51,772 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Ended with exit code 0 [2023-12-19 11:39:51,967 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable7 [2023-12-19 11:39:51,967 FATAL L? ?]: An unrecoverable error occured during an interaction with an SMT solver: de.uni_freiburg.informatik.ultimate.logic.SMTLIBException: External (MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1) with exit command (exit)) Received EOF on stdin. stderr output: (error "out of memory") at de.uni_freiburg.informatik.ultimate.smtsolver.external.Executor.parse(Executor.java:262) at de.uni_freiburg.informatik.ultimate.smtsolver.external.Executor.parseSuccess(Executor.java:277) at de.uni_freiburg.informatik.ultimate.smtsolver.external.Scriptor.push(Scriptor.java:133) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.arrays.DiffWrapperScript.push(DiffWrapperScript.java:90) at de.uni_freiburg.informatik.ultimate.logic.WrapperScript.push(WrapperScript.java:148) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.scripttransfer.HistoryRecordingScript.push(HistoryRecordingScript.java:107) at de.uni_freiburg.informatik.ultimate.logic.Util.checkSat(Util.java:48) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.SimplifyDDA2.checkRedundancy(SimplifyDDA2.java:268) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.SimplifyDDA2.convertForPreprocessedInputTerms(SimplifyDDA2.java:410) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.SimplifyDDA2.convert(SimplifyDDA2.java:394) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.SimplifyDDA2.convert(SimplifyDDA2.java:1) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.TermContextTransformationEngine.transform(TermContextTransformationEngine.java:88) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.TermContextTransformationEngine.transform(TermContextTransformationEngine.java:84) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.SimplifyDDA2.simplify(SimplifyDDA2.java:500) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.SmtUtils.simplify(SmtUtils.java:252) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.SmtUtils.simplifyWithStatistics(SmtUtils.java:324) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify(QuantifierPusher.java:731) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPushTermWalker.convert(QuantifierPushTermWalker.java:133) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPushTermWalker.convert(QuantifierPushTermWalker.java:1) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.TermContextTransformationEngine$ApplicationTermTask.doStep(TermContextTransformationEngine.java:209) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.TermContextTransformationEngine.transform(TermContextTransformationEngine.java:100) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.TermContextTransformationEngine.transform(TermContextTransformationEngine.java:84) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPushTermWalker.eliminate(QuantifierPushTermWalker.java:297) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.pushInner(QuantifierPusher.java:275) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPushTermWalker.convert(QuantifierPushTermWalker.java:194) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPushTermWalker.convert(QuantifierPushTermWalker.java:1) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.TermContextTransformationEngine$ApplicationTermTask.doStep(TermContextTransformationEngine.java:209) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.TermContextTransformationEngine.transform(TermContextTransformationEngine.java:100) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.TermContextTransformationEngine.transform(TermContextTransformationEngine.java:84) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPushTermWalker.eliminate(QuantifierPushTermWalker.java:297) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPushTermWalker.eliminate(QuantifierPushTermWalker.java:283) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.PartialQuantifierElimination.eliminate(PartialQuantifierElimination.java:51) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.predicates.IterativePredicateTransformer$QuantifierEliminationPostprocessor.postprocess(IterativePredicateTransformer.java:238) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.predicates.IterativePredicateTransformer.applyPostprocessors(IterativePredicateTransformer.java:420) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.predicates.IterativePredicateTransformer.computeBackwardSequence(IterativePredicateTransformer.java:399) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.predicates.IterativePredicateTransformer.computeWeakestPreconditionSequence(IterativePredicateTransformer.java:271) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.singletracecheck.TraceCheckSpWp.computeInterpolantsUsingUnsatCore(TraceCheckSpWp.java:341) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.singletracecheck.TraceCheckSpWp.computeInterpolants(TraceCheckSpWp.java:184) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.singletracecheck.TraceCheckSpWp.(TraceCheckSpWp.java:162) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleSpWp.construct(IpTcStrategyModuleSpWp.java:110) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleSpWp.construct(IpTcStrategyModuleSpWp.java:1) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getOrConstruct(IpTcStrategyModuleBase.java:101) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.isCorrect(IpTcStrategyModuleBase.java:57) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.checkFeasibility(AutomatonFreeRefinementEngine.java:210) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.executeStrategy(AutomatonFreeRefinementEngine.java:121) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.(AutomatonFreeRefinementEngine.java:85) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:82) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:337) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:431) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.startCegar(AbstractCegarLoop.java:366) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.runCegar(AbstractCegarLoop.java:348) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.executeCegarLoop(TraceAbstractionStarter.java:416) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseProgram(TraceAbstractionStarter.java:303) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseSequentialProgram(TraceAbstractionStarter.java:263) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:176) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:155) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:124) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:167) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:150) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:127) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:233) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:227) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:144) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:106) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:319) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:63) Caused by: de.uni_freiburg.informatik.ultimate.logic.SMTLIBException: EOF at de.uni_freiburg.informatik.ultimate.smtsolver.external.Parser$Action$.CUP$do_action(Parser.java:1518) at de.uni_freiburg.informatik.ultimate.smtsolver.external.Parser.do_action(Parser.java:701) at com.github.jhoenicke.javacup.runtime.LRParser.parse(LRParser.java:383) at de.uni_freiburg.informatik.ultimate.smtsolver.external.Executor.parse(Executor.java:258) ... 66 more [2023-12-19 11:39:51,979 INFO L158 Benchmark]: Toolchain (without parser) took 770625.47ms. Allocated memory was 199.2MB in the beginning and 859.8MB in the end (delta: 660.6MB). Free memory was 150.6MB in the beginning and 574.4MB in the end (delta: -423.8MB). Peak memory consumption was 512.9MB. Max. memory is 8.0GB. [2023-12-19 11:39:51,979 INFO L158 Benchmark]: CDTParser took 0.10ms. Allocated memory is still 199.2MB. Free memory is still 146.6MB. There was no memory consumed. Max. memory is 8.0GB. [2023-12-19 11:39:51,979 INFO L158 Benchmark]: CACSL2BoogieTranslator took 277.08ms. Allocated memory is still 199.2MB. Free memory was 150.3MB in the beginning and 133.5MB in the end (delta: 16.8MB). Peak memory consumption was 16.8MB. Max. memory is 8.0GB. [2023-12-19 11:39:51,980 INFO L158 Benchmark]: Boogie Procedure Inliner took 63.14ms. Allocated memory is still 199.2MB. Free memory was 133.5MB in the beginning and 127.9MB in the end (delta: 5.6MB). Peak memory consumption was 6.3MB. Max. memory is 8.0GB. [2023-12-19 11:39:51,980 INFO L158 Benchmark]: Boogie Preprocessor took 60.57ms. Allocated memory is still 199.2MB. Free memory was 127.9MB in the beginning and 118.8MB in the end (delta: 9.1MB). Peak memory consumption was 8.4MB. Max. memory is 8.0GB. [2023-12-19 11:39:51,981 INFO L158 Benchmark]: RCFGBuilder took 653.53ms. Allocated memory was 199.2MB in the beginning and 246.4MB in the end (delta: 47.2MB). Free memory was 118.8MB in the beginning and 192.2MB in the end (delta: -73.4MB). Peak memory consumption was 18.3MB. Max. memory is 8.0GB. [2023-12-19 11:39:51,981 INFO L158 Benchmark]: TraceAbstraction took 769566.32ms. Allocated memory was 246.4MB in the beginning and 859.8MB in the end (delta: 613.4MB). Free memory was 191.7MB in the beginning and 574.4MB in the end (delta: -382.7MB). Peak memory consumption was 506.1MB. Max. memory is 8.0GB. [2023-12-19 11:39:51,982 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.10ms. Allocated memory is still 199.2MB. Free memory is still 146.6MB. There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 277.08ms. Allocated memory is still 199.2MB. Free memory was 150.3MB in the beginning and 133.5MB in the end (delta: 16.8MB). Peak memory consumption was 16.8MB. Max. memory is 8.0GB. * Boogie Procedure Inliner took 63.14ms. Allocated memory is still 199.2MB. Free memory was 133.5MB in the beginning and 127.9MB in the end (delta: 5.6MB). Peak memory consumption was 6.3MB. Max. memory is 8.0GB. * Boogie Preprocessor took 60.57ms. Allocated memory is still 199.2MB. Free memory was 127.9MB in the beginning and 118.8MB in the end (delta: 9.1MB). Peak memory consumption was 8.4MB. Max. memory is 8.0GB. * RCFGBuilder took 653.53ms. Allocated memory was 199.2MB in the beginning and 246.4MB in the end (delta: 47.2MB). Free memory was 118.8MB in the beginning and 192.2MB in the end (delta: -73.4MB). Peak memory consumption was 18.3MB. Max. memory is 8.0GB. * TraceAbstraction took 769566.32ms. Allocated memory was 246.4MB in the beginning and 859.8MB in the end (delta: 613.4MB). Free memory was 191.7MB in the beginning and 574.4MB in the end (delta: -382.7MB). Peak memory consumption was 506.1MB. Max. memory is 8.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - ExceptionOrErrorResult: SMTLIBException: External (MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1) with exit command (exit)) Received EOF on stdin. stderr output: (error "out of memory") de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: SMTLIBException: External (MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1) with exit command (exit)) Received EOF on stdin. stderr output: (error "out of memory") : de.uni_freiburg.informatik.ultimate.smtsolver.external.Executor.parse(Executor.java:262) RESULT: Ultimate could not prove your program: Toolchain returned no result. Received shutdown request...