/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_loopvsstraightlinecode_25-1loop_file-78.i -------------------------------------------------------------------------------- This is Ultimate 0.2.4-tmp.fs.bitabs-eval-d9c3e40-m [2023-12-16 03:45:43,069 INFO L188 SettingsManager]: Resetting all preferences to default values... [2023-12-16 03:45:43,156 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:45:43,159 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2023-12-16 03:45:43,159 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2023-12-16 03:45:43,192 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2023-12-16 03:45:43,193 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-12-16 03:45:43,193 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-12-16 03:45:43,193 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2023-12-16 03:45:43,196 INFO L153 SettingsManager]: * Use memory slicer=true [2023-12-16 03:45:43,196 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-12-16 03:45:43,196 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-12-16 03:45:43,197 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-12-16 03:45:43,198 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2023-12-16 03:45:43,198 INFO L153 SettingsManager]: * Use SBE=true [2023-12-16 03:45:43,198 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-12-16 03:45:43,198 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2023-12-16 03:45:43,198 INFO L153 SettingsManager]: * sizeof long=4 [2023-12-16 03:45:43,199 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2023-12-16 03:45:43,199 INFO L153 SettingsManager]: * sizeof POINTER=4 [2023-12-16 03:45:43,199 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2023-12-16 03:45:43,199 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2023-12-16 03:45:43,199 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-12-16 03:45:43,199 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2023-12-16 03:45:43,200 INFO L153 SettingsManager]: * Allow undefined functions=false [2023-12-16 03:45:43,200 INFO L153 SettingsManager]: * sizeof long double=12 [2023-12-16 03:45:43,200 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2023-12-16 03:45:43,200 INFO L153 SettingsManager]: * Use constant arrays=true [2023-12-16 03:45:43,200 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-12-16 03:45:43,200 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-12-16 03:45:43,201 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2023-12-16 03:45:43,201 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2023-12-16 03:45:43,201 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2023-12-16 03:45:43,202 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-12-16 03:45:43,202 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-12-16 03:45:43,202 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2023-12-16 03:45:43,202 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2023-12-16 03:45:43,202 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2023-12-16 03:45:43,202 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2023-12-16 03:45:43,202 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-12-16 03:45:43,202 INFO L153 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2023-12-16 03:45:43,202 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2023-12-16 03:45:43,203 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-12-16 03:45:43,203 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:45:43,381 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-12-16 03:45:43,398 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-12-16 03:45:43,400 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-12-16 03:45:43,401 INFO L270 PluginConnector]: Initializing CDTParser... [2023-12-16 03:45:43,401 INFO L274 PluginConnector]: CDTParser initialized [2023-12-16 03:45:43,402 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/hardness-nfm22/hardness_loopvsstraightlinecode_25-1loop_file-78.i [2023-12-16 03:45:44,415 INFO L533 CDTParser]: Created temporary CDT project at NULL [2023-12-16 03:45:44,612 INFO L384 CDTParser]: Found 1 translation units. [2023-12-16 03:45:44,612 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/hardness-nfm22/hardness_loopvsstraightlinecode_25-1loop_file-78.i [2023-12-16 03:45:44,618 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/deb81d99e/ef16f92b695b4313a43eeaf77bd30d1c/FLAG166eaa2ab [2023-12-16 03:45:44,630 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/deb81d99e/ef16f92b695b4313a43eeaf77bd30d1c [2023-12-16 03:45:44,633 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-12-16 03:45:44,634 INFO L133 ToolchainWalker]: Walking toolchain with 5 elements. [2023-12-16 03:45:44,634 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-12-16 03:45:44,635 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-12-16 03:45:44,638 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2023-12-16 03:45:44,638 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.12 03:45:44" (1/1) ... [2023-12-16 03:45:44,639 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@1196b2ad and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.12 03:45:44, skipping insertion in model container [2023-12-16 03:45:44,639 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.12 03:45:44" (1/1) ... [2023-12-16 03:45:44,663 INFO L177 MainTranslator]: Built tables and reachable declarations [2023-12-16 03:45:44,749 WARN L239 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/hardness-nfm22/hardness_loopvsstraightlinecode_25-1loop_file-78.i[915,928] [2023-12-16 03:45:44,783 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-12-16 03:45:44,790 INFO L202 MainTranslator]: Completed pre-run [2023-12-16 03:45:44,797 WARN L239 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/hardness-nfm22/hardness_loopvsstraightlinecode_25-1loop_file-78.i[915,928] [2023-12-16 03:45:44,809 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-12-16 03:45:44,819 INFO L206 MainTranslator]: Completed translation [2023-12-16 03:45:44,819 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.12 03:45:44 WrapperNode [2023-12-16 03:45:44,819 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-12-16 03:45:44,820 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-12-16 03:45:44,820 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-12-16 03:45:44,820 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2023-12-16 03:45:44,826 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:45:44" (1/1) ... [2023-12-16 03:45:44,831 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:45:44" (1/1) ... [2023-12-16 03:45:44,849 INFO L138 Inliner]: procedures = 26, calls = 33, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 129 [2023-12-16 03:45:44,849 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-12-16 03:45:44,849 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-12-16 03:45:44,849 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2023-12-16 03:45:44,849 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2023-12-16 03:45:44,856 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.12 03:45:44" (1/1) ... [2023-12-16 03:45:44,856 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.12 03:45:44" (1/1) ... [2023-12-16 03:45:44,858 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.12 03:45:44" (1/1) ... [2023-12-16 03:45:44,866 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:45:44,866 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.12 03:45:44" (1/1) ... [2023-12-16 03:45:44,866 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.12 03:45:44" (1/1) ... [2023-12-16 03:45:44,869 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.12 03:45:44" (1/1) ... [2023-12-16 03:45:44,871 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.12 03:45:44" (1/1) ... [2023-12-16 03:45:44,872 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.12 03:45:44" (1/1) ... [2023-12-16 03:45:44,873 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.12 03:45:44" (1/1) ... [2023-12-16 03:45:44,874 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-12-16 03:45:44,875 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-12-16 03:45:44,875 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2023-12-16 03:45:44,875 INFO L274 PluginConnector]: RCFGBuilder initialized [2023-12-16 03:45:44,876 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.12 03:45:44" (1/1) ... [2023-12-16 03:45:44,879 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2023-12-16 03:45:44,888 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-12-16 03:45:44,896 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:45:44,913 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:45:44,933 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-12-16 03:45:44,933 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2023-12-16 03:45:44,933 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2023-12-16 03:45:44,934 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2023-12-16 03:45:44,934 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-12-16 03:45:44,934 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-12-16 03:45:45,014 INFO L241 CfgBuilder]: Building ICFG [2023-12-16 03:45:45,016 INFO L267 CfgBuilder]: Building CFG for each procedure with an implementation [2023-12-16 03:45:45,161 INFO L282 CfgBuilder]: Performing block encoding [2023-12-16 03:45:45,200 INFO L304 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-12-16 03:45:45,200 INFO L309 CfgBuilder]: Removed 1 assume(true) statements. [2023-12-16 03:45:45,201 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 16.12 03:45:45 BoogieIcfgContainer [2023-12-16 03:45:45,201 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-12-16 03:45:45,202 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-12-16 03:45:45,202 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2023-12-16 03:45:45,204 INFO L274 PluginConnector]: TraceAbstraction initialized [2023-12-16 03:45:45,204 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 16.12 03:45:44" (1/3) ... [2023-12-16 03:45:45,205 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@544dc3d4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.12 03:45:45, skipping insertion in model container [2023-12-16 03:45:45,205 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.12 03:45:44" (2/3) ... [2023-12-16 03:45:45,205 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@544dc3d4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.12 03:45:45, skipping insertion in model container [2023-12-16 03:45:45,205 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 16.12 03:45:45" (3/3) ... [2023-12-16 03:45:45,206 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_loopvsstraightlinecode_25-1loop_file-78.i [2023-12-16 03:45:45,222 INFO L204 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-12-16 03:45:45,222 INFO L163 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2023-12-16 03:45:45,250 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-12-16 03:45:45,254 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;@4a73b15e, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2023-12-16 03:45:45,254 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2023-12-16 03:45:45,257 INFO L276 IsEmpty]: Start isEmpty. Operand has 50 states, 27 states have (on average 1.3703703703703705) internal successors, (37), 28 states have internal predecessors, (37), 20 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 20 states have call predecessors, (20), 20 states have call successors, (20) [2023-12-16 03:45:45,266 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 122 [2023-12-16 03:45:45,266 INFO L187 NwaCegarLoop]: Found error trace [2023-12-16 03:45:45,267 INFO L195 NwaCegarLoop]: trace histogram [20, 20, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:45:45,267 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-16 03:45:45,272 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-16 03:45:45,273 INFO L85 PathProgramCache]: Analyzing trace with hash 1932450419, now seen corresponding path program 1 times [2023-12-16 03:45:45,278 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-16 03:45:45,279 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [556698697] [2023-12-16 03:45:45,279 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-16 03:45:45,279 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-16 03:45:45,389 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 03:45:45,461 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-12-16 03:45:45,463 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 03:45:45,466 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2023-12-16 03:45:45,467 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 03:45:45,470 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2023-12-16 03:45:45,471 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 03:45:45,473 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2023-12-16 03:45:45,474 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 03:45:45,476 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2023-12-16 03:45:45,478 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 03:45:45,480 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2023-12-16 03:45:45,481 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 03:45:45,482 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2023-12-16 03:45:45,484 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 03:45:45,486 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2023-12-16 03:45:45,487 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 03:45:45,489 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2023-12-16 03:45:45,490 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 03:45:45,492 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2023-12-16 03:45:45,494 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 03:45:45,495 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2023-12-16 03:45:45,496 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 03:45:45,498 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2023-12-16 03:45:45,499 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 03:45:45,501 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2023-12-16 03:45:45,502 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 03:45:45,504 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2023-12-16 03:45:45,505 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 03:45:45,507 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2023-12-16 03:45:45,508 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 03:45:45,510 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2023-12-16 03:45:45,511 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 03:45:45,513 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2023-12-16 03:45:45,514 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 03:45:45,516 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2023-12-16 03:45:45,517 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 03:45:45,518 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2023-12-16 03:45:45,519 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 03:45:45,525 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2023-12-16 03:45:45,528 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 03:45:45,534 INFO L134 CoverageAnalysis]: Checked inductivity of 760 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 760 trivial. 0 not checked. [2023-12-16 03:45:45,535 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-16 03:45:45,535 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [556698697] [2023-12-16 03:45:45,535 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [556698697] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-16 03:45:45,535 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-16 03:45:45,535 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-12-16 03:45:45,537 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [579016094] [2023-12-16 03:45:45,538 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-16 03:45:45,540 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2023-12-16 03:45:45,541 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-16 03:45:45,570 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2023-12-16 03:45:45,570 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2023-12-16 03:45:45,572 INFO L87 Difference]: Start difference. First operand has 50 states, 27 states have (on average 1.3703703703703705) internal successors, (37), 28 states have internal predecessors, (37), 20 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 20 states have call predecessors, (20), 20 states have call successors, (20) Second operand has 2 states, 2 states have (on average 12.0) internal successors, (24), 2 states have internal predecessors, (24), 2 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 2 states have call successors, (20) [2023-12-16 03:45:45,625 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-16 03:45:45,625 INFO L93 Difference]: Finished difference Result 99 states and 173 transitions. [2023-12-16 03:45:45,626 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-12-16 03:45:45,627 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 12.0) internal successors, (24), 2 states have internal predecessors, (24), 2 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 2 states have call successors, (20) Word has length 121 [2023-12-16 03:45:45,627 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-16 03:45:45,632 INFO L225 Difference]: With dead ends: 99 [2023-12-16 03:45:45,632 INFO L226 Difference]: Without dead ends: 48 [2023-12-16 03:45:45,634 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 62 GetRequests, 62 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:45:45,638 INFO L413 NwaCegarLoop]: 68 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 68 SdHoareTripleChecker+Invalid, 5 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 5 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-12-16 03:45:45,639 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 68 Invalid, 5 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-12-16 03:45:45,651 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 48 states. [2023-12-16 03:45:45,682 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 48 to 48. [2023-12-16 03:45:45,683 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 48 states, 26 states have (on average 1.1923076923076923) internal successors, (31), 26 states have internal predecessors, (31), 20 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 20 states have call predecessors, (20), 20 states have call successors, (20) [2023-12-16 03:45:45,685 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 48 states to 48 states and 71 transitions. [2023-12-16 03:45:45,685 INFO L78 Accepts]: Start accepts. Automaton has 48 states and 71 transitions. Word has length 121 [2023-12-16 03:45:45,686 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-16 03:45:45,686 INFO L495 AbstractCegarLoop]: Abstraction has 48 states and 71 transitions. [2023-12-16 03:45:45,686 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 12.0) internal successors, (24), 2 states have internal predecessors, (24), 2 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 2 states have call successors, (20) [2023-12-16 03:45:45,686 INFO L276 IsEmpty]: Start isEmpty. Operand 48 states and 71 transitions. [2023-12-16 03:45:45,689 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 122 [2023-12-16 03:45:45,689 INFO L187 NwaCegarLoop]: Found error trace [2023-12-16 03:45:45,689 INFO L195 NwaCegarLoop]: trace histogram [20, 20, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:45:45,690 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2023-12-16 03:45:45,690 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-16 03:45:45,690 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-16 03:45:45,690 INFO L85 PathProgramCache]: Analyzing trace with hash -1474044111, now seen corresponding path program 1 times [2023-12-16 03:45:45,690 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-16 03:45:45,691 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1372202926] [2023-12-16 03:45:45,691 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-16 03:45:45,691 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-16 03:45:45,818 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-12-16 03:45:45,818 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-12-16 03:45:45,893 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-12-16 03:45:45,934 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-12-16 03:45:45,934 INFO L360 BasicCegarLoop]: Counterexample is feasible [2023-12-16 03:45:45,935 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2023-12-16 03:45:45,936 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2023-12-16 03:45:45,938 INFO L445 BasicCegarLoop]: Path program histogram: [1, 1] [2023-12-16 03:45:45,942 INFO L179 ceAbstractionStarter]: Computing trace abstraction results [2023-12-16 03:45:46,014 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 16.12 03:45:46 BoogieIcfgContainer [2023-12-16 03:45:46,014 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2023-12-16 03:45:46,015 INFO L158 Benchmark]: Toolchain (without parser) took 1380.79ms. Allocated memory is still 261.1MB. Free memory was 219.1MB in the beginning and 173.4MB in the end (delta: 45.7MB). Peak memory consumption was 47.4MB. Max. memory is 8.0GB. [2023-12-16 03:45:46,015 INFO L158 Benchmark]: CDTParser took 0.10ms. Allocated memory is still 181.4MB. Free memory is still 135.1MB. There was no memory consumed. Max. memory is 8.0GB. [2023-12-16 03:45:46,015 INFO L158 Benchmark]: CACSL2BoogieTranslator took 185.20ms. Allocated memory is still 261.1MB. Free memory was 218.8MB in the beginning and 206.2MB in the end (delta: 12.6MB). Peak memory consumption was 13.6MB. Max. memory is 8.0GB. [2023-12-16 03:45:46,015 INFO L158 Benchmark]: Boogie Procedure Inliner took 28.77ms. Allocated memory is still 261.1MB. Free memory was 206.2MB in the beginning and 204.1MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. [2023-12-16 03:45:46,016 INFO L158 Benchmark]: Boogie Preprocessor took 25.06ms. Allocated memory is still 261.1MB. Free memory was 204.1MB in the beginning and 201.7MB in the end (delta: 2.5MB). Peak memory consumption was 3.1MB. Max. memory is 8.0GB. [2023-12-16 03:45:46,016 INFO L158 Benchmark]: RCFGBuilder took 325.97ms. Allocated memory is still 261.1MB. Free memory was 201.7MB in the beginning and 184.2MB in the end (delta: 17.4MB). Peak memory consumption was 16.8MB. Max. memory is 8.0GB. [2023-12-16 03:45:46,016 INFO L158 Benchmark]: TraceAbstraction took 811.93ms. Allocated memory is still 261.1MB. Free memory was 183.5MB in the beginning and 173.4MB in the end (delta: 10.1MB). Peak memory consumption was 10.7MB. Max. memory is 8.0GB. [2023-12-16 03:45:46,018 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.10ms. Allocated memory is still 181.4MB. Free memory is still 135.1MB. There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 185.20ms. Allocated memory is still 261.1MB. Free memory was 218.8MB in the beginning and 206.2MB in the end (delta: 12.6MB). Peak memory consumption was 13.6MB. Max. memory is 8.0GB. * Boogie Procedure Inliner took 28.77ms. Allocated memory is still 261.1MB. Free memory was 206.2MB in the beginning and 204.1MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. * Boogie Preprocessor took 25.06ms. Allocated memory is still 261.1MB. Free memory was 204.1MB in the beginning and 201.7MB in the end (delta: 2.5MB). Peak memory consumption was 3.1MB. Max. memory is 8.0GB. * RCFGBuilder took 325.97ms. Allocated memory is still 261.1MB. Free memory was 201.7MB in the beginning and 184.2MB in the end (delta: 17.4MB). Peak memory consumption was 16.8MB. Max. memory is 8.0GB. * TraceAbstraction took 811.93ms. Allocated memory is still 261.1MB. Free memory was 183.5MB in the beginning and 173.4MB in the end (delta: 10.1MB). Peak memory consumption was 10.7MB. 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 someBinaryFLOATComparisonOperation at line 99, overapproximation of someUnaryDOUBLEoperation at line 36. Possible FailurePath: [L21] unsigned char isInitial = 0; [L22] signed long int var_1_1 = -200; [L23] unsigned char var_1_2 = 0; [L24] unsigned char var_1_3 = 1; [L25] signed long int var_1_6 = 128; [L26] signed long int var_1_7 = 10; [L27] signed short int var_1_8 = 0; [L28] signed short int var_1_9 = 25; [L29] signed short int var_1_10 = 32; [L30] signed short int var_1_11 = 1000; [L31] signed short int var_1_12 = 25; [L32] signed short int var_1_13 = 128; [L33] unsigned long int var_1_14 = 5; [L34] float var_1_15 = 8.25; [L35] float var_1_16 = 63.5; [L36] float var_1_17 = -0.6; [L37] signed long int last_1_var_1_1 = -200; [L103] isInitial = 1 [L104] FCALL initially() [L105] int k_loop; [L106] k_loop = 0 VAL [isInitial=1, k_loop=0, last_1_var_1_1=-200, var_1_10=32, var_1_11=1000, var_1_12=25, var_1_13=128, var_1_14=5, var_1_15=33/4, var_1_16=127/2, var_1_1=-200, var_1_2=0, var_1_3=1, var_1_6=128, var_1_7=10, var_1_8=0, var_1_9=25] [L106] COND TRUE k_loop < 1 [L107] CALL updateLastVariables() [L96] last_1_var_1_1 = var_1_1 [L107] RET updateLastVariables() [L108] CALL updateVariables() [L63] var_1_2 = __VERIFIER_nondet_uchar() [L64] CALL assume_abort_if_not(var_1_2 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_1=-200, var_1_10=32, var_1_11=1000, var_1_12=25, var_1_13=128, var_1_14=5, var_1_15=33/4, var_1_16=127/2, var_1_1=-200, var_1_3=1, var_1_6=128, var_1_7=10, var_1_8=0, var_1_9=25] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1, isInitial=1, last_1_var_1_1=-200, var_1_10=32, var_1_11=1000, var_1_12=25, var_1_13=128, var_1_14=5, var_1_15=33/4, var_1_16=127/2, var_1_1=-200, var_1_3=1, var_1_6=128, var_1_7=10, var_1_8=0, var_1_9=25] [L64] RET assume_abort_if_not(var_1_2 >= 0) VAL [isInitial=1, last_1_var_1_1=-200, var_1_10=32, var_1_11=1000, var_1_12=25, var_1_13=128, var_1_14=5, var_1_15=33/4, var_1_16=127/2, var_1_1=-200, var_1_3=1, var_1_6=128, var_1_7=10, var_1_8=0, var_1_9=25] [L65] CALL assume_abort_if_not(var_1_2 <= 1) VAL [\old(cond)=1, isInitial=1, last_1_var_1_1=-200, var_1_10=32, var_1_11=1000, var_1_12=25, var_1_13=128, var_1_14=5, var_1_15=33/4, var_1_16=127/2, var_1_1=-200, var_1_2=0, var_1_3=1, var_1_6=128, var_1_7=10, var_1_8=0, var_1_9=25] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1, isInitial=1, last_1_var_1_1=-200, var_1_10=32, var_1_11=1000, var_1_12=25, var_1_13=128, var_1_14=5, var_1_15=33/4, var_1_16=127/2, var_1_1=-200, var_1_2=0, var_1_3=1, var_1_6=128, var_1_7=10, var_1_8=0, var_1_9=25] [L65] RET assume_abort_if_not(var_1_2 <= 1) VAL [isInitial=1, last_1_var_1_1=-200, var_1_10=32, var_1_11=1000, var_1_12=25, var_1_13=128, var_1_14=5, var_1_15=33/4, var_1_16=127/2, var_1_1=-200, var_1_2=0, var_1_3=1, var_1_6=128, var_1_7=10, var_1_8=0, var_1_9=25] [L66] var_1_3 = __VERIFIER_nondet_uchar() [L67] CALL assume_abort_if_not(var_1_3 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_1=-200, var_1_10=32, var_1_11=1000, var_1_12=25, var_1_13=128, var_1_14=5, var_1_15=33/4, var_1_16=127/2, var_1_1=-200, var_1_2=0, var_1_6=128, var_1_7=10, var_1_8=0, var_1_9=25] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1, isInitial=1, last_1_var_1_1=-200, var_1_10=32, var_1_11=1000, var_1_12=25, var_1_13=128, var_1_14=5, var_1_15=33/4, var_1_16=127/2, var_1_1=-200, var_1_2=0, var_1_6=128, var_1_7=10, var_1_8=0, var_1_9=25] [L67] RET assume_abort_if_not(var_1_3 >= 0) VAL [isInitial=1, last_1_var_1_1=-200, var_1_10=32, var_1_11=1000, var_1_12=25, var_1_13=128, var_1_14=5, var_1_15=33/4, var_1_16=127/2, var_1_1=-200, var_1_2=0, var_1_6=128, var_1_7=10, var_1_8=0, var_1_9=25] [L68] CALL assume_abort_if_not(var_1_3 <= 1) VAL [\old(cond)=1, isInitial=1, last_1_var_1_1=-200, var_1_10=32, var_1_11=1000, var_1_12=25, var_1_13=128, var_1_14=5, var_1_15=33/4, var_1_16=127/2, var_1_1=-200, var_1_2=0, var_1_3=1, var_1_6=128, var_1_7=10, var_1_8=0, var_1_9=25] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1, isInitial=1, last_1_var_1_1=-200, var_1_10=32, var_1_11=1000, var_1_12=25, var_1_13=128, var_1_14=5, var_1_15=33/4, var_1_16=127/2, var_1_1=-200, var_1_2=0, var_1_3=1, var_1_6=128, var_1_7=10, var_1_8=0, var_1_9=25] [L68] RET assume_abort_if_not(var_1_3 <= 1) VAL [isInitial=1, last_1_var_1_1=-200, var_1_10=32, var_1_11=1000, var_1_12=25, var_1_13=128, var_1_14=5, var_1_15=33/4, var_1_16=127/2, var_1_1=-200, var_1_2=0, var_1_3=1, var_1_6=128, var_1_7=10, var_1_8=0, var_1_9=25] [L69] var_1_6 = __VERIFIER_nondet_long() [L70] CALL assume_abort_if_not(var_1_6 >= -1) VAL [\old(cond)=1, isInitial=1, last_1_var_1_1=-200, var_1_10=32, var_1_11=1000, var_1_12=25, var_1_13=128, var_1_14=5, var_1_15=33/4, var_1_16=127/2, var_1_1=-200, var_1_2=0, var_1_3=1, var_1_6=2147483646, var_1_7=10, var_1_8=0, var_1_9=25] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1, isInitial=1, last_1_var_1_1=-200, var_1_10=32, var_1_11=1000, var_1_12=25, var_1_13=128, var_1_14=5, var_1_15=33/4, var_1_16=127/2, var_1_1=-200, var_1_2=0, var_1_3=1, var_1_6=2147483646, var_1_7=10, var_1_8=0, var_1_9=25] [L70] RET assume_abort_if_not(var_1_6 >= -1) VAL [isInitial=1, last_1_var_1_1=-200, var_1_10=32, var_1_11=1000, var_1_12=25, var_1_13=128, var_1_14=5, var_1_15=33/4, var_1_16=127/2, var_1_1=-200, var_1_2=0, var_1_3=1, var_1_6=2147483646, var_1_7=10, var_1_8=0, var_1_9=25] [L71] CALL assume_abort_if_not(var_1_6 <= 2147483646) VAL [\old(cond)=1, isInitial=1, last_1_var_1_1=-200, var_1_10=32, var_1_11=1000, var_1_12=25, var_1_13=128, var_1_14=5, var_1_15=33/4, var_1_16=127/2, var_1_1=-200, var_1_2=0, var_1_3=1, var_1_6=2147483646, var_1_7=10, var_1_8=0, var_1_9=25] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1, isInitial=1, last_1_var_1_1=-200, var_1_10=32, var_1_11=1000, var_1_12=25, var_1_13=128, var_1_14=5, var_1_15=33/4, var_1_16=127/2, var_1_1=-200, var_1_2=0, var_1_3=1, var_1_6=2147483646, var_1_7=10, var_1_8=0, var_1_9=25] [L71] RET assume_abort_if_not(var_1_6 <= 2147483646) VAL [isInitial=1, last_1_var_1_1=-200, var_1_10=32, var_1_11=1000, var_1_12=25, var_1_13=128, var_1_14=5, var_1_15=33/4, var_1_16=127/2, var_1_1=-200, var_1_2=0, var_1_3=1, var_1_6=2147483646, var_1_7=10, var_1_8=0, var_1_9=25] [L72] var_1_7 = __VERIFIER_nondet_long() [L73] CALL assume_abort_if_not(var_1_7 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_1=-200, var_1_10=32, var_1_11=1000, var_1_12=25, var_1_13=128, var_1_14=5, var_1_15=33/4, var_1_16=127/2, var_1_1=-200, var_1_2=0, var_1_3=1, var_1_6=2147483646, var_1_7=0, var_1_8=0, var_1_9=25] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1, isInitial=1, last_1_var_1_1=-200, var_1_10=32, var_1_11=1000, var_1_12=25, var_1_13=128, var_1_14=5, var_1_15=33/4, var_1_16=127/2, var_1_1=-200, var_1_2=0, var_1_3=1, var_1_6=2147483646, var_1_7=0, var_1_8=0, var_1_9=25] [L73] RET assume_abort_if_not(var_1_7 >= 0) VAL [isInitial=1, last_1_var_1_1=-200, var_1_10=32, var_1_11=1000, var_1_12=25, var_1_13=128, var_1_14=5, var_1_15=33/4, var_1_16=127/2, var_1_1=-200, var_1_2=0, var_1_3=1, var_1_6=2147483646, var_1_7=0, var_1_8=0, var_1_9=25] [L74] CALL assume_abort_if_not(var_1_7 <= 2147483646) VAL [\old(cond)=1, isInitial=1, last_1_var_1_1=-200, var_1_10=32, var_1_11=1000, var_1_12=25, var_1_13=128, var_1_14=5, var_1_15=33/4, var_1_16=127/2, var_1_1=-200, var_1_2=0, var_1_3=1, var_1_6=2147483646, var_1_7=0, var_1_8=0, var_1_9=25] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1, isInitial=1, last_1_var_1_1=-200, var_1_10=32, var_1_11=1000, var_1_12=25, var_1_13=128, var_1_14=5, var_1_15=33/4, var_1_16=127/2, var_1_1=-200, var_1_2=0, var_1_3=1, var_1_6=2147483646, var_1_7=0, var_1_8=0, var_1_9=25] [L74] RET assume_abort_if_not(var_1_7 <= 2147483646) VAL [isInitial=1, last_1_var_1_1=-200, var_1_10=32, var_1_11=1000, var_1_12=25, var_1_13=128, var_1_14=5, var_1_15=33/4, var_1_16=127/2, var_1_1=-200, var_1_2=0, var_1_3=1, var_1_6=2147483646, var_1_7=0, var_1_8=0, var_1_9=25] [L75] var_1_9 = __VERIFIER_nondet_short() [L76] CALL assume_abort_if_not(var_1_9 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_1=-200, var_1_10=32, var_1_11=1000, var_1_12=25, var_1_13=128, var_1_14=5, var_1_15=33/4, var_1_16=127/2, var_1_1=-200, var_1_2=0, var_1_3=1, var_1_6=2147483646, var_1_7=0, var_1_8=0, var_1_9=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1, isInitial=1, last_1_var_1_1=-200, var_1_10=32, var_1_11=1000, var_1_12=25, var_1_13=128, var_1_14=5, var_1_15=33/4, var_1_16=127/2, var_1_1=-200, var_1_2=0, var_1_3=1, var_1_6=2147483646, var_1_7=0, var_1_8=0, var_1_9=1] [L76] RET assume_abort_if_not(var_1_9 >= 0) VAL [isInitial=1, last_1_var_1_1=-200, var_1_10=32, var_1_11=1000, var_1_12=25, var_1_13=128, var_1_14=5, var_1_15=33/4, var_1_16=127/2, var_1_1=-200, var_1_2=0, var_1_3=1, var_1_6=2147483646, var_1_7=0, var_1_8=0, var_1_9=1] [L77] CALL assume_abort_if_not(var_1_9 <= 16383) VAL [\old(cond)=1, isInitial=1, last_1_var_1_1=-200, var_1_10=32, var_1_11=1000, var_1_12=25, var_1_13=128, var_1_14=5, var_1_15=33/4, var_1_16=127/2, var_1_1=-200, var_1_2=0, var_1_3=1, var_1_6=2147483646, var_1_7=0, var_1_8=0, var_1_9=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1, isInitial=1, last_1_var_1_1=-200, var_1_10=32, var_1_11=1000, var_1_12=25, var_1_13=128, var_1_14=5, var_1_15=33/4, var_1_16=127/2, var_1_1=-200, var_1_2=0, var_1_3=1, var_1_6=2147483646, var_1_7=0, var_1_8=0, var_1_9=1] [L77] RET assume_abort_if_not(var_1_9 <= 16383) VAL [isInitial=1, last_1_var_1_1=-200, var_1_10=32, var_1_11=1000, var_1_12=25, var_1_13=128, var_1_14=5, var_1_15=33/4, var_1_16=127/2, var_1_1=-200, var_1_2=0, var_1_3=1, var_1_6=2147483646, var_1_7=0, var_1_8=0, var_1_9=1] [L78] var_1_10 = __VERIFIER_nondet_short() [L79] CALL assume_abort_if_not(var_1_10 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_1=-200, var_1_10=0, var_1_11=1000, var_1_12=25, var_1_13=128, var_1_14=5, var_1_15=33/4, var_1_16=127/2, var_1_1=-200, var_1_2=0, var_1_3=1, var_1_6=2147483646, var_1_7=0, var_1_8=0, var_1_9=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1, isInitial=1, last_1_var_1_1=-200, var_1_10=0, var_1_11=1000, var_1_12=25, var_1_13=128, var_1_14=5, var_1_15=33/4, var_1_16=127/2, var_1_1=-200, var_1_2=0, var_1_3=1, var_1_6=2147483646, var_1_7=0, var_1_8=0, var_1_9=1] [L79] RET assume_abort_if_not(var_1_10 >= 0) VAL [isInitial=1, last_1_var_1_1=-200, var_1_10=0, var_1_11=1000, var_1_12=25, var_1_13=128, var_1_14=5, var_1_15=33/4, var_1_16=127/2, var_1_1=-200, var_1_2=0, var_1_3=1, var_1_6=2147483646, var_1_7=0, var_1_8=0, var_1_9=1] [L80] CALL assume_abort_if_not(var_1_10 <= 16383) VAL [\old(cond)=1, isInitial=1, last_1_var_1_1=-200, var_1_10=0, var_1_11=1000, var_1_12=25, var_1_13=128, var_1_14=5, var_1_15=33/4, var_1_16=127/2, var_1_1=-200, var_1_2=0, var_1_3=1, var_1_6=2147483646, var_1_7=0, var_1_8=0, var_1_9=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1, isInitial=1, last_1_var_1_1=-200, var_1_10=0, var_1_11=1000, var_1_12=25, var_1_13=128, var_1_14=5, var_1_15=33/4, var_1_16=127/2, var_1_1=-200, var_1_2=0, var_1_3=1, var_1_6=2147483646, var_1_7=0, var_1_8=0, var_1_9=1] [L80] RET assume_abort_if_not(var_1_10 <= 16383) VAL [isInitial=1, last_1_var_1_1=-200, var_1_10=0, var_1_11=1000, var_1_12=25, var_1_13=128, var_1_14=5, var_1_15=33/4, var_1_16=127/2, var_1_1=-200, var_1_2=0, var_1_3=1, var_1_6=2147483646, var_1_7=0, var_1_8=0, var_1_9=1] [L81] var_1_11 = __VERIFIER_nondet_short() [L82] CALL assume_abort_if_not(var_1_11 >= -8191) VAL [\old(cond)=1, isInitial=1, last_1_var_1_1=-200, var_1_10=0, var_1_11=8192, var_1_12=25, var_1_13=128, var_1_14=5, var_1_15=33/4, var_1_16=127/2, var_1_1=-200, var_1_2=0, var_1_3=1, var_1_6=2147483646, var_1_7=0, var_1_8=0, var_1_9=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1, isInitial=1, last_1_var_1_1=-200, var_1_10=0, var_1_11=8192, var_1_12=25, var_1_13=128, var_1_14=5, var_1_15=33/4, var_1_16=127/2, var_1_1=-200, var_1_2=0, var_1_3=1, var_1_6=2147483646, var_1_7=0, var_1_8=0, var_1_9=1] [L82] RET assume_abort_if_not(var_1_11 >= -8191) VAL [isInitial=1, last_1_var_1_1=-200, var_1_10=0, var_1_11=8192, var_1_12=25, var_1_13=128, var_1_14=5, var_1_15=33/4, var_1_16=127/2, var_1_1=-200, var_1_2=0, var_1_3=1, var_1_6=2147483646, var_1_7=0, var_1_8=0, var_1_9=1] [L83] CALL assume_abort_if_not(var_1_11 <= 8192) VAL [\old(cond)=1, isInitial=1, last_1_var_1_1=-200, var_1_10=0, var_1_11=8192, var_1_12=25, var_1_13=128, var_1_14=5, var_1_15=33/4, var_1_16=127/2, var_1_1=-200, var_1_2=0, var_1_3=1, var_1_6=2147483646, var_1_7=0, var_1_8=0, var_1_9=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1, isInitial=1, last_1_var_1_1=-200, var_1_10=0, var_1_11=8192, var_1_12=25, var_1_13=128, var_1_14=5, var_1_15=33/4, var_1_16=127/2, var_1_1=-200, var_1_2=0, var_1_3=1, var_1_6=2147483646, var_1_7=0, var_1_8=0, var_1_9=1] [L83] RET assume_abort_if_not(var_1_11 <= 8192) VAL [isInitial=1, last_1_var_1_1=-200, var_1_10=0, var_1_11=8192, var_1_12=25, var_1_13=128, var_1_14=5, var_1_15=33/4, var_1_16=127/2, var_1_1=-200, var_1_2=0, var_1_3=1, var_1_6=2147483646, var_1_7=0, var_1_8=0, var_1_9=1] [L84] var_1_12 = __VERIFIER_nondet_short() [L85] CALL assume_abort_if_not(var_1_12 >= -8191) VAL [\old(cond)=1, isInitial=1, last_1_var_1_1=-200, var_1_10=0, var_1_11=8192, var_1_12=8191, var_1_13=128, var_1_14=5, var_1_15=33/4, var_1_16=127/2, var_1_1=-200, var_1_2=0, var_1_3=1, var_1_6=2147483646, var_1_7=0, var_1_8=0, var_1_9=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1, isInitial=1, last_1_var_1_1=-200, var_1_10=0, var_1_11=8192, var_1_12=8191, var_1_13=128, var_1_14=5, var_1_15=33/4, var_1_16=127/2, var_1_1=-200, var_1_2=0, var_1_3=1, var_1_6=2147483646, var_1_7=0, var_1_8=0, var_1_9=1] [L85] RET assume_abort_if_not(var_1_12 >= -8191) VAL [isInitial=1, last_1_var_1_1=-200, var_1_10=0, var_1_11=8192, var_1_12=8191, var_1_13=128, var_1_14=5, var_1_15=33/4, var_1_16=127/2, var_1_1=-200, var_1_2=0, var_1_3=1, var_1_6=2147483646, var_1_7=0, var_1_8=0, var_1_9=1] [L86] CALL assume_abort_if_not(var_1_12 <= 8191) VAL [\old(cond)=1, isInitial=1, last_1_var_1_1=-200, var_1_10=0, var_1_11=8192, var_1_12=8191, var_1_13=128, var_1_14=5, var_1_15=33/4, var_1_16=127/2, var_1_1=-200, var_1_2=0, var_1_3=1, var_1_6=2147483646, var_1_7=0, var_1_8=0, var_1_9=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1, isInitial=1, last_1_var_1_1=-200, var_1_10=0, var_1_11=8192, var_1_12=8191, var_1_13=128, var_1_14=5, var_1_15=33/4, var_1_16=127/2, var_1_1=-200, var_1_2=0, var_1_3=1, var_1_6=2147483646, var_1_7=0, var_1_8=0, var_1_9=1] [L86] RET assume_abort_if_not(var_1_12 <= 8191) VAL [isInitial=1, last_1_var_1_1=-200, var_1_10=0, var_1_11=8192, var_1_12=8191, var_1_13=128, var_1_14=5, var_1_15=33/4, var_1_16=127/2, var_1_1=-200, var_1_2=0, var_1_3=1, var_1_6=2147483646, var_1_7=0, var_1_8=0, var_1_9=1] [L87] var_1_13 = __VERIFIER_nondet_short() [L88] CALL assume_abort_if_not(var_1_13 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_1=-200, var_1_10=0, var_1_11=8192, var_1_12=8191, var_1_13=32766, var_1_14=5, var_1_15=33/4, var_1_16=127/2, var_1_1=-200, var_1_2=0, var_1_3=1, var_1_6=2147483646, var_1_7=0, var_1_8=0, var_1_9=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1, isInitial=1, last_1_var_1_1=-200, var_1_10=0, var_1_11=8192, var_1_12=8191, var_1_13=32766, var_1_14=5, var_1_15=33/4, var_1_16=127/2, var_1_1=-200, var_1_2=0, var_1_3=1, var_1_6=2147483646, var_1_7=0, var_1_8=0, var_1_9=1] [L88] RET assume_abort_if_not(var_1_13 >= 0) VAL [isInitial=1, last_1_var_1_1=-200, var_1_10=0, var_1_11=8192, var_1_12=8191, var_1_13=32766, var_1_14=5, var_1_15=33/4, var_1_16=127/2, var_1_1=-200, var_1_2=0, var_1_3=1, var_1_6=2147483646, var_1_7=0, var_1_8=0, var_1_9=1] [L89] CALL assume_abort_if_not(var_1_13 <= 32766) VAL [\old(cond)=1, isInitial=1, last_1_var_1_1=-200, var_1_10=0, var_1_11=8192, var_1_12=8191, var_1_13=32766, var_1_14=5, var_1_15=33/4, var_1_16=127/2, var_1_1=-200, var_1_2=0, var_1_3=1, var_1_6=2147483646, var_1_7=0, var_1_8=0, var_1_9=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1, isInitial=1, last_1_var_1_1=-200, var_1_10=0, var_1_11=8192, var_1_12=8191, var_1_13=32766, var_1_14=5, var_1_15=33/4, var_1_16=127/2, var_1_1=-200, var_1_2=0, var_1_3=1, var_1_6=2147483646, var_1_7=0, var_1_8=0, var_1_9=1] [L89] RET assume_abort_if_not(var_1_13 <= 32766) VAL [isInitial=1, last_1_var_1_1=-200, var_1_10=0, var_1_11=8192, var_1_12=8191, var_1_13=32766, var_1_14=5, var_1_15=33/4, var_1_16=127/2, var_1_1=-200, var_1_2=0, var_1_3=1, var_1_6=2147483646, var_1_7=0, var_1_8=0, var_1_9=1] [L90] var_1_16 = __VERIFIER_nondet_float() [L91] CALL assume_abort_if_not((var_1_16 >= -922337.2036854765600e+13F && var_1_16 <= -1.0e-20F) || (var_1_16 <= 9223372.036854765600e+12F && var_1_16 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_1=-200, var_1_10=0, var_1_11=8192, var_1_12=8191, var_1_13=32766, var_1_14=5, var_1_15=33/4, var_1_1=-200, var_1_2=0, var_1_3=1, var_1_6=2147483646, var_1_7=0, var_1_8=0, var_1_9=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1, isInitial=1, last_1_var_1_1=-200, var_1_10=0, var_1_11=8192, var_1_12=8191, var_1_13=32766, var_1_14=5, var_1_15=33/4, var_1_1=-200, var_1_2=0, var_1_3=1, var_1_6=2147483646, var_1_7=0, var_1_8=0, var_1_9=1] [L91] RET assume_abort_if_not((var_1_16 >= -922337.2036854765600e+13F && var_1_16 <= -1.0e-20F) || (var_1_16 <= 9223372.036854765600e+12F && var_1_16 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_1=-200, var_1_10=0, var_1_11=8192, var_1_12=8191, var_1_13=32766, var_1_14=5, var_1_15=33/4, var_1_1=-200, var_1_2=0, var_1_3=1, var_1_6=2147483646, var_1_7=0, var_1_8=0, var_1_9=1] [L92] var_1_17 = __VERIFIER_nondet_float() [L93] CALL assume_abort_if_not((var_1_17 >= -922337.2036854765600e+13F && var_1_17 <= -1.0e-20F) || (var_1_17 <= 9223372.036854765600e+12F && var_1_17 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_1=-200, var_1_10=0, var_1_11=8192, var_1_12=8191, var_1_13=32766, var_1_14=5, var_1_15=33/4, var_1_1=-200, var_1_2=0, var_1_3=1, var_1_6=2147483646, var_1_7=0, var_1_8=0, var_1_9=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1, isInitial=1, last_1_var_1_1=-200, var_1_10=0, var_1_11=8192, var_1_12=8191, var_1_13=32766, var_1_14=5, var_1_15=33/4, var_1_1=-200, var_1_2=0, var_1_3=1, var_1_6=2147483646, var_1_7=0, var_1_8=0, var_1_9=1] [L93] RET assume_abort_if_not((var_1_17 >= -922337.2036854765600e+13F && var_1_17 <= -1.0e-20F) || (var_1_17 <= 9223372.036854765600e+12F && var_1_17 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_1=-200, var_1_10=0, var_1_11=8192, var_1_12=8191, var_1_13=32766, var_1_14=5, var_1_15=33/4, var_1_1=-200, var_1_2=0, var_1_3=1, var_1_6=2147483646, var_1_7=0, var_1_8=0, var_1_9=1] [L108] RET updateVariables() [L109] CALL step() [L41] COND TRUE \read(var_1_3) [L42] var_1_14 = (2931747731u - var_1_10) VAL [isInitial=1, last_1_var_1_1=-200, var_1_10=0, var_1_11=8192, var_1_12=8191, var_1_13=32766, var_1_14=2931747731, var_1_15=33/4, var_1_1=-200, var_1_2=0, var_1_3=1, var_1_6=2147483646, var_1_7=0, var_1_8=0, var_1_9=1] [L44] unsigned char stepLocal_1 = var_1_3; [L45] unsigned char stepLocal_0 = var_1_2; VAL [isInitial=1, last_1_var_1_1=-200, stepLocal_0=0, stepLocal_1=1, var_1_10=0, var_1_11=8192, var_1_12=8191, var_1_13=32766, var_1_14=2931747731, var_1_15=33/4, var_1_1=-200, var_1_2=0, var_1_3=1, var_1_6=2147483646, var_1_7=0, var_1_8=0, var_1_9=1] [L46] COND FALSE !(var_1_2 && stepLocal_1) VAL [isInitial=1, last_1_var_1_1=-200, stepLocal_0=0, stepLocal_1=1, var_1_10=0, var_1_11=8192, var_1_12=8191, var_1_13=32766, var_1_14=2931747731, var_1_15=33/4, var_1_1=-200, var_1_2=0, var_1_3=1, var_1_6=2147483646, var_1_7=0, var_1_8=0, var_1_9=1] [L53] COND FALSE !(var_1_14 > var_1_14) [L56] var_1_8 = (((((var_1_9) < (var_1_10)) ? (var_1_9) : (var_1_10))) - var_1_13) VAL [isInitial=1, last_1_var_1_1=-200, stepLocal_0=0, stepLocal_1=1, var_1_10=0, var_1_11=8192, var_1_12=8191, var_1_13=32766, var_1_14=2931747731, var_1_15=33/4, var_1_1=-200, var_1_2=0, var_1_3=1, var_1_6=2147483646, var_1_7=0, var_1_8=-32766, var_1_9=1] [L58] COND TRUE var_1_11 >= var_1_1 [L59] var_1_15 = ((((var_1_16) > (var_1_17)) ? (var_1_16) : (var_1_17))) VAL [isInitial=1, last_1_var_1_1=-200, stepLocal_0=0, stepLocal_1=1, var_1_10=0, var_1_11=8192, var_1_12=8191, var_1_13=32766, var_1_14=2931747731, var_1_15=2931747736, var_1_16=2931747736, var_1_17=2931747736, var_1_1=-200, var_1_2=0, var_1_3=1, var_1_6=2147483646, var_1_7=0, var_1_8=-32766, var_1_9=1] [L109] RET step() [L110] CALL, EXPR property() [L99-L100] return ((((var_1_2 && var_1_3) ? ((var_1_2 && (var_1_14 > last_1_var_1_1)) ? (var_1_1 == ((signed long int) (var_1_6 - var_1_7))) : (var_1_1 == ((signed long int) var_1_6))) : 1) && ((var_1_14 > var_1_14) ? (var_1_8 == ((signed short int) ((var_1_9 - var_1_10) + ((((-4) < ((var_1_11 + var_1_12))) ? (-4) : ((var_1_11 + var_1_12))))))) : (var_1_8 == ((signed short int) (((((var_1_9) < (var_1_10)) ? (var_1_9) : (var_1_10))) - var_1_13))))) && (var_1_3 ? (var_1_14 == ((unsigned long int) (2931747731u - var_1_10))) : 1)) && ((var_1_11 >= var_1_1) ? (var_1_15 == ((float) ((((var_1_16) > (var_1_17)) ? (var_1_16) : (var_1_17))))) : 1) ; [L110] RET, EXPR property() [L110] CALL __VERIFIER_assert(property()) [L19] COND TRUE !(cond) VAL [\old(cond)=0, cond=0, isInitial=1, last_1_var_1_1=-200, var_1_10=0, var_1_11=8192, var_1_12=8191, var_1_13=32766, var_1_14=2931747731, var_1_15=2931747736, var_1_16=2931747736, var_1_17=2931747736, var_1_1=-200, var_1_2=0, var_1_3=1, var_1_6=2147483646, var_1_7=0, var_1_8=-32766, var_1_9=1] [L19] reach_error() VAL [\old(cond)=0, cond=0, isInitial=1, last_1_var_1_1=-200, var_1_10=0, var_1_11=8192, var_1_12=8191, var_1_13=32766, var_1_14=2931747731, var_1_15=2931747736, var_1_16=2931747736, var_1_17=2931747736, var_1_1=-200, var_1_2=0, var_1_3=1, var_1_6=2147483646, var_1_7=0, var_1_8=-32766, var_1_9=1] - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 50 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 0.7s, OverallIterations: 2, TraceHistogramMax: 20, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 0.1s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 0 SdHoareTripleChecker+Valid, 0.0s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 0 mSDsluCounter, 68 SdHoareTripleChecker+Invalid, 0.0s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 0 mSDsCounter, 0 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 5 IncrementalHoareTripleChecker+Invalid, 5 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 0 mSolverCounterUnsat, 68 mSDtfsCounter, 5 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 62 GetRequests, 62 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=50occurred in iteration=0, InterpolantAutomatonStates: 2, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.0s AutomataMinimizationTime, 1 MinimizatonAttempts, 0 StatesRemovedByMinimization, 0 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 0.1s InterpolantComputationTime, 242 NumberOfCodeBlocks, 242 NumberOfCodeBlocksAsserted, 2 NumberOfCheckSat, 120 ConstructedInterpolants, 0 QuantifiedInterpolants, 120 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 1 InterpolantComputations, 1 PerfectInterpolantSequences, 760/760 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:45:46,035 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...