/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_floatingpointinfluence_no-floats_file-52.i -------------------------------------------------------------------------------- This is Ultimate 0.2.4-tmp.fs.bitabs-eval-d9c3e40-m [2023-12-16 03:35:05,057 INFO L188 SettingsManager]: Resetting all preferences to default values... [2023-12-16 03:35:05,130 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:35:05,134 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2023-12-16 03:35:05,135 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2023-12-16 03:35:05,157 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2023-12-16 03:35:05,158 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-12-16 03:35:05,159 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-12-16 03:35:05,159 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2023-12-16 03:35:05,162 INFO L153 SettingsManager]: * Use memory slicer=true [2023-12-16 03:35:05,162 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-12-16 03:35:05,163 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-12-16 03:35:05,163 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-12-16 03:35:05,164 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2023-12-16 03:35:05,164 INFO L153 SettingsManager]: * Use SBE=true [2023-12-16 03:35:05,165 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-12-16 03:35:05,165 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2023-12-16 03:35:05,165 INFO L153 SettingsManager]: * sizeof long=4 [2023-12-16 03:35:05,165 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2023-12-16 03:35:05,165 INFO L153 SettingsManager]: * sizeof POINTER=4 [2023-12-16 03:35:05,165 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2023-12-16 03:35:05,166 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2023-12-16 03:35:05,166 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-12-16 03:35:05,166 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2023-12-16 03:35:05,166 INFO L153 SettingsManager]: * Allow undefined functions=false [2023-12-16 03:35:05,166 INFO L153 SettingsManager]: * sizeof long double=12 [2023-12-16 03:35:05,167 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2023-12-16 03:35:05,167 INFO L153 SettingsManager]: * Use constant arrays=true [2023-12-16 03:35:05,167 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-12-16 03:35:05,167 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-12-16 03:35:05,168 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2023-12-16 03:35:05,168 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2023-12-16 03:35:05,168 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2023-12-16 03:35:05,169 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-12-16 03:35:05,169 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-12-16 03:35:05,169 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2023-12-16 03:35:05,169 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2023-12-16 03:35:05,169 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2023-12-16 03:35:05,169 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2023-12-16 03:35:05,169 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-12-16 03:35:05,170 INFO L153 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2023-12-16 03:35:05,170 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2023-12-16 03:35:05,170 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-12-16 03:35:05,170 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:35:05,369 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-12-16 03:35:05,385 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-12-16 03:35:05,386 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-12-16 03:35:05,387 INFO L270 PluginConnector]: Initializing CDTParser... [2023-12-16 03:35:05,391 INFO L274 PluginConnector]: CDTParser initialized [2023-12-16 03:35:05,391 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/hardness-nfm22/hardness_floatingpointinfluence_no-floats_file-52.i [2023-12-16 03:35:06,518 INFO L533 CDTParser]: Created temporary CDT project at NULL [2023-12-16 03:35:06,667 INFO L384 CDTParser]: Found 1 translation units. [2023-12-16 03:35:06,667 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/hardness-nfm22/hardness_floatingpointinfluence_no-floats_file-52.i [2023-12-16 03:35:06,675 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/657acd8d9/eb78248ea5094be8b30c2a1dc48568d2/FLAG0ae55942e [2023-12-16 03:35:06,692 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/657acd8d9/eb78248ea5094be8b30c2a1dc48568d2 [2023-12-16 03:35:06,695 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-12-16 03:35:06,696 INFO L133 ToolchainWalker]: Walking toolchain with 5 elements. [2023-12-16 03:35:06,697 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-12-16 03:35:06,697 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-12-16 03:35:06,702 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2023-12-16 03:35:06,703 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.12 03:35:06" (1/1) ... [2023-12-16 03:35:06,703 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@73b127f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.12 03:35:06, skipping insertion in model container [2023-12-16 03:35:06,703 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.12 03:35:06" (1/1) ... [2023-12-16 03:35:06,729 INFO L177 MainTranslator]: Built tables and reachable declarations [2023-12-16 03:35:06,830 WARN L239 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/hardness-nfm22/hardness_floatingpointinfluence_no-floats_file-52.i[916,929] [2023-12-16 03:35:06,870 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-12-16 03:35:06,878 INFO L202 MainTranslator]: Completed pre-run [2023-12-16 03:35:06,886 WARN L239 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/hardness-nfm22/hardness_floatingpointinfluence_no-floats_file-52.i[916,929] [2023-12-16 03:35:06,902 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-12-16 03:35:06,918 INFO L206 MainTranslator]: Completed translation [2023-12-16 03:35:06,918 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.12 03:35:06 WrapperNode [2023-12-16 03:35:06,918 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-12-16 03:35:06,919 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-12-16 03:35:06,919 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-12-16 03:35:06,919 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2023-12-16 03:35:06,923 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:35:06" (1/1) ... [2023-12-16 03:35:06,930 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:35:06" (1/1) ... [2023-12-16 03:35:06,955 INFO L138 Inliner]: procedures = 26, calls = 35, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 140 [2023-12-16 03:35:06,955 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-12-16 03:35:06,963 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-12-16 03:35:06,963 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2023-12-16 03:35:06,963 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2023-12-16 03:35:06,977 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.12 03:35:06" (1/1) ... [2023-12-16 03:35:06,978 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.12 03:35:06" (1/1) ... [2023-12-16 03:35:06,988 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.12 03:35:06" (1/1) ... [2023-12-16 03:35:07,005 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:35:07,005 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.12 03:35:06" (1/1) ... [2023-12-16 03:35:07,005 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.12 03:35:06" (1/1) ... [2023-12-16 03:35:07,010 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.12 03:35:06" (1/1) ... [2023-12-16 03:35:07,018 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.12 03:35:06" (1/1) ... [2023-12-16 03:35:07,019 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.12 03:35:06" (1/1) ... [2023-12-16 03:35:07,020 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.12 03:35:06" (1/1) ... [2023-12-16 03:35:07,022 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-12-16 03:35:07,023 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-12-16 03:35:07,023 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2023-12-16 03:35:07,023 INFO L274 PluginConnector]: RCFGBuilder initialized [2023-12-16 03:35:07,023 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.12 03:35:06" (1/1) ... [2023-12-16 03:35:07,044 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2023-12-16 03:35:07,054 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-12-16 03:35:07,065 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:35:07,083 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:35:07,088 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-12-16 03:35:07,088 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2023-12-16 03:35:07,088 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2023-12-16 03:35:07,089 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2023-12-16 03:35:07,089 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-12-16 03:35:07,089 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-12-16 03:35:07,168 INFO L241 CfgBuilder]: Building ICFG [2023-12-16 03:35:07,171 INFO L267 CfgBuilder]: Building CFG for each procedure with an implementation [2023-12-16 03:35:07,347 INFO L282 CfgBuilder]: Performing block encoding [2023-12-16 03:35:07,389 INFO L304 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-12-16 03:35:07,389 INFO L309 CfgBuilder]: Removed 1 assume(true) statements. [2023-12-16 03:35:07,390 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 16.12 03:35:07 BoogieIcfgContainer [2023-12-16 03:35:07,390 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-12-16 03:35:07,393 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-12-16 03:35:07,393 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2023-12-16 03:35:07,395 INFO L274 PluginConnector]: TraceAbstraction initialized [2023-12-16 03:35:07,395 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 16.12 03:35:06" (1/3) ... [2023-12-16 03:35:07,396 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5f4a3716 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.12 03:35:07, skipping insertion in model container [2023-12-16 03:35:07,396 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.12 03:35:06" (2/3) ... [2023-12-16 03:35:07,396 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5f4a3716 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.12 03:35:07, skipping insertion in model container [2023-12-16 03:35:07,396 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 16.12 03:35:07" (3/3) ... [2023-12-16 03:35:07,397 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_floatingpointinfluence_no-floats_file-52.i [2023-12-16 03:35:07,408 INFO L204 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-12-16 03:35:07,408 INFO L163 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2023-12-16 03:35:07,465 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-12-16 03:35:07,470 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;@43b2a295, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2023-12-16 03:35:07,470 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2023-12-16 03:35:07,472 INFO L276 IsEmpty]: Start isEmpty. Operand has 56 states, 31 states have (on average 1.4193548387096775) internal successors, (44), 32 states have internal predecessors, (44), 22 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 22 states have call predecessors, (22), 22 states have call successors, (22) [2023-12-16 03:35:07,481 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 133 [2023-12-16 03:35:07,481 INFO L187 NwaCegarLoop]: Found error trace [2023-12-16 03:35:07,481 INFO L195 NwaCegarLoop]: trace histogram [22, 22, 22, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:35:07,482 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-16 03:35:07,485 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-16 03:35:07,485 INFO L85 PathProgramCache]: Analyzing trace with hash 1549857978, now seen corresponding path program 1 times [2023-12-16 03:35:07,491 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-16 03:35:07,491 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1067702906] [2023-12-16 03:35:07,491 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-16 03:35:07,491 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-16 03:35:07,569 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 03:35:07,637 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-12-16 03:35:07,639 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 03:35:07,642 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2023-12-16 03:35:07,644 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 03:35:07,646 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2023-12-16 03:35:07,647 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 03:35:07,649 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2023-12-16 03:35:07,650 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 03:35:07,652 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2023-12-16 03:35:07,654 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 03:35:07,655 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2023-12-16 03:35:07,657 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 03:35:07,659 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2023-12-16 03:35:07,660 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 03:35:07,662 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2023-12-16 03:35:07,663 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 03:35:07,665 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2023-12-16 03:35:07,666 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 03:35:07,668 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2023-12-16 03:35:07,669 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 03:35:07,671 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2023-12-16 03:35:07,672 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 03:35:07,673 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2023-12-16 03:35:07,674 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 03:35:07,676 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2023-12-16 03:35:07,677 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 03:35:07,678 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2023-12-16 03:35:07,680 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 03:35:07,681 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2023-12-16 03:35:07,685 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 03:35:07,698 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2023-12-16 03:35:07,699 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 03:35:07,701 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2023-12-16 03:35:07,702 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 03:35:07,704 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2023-12-16 03:35:07,705 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 03:35:07,707 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2023-12-16 03:35:07,708 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 03:35:07,709 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 106 [2023-12-16 03:35:07,710 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 03:35:07,711 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 112 [2023-12-16 03:35:07,712 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 03:35:07,714 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 117 [2023-12-16 03:35:07,714 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 03:35:07,717 INFO L134 CoverageAnalysis]: Checked inductivity of 924 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 924 trivial. 0 not checked. [2023-12-16 03:35:07,718 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-16 03:35:07,718 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1067702906] [2023-12-16 03:35:07,718 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1067702906] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-16 03:35:07,719 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-16 03:35:07,719 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-12-16 03:35:07,720 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1208407131] [2023-12-16 03:35:07,720 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-16 03:35:07,723 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2023-12-16 03:35:07,723 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-16 03:35:07,746 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2023-12-16 03:35:07,746 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2023-12-16 03:35:07,748 INFO L87 Difference]: Start difference. First operand has 56 states, 31 states have (on average 1.4193548387096775) internal successors, (44), 32 states have internal predecessors, (44), 22 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 22 states have call predecessors, (22), 22 states have call successors, (22) Second operand has 2 states, 2 states have (on average 12.5) internal successors, (25), 2 states have internal predecessors, (25), 2 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 1 states have call predecessors, (22), 2 states have call successors, (22) [2023-12-16 03:35:07,785 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-16 03:35:07,786 INFO L93 Difference]: Finished difference Result 109 states and 196 transitions. [2023-12-16 03:35:07,787 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-12-16 03:35:07,788 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 12.5) internal successors, (25), 2 states have internal predecessors, (25), 2 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 1 states have call predecessors, (22), 2 states have call successors, (22) Word has length 132 [2023-12-16 03:35:07,788 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-16 03:35:07,796 INFO L225 Difference]: With dead ends: 109 [2023-12-16 03:35:07,796 INFO L226 Difference]: Without dead ends: 54 [2023-12-16 03:35:07,800 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 68 GetRequests, 68 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:35:07,803 INFO L413 NwaCegarLoop]: 80 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, 80 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:35:07,804 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 80 Invalid, 3 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 3 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-12-16 03:35:07,817 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 54 states. [2023-12-16 03:35:07,834 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 54 to 54. [2023-12-16 03:35:07,835 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 54 states, 30 states have (on average 1.3) internal successors, (39), 30 states have internal predecessors, (39), 22 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 22 states have call predecessors, (22), 22 states have call successors, (22) [2023-12-16 03:35:07,837 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 54 states to 54 states and 83 transitions. [2023-12-16 03:35:07,838 INFO L78 Accepts]: Start accepts. Automaton has 54 states and 83 transitions. Word has length 132 [2023-12-16 03:35:07,838 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-16 03:35:07,838 INFO L495 AbstractCegarLoop]: Abstraction has 54 states and 83 transitions. [2023-12-16 03:35:07,838 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 12.5) internal successors, (25), 2 states have internal predecessors, (25), 2 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 1 states have call predecessors, (22), 2 states have call successors, (22) [2023-12-16 03:35:07,838 INFO L276 IsEmpty]: Start isEmpty. Operand 54 states and 83 transitions. [2023-12-16 03:35:07,840 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 133 [2023-12-16 03:35:07,840 INFO L187 NwaCegarLoop]: Found error trace [2023-12-16 03:35:07,841 INFO L195 NwaCegarLoop]: trace histogram [22, 22, 22, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:35:07,841 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2023-12-16 03:35:07,841 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-16 03:35:07,841 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-16 03:35:07,842 INFO L85 PathProgramCache]: Analyzing trace with hash 1868574202, now seen corresponding path program 1 times [2023-12-16 03:35:07,842 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-16 03:35:07,842 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [552245520] [2023-12-16 03:35:07,842 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-16 03:35:07,842 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-16 03:35:08,002 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-12-16 03:35:08,003 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-12-16 03:35:08,103 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-12-16 03:35:08,139 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-12-16 03:35:08,139 INFO L360 BasicCegarLoop]: Counterexample is feasible [2023-12-16 03:35:08,140 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2023-12-16 03:35:08,142 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2023-12-16 03:35:08,144 INFO L445 BasicCegarLoop]: Path program histogram: [1, 1] [2023-12-16 03:35:08,146 INFO L179 ceAbstractionStarter]: Computing trace abstraction results [2023-12-16 03:35:08,229 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 16.12 03:35:08 BoogieIcfgContainer [2023-12-16 03:35:08,229 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2023-12-16 03:35:08,231 INFO L158 Benchmark]: Toolchain (without parser) took 1533.84ms. Allocated memory is still 187.7MB. Free memory was 142.3MB in the beginning and 96.3MB in the end (delta: 46.1MB). Peak memory consumption was 47.6MB. Max. memory is 8.0GB. [2023-12-16 03:35:08,232 INFO L158 Benchmark]: CDTParser took 0.10ms. Allocated memory is still 187.7MB. Free memory is still 146.0MB. There was no memory consumed. Max. memory is 8.0GB. [2023-12-16 03:35:08,233 INFO L158 Benchmark]: CACSL2BoogieTranslator took 221.35ms. Allocated memory is still 187.7MB. Free memory was 142.3MB in the beginning and 129.4MB in the end (delta: 12.9MB). Peak memory consumption was 13.6MB. Max. memory is 8.0GB. [2023-12-16 03:35:08,233 INFO L158 Benchmark]: Boogie Procedure Inliner took 36.53ms. Allocated memory is still 187.7MB. Free memory was 129.4MB in the beginning and 127.3MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. [2023-12-16 03:35:08,234 INFO L158 Benchmark]: Boogie Preprocessor took 59.28ms. Allocated memory is still 187.7MB. Free memory was 127.3MB in the beginning and 124.5MB in the end (delta: 2.8MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. [2023-12-16 03:35:08,234 INFO L158 Benchmark]: RCFGBuilder took 367.05ms. Allocated memory is still 187.7MB. Free memory was 124.5MB in the beginning and 107.4MB in the end (delta: 17.2MB). Peak memory consumption was 17.8MB. Max. memory is 8.0GB. [2023-12-16 03:35:08,234 INFO L158 Benchmark]: TraceAbstraction took 836.43ms. Allocated memory is still 187.7MB. Free memory was 106.7MB in the beginning and 96.3MB in the end (delta: 10.5MB). Peak memory consumption was 12.0MB. Max. memory is 8.0GB. [2023-12-16 03:35:08,236 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 187.7MB. Free memory is still 146.0MB. There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 221.35ms. Allocated memory is still 187.7MB. Free memory was 142.3MB in the beginning and 129.4MB in the end (delta: 12.9MB). Peak memory consumption was 13.6MB. Max. memory is 8.0GB. * Boogie Procedure Inliner took 36.53ms. Allocated memory is still 187.7MB. Free memory was 129.4MB in the beginning and 127.3MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. * Boogie Preprocessor took 59.28ms. Allocated memory is still 187.7MB. Free memory was 127.3MB in the beginning and 124.5MB in the end (delta: 2.8MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. * RCFGBuilder took 367.05ms. Allocated memory is still 187.7MB. Free memory was 124.5MB in the beginning and 107.4MB in the end (delta: 17.2MB). Peak memory consumption was 17.8MB. Max. memory is 8.0GB. * TraceAbstraction took 836.43ms. Allocated memory is still 187.7MB. Free memory was 106.7MB in the beginning and 96.3MB in the end (delta: 10.5MB). Peak memory consumption was 12.0MB. 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 102. Possible FailurePath: [L21] unsigned char isInitial = 0; [L22] signed short int var_1_1 = -4; [L23] signed short int var_1_3 = 32; [L24] signed short int var_1_4 = -1; [L25] unsigned char var_1_5 = 1; [L26] unsigned char var_1_6 = 0; [L27] unsigned char var_1_7 = 0; [L28] unsigned char var_1_8 = 1; [L29] unsigned char var_1_9 = 0; [L30] signed long int var_1_10 = 25; [L31] signed long int var_1_11 = 256; [L32] signed long int var_1_12 = 0; [L33] signed long int var_1_13 = 31; [L34] signed long int var_1_14 = 256; [L35] unsigned long int var_1_15 = 8; [L36] unsigned char var_1_16 = 16; [L106] isInitial = 1 [L107] FCALL initially() [L108] COND TRUE 1 [L109] FCALL updateLastVariables() [L110] CALL updateVariables() [L65] var_1_3 = __VERIFIER_nondet_short() [L66] CALL assume_abort_if_not(var_1_3 >= 0) VAL [\old(cond)=1, isInitial=1, var_1_10=25, var_1_11=256, var_1_12=0, var_1_13=31, var_1_14=256, var_1_15=8, var_1_16=16, var_1_1=-4, var_1_3=0, var_1_4=-1, var_1_5=1, var_1_6=0, var_1_7=0, var_1_8=1, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1, isInitial=1, var_1_10=25, var_1_11=256, var_1_12=0, var_1_13=31, var_1_14=256, var_1_15=8, var_1_16=16, var_1_1=-4, var_1_3=0, var_1_4=-1, var_1_5=1, var_1_6=0, var_1_7=0, var_1_8=1, var_1_9=0] [L66] RET assume_abort_if_not(var_1_3 >= 0) VAL [isInitial=1, var_1_10=25, var_1_11=256, var_1_12=0, var_1_13=31, var_1_14=256, var_1_15=8, var_1_16=16, var_1_1=-4, var_1_3=0, var_1_4=-1, var_1_5=1, var_1_6=0, var_1_7=0, var_1_8=1, var_1_9=0] [L67] CALL assume_abort_if_not(var_1_3 <= 32766) VAL [\old(cond)=1, isInitial=1, var_1_10=25, var_1_11=256, var_1_12=0, var_1_13=31, var_1_14=256, var_1_15=8, var_1_16=16, var_1_1=-4, var_1_3=0, var_1_4=-1, var_1_5=1, var_1_6=0, var_1_7=0, var_1_8=1, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1, isInitial=1, var_1_10=25, var_1_11=256, var_1_12=0, var_1_13=31, var_1_14=256, var_1_15=8, var_1_16=16, var_1_1=-4, var_1_3=0, var_1_4=-1, var_1_5=1, var_1_6=0, var_1_7=0, var_1_8=1, var_1_9=0] [L67] RET assume_abort_if_not(var_1_3 <= 32766) VAL [isInitial=1, var_1_10=25, var_1_11=256, var_1_12=0, var_1_13=31, var_1_14=256, var_1_15=8, var_1_16=16, var_1_1=-4, var_1_3=0, var_1_4=-1, var_1_5=1, var_1_6=0, var_1_7=0, var_1_8=1, var_1_9=0] [L68] var_1_4 = __VERIFIER_nondet_short() [L69] CALL assume_abort_if_not(var_1_4 >= -16383) VAL [\old(cond)=1, isInitial=1, var_1_10=25, var_1_11=256, var_1_12=0, var_1_13=31, var_1_14=256, var_1_15=8, var_1_16=16, var_1_1=-4, var_1_3=0, var_1_4=5, var_1_5=1, var_1_6=0, var_1_7=0, var_1_8=1, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1, isInitial=1, var_1_10=25, var_1_11=256, var_1_12=0, var_1_13=31, var_1_14=256, var_1_15=8, var_1_16=16, var_1_1=-4, var_1_3=0, var_1_4=5, var_1_5=1, var_1_6=0, var_1_7=0, var_1_8=1, var_1_9=0] [L69] RET assume_abort_if_not(var_1_4 >= -16383) VAL [isInitial=1, var_1_10=25, var_1_11=256, var_1_12=0, var_1_13=31, var_1_14=256, var_1_15=8, var_1_16=16, var_1_1=-4, var_1_3=0, var_1_4=5, var_1_5=1, var_1_6=0, var_1_7=0, var_1_8=1, var_1_9=0] [L70] CALL assume_abort_if_not(var_1_4 <= 16383) VAL [\old(cond)=1, isInitial=1, var_1_10=25, var_1_11=256, var_1_12=0, var_1_13=31, var_1_14=256, var_1_15=8, var_1_16=16, var_1_1=-4, var_1_3=0, var_1_4=5, var_1_5=1, var_1_6=0, var_1_7=0, var_1_8=1, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1, isInitial=1, var_1_10=25, var_1_11=256, var_1_12=0, var_1_13=31, var_1_14=256, var_1_15=8, var_1_16=16, var_1_1=-4, var_1_3=0, var_1_4=5, var_1_5=1, var_1_6=0, var_1_7=0, var_1_8=1, var_1_9=0] [L70] RET assume_abort_if_not(var_1_4 <= 16383) VAL [isInitial=1, var_1_10=25, var_1_11=256, var_1_12=0, var_1_13=31, var_1_14=256, var_1_15=8, var_1_16=16, var_1_1=-4, var_1_3=0, var_1_4=5, var_1_5=1, var_1_6=0, var_1_7=0, var_1_8=1, var_1_9=0] [L71] var_1_6 = __VERIFIER_nondet_uchar() [L72] CALL assume_abort_if_not(var_1_6 >= 0) VAL [\old(cond)=1, isInitial=1, var_1_10=25, var_1_11=256, var_1_12=0, var_1_13=31, var_1_14=256, var_1_15=8, var_1_16=16, var_1_1=-4, var_1_3=0, var_1_4=5, var_1_5=1, var_1_7=0, var_1_8=1, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1, isInitial=1, var_1_10=25, var_1_11=256, var_1_12=0, var_1_13=31, var_1_14=256, var_1_15=8, var_1_16=16, var_1_1=-4, var_1_3=0, var_1_4=5, var_1_5=1, var_1_7=0, var_1_8=1, var_1_9=0] [L72] RET assume_abort_if_not(var_1_6 >= 0) VAL [isInitial=1, var_1_10=25, var_1_11=256, var_1_12=0, var_1_13=31, var_1_14=256, var_1_15=8, var_1_16=16, var_1_1=-4, var_1_3=0, var_1_4=5, var_1_5=1, var_1_7=0, var_1_8=1, var_1_9=0] [L73] CALL assume_abort_if_not(var_1_6 <= 1) VAL [\old(cond)=1, isInitial=1, var_1_10=25, var_1_11=256, var_1_12=0, var_1_13=31, var_1_14=256, var_1_15=8, var_1_16=16, var_1_1=-4, var_1_3=0, var_1_4=5, var_1_5=1, var_1_6=1, var_1_7=0, var_1_8=1, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1, isInitial=1, var_1_10=25, var_1_11=256, var_1_12=0, var_1_13=31, var_1_14=256, var_1_15=8, var_1_16=16, var_1_1=-4, var_1_3=0, var_1_4=5, var_1_5=1, var_1_6=1, var_1_7=0, var_1_8=1, var_1_9=0] [L73] RET assume_abort_if_not(var_1_6 <= 1) VAL [isInitial=1, var_1_10=25, var_1_11=256, var_1_12=0, var_1_13=31, var_1_14=256, var_1_15=8, var_1_16=16, var_1_1=-4, var_1_3=0, var_1_4=5, var_1_5=1, var_1_6=1, var_1_7=0, var_1_8=1, var_1_9=0] [L74] var_1_7 = __VERIFIER_nondet_uchar() [L75] CALL assume_abort_if_not(var_1_7 >= 1) VAL [\old(cond)=1, isInitial=1, var_1_10=25, var_1_11=256, var_1_12=0, var_1_13=31, var_1_14=256, var_1_15=8, var_1_16=16, var_1_1=-4, var_1_3=0, var_1_4=5, var_1_5=1, var_1_6=1, var_1_7=1, var_1_8=1, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1, isInitial=1, var_1_10=25, var_1_11=256, var_1_12=0, var_1_13=31, var_1_14=256, var_1_15=8, var_1_16=16, var_1_1=-4, var_1_3=0, var_1_4=5, var_1_5=1, var_1_6=1, var_1_7=1, var_1_8=1, var_1_9=0] [L75] RET assume_abort_if_not(var_1_7 >= 1) VAL [isInitial=1, var_1_10=25, var_1_11=256, var_1_12=0, var_1_13=31, var_1_14=256, var_1_15=8, var_1_16=16, var_1_1=-4, var_1_3=0, var_1_4=5, var_1_5=1, var_1_6=1, var_1_7=1, var_1_8=1, var_1_9=0] [L76] CALL assume_abort_if_not(var_1_7 <= 1) VAL [\old(cond)=1, isInitial=1, var_1_10=25, var_1_11=256, var_1_12=0, var_1_13=31, var_1_14=256, var_1_15=8, var_1_16=16, var_1_1=-4, var_1_3=0, var_1_4=5, var_1_5=1, var_1_6=1, var_1_7=1, var_1_8=1, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1, isInitial=1, var_1_10=25, var_1_11=256, var_1_12=0, var_1_13=31, var_1_14=256, var_1_15=8, var_1_16=16, var_1_1=-4, var_1_3=0, var_1_4=5, var_1_5=1, var_1_6=1, var_1_7=1, var_1_8=1, var_1_9=0] [L76] RET assume_abort_if_not(var_1_7 <= 1) VAL [isInitial=1, var_1_10=25, var_1_11=256, var_1_12=0, var_1_13=31, var_1_14=256, var_1_15=8, var_1_16=16, var_1_1=-4, var_1_3=0, var_1_4=5, var_1_5=1, var_1_6=1, var_1_7=1, var_1_8=1, var_1_9=0] [L77] var_1_8 = __VERIFIER_nondet_uchar() [L78] CALL assume_abort_if_not(var_1_8 >= 1) VAL [\old(cond)=1, isInitial=1, var_1_10=25, var_1_11=256, var_1_12=0, var_1_13=31, var_1_14=256, var_1_15=8, var_1_16=16, var_1_1=-4, var_1_3=0, var_1_4=5, var_1_5=1, var_1_6=1, var_1_7=1, var_1_8=1, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1, isInitial=1, var_1_10=25, var_1_11=256, var_1_12=0, var_1_13=31, var_1_14=256, var_1_15=8, var_1_16=16, var_1_1=-4, var_1_3=0, var_1_4=5, var_1_5=1, var_1_6=1, var_1_7=1, var_1_8=1, var_1_9=0] [L78] RET assume_abort_if_not(var_1_8 >= 1) VAL [isInitial=1, var_1_10=25, var_1_11=256, var_1_12=0, var_1_13=31, var_1_14=256, var_1_15=8, var_1_16=16, var_1_1=-4, var_1_3=0, var_1_4=5, var_1_5=1, var_1_6=1, var_1_7=1, var_1_8=1, var_1_9=0] [L79] CALL assume_abort_if_not(var_1_8 <= 1) VAL [\old(cond)=1, isInitial=1, var_1_10=25, var_1_11=256, var_1_12=0, var_1_13=31, var_1_14=256, var_1_15=8, var_1_16=16, var_1_1=-4, var_1_3=0, var_1_4=5, var_1_5=1, var_1_6=1, var_1_7=1, var_1_8=1, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1, isInitial=1, var_1_10=25, var_1_11=256, var_1_12=0, var_1_13=31, var_1_14=256, var_1_15=8, var_1_16=16, var_1_1=-4, var_1_3=0, var_1_4=5, var_1_5=1, var_1_6=1, var_1_7=1, var_1_8=1, var_1_9=0] [L79] RET assume_abort_if_not(var_1_8 <= 1) VAL [isInitial=1, var_1_10=25, var_1_11=256, var_1_12=0, var_1_13=31, var_1_14=256, var_1_15=8, var_1_16=16, var_1_1=-4, var_1_3=0, var_1_4=5, var_1_5=1, var_1_6=1, var_1_7=1, var_1_8=1, var_1_9=0] [L80] var_1_9 = __VERIFIER_nondet_uchar() [L81] CALL assume_abort_if_not(var_1_9 >= 0) VAL [\old(cond)=1, isInitial=1, var_1_10=25, var_1_11=256, var_1_12=0, var_1_13=31, var_1_14=256, var_1_15=8, var_1_16=16, var_1_1=-4, var_1_3=0, var_1_4=5, var_1_5=1, var_1_6=1, var_1_7=1, var_1_8=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1, isInitial=1, var_1_10=25, var_1_11=256, var_1_12=0, var_1_13=31, var_1_14=256, var_1_15=8, var_1_16=16, var_1_1=-4, var_1_3=0, var_1_4=5, var_1_5=1, var_1_6=1, var_1_7=1, var_1_8=1] [L81] RET assume_abort_if_not(var_1_9 >= 0) VAL [isInitial=1, var_1_10=25, var_1_11=256, var_1_12=0, var_1_13=31, var_1_14=256, var_1_15=8, var_1_16=16, var_1_1=-4, var_1_3=0, var_1_4=5, var_1_5=1, var_1_6=1, var_1_7=1, var_1_8=1] [L82] CALL assume_abort_if_not(var_1_9 <= 0) VAL [\old(cond)=1, isInitial=1, var_1_10=25, var_1_11=256, var_1_12=0, var_1_13=31, var_1_14=256, var_1_15=8, var_1_16=16, var_1_1=-4, var_1_3=0, var_1_4=5, var_1_5=1, var_1_6=1, var_1_7=1, var_1_8=1, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1, isInitial=1, var_1_10=25, var_1_11=256, var_1_12=0, var_1_13=31, var_1_14=256, var_1_15=8, var_1_16=16, var_1_1=-4, var_1_3=0, var_1_4=5, var_1_5=1, var_1_6=1, var_1_7=1, var_1_8=1, var_1_9=0] [L82] RET assume_abort_if_not(var_1_9 <= 0) VAL [isInitial=1, var_1_10=25, var_1_11=256, var_1_12=0, var_1_13=31, var_1_14=256, var_1_15=8, var_1_16=16, var_1_1=-4, var_1_3=0, var_1_4=5, var_1_5=1, var_1_6=1, var_1_7=1, var_1_8=1, var_1_9=0] [L83] var_1_11 = __VERIFIER_nondet_long() [L84] CALL assume_abort_if_not(var_1_11 >= 0) VAL [\old(cond)=1, isInitial=1, var_1_10=25, var_1_11=0, var_1_12=0, var_1_13=31, var_1_14=256, var_1_15=8, var_1_16=16, var_1_1=-4, var_1_3=0, var_1_4=5, var_1_5=1, var_1_6=1, var_1_7=1, var_1_8=1, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1, isInitial=1, var_1_10=25, var_1_11=0, var_1_12=0, var_1_13=31, var_1_14=256, var_1_15=8, var_1_16=16, var_1_1=-4, var_1_3=0, var_1_4=5, var_1_5=1, var_1_6=1, var_1_7=1, var_1_8=1, var_1_9=0] [L84] RET assume_abort_if_not(var_1_11 >= 0) VAL [isInitial=1, var_1_10=25, var_1_11=0, var_1_12=0, var_1_13=31, var_1_14=256, var_1_15=8, var_1_16=16, var_1_1=-4, var_1_3=0, var_1_4=5, var_1_5=1, var_1_6=1, var_1_7=1, var_1_8=1, var_1_9=0] [L85] CALL assume_abort_if_not(var_1_11 <= 2147483647) VAL [\old(cond)=1, isInitial=1, var_1_10=25, var_1_11=0, var_1_12=0, var_1_13=31, var_1_14=256, var_1_15=8, var_1_16=16, var_1_1=-4, var_1_3=0, var_1_4=5, var_1_5=1, var_1_6=1, var_1_7=1, var_1_8=1, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1, isInitial=1, var_1_10=25, var_1_11=0, var_1_12=0, var_1_13=31, var_1_14=256, var_1_15=8, var_1_16=16, var_1_1=-4, var_1_3=0, var_1_4=5, var_1_5=1, var_1_6=1, var_1_7=1, var_1_8=1, var_1_9=0] [L85] RET assume_abort_if_not(var_1_11 <= 2147483647) VAL [isInitial=1, var_1_10=25, var_1_11=0, var_1_12=0, var_1_13=31, var_1_14=256, var_1_15=8, var_1_16=16, var_1_1=-4, var_1_3=0, var_1_4=5, var_1_5=1, var_1_6=1, var_1_7=1, var_1_8=1, var_1_9=0] [L86] var_1_12 = __VERIFIER_nondet_long() [L87] CALL assume_abort_if_not(var_1_12 >= 2147483647) VAL [\old(cond)=1, isInitial=1, var_1_10=25, var_1_11=0, var_1_12=2147483647, var_1_13=31, var_1_14=256, var_1_15=8, var_1_16=16, var_1_1=-4, var_1_3=0, var_1_4=5, var_1_5=1, var_1_6=1, var_1_7=1, var_1_8=1, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1, isInitial=1, var_1_10=25, var_1_11=0, var_1_12=2147483647, var_1_13=31, var_1_14=256, var_1_15=8, var_1_16=16, var_1_1=-4, var_1_3=0, var_1_4=5, var_1_5=1, var_1_6=1, var_1_7=1, var_1_8=1, var_1_9=0] [L87] RET assume_abort_if_not(var_1_12 >= 2147483647) VAL [isInitial=1, var_1_10=25, var_1_11=0, var_1_12=2147483647, var_1_13=31, var_1_14=256, var_1_15=8, var_1_16=16, var_1_1=-4, var_1_3=0, var_1_4=5, var_1_5=1, var_1_6=1, var_1_7=1, var_1_8=1, var_1_9=0] [L88] CALL assume_abort_if_not(var_1_12 <= 2147483647) VAL [\old(cond)=1, isInitial=1, var_1_10=25, var_1_11=0, var_1_12=2147483647, var_1_13=31, var_1_14=256, var_1_15=8, var_1_16=16, var_1_1=-4, var_1_3=0, var_1_4=5, var_1_5=1, var_1_6=1, var_1_7=1, var_1_8=1, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1, isInitial=1, var_1_10=25, var_1_11=0, var_1_12=2147483647, var_1_13=31, var_1_14=256, var_1_15=8, var_1_16=16, var_1_1=-4, var_1_3=0, var_1_4=5, var_1_5=1, var_1_6=1, var_1_7=1, var_1_8=1, var_1_9=0] [L88] RET assume_abort_if_not(var_1_12 <= 2147483647) VAL [isInitial=1, var_1_10=25, var_1_11=0, var_1_12=2147483647, var_1_13=31, var_1_14=256, var_1_15=8, var_1_16=16, var_1_1=-4, var_1_3=0, var_1_4=5, var_1_5=1, var_1_6=1, var_1_7=1, var_1_8=1, var_1_9=0] [L89] var_1_13 = __VERIFIER_nondet_long() [L90] CALL assume_abort_if_not(var_1_13 >= 0) VAL [\old(cond)=1, isInitial=1, var_1_10=25, var_1_11=0, var_1_12=2147483647, var_1_13=2147483646, var_1_14=256, var_1_15=8, var_1_16=16, var_1_1=-4, var_1_3=0, var_1_4=5, var_1_5=1, var_1_6=1, var_1_7=1, var_1_8=1, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1, isInitial=1, var_1_10=25, var_1_11=0, var_1_12=2147483647, var_1_13=2147483646, var_1_14=256, var_1_15=8, var_1_16=16, var_1_1=-4, var_1_3=0, var_1_4=5, var_1_5=1, var_1_6=1, var_1_7=1, var_1_8=1, var_1_9=0] [L90] RET assume_abort_if_not(var_1_13 >= 0) VAL [isInitial=1, var_1_10=25, var_1_11=0, var_1_12=2147483647, var_1_13=2147483646, var_1_14=256, var_1_15=8, var_1_16=16, var_1_1=-4, var_1_3=0, var_1_4=5, var_1_5=1, var_1_6=1, var_1_7=1, var_1_8=1, var_1_9=0] [L91] CALL assume_abort_if_not(var_1_13 <= 2147483647) VAL [\old(cond)=1, isInitial=1, var_1_10=25, var_1_11=0, var_1_12=2147483647, var_1_13=2147483646, var_1_14=256, var_1_15=8, var_1_16=16, var_1_1=-4, var_1_3=0, var_1_4=5, var_1_5=1, var_1_6=1, var_1_7=1, var_1_8=1, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1, isInitial=1, var_1_10=25, var_1_11=0, var_1_12=2147483647, var_1_13=2147483646, var_1_14=256, var_1_15=8, var_1_16=16, var_1_1=-4, var_1_3=0, var_1_4=5, var_1_5=1, var_1_6=1, var_1_7=1, var_1_8=1, var_1_9=0] [L91] RET assume_abort_if_not(var_1_13 <= 2147483647) VAL [isInitial=1, var_1_10=25, var_1_11=0, var_1_12=2147483647, var_1_13=2147483646, var_1_14=256, var_1_15=8, var_1_16=16, var_1_1=-4, var_1_3=0, var_1_4=5, var_1_5=1, var_1_6=1, var_1_7=1, var_1_8=1, var_1_9=0] [L92] var_1_14 = __VERIFIER_nondet_long() [L93] CALL assume_abort_if_not(var_1_14 >= 0) VAL [\old(cond)=1, isInitial=1, var_1_10=25, var_1_11=0, var_1_12=2147483647, var_1_13=2147483646, var_1_14=0, var_1_15=8, var_1_16=16, var_1_1=-4, var_1_3=0, var_1_4=5, var_1_5=1, var_1_6=1, var_1_7=1, var_1_8=1, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1, isInitial=1, var_1_10=25, var_1_11=0, var_1_12=2147483647, var_1_13=2147483646, var_1_14=0, var_1_15=8, var_1_16=16, var_1_1=-4, var_1_3=0, var_1_4=5, var_1_5=1, var_1_6=1, var_1_7=1, var_1_8=1, var_1_9=0] [L93] RET assume_abort_if_not(var_1_14 >= 0) VAL [isInitial=1, var_1_10=25, var_1_11=0, var_1_12=2147483647, var_1_13=2147483646, var_1_14=0, var_1_15=8, var_1_16=16, var_1_1=-4, var_1_3=0, var_1_4=5, var_1_5=1, var_1_6=1, var_1_7=1, var_1_8=1, var_1_9=0] [L94] CALL assume_abort_if_not(var_1_14 <= 2147483647) VAL [\old(cond)=1, isInitial=1, var_1_10=25, var_1_11=0, var_1_12=2147483647, var_1_13=2147483646, var_1_14=0, var_1_15=8, var_1_16=16, var_1_1=-4, var_1_3=0, var_1_4=5, var_1_5=1, var_1_6=1, var_1_7=1, var_1_8=1, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1, isInitial=1, var_1_10=25, var_1_11=0, var_1_12=2147483647, var_1_13=2147483646, var_1_14=0, var_1_15=8, var_1_16=16, var_1_1=-4, var_1_3=0, var_1_4=5, var_1_5=1, var_1_6=1, var_1_7=1, var_1_8=1, var_1_9=0] [L94] RET assume_abort_if_not(var_1_14 <= 2147483647) VAL [isInitial=1, var_1_10=25, var_1_11=0, var_1_12=2147483647, var_1_13=2147483646, var_1_14=0, var_1_15=8, var_1_16=16, var_1_1=-4, var_1_3=0, var_1_4=5, var_1_5=1, var_1_6=1, var_1_7=1, var_1_8=1, var_1_9=0] [L95] var_1_16 = __VERIFIER_nondet_uchar() [L96] CALL assume_abort_if_not(var_1_16 >= 0) VAL [\old(cond)=1, isInitial=1, var_1_10=25, var_1_11=0, var_1_12=2147483647, var_1_13=2147483646, var_1_14=0, var_1_15=8, var_1_1=-4, var_1_3=0, var_1_4=5, var_1_5=1, var_1_6=1, var_1_7=1, var_1_8=1, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1, isInitial=1, var_1_10=25, var_1_11=0, var_1_12=2147483647, var_1_13=2147483646, var_1_14=0, var_1_15=8, var_1_1=-4, var_1_3=0, var_1_4=5, var_1_5=1, var_1_6=1, var_1_7=1, var_1_8=1, var_1_9=0] [L96] RET assume_abort_if_not(var_1_16 >= 0) VAL [isInitial=1, var_1_10=25, var_1_11=0, var_1_12=2147483647, var_1_13=2147483646, var_1_14=0, var_1_15=8, var_1_1=-4, var_1_3=0, var_1_4=5, var_1_5=1, var_1_6=1, var_1_7=1, var_1_8=1, var_1_9=0] [L97] CALL assume_abort_if_not(var_1_16 <= 30) VAL [\old(cond)=1, isInitial=1, var_1_10=25, var_1_11=0, var_1_12=2147483647, var_1_13=2147483646, var_1_14=0, var_1_15=8, var_1_16=0, var_1_1=-4, var_1_3=0, var_1_4=5, var_1_5=1, var_1_6=1, var_1_7=1, var_1_8=1, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1, isInitial=1, var_1_10=25, var_1_11=0, var_1_12=2147483647, var_1_13=2147483646, var_1_14=0, var_1_15=8, var_1_16=0, var_1_1=-4, var_1_3=0, var_1_4=5, var_1_5=1, var_1_6=1, var_1_7=1, var_1_8=1, var_1_9=0] [L97] RET assume_abort_if_not(var_1_16 <= 30) VAL [isInitial=1, var_1_10=25, var_1_11=0, var_1_12=2147483647, var_1_13=2147483646, var_1_14=0, var_1_15=8, var_1_16=0, var_1_1=-4, var_1_3=0, var_1_4=5, var_1_5=1, var_1_6=1, var_1_7=1, var_1_8=1, var_1_9=0] [L110] RET updateVariables() [L111] CALL step() [L40] signed short int stepLocal_0 = var_1_3; VAL [isInitial=1, stepLocal_0=0, var_1_10=25, var_1_11=0, var_1_12=2147483647, var_1_13=2147483646, var_1_14=0, var_1_15=8, var_1_16=0, var_1_1=-4, var_1_3=0, var_1_4=5, var_1_5=1, var_1_6=1, var_1_7=1, var_1_8=1, var_1_9=0] [L41] COND FALSE !(stepLocal_0 > ((var_1_4 / -256) * 32)) [L48] var_1_5 = var_1_9 VAL [isInitial=1, stepLocal_0=0, var_1_10=25, var_1_11=0, var_1_12=2147483647, var_1_13=2147483646, var_1_14=0, var_1_15=8, var_1_16=0, var_1_1=-4, var_1_3=0, var_1_4=5, var_1_5=0, var_1_6=1, var_1_7=1, var_1_8=1, var_1_9=0] [L50] COND TRUE \read(var_1_7) [L51] var_1_10 = (var_1_11 - (((((var_1_12 - var_1_13)) > (var_1_14)) ? ((var_1_12 - var_1_13)) : (var_1_14)))) VAL [isInitial=1, stepLocal_0=0, var_1_10=-1, var_1_11=0, var_1_12=2147483647, var_1_13=2147483646, var_1_14=0, var_1_15=8, var_1_16=0, var_1_1=-4, var_1_3=0, var_1_4=5, var_1_5=0, var_1_6=1, var_1_7=1, var_1_8=1, var_1_9=0] [L53] COND TRUE var_1_10 < 63.75 [L54] var_1_1 = (10 - var_1_3) VAL [isInitial=1, stepLocal_0=0, var_1_10=-1, var_1_11=0, var_1_12=2147483647, var_1_13=2147483646, var_1_14=0, var_1_15=8, var_1_16=0, var_1_1=10, var_1_3=0, var_1_4=5, var_1_5=0, var_1_6=1, var_1_7=1, var_1_8=1, var_1_9=0] [L58] COND FALSE !(! (var_1_13 < (127.125 / var_1_12))) VAL [isInitial=1, stepLocal_0=0, var_1_10=-1, var_1_11=0, var_1_12=2147483647, var_1_13=2147483646, var_1_14=0, var_1_15=8, var_1_16=0, var_1_1=10, var_1_3=0, var_1_4=5, var_1_5=0, var_1_6=1, var_1_7=1, var_1_8=1, var_1_9=0] [L111] RET step() [L112] CALL, EXPR property() [L102] EXPR ((((var_1_10 < 63.75) ? (var_1_1 == ((signed short int) (10 - var_1_3))) : (var_1_1 == ((signed short int) (4 + var_1_4)))) && ((var_1_3 > ((var_1_4 / -256) * 32)) ? (var_1_6 ? (var_1_5 == ((unsigned char) (! (var_1_7 && var_1_8)))) : (var_1_5 == ((unsigned char) var_1_8))) : (var_1_5 == ((unsigned char) var_1_9)))) && (var_1_7 ? (var_1_10 == ((signed long int) (var_1_11 - (((((var_1_12 - var_1_13)) > (var_1_14)) ? ((var_1_12 - var_1_13)) : (var_1_14)))))) : 1)) && ((! (var_1_13 < (127.125 / var_1_12))) ? ((var_1_1 <= ((var_1_4 * var_1_3) + (-2 << var_1_16))) ? (var_1_15 == ((unsigned long int) var_1_3)) : 1) : 1) VAL [isInitial=1, var_1_10=-1, var_1_11=0, var_1_12=2147483647, var_1_13=2147483646, var_1_14=0, var_1_15=8, var_1_16=0, var_1_1=10, var_1_3=0, var_1_4=5, var_1_5=0, var_1_6=1, var_1_7=1, var_1_8=1, var_1_9=0] [L102-L103] return ((((var_1_10 < 63.75) ? (var_1_1 == ((signed short int) (10 - var_1_3))) : (var_1_1 == ((signed short int) (4 + var_1_4)))) && ((var_1_3 > ((var_1_4 / -256) * 32)) ? (var_1_6 ? (var_1_5 == ((unsigned char) (! (var_1_7 && var_1_8)))) : (var_1_5 == ((unsigned char) var_1_8))) : (var_1_5 == ((unsigned char) var_1_9)))) && (var_1_7 ? (var_1_10 == ((signed long int) (var_1_11 - (((((var_1_12 - var_1_13)) > (var_1_14)) ? ((var_1_12 - var_1_13)) : (var_1_14)))))) : 1)) && ((! (var_1_13 < (127.125 / var_1_12))) ? ((var_1_1 <= ((var_1_4 * var_1_3) + (-2 << var_1_16))) ? (var_1_15 == ((unsigned long int) var_1_3)) : 1) : 1) ; [L112] RET, EXPR property() [L112] CALL __VERIFIER_assert(property()) [L19] COND TRUE !(cond) VAL [\old(cond)=0, cond=0, isInitial=1, var_1_10=-1, var_1_11=0, var_1_12=2147483647, var_1_13=2147483646, var_1_14=0, var_1_15=8, var_1_16=0, var_1_1=10, var_1_3=0, var_1_4=5, var_1_5=0, var_1_6=1, var_1_7=1, var_1_8=1, var_1_9=0] [L19] reach_error() VAL [\old(cond)=0, cond=0, isInitial=1, var_1_10=-1, var_1_11=0, var_1_12=2147483647, var_1_13=2147483646, var_1_14=0, var_1_15=8, var_1_16=0, var_1_1=10, var_1_3=0, var_1_4=5, var_1_5=0, var_1_6=1, var_1_7=1, var_1_8=1, var_1_9=0] - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 56 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 0.7s, OverallIterations: 2, TraceHistogramMax: 22, 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, 80 SdHoareTripleChecker+Invalid, 0.0s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 0 mSDsCounter, 0 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 3 IncrementalHoareTripleChecker+Invalid, 3 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 0 mSolverCounterUnsat, 80 mSDtfsCounter, 3 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 68 GetRequests, 68 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=56occurred 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.2s SatisfiabilityAnalysisTime, 0.1s InterpolantComputationTime, 264 NumberOfCodeBlocks, 264 NumberOfCodeBlocksAsserted, 2 NumberOfCheckSat, 131 ConstructedInterpolants, 0 QuantifiedInterpolants, 131 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 1 InterpolantComputations, 1 PerfectInterpolantSequences, 924/924 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:35:08,279 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...