/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 false -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml -i ../../../trunk/examples/svcomp/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-ps-ci_file-30.i -------------------------------------------------------------------------------- This is Ultimate 0.2.4-tmp.fs.bitabs-eval-d9c3e40-m [2023-12-16 03:22:23,965 INFO L188 SettingsManager]: Resetting all preferences to default values... [2023-12-16 03:22:24,031 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-16 03:22:24,035 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2023-12-16 03:22:24,035 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2023-12-16 03:22:24,056 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2023-12-16 03:22:24,057 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-12-16 03:22:24,057 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-12-16 03:22:24,057 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2023-12-16 03:22:24,060 INFO L153 SettingsManager]: * Use memory slicer=true [2023-12-16 03:22:24,060 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-12-16 03:22:24,061 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-12-16 03:22:24,061 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-12-16 03:22:24,062 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2023-12-16 03:22:24,062 INFO L153 SettingsManager]: * Use SBE=true [2023-12-16 03:22:24,062 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-12-16 03:22:24,063 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2023-12-16 03:22:24,063 INFO L153 SettingsManager]: * sizeof long=4 [2023-12-16 03:22:24,063 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2023-12-16 03:22:24,064 INFO L153 SettingsManager]: * sizeof POINTER=4 [2023-12-16 03:22:24,064 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2023-12-16 03:22:24,064 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2023-12-16 03:22:24,064 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-12-16 03:22:24,065 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2023-12-16 03:22:24,065 INFO L153 SettingsManager]: * Allow undefined functions=false [2023-12-16 03:22:24,065 INFO L153 SettingsManager]: * sizeof long double=12 [2023-12-16 03:22:24,065 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2023-12-16 03:22:24,065 INFO L153 SettingsManager]: * Use constant arrays=true [2023-12-16 03:22:24,065 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-12-16 03:22:24,066 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-12-16 03:22:24,066 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2023-12-16 03:22:24,066 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2023-12-16 03:22:24,067 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2023-12-16 03:22:24,067 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-12-16 03:22:24,067 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-12-16 03:22:24,067 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2023-12-16 03:22:24,067 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2023-12-16 03:22:24,067 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2023-12-16 03:22:24,067 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2023-12-16 03:22:24,067 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-12-16 03:22:24,067 INFO L153 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2023-12-16 03:22:24,068 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2023-12-16 03:22:24,068 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-12-16 03:22:24,068 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 -> false [2023-12-16 03:22:24,250 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-12-16 03:22:24,267 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-12-16 03:22:24,269 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-12-16 03:22:24,269 INFO L270 PluginConnector]: Initializing CDTParser... [2023-12-16 03:22:24,270 INFO L274 PluginConnector]: CDTParser initialized [2023-12-16 03:22:24,270 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-ps-ci_file-30.i [2023-12-16 03:22:25,293 INFO L533 CDTParser]: Created temporary CDT project at NULL [2023-12-16 03:22:25,490 INFO L384 CDTParser]: Found 1 translation units. [2023-12-16 03:22:25,491 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-ps-ci_file-30.i [2023-12-16 03:22:25,497 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/d63af4d82/198ea3fd4fa74fa491578dc85b41a784/FLAG2a1d669e8 [2023-12-16 03:22:25,506 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/d63af4d82/198ea3fd4fa74fa491578dc85b41a784 [2023-12-16 03:22:25,508 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-12-16 03:22:25,509 INFO L133 ToolchainWalker]: Walking toolchain with 5 elements. [2023-12-16 03:22:25,512 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-12-16 03:22:25,512 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-12-16 03:22:25,515 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2023-12-16 03:22:25,516 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.12 03:22:25" (1/1) ... [2023-12-16 03:22:25,516 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3359e3be and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.12 03:22:25, skipping insertion in model container [2023-12-16 03:22:25,516 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.12 03:22:25" (1/1) ... [2023-12-16 03:22:25,542 INFO L177 MainTranslator]: Built tables and reachable declarations [2023-12-16 03:22:25,673 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_fillercode_fillercodestructure_filler-ps-ci_file-30.i[919,932] [2023-12-16 03:22:25,712 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-12-16 03:22:25,721 INFO L202 MainTranslator]: Completed pre-run [2023-12-16 03:22:25,729 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_fillercode_fillercodestructure_filler-ps-ci_file-30.i[919,932] [2023-12-16 03:22:25,751 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-12-16 03:22:25,763 INFO L206 MainTranslator]: Completed translation [2023-12-16 03:22:25,763 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.12 03:22:25 WrapperNode [2023-12-16 03:22:25,763 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-12-16 03:22:25,764 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-12-16 03:22:25,764 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-12-16 03:22:25,764 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2023-12-16 03:22:25,769 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.12 03:22:25" (1/1) ... [2023-12-16 03:22:25,775 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.12 03:22:25" (1/1) ... [2023-12-16 03:22:25,797 INFO L138 Inliner]: procedures = 26, calls = 37, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 207 [2023-12-16 03:22:25,797 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-12-16 03:22:25,798 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-12-16 03:22:25,798 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2023-12-16 03:22:25,798 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2023-12-16 03:22:25,806 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.12 03:22:25" (1/1) ... [2023-12-16 03:22:25,806 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.12 03:22:25" (1/1) ... [2023-12-16 03:22:25,808 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.12 03:22:25" (1/1) ... [2023-12-16 03:22:25,824 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-16 03:22:25,824 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.12 03:22:25" (1/1) ... [2023-12-16 03:22:25,824 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.12 03:22:25" (1/1) ... [2023-12-16 03:22:25,832 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.12 03:22:25" (1/1) ... [2023-12-16 03:22:25,835 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.12 03:22:25" (1/1) ... [2023-12-16 03:22:25,836 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.12 03:22:25" (1/1) ... [2023-12-16 03:22:25,837 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.12 03:22:25" (1/1) ... [2023-12-16 03:22:25,839 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-12-16 03:22:25,840 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-12-16 03:22:25,840 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2023-12-16 03:22:25,840 INFO L274 PluginConnector]: RCFGBuilder initialized [2023-12-16 03:22:25,840 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.12 03:22:25" (1/1) ... [2023-12-16 03:22:25,844 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2023-12-16 03:22:25,852 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-12-16 03:22:25,875 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-16 03:22:25,878 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-16 03:22:25,896 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-12-16 03:22:25,896 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2023-12-16 03:22:25,896 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2023-12-16 03:22:25,896 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2023-12-16 03:22:25,896 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-12-16 03:22:25,896 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-12-16 03:22:25,982 INFO L241 CfgBuilder]: Building ICFG [2023-12-16 03:22:25,984 INFO L267 CfgBuilder]: Building CFG for each procedure with an implementation [2023-12-16 03:22:26,178 INFO L282 CfgBuilder]: Performing block encoding [2023-12-16 03:22:26,233 INFO L304 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-12-16 03:22:26,233 INFO L309 CfgBuilder]: Removed 1 assume(true) statements. [2023-12-16 03:22:26,234 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 16.12 03:22:26 BoogieIcfgContainer [2023-12-16 03:22:26,234 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-12-16 03:22:26,235 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-12-16 03:22:26,235 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2023-12-16 03:22:26,237 INFO L274 PluginConnector]: TraceAbstraction initialized [2023-12-16 03:22:26,237 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 16.12 03:22:25" (1/3) ... [2023-12-16 03:22:26,238 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3f93c584 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.12 03:22:26, skipping insertion in model container [2023-12-16 03:22:26,238 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.12 03:22:25" (2/3) ... [2023-12-16 03:22:26,238 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3f93c584 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.12 03:22:26, skipping insertion in model container [2023-12-16 03:22:26,238 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 16.12 03:22:26" (3/3) ... [2023-12-16 03:22:26,239 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_fillercode_fillercodestructure_filler-ps-ci_file-30.i [2023-12-16 03:22:26,250 INFO L204 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-12-16 03:22:26,250 INFO L163 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2023-12-16 03:22:26,286 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-12-16 03:22:26,291 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;@582926c0, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2023-12-16 03:22:26,291 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2023-12-16 03:22:26,295 INFO L276 IsEmpty]: Start isEmpty. Operand has 84 states, 57 states have (on average 1.543859649122807) internal successors, (88), 58 states have internal predecessors, (88), 24 states have call successors, (24), 1 states have call predecessors, (24), 1 states have return successors, (24), 24 states have call predecessors, (24), 24 states have call successors, (24) [2023-12-16 03:22:26,328 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 162 [2023-12-16 03:22:26,328 INFO L187 NwaCegarLoop]: Found error trace [2023-12-16 03:22:26,328 INFO L195 NwaCegarLoop]: trace histogram [24, 24, 24, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-16 03:22:26,329 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-16 03:22:26,332 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-16 03:22:26,333 INFO L85 PathProgramCache]: Analyzing trace with hash 736086739, now seen corresponding path program 1 times [2023-12-16 03:22:26,338 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-16 03:22:26,338 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1050716843] [2023-12-16 03:22:26,338 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-16 03:22:26,339 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-16 03:22:26,537 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 03:22:26,681 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-12-16 03:22:26,683 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 03:22:26,686 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2023-12-16 03:22:26,687 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 03:22:26,690 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2023-12-16 03:22:26,691 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 03:22:26,693 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2023-12-16 03:22:26,694 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 03:22:26,695 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2023-12-16 03:22:26,697 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 03:22:26,698 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2023-12-16 03:22:26,699 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 03:22:26,701 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2023-12-16 03:22:26,702 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 03:22:26,704 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2023-12-16 03:22:26,706 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 03:22:26,707 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2023-12-16 03:22:26,708 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 03:22:26,710 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2023-12-16 03:22:26,711 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 03:22:26,713 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2023-12-16 03:22:26,714 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 03:22:26,716 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2023-12-16 03:22:26,717 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 03:22:26,719 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 70 [2023-12-16 03:22:26,720 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 03:22:26,722 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2023-12-16 03:22:26,723 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 03:22:26,724 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 81 [2023-12-16 03:22:26,725 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 03:22:26,727 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87 [2023-12-16 03:22:26,729 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 03:22:26,730 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2023-12-16 03:22:26,732 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 03:22:26,743 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2023-12-16 03:22:26,744 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 03:22:26,746 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2023-12-16 03:22:26,748 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 03:22:26,751 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 109 [2023-12-16 03:22:26,753 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 03:22:26,755 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 115 [2023-12-16 03:22:26,756 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 03:22:26,758 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 120 [2023-12-16 03:22:26,759 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 03:22:26,761 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 126 [2023-12-16 03:22:26,762 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 03:22:26,763 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 131 [2023-12-16 03:22:26,768 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 03:22:26,776 INFO L134 CoverageAnalysis]: Checked inductivity of 1104 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1104 trivial. 0 not checked. [2023-12-16 03:22:26,776 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-16 03:22:26,777 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1050716843] [2023-12-16 03:22:26,777 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1050716843] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-16 03:22:26,777 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-16 03:22:26,777 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-12-16 03:22:26,779 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [34642595] [2023-12-16 03:22:26,780 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-16 03:22:26,785 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2023-12-16 03:22:26,785 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-16 03:22:26,814 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2023-12-16 03:22:26,814 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2023-12-16 03:22:26,817 INFO L87 Difference]: Start difference. First operand has 84 states, 57 states have (on average 1.543859649122807) internal successors, (88), 58 states have internal predecessors, (88), 24 states have call successors, (24), 1 states have call predecessors, (24), 1 states have return successors, (24), 24 states have call predecessors, (24), 24 states have call successors, (24) Second operand has 2 states, 2 states have (on average 22.0) internal successors, (44), 2 states have internal predecessors, (44), 1 states have call successors, (24), 1 states have call predecessors, (24), 1 states have return successors, (24), 1 states have call predecessors, (24), 1 states have call successors, (24) [2023-12-16 03:22:26,860 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-16 03:22:26,861 INFO L93 Difference]: Finished difference Result 165 states and 294 transitions. [2023-12-16 03:22:26,865 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-12-16 03:22:26,867 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 22.0) internal successors, (44), 2 states have internal predecessors, (44), 1 states have call successors, (24), 1 states have call predecessors, (24), 1 states have return successors, (24), 1 states have call predecessors, (24), 1 states have call successors, (24) Word has length 161 [2023-12-16 03:22:26,868 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-16 03:22:26,873 INFO L225 Difference]: With dead ends: 165 [2023-12-16 03:22:26,873 INFO L226 Difference]: Without dead ends: 82 [2023-12-16 03:22:26,876 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 50 GetRequests, 50 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-16 03:22:26,879 INFO L413 NwaCegarLoop]: 127 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, 127 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-16 03:22:26,880 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 127 Invalid, 3 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 3 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-12-16 03:22:26,890 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 82 states. [2023-12-16 03:22:26,911 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 82 to 82. [2023-12-16 03:22:26,912 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 82 states, 56 states have (on average 1.4642857142857142) internal successors, (82), 56 states have internal predecessors, (82), 24 states have call successors, (24), 1 states have call predecessors, (24), 1 states have return successors, (24), 24 states have call predecessors, (24), 24 states have call successors, (24) [2023-12-16 03:22:26,913 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 82 states to 82 states and 130 transitions. [2023-12-16 03:22:26,914 INFO L78 Accepts]: Start accepts. Automaton has 82 states and 130 transitions. Word has length 161 [2023-12-16 03:22:26,916 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-16 03:22:26,916 INFO L495 AbstractCegarLoop]: Abstraction has 82 states and 130 transitions. [2023-12-16 03:22:26,916 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 22.0) internal successors, (44), 2 states have internal predecessors, (44), 1 states have call successors, (24), 1 states have call predecessors, (24), 1 states have return successors, (24), 1 states have call predecessors, (24), 1 states have call successors, (24) [2023-12-16 03:22:26,916 INFO L276 IsEmpty]: Start isEmpty. Operand 82 states and 130 transitions. [2023-12-16 03:22:26,918 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 163 [2023-12-16 03:22:26,918 INFO L187 NwaCegarLoop]: Found error trace [2023-12-16 03:22:26,919 INFO L195 NwaCegarLoop]: trace histogram [24, 24, 24, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-16 03:22:26,919 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2023-12-16 03:22:26,919 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-16 03:22:26,919 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-16 03:22:26,920 INFO L85 PathProgramCache]: Analyzing trace with hash -368015404, now seen corresponding path program 1 times [2023-12-16 03:22:26,920 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-16 03:22:26,920 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1091601529] [2023-12-16 03:22:26,920 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-16 03:22:26,920 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-16 03:22:27,010 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 03:22:27,163 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-12-16 03:22:27,166 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 03:22:27,171 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2023-12-16 03:22:27,174 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 03:22:27,177 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2023-12-16 03:22:27,179 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 03:22:27,189 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2023-12-16 03:22:27,191 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 03:22:27,201 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2023-12-16 03:22:27,203 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 03:22:27,205 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2023-12-16 03:22:27,208 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 03:22:27,227 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2023-12-16 03:22:27,230 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 03:22:27,234 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2023-12-16 03:22:27,237 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 03:22:27,245 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2023-12-16 03:22:27,248 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 03:22:27,261 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2023-12-16 03:22:27,264 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 03:22:27,278 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2023-12-16 03:22:27,279 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 03:22:27,304 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2023-12-16 03:22:27,306 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 03:22:27,316 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 70 [2023-12-16 03:22:27,318 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 03:22:27,319 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2023-12-16 03:22:27,359 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 03:22:27,365 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 81 [2023-12-16 03:22:27,366 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 03:22:27,370 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87 [2023-12-16 03:22:27,372 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 03:22:27,375 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2023-12-16 03:22:27,377 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 03:22:27,379 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2023-12-16 03:22:27,381 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 03:22:27,383 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2023-12-16 03:22:27,386 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 03:22:27,400 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 109 [2023-12-16 03:22:27,403 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 03:22:27,418 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 115 [2023-12-16 03:22:27,440 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 03:22:27,443 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 120 [2023-12-16 03:22:27,459 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 03:22:27,462 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 126 [2023-12-16 03:22:27,466 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 03:22:27,473 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 131 [2023-12-16 03:22:27,475 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 03:22:27,478 INFO L134 CoverageAnalysis]: Checked inductivity of 1104 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1104 trivial. 0 not checked. [2023-12-16 03:22:27,478 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-16 03:22:27,478 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1091601529] [2023-12-16 03:22:27,479 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1091601529] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-16 03:22:27,479 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-16 03:22:27,479 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-12-16 03:22:27,479 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [834205417] [2023-12-16 03:22:27,479 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-16 03:22:27,480 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-12-16 03:22:27,480 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-16 03:22:27,481 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-12-16 03:22:27,481 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-12-16 03:22:27,481 INFO L87 Difference]: Start difference. First operand 82 states and 130 transitions. Second operand has 3 states, 3 states have (on average 15.0) internal successors, (45), 3 states have internal predecessors, (45), 1 states have call successors, (24), 1 states have call predecessors, (24), 1 states have return successors, (24), 1 states have call predecessors, (24), 1 states have call successors, (24) [2023-12-16 03:22:27,574 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-16 03:22:27,575 INFO L93 Difference]: Finished difference Result 244 states and 388 transitions. [2023-12-16 03:22:27,588 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-12-16 03:22:27,589 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 15.0) internal successors, (45), 3 states have internal predecessors, (45), 1 states have call successors, (24), 1 states have call predecessors, (24), 1 states have return successors, (24), 1 states have call predecessors, (24), 1 states have call successors, (24) Word has length 162 [2023-12-16 03:22:27,591 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-16 03:22:27,595 INFO L225 Difference]: With dead ends: 244 [2023-12-16 03:22:27,595 INFO L226 Difference]: Without dead ends: 163 [2023-12-16 03:22:27,596 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 50 GetRequests, 49 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-12-16 03:22:27,597 INFO L413 NwaCegarLoop]: 148 mSDtfsCounter, 77 mSDsluCounter, 113 mSDsCounter, 0 mSdLazyCounter, 30 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 77 SdHoareTripleChecker+Valid, 261 SdHoareTripleChecker+Invalid, 31 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 30 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-12-16 03:22:27,597 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [77 Valid, 261 Invalid, 31 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 30 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-12-16 03:22:27,598 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 163 states. [2023-12-16 03:22:27,639 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 163 to 161. [2023-12-16 03:22:27,643 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 161 states, 110 states have (on average 1.4545454545454546) internal successors, (160), 110 states have internal predecessors, (160), 48 states have call successors, (48), 2 states have call predecessors, (48), 2 states have return successors, (48), 48 states have call predecessors, (48), 48 states have call successors, (48) [2023-12-16 03:22:27,651 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 161 states to 161 states and 256 transitions. [2023-12-16 03:22:27,651 INFO L78 Accepts]: Start accepts. Automaton has 161 states and 256 transitions. Word has length 162 [2023-12-16 03:22:27,653 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-16 03:22:27,653 INFO L495 AbstractCegarLoop]: Abstraction has 161 states and 256 transitions. [2023-12-16 03:22:27,653 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 15.0) internal successors, (45), 3 states have internal predecessors, (45), 1 states have call successors, (24), 1 states have call predecessors, (24), 1 states have return successors, (24), 1 states have call predecessors, (24), 1 states have call successors, (24) [2023-12-16 03:22:27,653 INFO L276 IsEmpty]: Start isEmpty. Operand 161 states and 256 transitions. [2023-12-16 03:22:27,659 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 163 [2023-12-16 03:22:27,659 INFO L187 NwaCegarLoop]: Found error trace [2023-12-16 03:22:27,660 INFO L195 NwaCegarLoop]: trace histogram [24, 24, 24, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-16 03:22:27,660 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2023-12-16 03:22:27,660 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-16 03:22:27,661 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-16 03:22:27,661 INFO L85 PathProgramCache]: Analyzing trace with hash -1956363306, now seen corresponding path program 1 times [2023-12-16 03:22:27,661 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-16 03:22:27,661 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1748112360] [2023-12-16 03:22:27,661 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-16 03:22:27,661 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-16 03:22:27,707 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 03:22:27,814 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-12-16 03:22:27,816 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 03:22:27,818 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2023-12-16 03:22:27,818 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 03:22:27,819 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2023-12-16 03:22:27,820 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 03:22:27,821 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2023-12-16 03:22:27,822 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 03:22:27,823 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2023-12-16 03:22:27,825 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 03:22:27,827 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2023-12-16 03:22:27,828 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 03:22:27,829 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2023-12-16 03:22:27,830 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 03:22:27,832 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2023-12-16 03:22:27,832 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 03:22:27,833 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2023-12-16 03:22:27,834 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 03:22:27,835 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2023-12-16 03:22:27,836 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 03:22:27,837 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2023-12-16 03:22:27,837 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 03:22:27,839 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2023-12-16 03:22:27,840 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 03:22:27,841 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 70 [2023-12-16 03:22:27,842 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 03:22:27,843 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2023-12-16 03:22:27,844 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 03:22:27,846 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 81 [2023-12-16 03:22:27,847 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 03:22:27,856 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87 [2023-12-16 03:22:27,857 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 03:22:27,858 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2023-12-16 03:22:27,859 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 03:22:27,860 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2023-12-16 03:22:27,861 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 03:22:27,862 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2023-12-16 03:22:27,862 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 03:22:27,863 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 109 [2023-12-16 03:22:27,864 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 03:22:27,865 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 115 [2023-12-16 03:22:27,865 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 03:22:27,866 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 120 [2023-12-16 03:22:27,867 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 03:22:27,867 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 126 [2023-12-16 03:22:27,868 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 03:22:27,869 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 131 [2023-12-16 03:22:27,870 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 03:22:27,871 INFO L134 CoverageAnalysis]: Checked inductivity of 1104 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1104 trivial. 0 not checked. [2023-12-16 03:22:27,872 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-16 03:22:27,873 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1748112360] [2023-12-16 03:22:27,873 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1748112360] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-16 03:22:27,873 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-16 03:22:27,873 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-12-16 03:22:27,873 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1637790132] [2023-12-16 03:22:27,873 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-16 03:22:27,874 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-12-16 03:22:27,874 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-16 03:22:27,874 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-12-16 03:22:27,879 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-12-16 03:22:27,879 INFO L87 Difference]: Start difference. First operand 161 states and 256 transitions. Second operand has 3 states, 3 states have (on average 15.0) internal successors, (45), 3 states have internal predecessors, (45), 1 states have call successors, (24), 1 states have call predecessors, (24), 1 states have return successors, (24), 1 states have call predecessors, (24), 1 states have call successors, (24) [2023-12-16 03:22:27,970 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-16 03:22:27,970 INFO L93 Difference]: Finished difference Result 475 states and 754 transitions. [2023-12-16 03:22:27,971 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-12-16 03:22:27,971 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 15.0) internal successors, (45), 3 states have internal predecessors, (45), 1 states have call successors, (24), 1 states have call predecessors, (24), 1 states have return successors, (24), 1 states have call predecessors, (24), 1 states have call successors, (24) Word has length 162 [2023-12-16 03:22:27,971 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-16 03:22:27,974 INFO L225 Difference]: With dead ends: 475 [2023-12-16 03:22:27,974 INFO L226 Difference]: Without dead ends: 315 [2023-12-16 03:22:27,977 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 51 GetRequests, 50 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-12-16 03:22:27,979 INFO L413 NwaCegarLoop]: 141 mSDtfsCounter, 114 mSDsluCounter, 108 mSDsCounter, 0 mSdLazyCounter, 21 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 114 SdHoareTripleChecker+Valid, 249 SdHoareTripleChecker+Invalid, 30 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 21 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-12-16 03:22:27,980 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [114 Valid, 249 Invalid, 30 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 21 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-12-16 03:22:27,982 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 315 states. [2023-12-16 03:22:28,035 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 315 to 313. [2023-12-16 03:22:28,036 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 313 states, 212 states have (on average 1.3962264150943395) internal successors, (296), 212 states have internal predecessors, (296), 96 states have call successors, (96), 4 states have call predecessors, (96), 4 states have return successors, (96), 96 states have call predecessors, (96), 96 states have call successors, (96) [2023-12-16 03:22:28,039 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 313 states to 313 states and 488 transitions. [2023-12-16 03:22:28,040 INFO L78 Accepts]: Start accepts. Automaton has 313 states and 488 transitions. Word has length 162 [2023-12-16 03:22:28,040 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-16 03:22:28,040 INFO L495 AbstractCegarLoop]: Abstraction has 313 states and 488 transitions. [2023-12-16 03:22:28,041 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 15.0) internal successors, (45), 3 states have internal predecessors, (45), 1 states have call successors, (24), 1 states have call predecessors, (24), 1 states have return successors, (24), 1 states have call predecessors, (24), 1 states have call successors, (24) [2023-12-16 03:22:28,041 INFO L276 IsEmpty]: Start isEmpty. Operand 313 states and 488 transitions. [2023-12-16 03:22:28,042 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 163 [2023-12-16 03:22:28,042 INFO L187 NwaCegarLoop]: Found error trace [2023-12-16 03:22:28,042 INFO L195 NwaCegarLoop]: trace histogram [24, 24, 24, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-16 03:22:28,042 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2023-12-16 03:22:28,042 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-16 03:22:28,042 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-16 03:22:28,042 INFO L85 PathProgramCache]: Analyzing trace with hash -1369557292, now seen corresponding path program 1 times [2023-12-16 03:22:28,043 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-16 03:22:28,043 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [877940818] [2023-12-16 03:22:28,043 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-16 03:22:28,043 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-16 03:22:28,091 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 03:22:28,310 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-12-16 03:22:28,311 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 03:22:28,313 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2023-12-16 03:22:28,314 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 03:22:28,315 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2023-12-16 03:22:28,316 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 03:22:28,318 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2023-12-16 03:22:28,319 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 03:22:28,320 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2023-12-16 03:22:28,320 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 03:22:28,322 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2023-12-16 03:22:28,323 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 03:22:28,325 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2023-12-16 03:22:28,326 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 03:22:28,328 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2023-12-16 03:22:28,329 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 03:22:28,330 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2023-12-16 03:22:28,330 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 03:22:28,333 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2023-12-16 03:22:28,334 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 03:22:28,336 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2023-12-16 03:22:28,338 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 03:22:28,340 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2023-12-16 03:22:28,341 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 03:22:28,343 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 70 [2023-12-16 03:22:28,344 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 03:22:28,345 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2023-12-16 03:22:28,346 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 03:22:28,348 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 81 [2023-12-16 03:22:28,349 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 03:22:28,350 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87 [2023-12-16 03:22:28,351 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 03:22:28,352 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2023-12-16 03:22:28,353 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 03:22:28,355 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2023-12-16 03:22:28,356 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 03:22:28,357 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2023-12-16 03:22:28,358 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 03:22:28,361 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 109 [2023-12-16 03:22:28,362 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 03:22:28,366 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 115 [2023-12-16 03:22:28,367 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 03:22:28,369 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 120 [2023-12-16 03:22:28,370 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 03:22:28,371 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 126 [2023-12-16 03:22:28,372 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 03:22:28,373 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 131 [2023-12-16 03:22:28,374 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 03:22:28,376 INFO L134 CoverageAnalysis]: Checked inductivity of 1104 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1104 trivial. 0 not checked. [2023-12-16 03:22:28,377 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-16 03:22:28,377 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [877940818] [2023-12-16 03:22:28,377 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [877940818] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-16 03:22:28,377 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-16 03:22:28,377 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-12-16 03:22:28,377 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1403926283] [2023-12-16 03:22:28,377 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-16 03:22:28,378 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-12-16 03:22:28,378 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-16 03:22:28,379 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-12-16 03:22:28,379 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-12-16 03:22:28,379 INFO L87 Difference]: Start difference. First operand 313 states and 488 transitions. Second operand has 4 states, 4 states have (on average 11.25) internal successors, (45), 4 states have internal predecessors, (45), 1 states have call successors, (24), 1 states have call predecessors, (24), 1 states have return successors, (24), 1 states have call predecessors, (24), 1 states have call successors, (24) [2023-12-16 03:22:28,527 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-16 03:22:28,527 INFO L93 Difference]: Finished difference Result 696 states and 1082 transitions. [2023-12-16 03:22:28,527 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-12-16 03:22:28,527 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 11.25) internal successors, (45), 4 states have internal predecessors, (45), 1 states have call successors, (24), 1 states have call predecessors, (24), 1 states have return successors, (24), 1 states have call predecessors, (24), 1 states have call successors, (24) Word has length 162 [2023-12-16 03:22:28,528 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-16 03:22:28,531 INFO L225 Difference]: With dead ends: 696 [2023-12-16 03:22:28,532 INFO L226 Difference]: Without dead ends: 539 [2023-12-16 03:22:28,534 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 54 GetRequests, 51 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2023-12-16 03:22:28,539 INFO L413 NwaCegarLoop]: 140 mSDtfsCounter, 131 mSDsluCounter, 238 mSDsCounter, 0 mSdLazyCounter, 33 mSolverCounterSat, 73 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 131 SdHoareTripleChecker+Valid, 378 SdHoareTripleChecker+Invalid, 106 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 73 IncrementalHoareTripleChecker+Valid, 33 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-12-16 03:22:28,540 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [131 Valid, 378 Invalid, 106 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [73 Valid, 33 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-12-16 03:22:28,541 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 539 states. [2023-12-16 03:22:28,584 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 539 to 471. [2023-12-16 03:22:28,585 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 471 states, 320 states have (on average 1.38125) internal successors, (442), 320 states have internal predecessors, (442), 144 states have call successors, (144), 6 states have call predecessors, (144), 6 states have return successors, (144), 144 states have call predecessors, (144), 144 states have call successors, (144) [2023-12-16 03:22:28,588 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 471 states to 471 states and 730 transitions. [2023-12-16 03:22:28,588 INFO L78 Accepts]: Start accepts. Automaton has 471 states and 730 transitions. Word has length 162 [2023-12-16 03:22:28,588 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-16 03:22:28,588 INFO L495 AbstractCegarLoop]: Abstraction has 471 states and 730 transitions. [2023-12-16 03:22:28,588 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 11.25) internal successors, (45), 4 states have internal predecessors, (45), 1 states have call successors, (24), 1 states have call predecessors, (24), 1 states have return successors, (24), 1 states have call predecessors, (24), 1 states have call successors, (24) [2023-12-16 03:22:28,588 INFO L276 IsEmpty]: Start isEmpty. Operand 471 states and 730 transitions. [2023-12-16 03:22:28,589 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 164 [2023-12-16 03:22:28,589 INFO L187 NwaCegarLoop]: Found error trace [2023-12-16 03:22:28,590 INFO L195 NwaCegarLoop]: trace histogram [24, 24, 24, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-16 03:22:28,590 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2023-12-16 03:22:28,590 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-16 03:22:28,591 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-16 03:22:28,591 INFO L85 PathProgramCache]: Analyzing trace with hash -487959185, now seen corresponding path program 1 times [2023-12-16 03:22:28,591 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-16 03:22:28,591 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [863241250] [2023-12-16 03:22:28,591 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-16 03:22:28,591 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-16 03:22:28,638 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 03:22:29,006 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-12-16 03:22:29,008 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 03:22:29,040 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2023-12-16 03:22:29,042 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 03:22:29,045 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2023-12-16 03:22:29,046 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 03:22:29,048 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2023-12-16 03:22:29,049 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 03:22:29,051 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2023-12-16 03:22:29,052 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 03:22:29,054 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2023-12-16 03:22:29,055 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 03:22:29,057 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2023-12-16 03:22:29,058 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 03:22:29,062 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2023-12-16 03:22:29,064 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 03:22:29,065 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2023-12-16 03:22:29,066 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 03:22:29,068 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2023-12-16 03:22:29,069 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 03:22:29,071 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2023-12-16 03:22:29,072 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 03:22:29,074 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2023-12-16 03:22:29,075 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 03:22:29,077 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 70 [2023-12-16 03:22:29,079 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 03:22:29,081 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2023-12-16 03:22:29,081 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 03:22:29,085 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 81 [2023-12-16 03:22:29,086 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 03:22:29,087 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87 [2023-12-16 03:22:29,088 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 03:22:29,090 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2023-12-16 03:22:29,090 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 03:22:29,092 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2023-12-16 03:22:29,093 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 03:22:29,095 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2023-12-16 03:22:29,095 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 03:22:29,099 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 109 [2023-12-16 03:22:29,100 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 03:22:29,103 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 115 [2023-12-16 03:22:29,104 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 03:22:29,108 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 120 [2023-12-16 03:22:29,110 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 03:22:29,115 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 126 [2023-12-16 03:22:29,116 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 03:22:29,119 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 131 [2023-12-16 03:22:29,120 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 03:22:29,123 INFO L134 CoverageAnalysis]: Checked inductivity of 1104 backedges. 0 proven. 69 refuted. 0 times theorem prover too weak. 1035 trivial. 0 not checked. [2023-12-16 03:22:29,123 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-16 03:22:29,123 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [863241250] [2023-12-16 03:22:29,123 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [863241250] provided 0 perfect and 1 imperfect interpolant sequences [2023-12-16 03:22:29,124 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [655445082] [2023-12-16 03:22:29,124 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-16 03:22:29,124 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-16 03:22:29,124 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-12-16 03:22:29,126 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-16 03:22:29,144 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-16 03:22:29,241 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 03:22:29,243 INFO L262 TraceCheckSpWp]: Trace formula consists of 388 conjuncts, 8 conjunts are in the unsatisfiable core [2023-12-16 03:22:29,250 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-16 03:22:29,457 INFO L134 CoverageAnalysis]: Checked inductivity of 1104 backedges. 23 proven. 69 refuted. 0 times theorem prover too weak. 1012 trivial. 0 not checked. [2023-12-16 03:22:29,458 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-16 03:22:29,636 INFO L134 CoverageAnalysis]: Checked inductivity of 1104 backedges. 0 proven. 69 refuted. 0 times theorem prover too weak. 1035 trivial. 0 not checked. [2023-12-16 03:22:29,636 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [655445082] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-16 03:22:29,636 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-12-16 03:22:29,636 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 6, 6] total 13 [2023-12-16 03:22:29,637 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1167197899] [2023-12-16 03:22:29,637 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-12-16 03:22:29,637 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2023-12-16 03:22:29,637 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-16 03:22:29,638 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2023-12-16 03:22:29,638 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=118, Unknown=0, NotChecked=0, Total=156 [2023-12-16 03:22:29,638 INFO L87 Difference]: Start difference. First operand 471 states and 730 transitions. Second operand has 13 states, 12 states have (on average 7.916666666666667) internal successors, (95), 13 states have internal predecessors, (95), 4 states have call successors, (71), 2 states have call predecessors, (71), 4 states have return successors, (72), 2 states have call predecessors, (72), 4 states have call successors, (72) [2023-12-16 03:22:30,189 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-16 03:22:30,189 INFO L93 Difference]: Finished difference Result 712 states and 1075 transitions. [2023-12-16 03:22:30,189 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2023-12-16 03:22:30,189 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 12 states have (on average 7.916666666666667) internal successors, (95), 13 states have internal predecessors, (95), 4 states have call successors, (71), 2 states have call predecessors, (71), 4 states have return successors, (72), 2 states have call predecessors, (72), 4 states have call successors, (72) Word has length 163 [2023-12-16 03:22:30,190 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-16 03:22:30,191 INFO L225 Difference]: With dead ends: 712 [2023-12-16 03:22:30,191 INFO L226 Difference]: Without dead ends: 400 [2023-12-16 03:22:30,193 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 399 GetRequests, 369 SyntacticMatches, 2 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 164 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=227, Invalid=643, Unknown=0, NotChecked=0, Total=870 [2023-12-16 03:22:30,193 INFO L413 NwaCegarLoop]: 104 mSDtfsCounter, 398 mSDsluCounter, 498 mSDsCounter, 0 mSdLazyCounter, 475 mSolverCounterSat, 197 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 399 SdHoareTripleChecker+Valid, 602 SdHoareTripleChecker+Invalid, 672 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 197 IncrementalHoareTripleChecker+Valid, 475 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2023-12-16 03:22:30,193 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [399 Valid, 602 Invalid, 672 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [197 Valid, 475 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2023-12-16 03:22:30,194 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 400 states. [2023-12-16 03:22:30,271 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 400 to 335. [2023-12-16 03:22:30,272 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 335 states, 230 states have (on average 1.3391304347826087) internal successors, (308), 230 states have internal predecessors, (308), 96 states have call successors, (96), 8 states have call predecessors, (96), 8 states have return successors, (96), 96 states have call predecessors, (96), 96 states have call successors, (96) [2023-12-16 03:22:30,273 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 335 states to 335 states and 500 transitions. [2023-12-16 03:22:30,274 INFO L78 Accepts]: Start accepts. Automaton has 335 states and 500 transitions. Word has length 163 [2023-12-16 03:22:30,274 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-16 03:22:30,274 INFO L495 AbstractCegarLoop]: Abstraction has 335 states and 500 transitions. [2023-12-16 03:22:30,274 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 12 states have (on average 7.916666666666667) internal successors, (95), 13 states have internal predecessors, (95), 4 states have call successors, (71), 2 states have call predecessors, (71), 4 states have return successors, (72), 2 states have call predecessors, (72), 4 states have call successors, (72) [2023-12-16 03:22:30,274 INFO L276 IsEmpty]: Start isEmpty. Operand 335 states and 500 transitions. [2023-12-16 03:22:30,276 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 165 [2023-12-16 03:22:30,276 INFO L187 NwaCegarLoop]: Found error trace [2023-12-16 03:22:30,276 INFO L195 NwaCegarLoop]: trace histogram [24, 24, 24, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-16 03:22:30,285 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-16 03:22:30,476 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-16 03:22:30,477 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-16 03:22:30,477 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-16 03:22:30,478 INFO L85 PathProgramCache]: Analyzing trace with hash 1027130092, now seen corresponding path program 1 times [2023-12-16 03:22:30,478 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-16 03:22:30,478 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [915633664] [2023-12-16 03:22:30,478 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-16 03:22:30,478 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-16 03:22:30,501 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 03:22:30,538 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-12-16 03:22:30,540 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 03:22:30,541 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2023-12-16 03:22:30,542 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 03:22:30,544 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2023-12-16 03:22:30,544 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 03:22:30,545 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2023-12-16 03:22:30,546 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 03:22:30,546 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2023-12-16 03:22:30,547 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 03:22:30,547 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2023-12-16 03:22:30,548 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 03:22:30,548 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2023-12-16 03:22:30,549 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 03:22:30,549 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2023-12-16 03:22:30,550 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 03:22:30,551 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2023-12-16 03:22:30,551 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 03:22:30,552 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2023-12-16 03:22:30,552 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 03:22:30,553 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2023-12-16 03:22:30,553 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 03:22:30,554 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2023-12-16 03:22:30,555 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 03:22:30,556 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 70 [2023-12-16 03:22:30,556 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 03:22:30,557 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2023-12-16 03:22:30,559 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 03:22:30,560 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 81 [2023-12-16 03:22:30,560 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 03:22:30,561 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87 [2023-12-16 03:22:30,562 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 03:22:30,562 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2023-12-16 03:22:30,563 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 03:22:30,564 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2023-12-16 03:22:30,564 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 03:22:30,565 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2023-12-16 03:22:30,565 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 03:22:30,566 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 109 [2023-12-16 03:22:30,566 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 03:22:30,567 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 115 [2023-12-16 03:22:30,568 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 03:22:30,568 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 120 [2023-12-16 03:22:30,569 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 03:22:30,569 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 126 [2023-12-16 03:22:30,570 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 03:22:30,571 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 131 [2023-12-16 03:22:30,571 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 03:22:30,572 INFO L134 CoverageAnalysis]: Checked inductivity of 1104 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1104 trivial. 0 not checked. [2023-12-16 03:22:30,572 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-16 03:22:30,572 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [915633664] [2023-12-16 03:22:30,572 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [915633664] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-16 03:22:30,572 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-16 03:22:30,572 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-12-16 03:22:30,573 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1674118342] [2023-12-16 03:22:30,573 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-16 03:22:30,573 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-12-16 03:22:30,573 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-16 03:22:30,573 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-12-16 03:22:30,573 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-12-16 03:22:30,574 INFO L87 Difference]: Start difference. First operand 335 states and 500 transitions. Second operand has 3 states, 3 states have (on average 15.666666666666666) internal successors, (47), 3 states have internal predecessors, (47), 1 states have call successors, (24), 1 states have call predecessors, (24), 1 states have return successors, (24), 1 states have call predecessors, (24), 1 states have call successors, (24) [2023-12-16 03:22:30,618 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-16 03:22:30,619 INFO L93 Difference]: Finished difference Result 669 states and 999 transitions. [2023-12-16 03:22:30,619 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-12-16 03:22:30,619 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 15.666666666666666) internal successors, (47), 3 states have internal predecessors, (47), 1 states have call successors, (24), 1 states have call predecessors, (24), 1 states have return successors, (24), 1 states have call predecessors, (24), 1 states have call successors, (24) Word has length 164 [2023-12-16 03:22:30,619 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-16 03:22:30,621 INFO L225 Difference]: With dead ends: 669 [2023-12-16 03:22:30,621 INFO L226 Difference]: Without dead ends: 335 [2023-12-16 03:22:30,622 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 51 GetRequests, 50 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-12-16 03:22:30,623 INFO L413 NwaCegarLoop]: 115 mSDtfsCounter, 17 mSDsluCounter, 94 mSDsCounter, 0 mSdLazyCounter, 20 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 17 SdHoareTripleChecker+Valid, 209 SdHoareTripleChecker+Invalid, 20 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 20 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-12-16 03:22:30,623 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [17 Valid, 209 Invalid, 20 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 20 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-12-16 03:22:30,624 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 335 states. [2023-12-16 03:22:30,674 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 335 to 335. [2023-12-16 03:22:30,675 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 335 states, 230 states have (on average 1.3217391304347825) internal successors, (304), 230 states have internal predecessors, (304), 96 states have call successors, (96), 8 states have call predecessors, (96), 8 states have return successors, (96), 96 states have call predecessors, (96), 96 states have call successors, (96) [2023-12-16 03:22:30,676 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 335 states to 335 states and 496 transitions. [2023-12-16 03:22:30,677 INFO L78 Accepts]: Start accepts. Automaton has 335 states and 496 transitions. Word has length 164 [2023-12-16 03:22:30,677 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-16 03:22:30,677 INFO L495 AbstractCegarLoop]: Abstraction has 335 states and 496 transitions. [2023-12-16 03:22:30,677 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 15.666666666666666) internal successors, (47), 3 states have internal predecessors, (47), 1 states have call successors, (24), 1 states have call predecessors, (24), 1 states have return successors, (24), 1 states have call predecessors, (24), 1 states have call successors, (24) [2023-12-16 03:22:30,678 INFO L276 IsEmpty]: Start isEmpty. Operand 335 states and 496 transitions. [2023-12-16 03:22:30,678 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 166 [2023-12-16 03:22:30,678 INFO L187 NwaCegarLoop]: Found error trace [2023-12-16 03:22:30,679 INFO L195 NwaCegarLoop]: trace histogram [24, 24, 24, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-16 03:22:30,679 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2023-12-16 03:22:30,679 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-16 03:22:30,679 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-16 03:22:30,679 INFO L85 PathProgramCache]: Analyzing trace with hash -1364274106, now seen corresponding path program 1 times [2023-12-16 03:22:30,679 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-16 03:22:30,679 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [55483690] [2023-12-16 03:22:30,679 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-16 03:22:30,679 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-16 03:22:30,699 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 03:22:30,765 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-12-16 03:22:30,766 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 03:22:30,768 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2023-12-16 03:22:30,769 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 03:22:30,770 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2023-12-16 03:22:30,771 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 03:22:30,771 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2023-12-16 03:22:30,772 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 03:22:30,773 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2023-12-16 03:22:30,774 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 03:22:30,775 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2023-12-16 03:22:30,782 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 03:22:30,783 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2023-12-16 03:22:30,784 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 03:22:30,785 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2023-12-16 03:22:30,786 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 03:22:30,787 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2023-12-16 03:22:30,788 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 03:22:30,789 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2023-12-16 03:22:30,790 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 03:22:30,791 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2023-12-16 03:22:30,791 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 03:22:30,793 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2023-12-16 03:22:30,794 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 03:22:30,795 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 70 [2023-12-16 03:22:30,796 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 03:22:30,797 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2023-12-16 03:22:30,797 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 03:22:30,798 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 81 [2023-12-16 03:22:30,799 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 03:22:30,800 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87 [2023-12-16 03:22:30,800 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 03:22:30,801 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2023-12-16 03:22:30,802 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 03:22:30,803 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2023-12-16 03:22:30,803 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 03:22:30,804 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2023-12-16 03:22:30,805 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 03:22:30,806 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 109 [2023-12-16 03:22:30,807 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 03:22:30,808 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 115 [2023-12-16 03:22:30,808 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 03:22:30,809 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 120 [2023-12-16 03:22:30,810 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 03:22:30,811 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 126 [2023-12-16 03:22:30,812 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 03:22:30,813 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 131 [2023-12-16 03:22:30,813 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 03:22:30,815 INFO L134 CoverageAnalysis]: Checked inductivity of 1104 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1104 trivial. 0 not checked. [2023-12-16 03:22:30,815 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-16 03:22:30,815 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [55483690] [2023-12-16 03:22:30,815 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [55483690] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-16 03:22:30,815 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-16 03:22:30,815 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-12-16 03:22:30,815 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1242033083] [2023-12-16 03:22:30,815 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-16 03:22:30,816 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-12-16 03:22:30,816 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-16 03:22:30,816 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-12-16 03:22:30,816 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-12-16 03:22:30,816 INFO L87 Difference]: Start difference. First operand 335 states and 496 transitions. Second operand has 5 states, 5 states have (on average 9.6) internal successors, (48), 5 states have internal predecessors, (48), 1 states have call successors, (24), 1 states have call predecessors, (24), 1 states have return successors, (24), 1 states have call predecessors, (24), 1 states have call successors, (24) [2023-12-16 03:22:30,963 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-16 03:22:30,963 INFO L93 Difference]: Finished difference Result 595 states and 877 transitions. [2023-12-16 03:22:30,963 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-12-16 03:22:30,964 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 9.6) internal successors, (48), 5 states have internal predecessors, (48), 1 states have call successors, (24), 1 states have call predecessors, (24), 1 states have return successors, (24), 1 states have call predecessors, (24), 1 states have call successors, (24) Word has length 165 [2023-12-16 03:22:30,964 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-16 03:22:30,965 INFO L225 Difference]: With dead ends: 595 [2023-12-16 03:22:30,965 INFO L226 Difference]: Without dead ends: 261 [2023-12-16 03:22:30,966 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 56 GetRequests, 50 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2023-12-16 03:22:30,967 INFO L413 NwaCegarLoop]: 135 mSDtfsCounter, 135 mSDsluCounter, 295 mSDsCounter, 0 mSdLazyCounter, 103 mSolverCounterSat, 73 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 135 SdHoareTripleChecker+Valid, 430 SdHoareTripleChecker+Invalid, 176 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 73 IncrementalHoareTripleChecker+Valid, 103 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-12-16 03:22:30,967 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [135 Valid, 430 Invalid, 176 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [73 Valid, 103 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-12-16 03:22:30,967 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 261 states. [2023-12-16 03:22:30,991 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 261 to 234. [2023-12-16 03:22:30,991 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 234 states, 155 states have (on average 1.2838709677419355) internal successors, (199), 155 states have internal predecessors, (199), 72 states have call successors, (72), 6 states have call predecessors, (72), 6 states have return successors, (72), 72 states have call predecessors, (72), 72 states have call successors, (72) [2023-12-16 03:22:30,992 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 234 states to 234 states and 343 transitions. [2023-12-16 03:22:30,993 INFO L78 Accepts]: Start accepts. Automaton has 234 states and 343 transitions. Word has length 165 [2023-12-16 03:22:30,995 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-16 03:22:30,995 INFO L495 AbstractCegarLoop]: Abstraction has 234 states and 343 transitions. [2023-12-16 03:22:30,995 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 9.6) internal successors, (48), 5 states have internal predecessors, (48), 1 states have call successors, (24), 1 states have call predecessors, (24), 1 states have return successors, (24), 1 states have call predecessors, (24), 1 states have call successors, (24) [2023-12-16 03:22:30,995 INFO L276 IsEmpty]: Start isEmpty. Operand 234 states and 343 transitions. [2023-12-16 03:22:30,996 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 166 [2023-12-16 03:22:30,996 INFO L187 NwaCegarLoop]: Found error trace [2023-12-16 03:22:30,996 INFO L195 NwaCegarLoop]: trace histogram [24, 24, 24, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-16 03:22:30,996 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2023-12-16 03:22:30,996 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-16 03:22:30,997 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-16 03:22:30,997 INFO L85 PathProgramCache]: Analyzing trace with hash -84410428, now seen corresponding path program 1 times [2023-12-16 03:22:30,997 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-16 03:22:30,997 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1201227644] [2023-12-16 03:22:30,997 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-16 03:22:30,997 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-16 03:22:31,048 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-12-16 03:22:31,049 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-12-16 03:22:31,070 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-12-16 03:22:31,129 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-12-16 03:22:31,130 INFO L360 BasicCegarLoop]: Counterexample is feasible [2023-12-16 03:22:31,130 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2023-12-16 03:22:31,131 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2023-12-16 03:22:31,134 INFO L445 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1] [2023-12-16 03:22:31,136 INFO L179 ceAbstractionStarter]: Computing trace abstraction results [2023-12-16 03:22:31,208 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 16.12 03:22:31 BoogieIcfgContainer [2023-12-16 03:22:31,208 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2023-12-16 03:22:31,208 INFO L158 Benchmark]: Toolchain (without parser) took 5699.90ms. Allocated memory was 216.0MB in the beginning and 260.0MB in the end (delta: 44.0MB). Free memory was 168.1MB in the beginning and 214.3MB in the end (delta: -46.2MB). Peak memory consumption was 132.3MB. Max. memory is 8.0GB. [2023-12-16 03:22:31,209 INFO L158 Benchmark]: CDTParser took 0.43ms. Allocated memory is still 179.3MB. Free memory is still 136.0MB. There was no memory consumed. Max. memory is 8.0GB. [2023-12-16 03:22:31,209 INFO L158 Benchmark]: CACSL2BoogieTranslator took 251.48ms. Allocated memory is still 216.0MB. Free memory was 167.9MB in the beginning and 152.8MB in the end (delta: 15.1MB). Peak memory consumption was 15.7MB. Max. memory is 8.0GB. [2023-12-16 03:22:31,209 INFO L158 Benchmark]: Boogie Procedure Inliner took 33.06ms. Allocated memory is still 216.0MB. Free memory was 152.8MB in the beginning and 150.3MB in the end (delta: 2.5MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. [2023-12-16 03:22:31,209 INFO L158 Benchmark]: Boogie Preprocessor took 41.62ms. Allocated memory is still 216.0MB. Free memory was 150.3MB in the beginning and 147.5MB in the end (delta: 2.7MB). Peak memory consumption was 3.1MB. Max. memory is 8.0GB. [2023-12-16 03:22:31,209 INFO L158 Benchmark]: RCFGBuilder took 394.03ms. Allocated memory is still 216.0MB. Free memory was 147.1MB in the beginning and 125.5MB in the end (delta: 21.6MB). Peak memory consumption was 22.0MB. Max. memory is 8.0GB. [2023-12-16 03:22:31,209 INFO L158 Benchmark]: TraceAbstraction took 4973.08ms. Allocated memory was 216.0MB in the beginning and 260.0MB in the end (delta: 44.0MB). Free memory was 125.1MB in the beginning and 214.3MB in the end (delta: -89.2MB). Peak memory consumption was 89.3MB. Max. memory is 8.0GB. [2023-12-16 03:22:31,210 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.43ms. Allocated memory is still 179.3MB. Free memory is still 136.0MB. There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 251.48ms. Allocated memory is still 216.0MB. Free memory was 167.9MB in the beginning and 152.8MB in the end (delta: 15.1MB). Peak memory consumption was 15.7MB. Max. memory is 8.0GB. * Boogie Procedure Inliner took 33.06ms. Allocated memory is still 216.0MB. Free memory was 152.8MB in the beginning and 150.3MB in the end (delta: 2.5MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. * Boogie Preprocessor took 41.62ms. Allocated memory is still 216.0MB. Free memory was 150.3MB in the beginning and 147.5MB in the end (delta: 2.7MB). Peak memory consumption was 3.1MB. Max. memory is 8.0GB. * RCFGBuilder took 394.03ms. Allocated memory is still 216.0MB. Free memory was 147.1MB in the beginning and 125.5MB in the end (delta: 21.6MB). Peak memory consumption was 22.0MB. Max. memory is 8.0GB. * TraceAbstraction took 4973.08ms. Allocated memory was 216.0MB in the beginning and 260.0MB in the end (delta: 44.0MB). Free memory was 125.1MB in the beginning and 214.3MB in the end (delta: -89.2MB). Peak memory consumption was 89.3MB. Max. memory is 8.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - UnprovableResult [Line: 19]: Unable to prove that a call to reach_error is unreachable Unable to prove that a call to reach_error is unreachable Reason: overapproximation of someBinaryDOUBLEComparisonOperation at line 198, overapproximation of bitwise operation at line 120, overapproximation of someBinaryArithmeticDOUBLEoperation at line 134. Possible FailurePath: [L21] unsigned char isInitial = 0; [L22] unsigned char var_1_1 = 1; [L23] unsigned char var_1_4 = 0; [L24] double var_1_5 = 127.5; [L25] double var_1_7 = 10000000000000.125; [L26] double var_1_8 = 1.25; [L27] double var_1_10 = 25.7; [L28] signed long int var_1_11 = -2; [L29] signed long int var_1_13 = 5; [L30] signed long int var_1_14 = 128; [L31] signed long int var_1_15 = 1000; [L32] double var_1_16 = 0.2; [L33] double var_1_17 = 0.25; [L34] double var_1_18 = 99999999999999.5; [L35] signed short int var_1_19 = -64; [L36] double var_1_21 = 100.4; [L37] signed long int var_1_24 = 10; [L38] signed char var_1_25 = -8; [L39] double var_1_26 = 9.75; [L40] signed char var_1_28 = 8; [L41] unsigned long int var_1_29 = 16; [L42] unsigned long int var_1_30 = 1; [L43] float var_1_31 = 16.6; [L44] signed short int var_1_35 = 256; [L45] unsigned long int var_1_36 = 16; [L46] double var_1_37 = 8.5; [L47] unsigned long int var_1_38 = 3569725445; [L48] unsigned long int var_1_39 = 3551809449; [L49] unsigned long int var_1_40 = 10000000; [L50] unsigned char last_1_var_1_1 = 1; [L51] signed long int last_1_var_1_11 = -2; [L52] signed long int last_1_var_1_15 = 1000; [L53] double last_1_var_1_16 = 0.2; [L202] isInitial = 1 [L203] FCALL initially() [L204] COND TRUE 1 [L205] CALL updateLastVariables() [L192] last_1_var_1_1 = var_1_1 [L193] last_1_var_1_11 = var_1_11 [L194] last_1_var_1_15 = var_1_15 [L195] last_1_var_1_16 = var_1_16 [L205] RET updateLastVariables() [L206] CALL updateVariables() [L151] var_1_4 = __VERIFIER_nondet_uchar() [L152] CALL assume_abort_if_not(var_1_4 >= 1) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=-2, last_1_var_1_15=1000, last_1_var_1_16=1/5, last_1_var_1_1=1, var_1_10=257/10, var_1_11=-2, var_1_13=5, var_1_14=128, var_1_15=1000, var_1_16=1/5, var_1_17=1/4, var_1_18=199999999999999/2, var_1_19=-64, var_1_1=1, var_1_21=502/5, var_1_24=10, var_1_25=-8, var_1_26=39/4, var_1_28=8, var_1_29=16, var_1_30=1, var_1_31=83/5, var_1_35=256, var_1_36=16, var_1_37=17/2, var_1_38=3569725445, var_1_39=3551809449, var_1_40=10000000, var_1_4=1, var_1_5=255/2, var_1_7=80000000000001/8, var_1_8=5/4] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1, isInitial=1, last_1_var_1_11=-2, last_1_var_1_15=1000, last_1_var_1_16=1/5, last_1_var_1_1=1, var_1_10=257/10, var_1_11=-2, var_1_13=5, var_1_14=128, var_1_15=1000, var_1_16=1/5, var_1_17=1/4, var_1_18=199999999999999/2, var_1_19=-64, var_1_1=1, var_1_21=502/5, var_1_24=10, var_1_25=-8, var_1_26=39/4, var_1_28=8, var_1_29=16, var_1_30=1, var_1_31=83/5, var_1_35=256, var_1_36=16, var_1_37=17/2, var_1_38=3569725445, var_1_39=3551809449, var_1_40=10000000, var_1_4=1, var_1_5=255/2, var_1_7=80000000000001/8, var_1_8=5/4] [L152] RET assume_abort_if_not(var_1_4 >= 1) VAL [isInitial=1, last_1_var_1_11=-2, last_1_var_1_15=1000, last_1_var_1_16=1/5, last_1_var_1_1=1, var_1_10=257/10, var_1_11=-2, var_1_13=5, var_1_14=128, var_1_15=1000, var_1_16=1/5, var_1_17=1/4, var_1_18=199999999999999/2, var_1_19=-64, var_1_1=1, var_1_21=502/5, var_1_24=10, var_1_25=-8, var_1_26=39/4, var_1_28=8, var_1_29=16, var_1_30=1, var_1_31=83/5, var_1_35=256, var_1_36=16, var_1_37=17/2, var_1_38=3569725445, var_1_39=3551809449, var_1_40=10000000, var_1_4=1, var_1_5=255/2, var_1_7=80000000000001/8, var_1_8=5/4] [L153] CALL assume_abort_if_not(var_1_4 <= 1) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=-2, last_1_var_1_15=1000, last_1_var_1_16=1/5, last_1_var_1_1=1, var_1_10=257/10, var_1_11=-2, var_1_13=5, var_1_14=128, var_1_15=1000, var_1_16=1/5, var_1_17=1/4, var_1_18=199999999999999/2, var_1_19=-64, var_1_1=1, var_1_21=502/5, var_1_24=10, var_1_25=-8, var_1_26=39/4, var_1_28=8, var_1_29=16, var_1_30=1, var_1_31=83/5, var_1_35=256, var_1_36=16, var_1_37=17/2, var_1_38=3569725445, var_1_39=3551809449, var_1_40=10000000, var_1_4=1, var_1_5=255/2, var_1_7=80000000000001/8, var_1_8=5/4] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1, isInitial=1, last_1_var_1_11=-2, last_1_var_1_15=1000, last_1_var_1_16=1/5, last_1_var_1_1=1, var_1_10=257/10, var_1_11=-2, var_1_13=5, var_1_14=128, var_1_15=1000, var_1_16=1/5, var_1_17=1/4, var_1_18=199999999999999/2, var_1_19=-64, var_1_1=1, var_1_21=502/5, var_1_24=10, var_1_25=-8, var_1_26=39/4, var_1_28=8, var_1_29=16, var_1_30=1, var_1_31=83/5, var_1_35=256, var_1_36=16, var_1_37=17/2, var_1_38=3569725445, var_1_39=3551809449, var_1_40=10000000, var_1_4=1, var_1_5=255/2, var_1_7=80000000000001/8, var_1_8=5/4] [L153] RET assume_abort_if_not(var_1_4 <= 1) VAL [isInitial=1, last_1_var_1_11=-2, last_1_var_1_15=1000, last_1_var_1_16=1/5, last_1_var_1_1=1, var_1_10=257/10, var_1_11=-2, var_1_13=5, var_1_14=128, var_1_15=1000, var_1_16=1/5, var_1_17=1/4, var_1_18=199999999999999/2, var_1_19=-64, var_1_1=1, var_1_21=502/5, var_1_24=10, var_1_25=-8, var_1_26=39/4, var_1_28=8, var_1_29=16, var_1_30=1, var_1_31=83/5, var_1_35=256, var_1_36=16, var_1_37=17/2, var_1_38=3569725445, var_1_39=3551809449, var_1_40=10000000, var_1_4=1, var_1_5=255/2, var_1_7=80000000000001/8, var_1_8=5/4] [L154] var_1_7 = __VERIFIER_nondet_double() [L155] CALL assume_abort_if_not((var_1_7 >= -922337.2036854765600e+13F && var_1_7 <= -1.0e-20F) || (var_1_7 <= 9223372.036854765600e+12F && var_1_7 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=-2, last_1_var_1_15=1000, last_1_var_1_16=1/5, last_1_var_1_1=1, var_1_10=257/10, var_1_11=-2, var_1_13=5, var_1_14=128, var_1_15=1000, var_1_16=1/5, var_1_17=1/4, var_1_18=199999999999999/2, var_1_19=-64, var_1_1=1, var_1_21=502/5, var_1_24=10, var_1_25=-8, var_1_26=39/4, var_1_28=8, var_1_29=16, var_1_30=1, var_1_31=83/5, var_1_35=256, var_1_36=16, var_1_37=17/2, var_1_38=3569725445, var_1_39=3551809449, var_1_40=10000000, var_1_4=1, var_1_5=255/2, var_1_8=5/4] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1, isInitial=1, last_1_var_1_11=-2, last_1_var_1_15=1000, last_1_var_1_16=1/5, last_1_var_1_1=1, var_1_10=257/10, var_1_11=-2, var_1_13=5, var_1_14=128, var_1_15=1000, var_1_16=1/5, var_1_17=1/4, var_1_18=199999999999999/2, var_1_19=-64, var_1_1=1, var_1_21=502/5, var_1_24=10, var_1_25=-8, var_1_26=39/4, var_1_28=8, var_1_29=16, var_1_30=1, var_1_31=83/5, var_1_35=256, var_1_36=16, var_1_37=17/2, var_1_38=3569725445, var_1_39=3551809449, var_1_40=10000000, var_1_4=1, var_1_5=255/2, var_1_8=5/4] [L155] RET assume_abort_if_not((var_1_7 >= -922337.2036854765600e+13F && var_1_7 <= -1.0e-20F) || (var_1_7 <= 9223372.036854765600e+12F && var_1_7 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_11=-2, last_1_var_1_15=1000, last_1_var_1_16=1/5, last_1_var_1_1=1, var_1_10=257/10, var_1_11=-2, var_1_13=5, var_1_14=128, var_1_15=1000, var_1_16=1/5, var_1_17=1/4, var_1_18=199999999999999/2, var_1_19=-64, var_1_1=1, var_1_21=502/5, var_1_24=10, var_1_25=-8, var_1_26=39/4, var_1_28=8, var_1_29=16, var_1_30=1, var_1_31=83/5, var_1_35=256, var_1_36=16, var_1_37=17/2, var_1_38=3569725445, var_1_39=3551809449, var_1_40=10000000, var_1_4=1, var_1_5=255/2, var_1_8=5/4] [L156] var_1_10 = __VERIFIER_nondet_double() [L157] CALL assume_abort_if_not((var_1_10 >= -922337.2036854765600e+13F && var_1_10 <= -1.0e-20F) || (var_1_10 <= 9223372.036854765600e+12F && var_1_10 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=-2, last_1_var_1_15=1000, last_1_var_1_16=1/5, last_1_var_1_1=1, var_1_11=-2, var_1_13=5, var_1_14=128, var_1_15=1000, var_1_16=1/5, var_1_17=1/4, var_1_18=199999999999999/2, var_1_19=-64, var_1_1=1, var_1_21=502/5, var_1_24=10, var_1_25=-8, var_1_26=39/4, var_1_28=8, var_1_29=16, var_1_30=1, var_1_31=83/5, var_1_35=256, var_1_36=16, var_1_37=17/2, var_1_38=3569725445, var_1_39=3551809449, var_1_40=10000000, var_1_4=1, var_1_5=255/2, var_1_8=5/4] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1, isInitial=1, last_1_var_1_11=-2, last_1_var_1_15=1000, last_1_var_1_16=1/5, last_1_var_1_1=1, var_1_11=-2, var_1_13=5, var_1_14=128, var_1_15=1000, var_1_16=1/5, var_1_17=1/4, var_1_18=199999999999999/2, var_1_19=-64, var_1_1=1, var_1_21=502/5, var_1_24=10, var_1_25=-8, var_1_26=39/4, var_1_28=8, var_1_29=16, var_1_30=1, var_1_31=83/5, var_1_35=256, var_1_36=16, var_1_37=17/2, var_1_38=3569725445, var_1_39=3551809449, var_1_40=10000000, var_1_4=1, var_1_5=255/2, var_1_8=5/4] [L157] RET assume_abort_if_not((var_1_10 >= -922337.2036854765600e+13F && var_1_10 <= -1.0e-20F) || (var_1_10 <= 9223372.036854765600e+12F && var_1_10 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_11=-2, last_1_var_1_15=1000, last_1_var_1_16=1/5, last_1_var_1_1=1, var_1_11=-2, var_1_13=5, var_1_14=128, var_1_15=1000, var_1_16=1/5, var_1_17=1/4, var_1_18=199999999999999/2, var_1_19=-64, var_1_1=1, var_1_21=502/5, var_1_24=10, var_1_25=-8, var_1_26=39/4, var_1_28=8, var_1_29=16, var_1_30=1, var_1_31=83/5, var_1_35=256, var_1_36=16, var_1_37=17/2, var_1_38=3569725445, var_1_39=3551809449, var_1_40=10000000, var_1_4=1, var_1_5=255/2, var_1_8=5/4] [L158] var_1_13 = __VERIFIER_nondet_long() [L159] CALL assume_abort_if_not(var_1_13 >= -1) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=-2, last_1_var_1_15=1000, last_1_var_1_16=1/5, last_1_var_1_1=1, var_1_11=-2, var_1_13=2147483646, var_1_14=128, var_1_15=1000, var_1_16=1/5, var_1_17=1/4, var_1_18=199999999999999/2, var_1_19=-64, var_1_1=1, var_1_21=502/5, var_1_24=10, var_1_25=-8, var_1_26=39/4, var_1_28=8, var_1_29=16, var_1_30=1, var_1_31=83/5, var_1_35=256, var_1_36=16, var_1_37=17/2, var_1_38=3569725445, var_1_39=3551809449, var_1_40=10000000, var_1_4=1, var_1_5=255/2, var_1_8=5/4] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1, isInitial=1, last_1_var_1_11=-2, last_1_var_1_15=1000, last_1_var_1_16=1/5, last_1_var_1_1=1, var_1_11=-2, var_1_13=2147483646, var_1_14=128, var_1_15=1000, var_1_16=1/5, var_1_17=1/4, var_1_18=199999999999999/2, var_1_19=-64, var_1_1=1, var_1_21=502/5, var_1_24=10, var_1_25=-8, var_1_26=39/4, var_1_28=8, var_1_29=16, var_1_30=1, var_1_31=83/5, var_1_35=256, var_1_36=16, var_1_37=17/2, var_1_38=3569725445, var_1_39=3551809449, var_1_40=10000000, var_1_4=1, var_1_5=255/2, var_1_8=5/4] [L159] RET assume_abort_if_not(var_1_13 >= -1) VAL [isInitial=1, last_1_var_1_11=-2, last_1_var_1_15=1000, last_1_var_1_16=1/5, last_1_var_1_1=1, var_1_11=-2, var_1_13=2147483646, var_1_14=128, var_1_15=1000, var_1_16=1/5, var_1_17=1/4, var_1_18=199999999999999/2, var_1_19=-64, var_1_1=1, var_1_21=502/5, var_1_24=10, var_1_25=-8, var_1_26=39/4, var_1_28=8, var_1_29=16, var_1_30=1, var_1_31=83/5, var_1_35=256, var_1_36=16, var_1_37=17/2, var_1_38=3569725445, var_1_39=3551809449, var_1_40=10000000, var_1_4=1, var_1_5=255/2, var_1_8=5/4] [L160] CALL assume_abort_if_not(var_1_13 <= 2147483646) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=-2, last_1_var_1_15=1000, last_1_var_1_16=1/5, last_1_var_1_1=1, var_1_11=-2, var_1_13=2147483646, var_1_14=128, var_1_15=1000, var_1_16=1/5, var_1_17=1/4, var_1_18=199999999999999/2, var_1_19=-64, var_1_1=1, var_1_21=502/5, var_1_24=10, var_1_25=-8, var_1_26=39/4, var_1_28=8, var_1_29=16, var_1_30=1, var_1_31=83/5, var_1_35=256, var_1_36=16, var_1_37=17/2, var_1_38=3569725445, var_1_39=3551809449, var_1_40=10000000, var_1_4=1, var_1_5=255/2, var_1_8=5/4] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1, isInitial=1, last_1_var_1_11=-2, last_1_var_1_15=1000, last_1_var_1_16=1/5, last_1_var_1_1=1, var_1_11=-2, var_1_13=2147483646, var_1_14=128, var_1_15=1000, var_1_16=1/5, var_1_17=1/4, var_1_18=199999999999999/2, var_1_19=-64, var_1_1=1, var_1_21=502/5, var_1_24=10, var_1_25=-8, var_1_26=39/4, var_1_28=8, var_1_29=16, var_1_30=1, var_1_31=83/5, var_1_35=256, var_1_36=16, var_1_37=17/2, var_1_38=3569725445, var_1_39=3551809449, var_1_40=10000000, var_1_4=1, var_1_5=255/2, var_1_8=5/4] [L160] RET assume_abort_if_not(var_1_13 <= 2147483646) VAL [isInitial=1, last_1_var_1_11=-2, last_1_var_1_15=1000, last_1_var_1_16=1/5, last_1_var_1_1=1, var_1_11=-2, var_1_13=2147483646, var_1_14=128, var_1_15=1000, var_1_16=1/5, var_1_17=1/4, var_1_18=199999999999999/2, var_1_19=-64, var_1_1=1, var_1_21=502/5, var_1_24=10, var_1_25=-8, var_1_26=39/4, var_1_28=8, var_1_29=16, var_1_30=1, var_1_31=83/5, var_1_35=256, var_1_36=16, var_1_37=17/2, var_1_38=3569725445, var_1_39=3551809449, var_1_40=10000000, var_1_4=1, var_1_5=255/2, var_1_8=5/4] [L161] var_1_14 = __VERIFIER_nondet_long() [L162] CALL assume_abort_if_not(var_1_14 >= -2147483647) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=-2, last_1_var_1_15=1000, last_1_var_1_16=1/5, last_1_var_1_1=1, var_1_11=-2, var_1_13=2147483646, var_1_14=2147483642, var_1_15=1000, var_1_16=1/5, var_1_17=1/4, var_1_18=199999999999999/2, var_1_19=-64, var_1_1=1, var_1_21=502/5, var_1_24=10, var_1_25=-8, var_1_26=39/4, var_1_28=8, var_1_29=16, var_1_30=1, var_1_31=83/5, var_1_35=256, var_1_36=16, var_1_37=17/2, var_1_38=3569725445, var_1_39=3551809449, var_1_40=10000000, var_1_4=1, var_1_5=255/2, var_1_8=5/4] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1, isInitial=1, last_1_var_1_11=-2, last_1_var_1_15=1000, last_1_var_1_16=1/5, last_1_var_1_1=1, var_1_11=-2, var_1_13=2147483646, var_1_14=2147483642, var_1_15=1000, var_1_16=1/5, var_1_17=1/4, var_1_18=199999999999999/2, var_1_19=-64, var_1_1=1, var_1_21=502/5, var_1_24=10, var_1_25=-8, var_1_26=39/4, var_1_28=8, var_1_29=16, var_1_30=1, var_1_31=83/5, var_1_35=256, var_1_36=16, var_1_37=17/2, var_1_38=3569725445, var_1_39=3551809449, var_1_40=10000000, var_1_4=1, var_1_5=255/2, var_1_8=5/4] [L162] RET assume_abort_if_not(var_1_14 >= -2147483647) VAL [isInitial=1, last_1_var_1_11=-2, last_1_var_1_15=1000, last_1_var_1_16=1/5, last_1_var_1_1=1, var_1_11=-2, var_1_13=2147483646, var_1_14=2147483642, var_1_15=1000, var_1_16=1/5, var_1_17=1/4, var_1_18=199999999999999/2, var_1_19=-64, var_1_1=1, var_1_21=502/5, var_1_24=10, var_1_25=-8, var_1_26=39/4, var_1_28=8, var_1_29=16, var_1_30=1, var_1_31=83/5, var_1_35=256, var_1_36=16, var_1_37=17/2, var_1_38=3569725445, var_1_39=3551809449, var_1_40=10000000, var_1_4=1, var_1_5=255/2, var_1_8=5/4] [L163] CALL assume_abort_if_not(var_1_14 <= 2147483646) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=-2, last_1_var_1_15=1000, last_1_var_1_16=1/5, last_1_var_1_1=1, var_1_11=-2, var_1_13=2147483646, var_1_14=2147483642, var_1_15=1000, var_1_16=1/5, var_1_17=1/4, var_1_18=199999999999999/2, var_1_19=-64, var_1_1=1, var_1_21=502/5, var_1_24=10, var_1_25=-8, var_1_26=39/4, var_1_28=8, var_1_29=16, var_1_30=1, var_1_31=83/5, var_1_35=256, var_1_36=16, var_1_37=17/2, var_1_38=3569725445, var_1_39=3551809449, var_1_40=10000000, var_1_4=1, var_1_5=255/2, var_1_8=5/4] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1, isInitial=1, last_1_var_1_11=-2, last_1_var_1_15=1000, last_1_var_1_16=1/5, last_1_var_1_1=1, var_1_11=-2, var_1_13=2147483646, var_1_14=2147483642, var_1_15=1000, var_1_16=1/5, var_1_17=1/4, var_1_18=199999999999999/2, var_1_19=-64, var_1_1=1, var_1_21=502/5, var_1_24=10, var_1_25=-8, var_1_26=39/4, var_1_28=8, var_1_29=16, var_1_30=1, var_1_31=83/5, var_1_35=256, var_1_36=16, var_1_37=17/2, var_1_38=3569725445, var_1_39=3551809449, var_1_40=10000000, var_1_4=1, var_1_5=255/2, var_1_8=5/4] [L163] RET assume_abort_if_not(var_1_14 <= 2147483646) VAL [isInitial=1, last_1_var_1_11=-2, last_1_var_1_15=1000, last_1_var_1_16=1/5, last_1_var_1_1=1, var_1_11=-2, var_1_13=2147483646, var_1_14=2147483642, var_1_15=1000, var_1_16=1/5, var_1_17=1/4, var_1_18=199999999999999/2, var_1_19=-64, var_1_1=1, var_1_21=502/5, var_1_24=10, var_1_25=-8, var_1_26=39/4, var_1_28=8, var_1_29=16, var_1_30=1, var_1_31=83/5, var_1_35=256, var_1_36=16, var_1_37=17/2, var_1_38=3569725445, var_1_39=3551809449, var_1_40=10000000, var_1_4=1, var_1_5=255/2, var_1_8=5/4] [L164] var_1_17 = __VERIFIER_nondet_double() [L165] CALL assume_abort_if_not((var_1_17 >= -461168.6018427382800e+13F && var_1_17 <= -1.0e-20F) || (var_1_17 <= 4611686.018427382800e+12F && var_1_17 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=-2, last_1_var_1_15=1000, last_1_var_1_16=1/5, last_1_var_1_1=1, var_1_11=-2, var_1_13=2147483646, var_1_14=2147483642, var_1_15=1000, var_1_16=1/5, var_1_18=199999999999999/2, var_1_19=-64, var_1_1=1, var_1_21=502/5, var_1_24=10, var_1_25=-8, var_1_26=39/4, var_1_28=8, var_1_29=16, var_1_30=1, var_1_31=83/5, var_1_35=256, var_1_36=16, var_1_37=17/2, var_1_38=3569725445, var_1_39=3551809449, var_1_40=10000000, var_1_4=1, var_1_5=255/2, var_1_8=5/4] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1, isInitial=1, last_1_var_1_11=-2, last_1_var_1_15=1000, last_1_var_1_16=1/5, last_1_var_1_1=1, var_1_11=-2, var_1_13=2147483646, var_1_14=2147483642, var_1_15=1000, var_1_16=1/5, var_1_18=199999999999999/2, var_1_19=-64, var_1_1=1, var_1_21=502/5, var_1_24=10, var_1_25=-8, var_1_26=39/4, var_1_28=8, var_1_29=16, var_1_30=1, var_1_31=83/5, var_1_35=256, var_1_36=16, var_1_37=17/2, var_1_38=3569725445, var_1_39=3551809449, var_1_40=10000000, var_1_4=1, var_1_5=255/2, var_1_8=5/4] [L165] RET assume_abort_if_not((var_1_17 >= -461168.6018427382800e+13F && var_1_17 <= -1.0e-20F) || (var_1_17 <= 4611686.018427382800e+12F && var_1_17 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_11=-2, last_1_var_1_15=1000, last_1_var_1_16=1/5, last_1_var_1_1=1, var_1_11=-2, var_1_13=2147483646, var_1_14=2147483642, var_1_15=1000, var_1_16=1/5, var_1_18=199999999999999/2, var_1_19=-64, var_1_1=1, var_1_21=502/5, var_1_24=10, var_1_25=-8, var_1_26=39/4, var_1_28=8, var_1_29=16, var_1_30=1, var_1_31=83/5, var_1_35=256, var_1_36=16, var_1_37=17/2, var_1_38=3569725445, var_1_39=3551809449, var_1_40=10000000, var_1_4=1, var_1_5=255/2, var_1_8=5/4] [L166] var_1_18 = __VERIFIER_nondet_double() [L167] CALL assume_abort_if_not((var_1_18 >= -230584.3009213691390e+13F && var_1_18 <= -1.0e-20F) || (var_1_18 <= 2305843.009213691390e+12F && var_1_18 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=-2, last_1_var_1_15=1000, last_1_var_1_16=1/5, last_1_var_1_1=1, var_1_11=-2, var_1_13=2147483646, var_1_14=2147483642, var_1_15=1000, var_1_16=1/5, var_1_19=-64, var_1_1=1, var_1_21=502/5, var_1_24=10, var_1_25=-8, var_1_26=39/4, var_1_28=8, var_1_29=16, var_1_30=1, var_1_31=83/5, var_1_35=256, var_1_36=16, var_1_37=17/2, var_1_38=3569725445, var_1_39=3551809449, var_1_40=10000000, var_1_4=1, var_1_5=255/2, var_1_8=5/4] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1, isInitial=1, last_1_var_1_11=-2, last_1_var_1_15=1000, last_1_var_1_16=1/5, last_1_var_1_1=1, var_1_11=-2, var_1_13=2147483646, var_1_14=2147483642, var_1_15=1000, var_1_16=1/5, var_1_19=-64, var_1_1=1, var_1_21=502/5, var_1_24=10, var_1_25=-8, var_1_26=39/4, var_1_28=8, var_1_29=16, var_1_30=1, var_1_31=83/5, var_1_35=256, var_1_36=16, var_1_37=17/2, var_1_38=3569725445, var_1_39=3551809449, var_1_40=10000000, var_1_4=1, var_1_5=255/2, var_1_8=5/4] [L167] RET assume_abort_if_not((var_1_18 >= -230584.3009213691390e+13F && var_1_18 <= -1.0e-20F) || (var_1_18 <= 2305843.009213691390e+12F && var_1_18 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_11=-2, last_1_var_1_15=1000, last_1_var_1_16=1/5, last_1_var_1_1=1, var_1_11=-2, var_1_13=2147483646, var_1_14=2147483642, var_1_15=1000, var_1_16=1/5, var_1_19=-64, var_1_1=1, var_1_21=502/5, var_1_24=10, var_1_25=-8, var_1_26=39/4, var_1_28=8, var_1_29=16, var_1_30=1, var_1_31=83/5, var_1_35=256, var_1_36=16, var_1_37=17/2, var_1_38=3569725445, var_1_39=3551809449, var_1_40=10000000, var_1_4=1, var_1_5=255/2, var_1_8=5/4] [L168] var_1_21 = __VERIFIER_nondet_double() [L169] CALL assume_abort_if_not((var_1_21 >= 0.0F && var_1_21 <= -1.0e-20F) || (var_1_21 <= 9223372.036854776000e+12F && var_1_21 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=-2, last_1_var_1_15=1000, last_1_var_1_16=1/5, last_1_var_1_1=1, var_1_11=-2, var_1_13=2147483646, var_1_14=2147483642, var_1_15=1000, var_1_16=1/5, var_1_19=-64, var_1_1=1, var_1_24=10, var_1_25=-8, var_1_26=39/4, var_1_28=8, var_1_29=16, var_1_30=1, var_1_31=83/5, var_1_35=256, var_1_36=16, var_1_37=17/2, var_1_38=3569725445, var_1_39=3551809449, var_1_40=10000000, var_1_4=1, var_1_5=255/2, var_1_8=5/4] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1, isInitial=1, last_1_var_1_11=-2, last_1_var_1_15=1000, last_1_var_1_16=1/5, last_1_var_1_1=1, var_1_11=-2, var_1_13=2147483646, var_1_14=2147483642, var_1_15=1000, var_1_16=1/5, var_1_19=-64, var_1_1=1, var_1_24=10, var_1_25=-8, var_1_26=39/4, var_1_28=8, var_1_29=16, var_1_30=1, var_1_31=83/5, var_1_35=256, var_1_36=16, var_1_37=17/2, var_1_38=3569725445, var_1_39=3551809449, var_1_40=10000000, var_1_4=1, var_1_5=255/2, var_1_8=5/4] [L169] RET assume_abort_if_not((var_1_21 >= 0.0F && var_1_21 <= -1.0e-20F) || (var_1_21 <= 9223372.036854776000e+12F && var_1_21 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_11=-2, last_1_var_1_15=1000, last_1_var_1_16=1/5, last_1_var_1_1=1, var_1_11=-2, var_1_13=2147483646, var_1_14=2147483642, var_1_15=1000, var_1_16=1/5, var_1_19=-64, var_1_1=1, var_1_24=10, var_1_25=-8, var_1_26=39/4, var_1_28=8, var_1_29=16, var_1_30=1, var_1_31=83/5, var_1_35=256, var_1_36=16, var_1_37=17/2, var_1_38=3569725445, var_1_39=3551809449, var_1_40=10000000, var_1_4=1, var_1_5=255/2, var_1_8=5/4] [L170] var_1_26 = __VERIFIER_nondet_double() [L171] CALL assume_abort_if_not((var_1_26 >= -922337.2036854776000e+13F && var_1_26 <= -1.0e-20F) || (var_1_26 <= 9223372.036854776000e+12F && var_1_26 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=-2, last_1_var_1_15=1000, last_1_var_1_16=1/5, last_1_var_1_1=1, var_1_11=-2, var_1_13=2147483646, var_1_14=2147483642, var_1_15=1000, var_1_16=1/5, var_1_19=-64, var_1_1=1, var_1_24=10, var_1_25=-8, var_1_28=8, var_1_29=16, var_1_30=1, var_1_31=83/5, var_1_35=256, var_1_36=16, var_1_37=17/2, var_1_38=3569725445, var_1_39=3551809449, var_1_40=10000000, var_1_4=1, var_1_5=255/2, var_1_8=5/4] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1, isInitial=1, last_1_var_1_11=-2, last_1_var_1_15=1000, last_1_var_1_16=1/5, last_1_var_1_1=1, var_1_11=-2, var_1_13=2147483646, var_1_14=2147483642, var_1_15=1000, var_1_16=1/5, var_1_19=-64, var_1_1=1, var_1_24=10, var_1_25=-8, var_1_28=8, var_1_29=16, var_1_30=1, var_1_31=83/5, var_1_35=256, var_1_36=16, var_1_37=17/2, var_1_38=3569725445, var_1_39=3551809449, var_1_40=10000000, var_1_4=1, var_1_5=255/2, var_1_8=5/4] [L171] RET assume_abort_if_not((var_1_26 >= -922337.2036854776000e+13F && var_1_26 <= -1.0e-20F) || (var_1_26 <= 9223372.036854776000e+12F && var_1_26 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_11=-2, last_1_var_1_15=1000, last_1_var_1_16=1/5, last_1_var_1_1=1, var_1_11=-2, var_1_13=2147483646, var_1_14=2147483642, var_1_15=1000, var_1_16=1/5, var_1_19=-64, var_1_1=1, var_1_24=10, var_1_25=-8, var_1_28=8, var_1_29=16, var_1_30=1, var_1_31=83/5, var_1_35=256, var_1_36=16, var_1_37=17/2, var_1_38=3569725445, var_1_39=3551809449, var_1_40=10000000, var_1_4=1, var_1_5=255/2, var_1_8=5/4] [L172] CALL assume_abort_if_not(var_1_26 != 0.0F) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=-2, last_1_var_1_15=1000, last_1_var_1_16=1/5, last_1_var_1_1=1, var_1_11=-2, var_1_13=2147483646, var_1_14=2147483642, var_1_15=1000, var_1_16=1/5, var_1_19=-64, var_1_1=1, var_1_24=10, var_1_25=-8, var_1_28=8, var_1_29=16, var_1_30=1, var_1_31=83/5, var_1_35=256, var_1_36=16, var_1_37=17/2, var_1_38=3569725445, var_1_39=3551809449, var_1_40=10000000, var_1_4=1, var_1_5=255/2, var_1_8=5/4] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1, isInitial=1, last_1_var_1_11=-2, last_1_var_1_15=1000, last_1_var_1_16=1/5, last_1_var_1_1=1, var_1_11=-2, var_1_13=2147483646, var_1_14=2147483642, var_1_15=1000, var_1_16=1/5, var_1_19=-64, var_1_1=1, var_1_24=10, var_1_25=-8, var_1_28=8, var_1_29=16, var_1_30=1, var_1_31=83/5, var_1_35=256, var_1_36=16, var_1_37=17/2, var_1_38=3569725445, var_1_39=3551809449, var_1_40=10000000, var_1_4=1, var_1_5=255/2, var_1_8=5/4] [L172] RET assume_abort_if_not(var_1_26 != 0.0F) VAL [isInitial=1, last_1_var_1_11=-2, last_1_var_1_15=1000, last_1_var_1_16=1/5, last_1_var_1_1=1, var_1_11=-2, var_1_13=2147483646, var_1_14=2147483642, var_1_15=1000, var_1_16=1/5, var_1_19=-64, var_1_1=1, var_1_24=10, var_1_25=-8, var_1_28=8, var_1_29=16, var_1_30=1, var_1_31=83/5, var_1_35=256, var_1_36=16, var_1_37=17/2, var_1_38=3569725445, var_1_39=3551809449, var_1_40=10000000, var_1_4=1, var_1_5=255/2, var_1_8=5/4] [L173] var_1_28 = __VERIFIER_nondet_char() [L174] CALL assume_abort_if_not(var_1_28 >= -127) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=-2, last_1_var_1_15=1000, last_1_var_1_16=1/5, last_1_var_1_1=1, var_1_11=-2, var_1_13=2147483646, var_1_14=2147483642, var_1_15=1000, var_1_16=1/5, var_1_19=-64, var_1_1=1, var_1_24=10, var_1_25=-8, var_1_28=126, var_1_29=16, var_1_30=1, var_1_31=83/5, var_1_35=256, var_1_36=16, var_1_37=17/2, var_1_38=3569725445, var_1_39=3551809449, var_1_40=10000000, var_1_4=1, var_1_5=255/2, var_1_8=5/4] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1, isInitial=1, last_1_var_1_11=-2, last_1_var_1_15=1000, last_1_var_1_16=1/5, last_1_var_1_1=1, var_1_11=-2, var_1_13=2147483646, var_1_14=2147483642, var_1_15=1000, var_1_16=1/5, var_1_19=-64, var_1_1=1, var_1_24=10, var_1_25=-8, var_1_28=126, var_1_29=16, var_1_30=1, var_1_31=83/5, var_1_35=256, var_1_36=16, var_1_37=17/2, var_1_38=3569725445, var_1_39=3551809449, var_1_40=10000000, var_1_4=1, var_1_5=255/2, var_1_8=5/4] [L174] RET assume_abort_if_not(var_1_28 >= -127) VAL [isInitial=1, last_1_var_1_11=-2, last_1_var_1_15=1000, last_1_var_1_16=1/5, last_1_var_1_1=1, var_1_11=-2, var_1_13=2147483646, var_1_14=2147483642, var_1_15=1000, var_1_16=1/5, var_1_19=-64, var_1_1=1, var_1_24=10, var_1_25=-8, var_1_28=126, var_1_29=16, var_1_30=1, var_1_31=83/5, var_1_35=256, var_1_36=16, var_1_37=17/2, var_1_38=3569725445, var_1_39=3551809449, var_1_40=10000000, var_1_4=1, var_1_5=255/2, var_1_8=5/4] [L175] CALL assume_abort_if_not(var_1_28 <= 126) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=-2, last_1_var_1_15=1000, last_1_var_1_16=1/5, last_1_var_1_1=1, var_1_11=-2, var_1_13=2147483646, var_1_14=2147483642, var_1_15=1000, var_1_16=1/5, var_1_19=-64, var_1_1=1, var_1_24=10, var_1_25=-8, var_1_28=126, var_1_29=16, var_1_30=1, var_1_31=83/5, var_1_35=256, var_1_36=16, var_1_37=17/2, var_1_38=3569725445, var_1_39=3551809449, var_1_40=10000000, var_1_4=1, var_1_5=255/2, var_1_8=5/4] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1, isInitial=1, last_1_var_1_11=-2, last_1_var_1_15=1000, last_1_var_1_16=1/5, last_1_var_1_1=1, var_1_11=-2, var_1_13=2147483646, var_1_14=2147483642, var_1_15=1000, var_1_16=1/5, var_1_19=-64, var_1_1=1, var_1_24=10, var_1_25=-8, var_1_28=126, var_1_29=16, var_1_30=1, var_1_31=83/5, var_1_35=256, var_1_36=16, var_1_37=17/2, var_1_38=3569725445, var_1_39=3551809449, var_1_40=10000000, var_1_4=1, var_1_5=255/2, var_1_8=5/4] [L175] RET assume_abort_if_not(var_1_28 <= 126) VAL [isInitial=1, last_1_var_1_11=-2, last_1_var_1_15=1000, last_1_var_1_16=1/5, last_1_var_1_1=1, var_1_11=-2, var_1_13=2147483646, var_1_14=2147483642, var_1_15=1000, var_1_16=1/5, var_1_19=-64, var_1_1=1, var_1_24=10, var_1_25=-8, var_1_28=126, var_1_29=16, var_1_30=1, var_1_31=83/5, var_1_35=256, var_1_36=16, var_1_37=17/2, var_1_38=3569725445, var_1_39=3551809449, var_1_40=10000000, var_1_4=1, var_1_5=255/2, var_1_8=5/4] [L176] var_1_30 = __VERIFIER_nondet_ulong() [L177] CALL assume_abort_if_not(var_1_30 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=-2, last_1_var_1_15=1000, last_1_var_1_16=1/5, last_1_var_1_1=1, var_1_11=-2, var_1_13=2147483646, var_1_14=2147483642, var_1_15=1000, var_1_16=1/5, var_1_19=-64, var_1_1=1, var_1_24=10, var_1_25=-8, var_1_28=126, var_1_29=16, var_1_31=83/5, var_1_35=256, var_1_36=16, var_1_37=17/2, var_1_38=3569725445, var_1_39=3551809449, var_1_40=10000000, var_1_4=1, var_1_5=255/2, var_1_8=5/4] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1, isInitial=1, last_1_var_1_11=-2, last_1_var_1_15=1000, last_1_var_1_16=1/5, last_1_var_1_1=1, var_1_11=-2, var_1_13=2147483646, var_1_14=2147483642, var_1_15=1000, var_1_16=1/5, var_1_19=-64, var_1_1=1, var_1_24=10, var_1_25=-8, var_1_28=126, var_1_29=16, var_1_31=83/5, var_1_35=256, var_1_36=16, var_1_37=17/2, var_1_38=3569725445, var_1_39=3551809449, var_1_40=10000000, var_1_4=1, var_1_5=255/2, var_1_8=5/4] [L177] RET assume_abort_if_not(var_1_30 >= 0) VAL [isInitial=1, last_1_var_1_11=-2, last_1_var_1_15=1000, last_1_var_1_16=1/5, last_1_var_1_1=1, var_1_11=-2, var_1_13=2147483646, var_1_14=2147483642, var_1_15=1000, var_1_16=1/5, var_1_19=-64, var_1_1=1, var_1_24=10, var_1_25=-8, var_1_28=126, var_1_29=16, var_1_31=83/5, var_1_35=256, var_1_36=16, var_1_37=17/2, var_1_38=3569725445, var_1_39=3551809449, var_1_40=10000000, var_1_4=1, var_1_5=255/2, var_1_8=5/4] [L178] CALL assume_abort_if_not(var_1_30 <= 4294967294) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=-2, last_1_var_1_15=1000, last_1_var_1_16=1/5, last_1_var_1_1=1, var_1_11=-2, var_1_13=2147483646, var_1_14=2147483642, var_1_15=1000, var_1_16=1/5, var_1_19=-64, var_1_1=1, var_1_24=10, var_1_25=-8, var_1_28=126, var_1_29=16, var_1_30=4294967294, var_1_31=83/5, var_1_35=256, var_1_36=16, var_1_37=17/2, var_1_38=3569725445, var_1_39=3551809449, var_1_40=10000000, var_1_4=1, var_1_5=255/2, var_1_8=5/4] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1, isInitial=1, last_1_var_1_11=-2, last_1_var_1_15=1000, last_1_var_1_16=1/5, last_1_var_1_1=1, var_1_11=-2, var_1_13=2147483646, var_1_14=2147483642, var_1_15=1000, var_1_16=1/5, var_1_19=-64, var_1_1=1, var_1_24=10, var_1_25=-8, var_1_28=126, var_1_29=16, var_1_30=4294967294, var_1_31=83/5, var_1_35=256, var_1_36=16, var_1_37=17/2, var_1_38=3569725445, var_1_39=3551809449, var_1_40=10000000, var_1_4=1, var_1_5=255/2, var_1_8=5/4] [L178] RET assume_abort_if_not(var_1_30 <= 4294967294) VAL [isInitial=1, last_1_var_1_11=-2, last_1_var_1_15=1000, last_1_var_1_16=1/5, last_1_var_1_1=1, var_1_11=-2, var_1_13=2147483646, var_1_14=2147483642, var_1_15=1000, var_1_16=1/5, var_1_19=-64, var_1_1=1, var_1_24=10, var_1_25=-8, var_1_28=126, var_1_29=16, var_1_30=4294967294, var_1_31=83/5, var_1_35=256, var_1_36=16, var_1_37=17/2, var_1_38=3569725445, var_1_39=3551809449, var_1_40=10000000, var_1_4=1, var_1_5=255/2, var_1_8=5/4] [L179] var_1_37 = __VERIFIER_nondet_double() [L180] CALL assume_abort_if_not((var_1_37 >= 0.0F && var_1_37 <= -1.0e-20F) || (var_1_37 <= 9223372.036854776000e+12F && var_1_37 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=-2, last_1_var_1_15=1000, last_1_var_1_16=1/5, last_1_var_1_1=1, var_1_11=-2, var_1_13=2147483646, var_1_14=2147483642, var_1_15=1000, var_1_16=1/5, var_1_19=-64, var_1_1=1, var_1_24=10, var_1_25=-8, var_1_28=126, var_1_29=16, var_1_30=4294967294, var_1_31=83/5, var_1_35=256, var_1_36=16, var_1_38=3569725445, var_1_39=3551809449, var_1_40=10000000, var_1_4=1, var_1_5=255/2, var_1_8=5/4] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1, isInitial=1, last_1_var_1_11=-2, last_1_var_1_15=1000, last_1_var_1_16=1/5, last_1_var_1_1=1, var_1_11=-2, var_1_13=2147483646, var_1_14=2147483642, var_1_15=1000, var_1_16=1/5, var_1_19=-64, var_1_1=1, var_1_24=10, var_1_25=-8, var_1_28=126, var_1_29=16, var_1_30=4294967294, var_1_31=83/5, var_1_35=256, var_1_36=16, var_1_38=3569725445, var_1_39=3551809449, var_1_40=10000000, var_1_4=1, var_1_5=255/2, var_1_8=5/4] [L180] RET assume_abort_if_not((var_1_37 >= 0.0F && var_1_37 <= -1.0e-20F) || (var_1_37 <= 9223372.036854776000e+12F && var_1_37 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_11=-2, last_1_var_1_15=1000, last_1_var_1_16=1/5, last_1_var_1_1=1, var_1_11=-2, var_1_13=2147483646, var_1_14=2147483642, var_1_15=1000, var_1_16=1/5, var_1_19=-64, var_1_1=1, var_1_24=10, var_1_25=-8, var_1_28=126, var_1_29=16, var_1_30=4294967294, var_1_31=83/5, var_1_35=256, var_1_36=16, var_1_38=3569725445, var_1_39=3551809449, var_1_40=10000000, var_1_4=1, var_1_5=255/2, var_1_8=5/4] [L181] var_1_38 = __VERIFIER_nondet_ulong() [L182] CALL assume_abort_if_not(var_1_38 >= 2147483647) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=-2, last_1_var_1_15=1000, last_1_var_1_16=1/5, last_1_var_1_1=1, var_1_11=-2, var_1_13=2147483646, var_1_14=2147483642, var_1_15=1000, var_1_16=1/5, var_1_19=-64, var_1_1=1, var_1_24=10, var_1_25=-8, var_1_28=126, var_1_29=16, var_1_30=4294967294, var_1_31=83/5, var_1_35=256, var_1_36=16, var_1_38=2147483647, var_1_39=3551809449, var_1_40=10000000, var_1_4=1, var_1_5=255/2, var_1_8=5/4] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1, isInitial=1, last_1_var_1_11=-2, last_1_var_1_15=1000, last_1_var_1_16=1/5, last_1_var_1_1=1, var_1_11=-2, var_1_13=2147483646, var_1_14=2147483642, var_1_15=1000, var_1_16=1/5, var_1_19=-64, var_1_1=1, var_1_24=10, var_1_25=-8, var_1_28=126, var_1_29=16, var_1_30=4294967294, var_1_31=83/5, var_1_35=256, var_1_36=16, var_1_38=2147483647, var_1_39=3551809449, var_1_40=10000000, var_1_4=1, var_1_5=255/2, var_1_8=5/4] [L182] RET assume_abort_if_not(var_1_38 >= 2147483647) VAL [isInitial=1, last_1_var_1_11=-2, last_1_var_1_15=1000, last_1_var_1_16=1/5, last_1_var_1_1=1, var_1_11=-2, var_1_13=2147483646, var_1_14=2147483642, var_1_15=1000, var_1_16=1/5, var_1_19=-64, var_1_1=1, var_1_24=10, var_1_25=-8, var_1_28=126, var_1_29=16, var_1_30=4294967294, var_1_31=83/5, var_1_35=256, var_1_36=16, var_1_38=2147483647, var_1_39=3551809449, var_1_40=10000000, var_1_4=1, var_1_5=255/2, var_1_8=5/4] [L183] CALL assume_abort_if_not(var_1_38 <= 4294967294) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=-2, last_1_var_1_15=1000, last_1_var_1_16=1/5, last_1_var_1_1=1, var_1_11=-2, var_1_13=2147483646, var_1_14=2147483642, var_1_15=1000, var_1_16=1/5, var_1_19=-64, var_1_1=1, var_1_24=10, var_1_25=-8, var_1_28=126, var_1_29=16, var_1_30=4294967294, var_1_31=83/5, var_1_35=256, var_1_36=16, var_1_38=2147483647, var_1_39=3551809449, var_1_40=10000000, var_1_4=1, var_1_5=255/2, var_1_8=5/4] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1, isInitial=1, last_1_var_1_11=-2, last_1_var_1_15=1000, last_1_var_1_16=1/5, last_1_var_1_1=1, var_1_11=-2, var_1_13=2147483646, var_1_14=2147483642, var_1_15=1000, var_1_16=1/5, var_1_19=-64, var_1_1=1, var_1_24=10, var_1_25=-8, var_1_28=126, var_1_29=16, var_1_30=4294967294, var_1_31=83/5, var_1_35=256, var_1_36=16, var_1_38=2147483647, var_1_39=3551809449, var_1_40=10000000, var_1_4=1, var_1_5=255/2, var_1_8=5/4] [L183] RET assume_abort_if_not(var_1_38 <= 4294967294) VAL [isInitial=1, last_1_var_1_11=-2, last_1_var_1_15=1000, last_1_var_1_16=1/5, last_1_var_1_1=1, var_1_11=-2, var_1_13=2147483646, var_1_14=2147483642, var_1_15=1000, var_1_16=1/5, var_1_19=-64, var_1_1=1, var_1_24=10, var_1_25=-8, var_1_28=126, var_1_29=16, var_1_30=4294967294, var_1_31=83/5, var_1_35=256, var_1_36=16, var_1_38=2147483647, var_1_39=3551809449, var_1_40=10000000, var_1_4=1, var_1_5=255/2, var_1_8=5/4] [L184] var_1_39 = __VERIFIER_nondet_ulong() [L185] CALL assume_abort_if_not(var_1_39 >= 2147483647) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=-2, last_1_var_1_15=1000, last_1_var_1_16=1/5, last_1_var_1_1=1, var_1_11=-2, var_1_13=2147483646, var_1_14=2147483642, var_1_15=1000, var_1_16=1/5, var_1_19=-64, var_1_1=1, var_1_24=10, var_1_25=-8, var_1_28=126, var_1_29=16, var_1_30=4294967294, var_1_31=83/5, var_1_35=256, var_1_36=16, var_1_38=2147483647, var_1_39=4294967294, var_1_40=10000000, var_1_4=1, var_1_5=255/2, var_1_8=5/4] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1, isInitial=1, last_1_var_1_11=-2, last_1_var_1_15=1000, last_1_var_1_16=1/5, last_1_var_1_1=1, var_1_11=-2, var_1_13=2147483646, var_1_14=2147483642, var_1_15=1000, var_1_16=1/5, var_1_19=-64, var_1_1=1, var_1_24=10, var_1_25=-8, var_1_28=126, var_1_29=16, var_1_30=4294967294, var_1_31=83/5, var_1_35=256, var_1_36=16, var_1_38=2147483647, var_1_39=4294967294, var_1_40=10000000, var_1_4=1, var_1_5=255/2, var_1_8=5/4] [L185] RET assume_abort_if_not(var_1_39 >= 2147483647) VAL [isInitial=1, last_1_var_1_11=-2, last_1_var_1_15=1000, last_1_var_1_16=1/5, last_1_var_1_1=1, var_1_11=-2, var_1_13=2147483646, var_1_14=2147483642, var_1_15=1000, var_1_16=1/5, var_1_19=-64, var_1_1=1, var_1_24=10, var_1_25=-8, var_1_28=126, var_1_29=16, var_1_30=4294967294, var_1_31=83/5, var_1_35=256, var_1_36=16, var_1_38=2147483647, var_1_39=4294967294, var_1_40=10000000, var_1_4=1, var_1_5=255/2, var_1_8=5/4] [L186] CALL assume_abort_if_not(var_1_39 <= 4294967294) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=-2, last_1_var_1_15=1000, last_1_var_1_16=1/5, last_1_var_1_1=1, var_1_11=-2, var_1_13=2147483646, var_1_14=2147483642, var_1_15=1000, var_1_16=1/5, var_1_19=-64, var_1_1=1, var_1_24=10, var_1_25=-8, var_1_28=126, var_1_29=16, var_1_30=4294967294, var_1_31=83/5, var_1_35=256, var_1_36=16, var_1_38=2147483647, var_1_39=4294967294, var_1_40=10000000, var_1_4=1, var_1_5=255/2, var_1_8=5/4] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1, isInitial=1, last_1_var_1_11=-2, last_1_var_1_15=1000, last_1_var_1_16=1/5, last_1_var_1_1=1, var_1_11=-2, var_1_13=2147483646, var_1_14=2147483642, var_1_15=1000, var_1_16=1/5, var_1_19=-64, var_1_1=1, var_1_24=10, var_1_25=-8, var_1_28=126, var_1_29=16, var_1_30=4294967294, var_1_31=83/5, var_1_35=256, var_1_36=16, var_1_38=2147483647, var_1_39=4294967294, var_1_40=10000000, var_1_4=1, var_1_5=255/2, var_1_8=5/4] [L186] RET assume_abort_if_not(var_1_39 <= 4294967294) VAL [isInitial=1, last_1_var_1_11=-2, last_1_var_1_15=1000, last_1_var_1_16=1/5, last_1_var_1_1=1, var_1_11=-2, var_1_13=2147483646, var_1_14=2147483642, var_1_15=1000, var_1_16=1/5, var_1_19=-64, var_1_1=1, var_1_24=10, var_1_25=-8, var_1_28=126, var_1_29=16, var_1_30=4294967294, var_1_31=83/5, var_1_35=256, var_1_36=16, var_1_38=2147483647, var_1_39=4294967294, var_1_40=10000000, var_1_4=1, var_1_5=255/2, var_1_8=5/4] [L187] var_1_40 = __VERIFIER_nondet_ulong() [L188] CALL assume_abort_if_not(var_1_40 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=-2, last_1_var_1_15=1000, last_1_var_1_16=1/5, last_1_var_1_1=1, var_1_11=-2, var_1_13=2147483646, var_1_14=2147483642, var_1_15=1000, var_1_16=1/5, var_1_19=-64, var_1_1=1, var_1_24=10, var_1_25=-8, var_1_28=126, var_1_29=16, var_1_30=4294967294, var_1_31=83/5, var_1_35=256, var_1_36=16, var_1_38=2147483647, var_1_39=4294967294, var_1_4=1, var_1_5=255/2, var_1_8=5/4] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1, isInitial=1, last_1_var_1_11=-2, last_1_var_1_15=1000, last_1_var_1_16=1/5, last_1_var_1_1=1, var_1_11=-2, var_1_13=2147483646, var_1_14=2147483642, var_1_15=1000, var_1_16=1/5, var_1_19=-64, var_1_1=1, var_1_24=10, var_1_25=-8, var_1_28=126, var_1_29=16, var_1_30=4294967294, var_1_31=83/5, var_1_35=256, var_1_36=16, var_1_38=2147483647, var_1_39=4294967294, var_1_4=1, var_1_5=255/2, var_1_8=5/4] [L188] RET assume_abort_if_not(var_1_40 >= 0) VAL [isInitial=1, last_1_var_1_11=-2, last_1_var_1_15=1000, last_1_var_1_16=1/5, last_1_var_1_1=1, var_1_11=-2, var_1_13=2147483646, var_1_14=2147483642, var_1_15=1000, var_1_16=1/5, var_1_19=-64, var_1_1=1, var_1_24=10, var_1_25=-8, var_1_28=126, var_1_29=16, var_1_30=4294967294, var_1_31=83/5, var_1_35=256, var_1_36=16, var_1_38=2147483647, var_1_39=4294967294, var_1_4=1, var_1_5=255/2, var_1_8=5/4] [L189] CALL assume_abort_if_not(var_1_40 <= 2147483647) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=-2, last_1_var_1_15=1000, last_1_var_1_16=1/5, last_1_var_1_1=1, var_1_11=-2, var_1_13=2147483646, var_1_14=2147483642, var_1_15=1000, var_1_16=1/5, var_1_19=-64, var_1_1=1, var_1_24=10, var_1_25=-8, var_1_28=126, var_1_29=16, var_1_30=4294967294, var_1_31=83/5, var_1_35=256, var_1_36=16, var_1_38=2147483647, var_1_39=4294967294, var_1_40=2147483647, var_1_4=1, var_1_5=255/2, var_1_8=5/4] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1, isInitial=1, last_1_var_1_11=-2, last_1_var_1_15=1000, last_1_var_1_16=1/5, last_1_var_1_1=1, var_1_11=-2, var_1_13=2147483646, var_1_14=2147483642, var_1_15=1000, var_1_16=1/5, var_1_19=-64, var_1_1=1, var_1_24=10, var_1_25=-8, var_1_28=126, var_1_29=16, var_1_30=4294967294, var_1_31=83/5, var_1_35=256, var_1_36=16, var_1_38=2147483647, var_1_39=4294967294, var_1_40=2147483647, var_1_4=1, var_1_5=255/2, var_1_8=5/4] [L189] RET assume_abort_if_not(var_1_40 <= 2147483647) VAL [isInitial=1, last_1_var_1_11=-2, last_1_var_1_15=1000, last_1_var_1_16=1/5, last_1_var_1_1=1, var_1_11=-2, var_1_13=2147483646, var_1_14=2147483642, var_1_15=1000, var_1_16=1/5, var_1_19=-64, var_1_1=1, var_1_24=10, var_1_25=-8, var_1_28=126, var_1_29=16, var_1_30=4294967294, var_1_31=83/5, var_1_35=256, var_1_36=16, var_1_38=2147483647, var_1_39=4294967294, var_1_40=2147483647, var_1_4=1, var_1_5=255/2, var_1_8=5/4] [L206] RET updateVariables() [L207] CALL step() [L57] COND TRUE (((((var_1_16) < 0 ) ? -(var_1_16) : (var_1_16))) - var_1_21) == (var_1_16 * var_1_7) [L58] var_1_19 = -4 VAL [isInitial=1, last_1_var_1_11=-2, last_1_var_1_15=1000, last_1_var_1_16=1/5, last_1_var_1_1=1, var_1_11=-2, var_1_13=2147483646, var_1_14=2147483642, var_1_15=1000, var_1_16=1/5, var_1_19=-4, var_1_1=1, var_1_24=10, var_1_25=-8, var_1_28=126, var_1_29=16, var_1_30=4294967294, var_1_31=83/5, var_1_35=256, var_1_36=16, var_1_38=2147483647, var_1_39=4294967294, var_1_40=2147483647, var_1_4=1, var_1_5=255/2, var_1_8=5/4] [L60] var_1_24 = var_1_11 VAL [isInitial=1, last_1_var_1_11=-2, last_1_var_1_15=1000, last_1_var_1_16=1/5, last_1_var_1_1=1, var_1_11=-2, var_1_13=2147483646, var_1_14=2147483642, var_1_15=1000, var_1_16=1/5, var_1_19=-4, var_1_1=1, var_1_24=-2, var_1_25=-8, var_1_28=126, var_1_29=16, var_1_30=4294967294, var_1_31=83/5, var_1_35=256, var_1_36=16, var_1_38=2147483647, var_1_39=4294967294, var_1_40=2147483647, var_1_4=1, var_1_5=255/2, var_1_8=5/4] [L61] COND TRUE var_1_21 != var_1_16 VAL [isInitial=1, last_1_var_1_11=-2, last_1_var_1_15=1000, last_1_var_1_16=1/5, last_1_var_1_1=1, var_1_11=-2, var_1_13=2147483646, var_1_14=2147483642, var_1_15=1000, var_1_16=1/5, var_1_19=-4, var_1_1=1, var_1_24=-2, var_1_25=-8, var_1_28=126, var_1_29=16, var_1_30=4294967294, var_1_31=83/5, var_1_35=256, var_1_36=16, var_1_38=2147483647, var_1_39=4294967294, var_1_40=2147483647, var_1_4=1, var_1_5=255/2, var_1_8=5/4] [L62] COND TRUE var_1_5 < (var_1_10 / var_1_26) [L63] var_1_25 = ((((4) < 0 ) ? -(4) : (4))) VAL [isInitial=1, last_1_var_1_11=-2, last_1_var_1_15=1000, last_1_var_1_16=1/5, last_1_var_1_1=1, var_1_11=-2, var_1_13=2147483646, var_1_14=2147483642, var_1_15=1000, var_1_16=1/5, var_1_19=-4, var_1_1=1, var_1_24=-2, var_1_25=4, var_1_28=126, var_1_29=16, var_1_30=4294967294, var_1_31=83/5, var_1_35=256, var_1_36=16, var_1_38=2147483647, var_1_39=4294967294, var_1_40=2147483647, var_1_4=1, var_1_5=255/2, var_1_8=5/4] [L74] var_1_29 = var_1_30 VAL [isInitial=1, last_1_var_1_11=-2, last_1_var_1_15=1000, last_1_var_1_16=1/5, last_1_var_1_1=1, var_1_11=-2, var_1_13=2147483646, var_1_14=2147483642, var_1_15=1000, var_1_16=1/5, var_1_19=-4, var_1_1=1, var_1_24=-2, var_1_25=4, var_1_28=126, var_1_29=4294967294, var_1_30=4294967294, var_1_31=83/5, var_1_35=256, var_1_36=16, var_1_38=2147483647, var_1_39=4294967294, var_1_40=2147483647, var_1_4=1, var_1_5=255/2, var_1_8=5/4] [L75] COND FALSE !(var_1_7 > var_1_17) VAL [isInitial=1, last_1_var_1_11=-2, last_1_var_1_15=1000, last_1_var_1_16=1/5, last_1_var_1_1=1, var_1_11=-2, var_1_13=2147483646, var_1_14=2147483642, var_1_15=1000, var_1_16=1/5, var_1_19=-4, var_1_1=1, var_1_24=-2, var_1_25=4, var_1_28=126, var_1_29=4294967294, var_1_30=4294967294, var_1_31=83/5, var_1_35=256, var_1_36=16, var_1_38=2147483647, var_1_39=4294967294, var_1_40=2147483647, var_1_4=1, var_1_5=255/2, var_1_8=5/4] [L82] COND TRUE \read(var_1_1) [L83] var_1_31 = ((((((((var_1_7) < (var_1_18)) ? (var_1_7) : (var_1_18))) < 0 ) ? -((((var_1_7) < (var_1_18)) ? (var_1_7) : (var_1_18))) : ((((var_1_7) < (var_1_18)) ? (var_1_7) : (var_1_18))))) - 256.35f) VAL [isInitial=1, last_1_var_1_11=-2, last_1_var_1_15=1000, last_1_var_1_16=1/5, last_1_var_1_1=1, var_1_11=-2, var_1_13=2147483646, var_1_14=2147483642, var_1_15=1000, var_1_16=1/5, var_1_19=-4, var_1_1=1, var_1_24=-2, var_1_25=4, var_1_28=126, var_1_29=4294967294, var_1_30=4294967294, var_1_35=256, var_1_36=16, var_1_38=2147483647, var_1_39=4294967294, var_1_40=2147483647, var_1_4=1, var_1_5=255/2, var_1_8=5/4] [L86] COND TRUE ! ((1 + var_1_11) <= var_1_11) VAL [isInitial=1, last_1_var_1_11=-2, last_1_var_1_15=1000, last_1_var_1_16=1/5, last_1_var_1_1=1, var_1_11=-2, var_1_13=2147483646, var_1_14=2147483642, var_1_15=1000, var_1_16=1/5, var_1_19=-4, var_1_1=1, var_1_24=-2, var_1_25=4, var_1_28=126, var_1_29=4294967294, var_1_30=4294967294, var_1_35=256, var_1_36=16, var_1_38=2147483647, var_1_39=4294967294, var_1_40=2147483647, var_1_4=1, var_1_5=255/2, var_1_8=5/4] [L87] COND FALSE !(var_1_11 > (((((((-5) < 0 ) ? -(-5) : (-5))) < 0 ) ? -((((-5) < 0 ) ? -(-5) : (-5))) : ((((-5) < 0 ) ? -(-5) : (-5)))))) VAL [isInitial=1, last_1_var_1_11=-2, last_1_var_1_15=1000, last_1_var_1_16=1/5, last_1_var_1_1=1, var_1_11=-2, var_1_13=2147483646, var_1_14=2147483642, var_1_15=1000, var_1_16=1/5, var_1_19=-4, var_1_1=1, var_1_24=-2, var_1_25=4, var_1_28=126, var_1_29=4294967294, var_1_30=4294967294, var_1_35=256, var_1_36=16, var_1_38=2147483647, var_1_39=4294967294, var_1_40=2147483647, var_1_4=1, var_1_5=255/2, var_1_8=5/4] [L91] COND FALSE !(var_1_21 < var_1_7) VAL [isInitial=1, last_1_var_1_11=-2, last_1_var_1_15=1000, last_1_var_1_16=1/5, last_1_var_1_1=1, var_1_11=-2, var_1_13=2147483646, var_1_14=2147483642, var_1_15=1000, var_1_16=1/5, var_1_19=-4, var_1_1=1, var_1_24=-2, var_1_25=4, var_1_28=126, var_1_29=4294967294, var_1_30=4294967294, var_1_35=256, var_1_36=16, var_1_38=2147483647, var_1_39=4294967294, var_1_40=2147483647, var_1_4=1, var_1_5=255/2, var_1_8=5/4] [L98] COND TRUE \read(last_1_var_1_1) VAL [isInitial=1, last_1_var_1_11=-2, last_1_var_1_15=1000, last_1_var_1_16=1/5, last_1_var_1_1=1, var_1_11=-2, var_1_13=2147483646, var_1_14=2147483642, var_1_15=1000, var_1_16=1/5, var_1_19=-4, var_1_1=1, var_1_24=-2, var_1_25=4, var_1_28=126, var_1_29=4294967294, var_1_30=4294967294, var_1_35=256, var_1_36=16, var_1_38=2147483647, var_1_39=4294967294, var_1_40=2147483647, var_1_4=1, var_1_5=255/2, var_1_8=5/4] [L99] COND TRUE ((((last_1_var_1_16) > (49.75)) ? (last_1_var_1_16) : (49.75))) > last_1_var_1_16 [L100] var_1_11 = ((((last_1_var_1_15) < ((((((var_1_13 - 5)) > (var_1_14)) ? ((var_1_13 - 5)) : (var_1_14))))) ? (last_1_var_1_15) : ((((((var_1_13 - 5)) > (var_1_14)) ? ((var_1_13 - 5)) : (var_1_14)))))) VAL [isInitial=1, last_1_var_1_11=-2, last_1_var_1_15=1000, last_1_var_1_16=1/5, last_1_var_1_1=1, var_1_11=1000, var_1_13=2147483646, var_1_14=2147483642, var_1_15=1000, var_1_16=1/5, var_1_19=-4, var_1_1=1, var_1_24=-2, var_1_25=4, var_1_28=126, var_1_29=4294967294, var_1_30=4294967294, var_1_35=256, var_1_36=16, var_1_38=2147483647, var_1_39=4294967294, var_1_40=2147483647, var_1_4=1, var_1_5=255/2, var_1_8=5/4] [L105] signed long int stepLocal_0 = last_1_var_1_11; VAL [isInitial=1, last_1_var_1_11=-2, last_1_var_1_15=1000, last_1_var_1_16=1/5, last_1_var_1_1=1, stepLocal_0=-2, var_1_11=1000, var_1_13=2147483646, var_1_14=2147483642, var_1_15=1000, var_1_16=1/5, var_1_19=-4, var_1_1=1, var_1_24=-2, var_1_25=4, var_1_28=126, var_1_29=4294967294, var_1_30=4294967294, var_1_35=256, var_1_36=16, var_1_38=2147483647, var_1_39=4294967294, var_1_40=2147483647, var_1_4=1, var_1_5=255/2, var_1_8=5/4] [L106] COND TRUE (last_1_var_1_11 / ((((-16) < 0 ) ? -(-16) : (-16)))) >= stepLocal_0 [L107] var_1_1 = var_1_4 VAL [isInitial=1, last_1_var_1_11=-2, last_1_var_1_15=1000, last_1_var_1_16=1/5, last_1_var_1_1=1, stepLocal_0=-2, var_1_11=1000, var_1_13=2147483646, var_1_14=2147483642, var_1_15=1000, var_1_16=1/5, var_1_19=-4, var_1_1=1, var_1_24=-2, var_1_25=4, var_1_28=126, var_1_29=4294967294, var_1_30=4294967294, var_1_35=256, var_1_36=16, var_1_38=2147483647, var_1_39=4294967294, var_1_40=2147483647, var_1_4=1, var_1_5=255/2, var_1_8=5/4] [L109] signed long int stepLocal_2 = var_1_11; [L110] unsigned char stepLocal_1 = var_1_1; VAL [isInitial=1, last_1_var_1_11=-2, last_1_var_1_15=1000, last_1_var_1_16=1/5, last_1_var_1_1=1, stepLocal_0=-2, stepLocal_1=1, stepLocal_2=1000, var_1_11=1000, var_1_13=2147483646, var_1_14=2147483642, var_1_15=1000, var_1_16=1/5, var_1_19=-4, var_1_1=1, var_1_24=-2, var_1_25=4, var_1_28=126, var_1_29=4294967294, var_1_30=4294967294, var_1_35=256, var_1_36=16, var_1_38=2147483647, var_1_39=4294967294, var_1_40=2147483647, var_1_4=1, var_1_5=255/2, var_1_8=5/4] [L111] COND TRUE \read(var_1_1) VAL [isInitial=1, last_1_var_1_11=-2, last_1_var_1_15=1000, last_1_var_1_16=1/5, last_1_var_1_1=1, stepLocal_0=-2, stepLocal_1=1, stepLocal_2=1000, var_1_11=1000, var_1_13=2147483646, var_1_14=2147483642, var_1_15=1000, var_1_16=1/5, var_1_19=-4, var_1_1=1, var_1_24=-2, var_1_25=4, var_1_28=126, var_1_29=4294967294, var_1_30=4294967294, var_1_35=256, var_1_36=16, var_1_38=2147483647, var_1_39=4294967294, var_1_40=2147483647, var_1_4=1, var_1_5=255/2, var_1_8=5/4] [L112] COND TRUE var_1_11 >= stepLocal_2 VAL [isInitial=1, last_1_var_1_11=-2, last_1_var_1_15=1000, last_1_var_1_16=1/5, last_1_var_1_1=1, stepLocal_0=-2, stepLocal_1=1, stepLocal_2=1000, var_1_11=1000, var_1_13=2147483646, var_1_14=2147483642, var_1_15=1000, var_1_16=1/5, var_1_19=-4, var_1_1=1, var_1_24=-2, var_1_25=4, var_1_28=126, var_1_29=4294967294, var_1_30=4294967294, var_1_35=256, var_1_36=16, var_1_38=2147483647, var_1_39=4294967294, var_1_40=2147483647, var_1_4=1, var_1_5=255/2, var_1_8=5/4] [L113] COND TRUE stepLocal_1 || (var_1_11 < var_1_11) [L114] var_1_5 = var_1_7 VAL [isInitial=1, last_1_var_1_11=-2, last_1_var_1_15=1000, last_1_var_1_16=1/5, last_1_var_1_1=1, stepLocal_0=-2, stepLocal_1=1, stepLocal_2=1000, var_1_11=1000, var_1_13=2147483646, var_1_14=2147483642, var_1_15=1000, var_1_16=1/5, var_1_19=-4, var_1_1=1, var_1_24=-2, var_1_25=4, var_1_28=126, var_1_29=4294967294, var_1_30=4294967294, var_1_35=256, var_1_36=16, var_1_38=2147483647, var_1_39=4294967294, var_1_40=2147483647, var_1_4=1, var_1_5=100000000000004, var_1_7=100000000000004, var_1_8=5/4] [L120] EXPR var_1_11 & var_1_13 VAL [isInitial=1, last_1_var_1_11=-2, last_1_var_1_15=1000, last_1_var_1_16=1/5, last_1_var_1_1=1, stepLocal_0=-2, stepLocal_1=1, stepLocal_2=1000, var_1_11=1000, var_1_13=2147483646, var_1_14=2147483642, var_1_15=1000, var_1_16=1/5, var_1_19=-4, var_1_1=1, var_1_24=-2, var_1_25=4, var_1_28=126, var_1_29=4294967294, var_1_30=4294967294, var_1_35=256, var_1_36=16, var_1_38=2147483647, var_1_39=4294967294, var_1_40=2147483647, var_1_4=1, var_1_5=100000000000004, var_1_7=100000000000004, var_1_8=5/4] [L120] COND FALSE !((- var_1_11) > (var_1_11 & var_1_13)) [L131] var_1_15 = var_1_13 VAL [isInitial=1, last_1_var_1_11=-2, last_1_var_1_15=1000, last_1_var_1_16=1/5, last_1_var_1_1=1, stepLocal_0=-2, stepLocal_1=1, stepLocal_2=1000, var_1_11=1000, var_1_13=2147483646, var_1_14=2147483642, var_1_15=2147483646, var_1_16=1/5, var_1_19=-4, var_1_1=1, var_1_24=-2, var_1_25=4, var_1_28=126, var_1_29=4294967294, var_1_30=4294967294, var_1_35=256, var_1_36=16, var_1_38=2147483647, var_1_39=4294967294, var_1_40=2147483647, var_1_4=1, var_1_5=100000000000004, var_1_7=100000000000004, var_1_8=5/4] [L133] COND TRUE ((((var_1_5) < (last_1_var_1_16)) ? (var_1_5) : (last_1_var_1_16))) >= var_1_7 [L134] var_1_16 = (var_1_17 + (var_1_18 + 16.75)) VAL [isInitial=1, last_1_var_1_11=-2, last_1_var_1_15=1000, last_1_var_1_16=1/5, last_1_var_1_1=1, stepLocal_0=-2, stepLocal_1=1, stepLocal_2=1000, var_1_11=1000, var_1_13=2147483646, var_1_14=2147483642, var_1_15=2147483646, var_1_19=-4, var_1_1=1, var_1_24=-2, var_1_25=4, var_1_28=126, var_1_29=4294967294, var_1_30=4294967294, var_1_35=256, var_1_36=16, var_1_38=2147483647, var_1_39=4294967294, var_1_40=2147483647, var_1_4=1, var_1_5=100000000000004, var_1_7=100000000000004, var_1_8=5/4] [L138] COND TRUE 10.55f < var_1_16 VAL [isInitial=1, last_1_var_1_11=-2, last_1_var_1_15=1000, last_1_var_1_16=1/5, last_1_var_1_1=1, stepLocal_0=-2, stepLocal_1=1, stepLocal_2=1000, var_1_11=1000, var_1_13=2147483646, var_1_14=2147483642, var_1_15=2147483646, var_1_19=-4, var_1_1=1, var_1_24=-2, var_1_25=4, var_1_28=126, var_1_29=4294967294, var_1_30=4294967294, var_1_35=256, var_1_36=16, var_1_38=2147483647, var_1_39=4294967294, var_1_40=2147483647, var_1_4=1, var_1_5=100000000000004, var_1_7=100000000000004, var_1_8=5/4] [L139] COND TRUE var_1_16 > (var_1_7 * var_1_16) [L140] var_1_8 = ((((var_1_7) > (var_1_10)) ? (var_1_7) : (var_1_10))) VAL [isInitial=1, last_1_var_1_11=-2, last_1_var_1_15=1000, last_1_var_1_16=1/5, last_1_var_1_1=1, stepLocal_0=-2, stepLocal_1=1, stepLocal_2=1000, var_1_10=100000000000004, var_1_11=1000, var_1_13=2147483646, var_1_14=2147483642, var_1_15=2147483646, var_1_19=-4, var_1_1=1, var_1_24=-2, var_1_25=4, var_1_28=126, var_1_29=4294967294, var_1_30=4294967294, var_1_35=256, var_1_36=16, var_1_38=2147483647, var_1_39=4294967294, var_1_40=2147483647, var_1_4=1, var_1_5=100000000000004, var_1_7=100000000000004, var_1_8=100000000000004] [L207] RET step() [L208] CALL, EXPR property() [L198] EXPR ((((((last_1_var_1_11 / ((((-16) < 0 ) ? -(-16) : (-16)))) >= last_1_var_1_11) ? (var_1_1 == ((unsigned char) var_1_4)) : 1) && (var_1_1 ? ((var_1_11 >= var_1_11) ? ((var_1_1 || (var_1_11 < var_1_11)) ? (var_1_5 == ((double) var_1_7)) : 1) : (var_1_5 == ((double) var_1_7))) : 1)) && ((10.55f < var_1_16) ? ((var_1_16 > (var_1_7 * var_1_16)) ? (var_1_8 == ((double) ((((var_1_7) > (var_1_10)) ? (var_1_7) : (var_1_10))))) : 1) : ((var_1_16 > var_1_7) ? (var_1_8 == ((double) var_1_10)) : (var_1_8 == ((double) var_1_7))))) && (last_1_var_1_1 ? ((((((last_1_var_1_16) > (49.75)) ? (last_1_var_1_16) : (49.75))) > last_1_var_1_16) ? (var_1_11 == ((signed long int) ((((last_1_var_1_15) < ((((((var_1_13 - 5)) > (var_1_14)) ? ((var_1_13 - 5)) : (var_1_14))))) ? (last_1_var_1_15) : ((((((var_1_13 - 5)) > (var_1_14)) ? ((var_1_13 - 5)) : (var_1_14)))))))) : 1) : (var_1_11 == ((signed long int) last_1_var_1_15)))) && (((- var_1_11) > (var_1_11 & var_1_13)) ? ((var_1_11 <= 128) ? (var_1_1 ? (var_1_15 == ((signed long int) var_1_14)) : (var_1_15 == ((signed long int) var_1_14))) : (var_1_15 == ((signed long int) var_1_14))) : (var_1_15 == ((signed long int) var_1_13))) [L198] EXPR var_1_11 & var_1_13 [L198] EXPR ((((((last_1_var_1_11 / ((((-16) < 0 ) ? -(-16) : (-16)))) >= last_1_var_1_11) ? (var_1_1 == ((unsigned char) var_1_4)) : 1) && (var_1_1 ? ((var_1_11 >= var_1_11) ? ((var_1_1 || (var_1_11 < var_1_11)) ? (var_1_5 == ((double) var_1_7)) : 1) : (var_1_5 == ((double) var_1_7))) : 1)) && ((10.55f < var_1_16) ? ((var_1_16 > (var_1_7 * var_1_16)) ? (var_1_8 == ((double) ((((var_1_7) > (var_1_10)) ? (var_1_7) : (var_1_10))))) : 1) : ((var_1_16 > var_1_7) ? (var_1_8 == ((double) var_1_10)) : (var_1_8 == ((double) var_1_7))))) && (last_1_var_1_1 ? ((((((last_1_var_1_16) > (49.75)) ? (last_1_var_1_16) : (49.75))) > last_1_var_1_16) ? (var_1_11 == ((signed long int) ((((last_1_var_1_15) < ((((((var_1_13 - 5)) > (var_1_14)) ? ((var_1_13 - 5)) : (var_1_14))))) ? (last_1_var_1_15) : ((((((var_1_13 - 5)) > (var_1_14)) ? ((var_1_13 - 5)) : (var_1_14)))))))) : 1) : (var_1_11 == ((signed long int) last_1_var_1_15)))) && (((- var_1_11) > (var_1_11 & var_1_13)) ? ((var_1_11 <= 128) ? (var_1_1 ? (var_1_15 == ((signed long int) var_1_14)) : (var_1_15 == ((signed long int) var_1_14))) : (var_1_15 == ((signed long int) var_1_14))) : (var_1_15 == ((signed long int) var_1_13))) VAL [isInitial=1, last_1_var_1_11=-2, last_1_var_1_15=1000, last_1_var_1_16=1/5, last_1_var_1_1=1, var_1_10=100000000000004, var_1_11=1000, var_1_13=2147483646, var_1_14=2147483642, var_1_15=2147483646, var_1_19=-4, var_1_1=1, var_1_24=-2, var_1_25=4, var_1_28=126, var_1_29=4294967294, var_1_30=4294967294, var_1_35=256, var_1_36=16, var_1_38=2147483647, var_1_39=4294967294, var_1_40=2147483647, var_1_4=1, var_1_5=100000000000004, var_1_7=100000000000004, var_1_8=100000000000004] [L198-L199] return (((((((last_1_var_1_11 / ((((-16) < 0 ) ? -(-16) : (-16)))) >= last_1_var_1_11) ? (var_1_1 == ((unsigned char) var_1_4)) : 1) && (var_1_1 ? ((var_1_11 >= var_1_11) ? ((var_1_1 || (var_1_11 < var_1_11)) ? (var_1_5 == ((double) var_1_7)) : 1) : (var_1_5 == ((double) var_1_7))) : 1)) && ((10.55f < var_1_16) ? ((var_1_16 > (var_1_7 * var_1_16)) ? (var_1_8 == ((double) ((((var_1_7) > (var_1_10)) ? (var_1_7) : (var_1_10))))) : 1) : ((var_1_16 > var_1_7) ? (var_1_8 == ((double) var_1_10)) : (var_1_8 == ((double) var_1_7))))) && (last_1_var_1_1 ? ((((((last_1_var_1_16) > (49.75)) ? (last_1_var_1_16) : (49.75))) > last_1_var_1_16) ? (var_1_11 == ((signed long int) ((((last_1_var_1_15) < ((((((var_1_13 - 5)) > (var_1_14)) ? ((var_1_13 - 5)) : (var_1_14))))) ? (last_1_var_1_15) : ((((((var_1_13 - 5)) > (var_1_14)) ? ((var_1_13 - 5)) : (var_1_14)))))))) : 1) : (var_1_11 == ((signed long int) last_1_var_1_15)))) && (((- var_1_11) > (var_1_11 & var_1_13)) ? ((var_1_11 <= 128) ? (var_1_1 ? (var_1_15 == ((signed long int) var_1_14)) : (var_1_15 == ((signed long int) var_1_14))) : (var_1_15 == ((signed long int) var_1_14))) : (var_1_15 == ((signed long int) var_1_13)))) && ((((((var_1_5) < (last_1_var_1_16)) ? (var_1_5) : (last_1_var_1_16))) >= var_1_7) ? (var_1_16 == ((double) (var_1_17 + (var_1_18 + 16.75)))) : (var_1_16 == ((double) var_1_17))) ; [L208] RET, EXPR property() [L208] CALL __VERIFIER_assert(property()) [L19] COND TRUE !(cond) VAL [\old(cond)=0, cond=0, isInitial=1, last_1_var_1_11=-2, last_1_var_1_15=1000, last_1_var_1_16=1/5, last_1_var_1_1=1, var_1_10=100000000000004, var_1_11=1000, var_1_13=2147483646, var_1_14=2147483642, var_1_15=2147483646, var_1_19=-4, var_1_1=1, var_1_24=-2, var_1_25=4, var_1_28=126, var_1_29=4294967294, var_1_30=4294967294, var_1_35=256, var_1_36=16, var_1_38=2147483647, var_1_39=4294967294, var_1_40=2147483647, var_1_4=1, var_1_5=100000000000004, var_1_7=100000000000004, var_1_8=100000000000004] [L19] reach_error() VAL [\old(cond)=0, cond=0, isInitial=1, last_1_var_1_11=-2, last_1_var_1_15=1000, last_1_var_1_16=1/5, last_1_var_1_1=1, var_1_10=100000000000004, var_1_11=1000, var_1_13=2147483646, var_1_14=2147483642, var_1_15=2147483646, var_1_19=-4, var_1_1=1, var_1_24=-2, var_1_25=4, var_1_28=126, var_1_29=4294967294, var_1_30=4294967294, var_1_35=256, var_1_36=16, var_1_38=2147483647, var_1_39=4294967294, var_1_40=2147483647, var_1_4=1, var_1_5=100000000000004, var_1_7=100000000000004, var_1_8=100000000000004] - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 84 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 4.9s, OverallIterations: 8, TraceHistogramMax: 24, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 1.2s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 873 SdHoareTripleChecker+Valid, 0.6s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 872 mSDsluCounter, 2256 SdHoareTripleChecker+Invalid, 0.5s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 1346 mSDsCounter, 353 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 685 IncrementalHoareTripleChecker+Invalid, 1038 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 353 mSolverCounterUnsat, 910 mSDtfsCounter, 685 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 711 GetRequests, 669 SyntacticMatches, 2 SemanticMatches, 40 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 165 ImplicationChecksByTransitivity, 0.3s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=471occurred in iteration=4, InterpolantAutomatonStates: 41, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.3s AutomataMinimizationTime, 7 MinimizatonAttempts, 164 StatesRemovedByMinimization, 5 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.3s SatisfiabilityAnalysisTime, 2.2s InterpolantComputationTime, 1467 NumberOfCodeBlocks, 1467 NumberOfCodeBlocksAsserted, 9 NumberOfCheckSat, 1456 ConstructedInterpolants, 0 QuantifiedInterpolants, 3769 SizeOfPredicates, 2 NumberOfNonLiveVariables, 388 ConjunctsInSsa, 8 ConjunctsInUnsatCore, 9 InterpolantComputations, 6 PerfectInterpolantSequences, 9729/9936 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate could not prove your program: unable to determine feasibility of some traces [2023-12-16 03:22:31,236 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 0 Received shutdown request...