/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-64bit-Automizer_Default.epf --cacsl2boogietranslator.use.bitabs.translation false -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml -i ../../../trunk/examples/svcomp/hardware-verification-bv/btor2c-lazyMod.safe_intersymbol_analog_estimation_convergence.c -------------------------------------------------------------------------------- This is Ultimate 0.2.4-tmp.fs.bitabs-eval-d9c3e40-m [2023-12-26 02:03:36,641 INFO L188 SettingsManager]: Resetting all preferences to default values... [2023-12-26 02:03:36,683 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/default/automizer/svcomp-Reach-64bit-Automizer_Default.epf [2023-12-26 02:03:36,686 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2023-12-26 02:03:36,687 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2023-12-26 02:03:36,704 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2023-12-26 02:03:36,705 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-12-26 02:03:36,705 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-12-26 02:03:36,705 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2023-12-26 02:03:36,705 INFO L153 SettingsManager]: * Use memory slicer=true [2023-12-26 02:03:36,706 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-12-26 02:03:36,706 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-12-26 02:03:36,706 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-12-26 02:03:36,706 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2023-12-26 02:03:36,707 INFO L153 SettingsManager]: * Use SBE=true [2023-12-26 02:03:36,707 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-12-26 02:03:36,707 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2023-12-26 02:03:36,707 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2023-12-26 02:03:36,708 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2023-12-26 02:03:36,708 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2023-12-26 02:03:36,708 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-12-26 02:03:36,710 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2023-12-26 02:03:36,710 INFO L153 SettingsManager]: * Allow undefined functions=false [2023-12-26 02:03:36,710 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2023-12-26 02:03:36,710 INFO L153 SettingsManager]: * Use constant arrays=true [2023-12-26 02:03:36,711 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-12-26 02:03:36,711 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-12-26 02:03:36,711 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2023-12-26 02:03:36,711 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2023-12-26 02:03:36,711 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2023-12-26 02:03:36,711 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-12-26 02:03:36,711 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-12-26 02:03:36,712 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2023-12-26 02:03:36,712 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2023-12-26 02:03:36,712 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2023-12-26 02:03:36,713 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2023-12-26 02:03:36,713 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-12-26 02:03:36,713 INFO L153 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2023-12-26 02:03:36,713 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2023-12-26 02:03:36,713 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-12-26 02:03:36,713 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-26 02:03:36,878 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-12-26 02:03:36,893 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-12-26 02:03:36,895 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-12-26 02:03:36,896 INFO L270 PluginConnector]: Initializing CDTParser... [2023-12-26 02:03:36,896 INFO L274 PluginConnector]: CDTParser initialized [2023-12-26 02:03:36,896 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/hardware-verification-bv/btor2c-lazyMod.safe_intersymbol_analog_estimation_convergence.c [2023-12-26 02:03:37,839 INFO L533 CDTParser]: Created temporary CDT project at NULL [2023-12-26 02:03:38,011 INFO L384 CDTParser]: Found 1 translation units. [2023-12-26 02:03:38,012 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/hardware-verification-bv/btor2c-lazyMod.safe_intersymbol_analog_estimation_convergence.c [2023-12-26 02:03:38,026 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/bb7d54afe/6e76887dcb434fabb7be70b12eedaeb2/FLAGd1fc9516a [2023-12-26 02:03:38,040 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/bb7d54afe/6e76887dcb434fabb7be70b12eedaeb2 [2023-12-26 02:03:38,041 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-12-26 02:03:38,042 INFO L133 ToolchainWalker]: Walking toolchain with 5 elements. [2023-12-26 02:03:38,043 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-12-26 02:03:38,043 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-12-26 02:03:38,047 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2023-12-26 02:03:38,047 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 26.12 02:03:38" (1/1) ... [2023-12-26 02:03:38,048 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@76ab690b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.12 02:03:38, skipping insertion in model container [2023-12-26 02:03:38,048 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 26.12 02:03:38" (1/1) ... [2023-12-26 02:03:38,094 INFO L177 MainTranslator]: Built tables and reachable declarations [2023-12-26 02:03:38,186 WARN L239 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/hardware-verification-bv/btor2c-lazyMod.safe_intersymbol_analog_estimation_convergence.c[1311,1324] [2023-12-26 02:03:38,300 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-12-26 02:03:38,308 INFO L202 MainTranslator]: Completed pre-run [2023-12-26 02:03:38,315 WARN L239 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/hardware-verification-bv/btor2c-lazyMod.safe_intersymbol_analog_estimation_convergence.c[1311,1324] [2023-12-26 02:03:38,406 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-12-26 02:03:38,415 INFO L206 MainTranslator]: Completed translation [2023-12-26 02:03:38,415 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.12 02:03:38 WrapperNode [2023-12-26 02:03:38,415 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-12-26 02:03:38,416 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-12-26 02:03:38,416 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-12-26 02:03:38,416 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2023-12-26 02:03:38,421 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.12 02:03:38" (1/1) ... [2023-12-26 02:03:38,435 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.12 02:03:38" (1/1) ... [2023-12-26 02:03:38,497 INFO L138 Inliner]: procedures = 17, calls = 10, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 1180 [2023-12-26 02:03:38,498 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-12-26 02:03:38,498 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-12-26 02:03:38,498 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2023-12-26 02:03:38,498 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2023-12-26 02:03:38,507 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.12 02:03:38" (1/1) ... [2023-12-26 02:03:38,507 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.12 02:03:38" (1/1) ... [2023-12-26 02:03:38,516 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.12 02:03:38" (1/1) ... [2023-12-26 02:03:38,541 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-26 02:03:38,541 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.12 02:03:38" (1/1) ... [2023-12-26 02:03:38,541 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.12 02:03:38" (1/1) ... [2023-12-26 02:03:38,554 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.12 02:03:38" (1/1) ... [2023-12-26 02:03:38,557 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.12 02:03:38" (1/1) ... [2023-12-26 02:03:38,559 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.12 02:03:38" (1/1) ... [2023-12-26 02:03:38,562 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.12 02:03:38" (1/1) ... [2023-12-26 02:03:38,568 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-12-26 02:03:38,569 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-12-26 02:03:38,569 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2023-12-26 02:03:38,569 INFO L274 PluginConnector]: RCFGBuilder initialized [2023-12-26 02:03:38,570 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.12 02:03:38" (1/1) ... [2023-12-26 02:03:38,574 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2023-12-26 02:03:38,584 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-12-26 02:03:38,609 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-26 02:03:38,631 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-26 02:03:38,638 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-12-26 02:03:38,638 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2023-12-26 02:03:38,638 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2023-12-26 02:03:38,638 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2023-12-26 02:03:38,638 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-12-26 02:03:38,639 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-12-26 02:03:38,825 INFO L241 CfgBuilder]: Building ICFG [2023-12-26 02:03:38,827 INFO L267 CfgBuilder]: Building CFG for each procedure with an implementation [2023-12-26 02:03:39,298 INFO L282 CfgBuilder]: Performing block encoding [2023-12-26 02:03:39,345 INFO L304 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-12-26 02:03:39,346 INFO L309 CfgBuilder]: Removed 1 assume(true) statements. [2023-12-26 02:03:39,347 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 26.12 02:03:39 BoogieIcfgContainer [2023-12-26 02:03:39,347 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-12-26 02:03:39,350 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-12-26 02:03:39,350 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2023-12-26 02:03:39,352 INFO L274 PluginConnector]: TraceAbstraction initialized [2023-12-26 02:03:39,353 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 26.12 02:03:38" (1/3) ... [2023-12-26 02:03:39,353 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@59db105c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 26.12 02:03:39, skipping insertion in model container [2023-12-26 02:03:39,353 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.12 02:03:38" (2/3) ... [2023-12-26 02:03:39,354 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@59db105c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 26.12 02:03:39, skipping insertion in model container [2023-12-26 02:03:39,354 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 26.12 02:03:39" (3/3) ... [2023-12-26 02:03:39,355 INFO L112 eAbstractionObserver]: Analyzing ICFG btor2c-lazyMod.safe_intersymbol_analog_estimation_convergence.c [2023-12-26 02:03:39,366 INFO L204 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-12-26 02:03:39,367 INFO L163 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2023-12-26 02:03:39,406 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-12-26 02:03:39,412 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;@7f351057, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2023-12-26 02:03:39,412 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2023-12-26 02:03:39,415 INFO L276 IsEmpty]: Start isEmpty. Operand has 32 states, 27 states have (on average 1.4814814814814814) internal successors, (40), 28 states have internal predecessors, (40), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2023-12-26 02:03:39,422 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2023-12-26 02:03:39,422 INFO L187 NwaCegarLoop]: Found error trace [2023-12-26 02:03:39,423 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-26 02:03:39,424 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-26 02:03:39,428 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-26 02:03:39,429 INFO L85 PathProgramCache]: Analyzing trace with hash 2003916049, now seen corresponding path program 1 times [2023-12-26 02:03:39,434 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-26 02:03:39,435 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2126057192] [2023-12-26 02:03:39,435 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-26 02:03:39,436 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-26 02:03:39,545 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-26 02:03:39,662 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-12-26 02:03:39,664 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-26 02:03:39,668 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2023-12-26 02:03:39,672 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-26 02:03:39,674 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2023-12-26 02:03:39,675 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-26 02:03:39,675 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2126057192] [2023-12-26 02:03:39,675 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2126057192] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-26 02:03:39,675 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-26 02:03:39,676 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-12-26 02:03:39,677 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1119467512] [2023-12-26 02:03:39,677 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-26 02:03:39,680 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2023-12-26 02:03:39,680 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-26 02:03:39,703 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2023-12-26 02:03:39,704 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2023-12-26 02:03:39,705 INFO L87 Difference]: Start difference. First operand has 32 states, 27 states have (on average 1.4814814814814814) internal successors, (40), 28 states have internal predecessors, (40), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Second operand has 2 states, 2 states have (on average 4.5) internal successors, (9), 2 states have internal predecessors, (9), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) [2023-12-26 02:03:39,727 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-26 02:03:39,727 INFO L93 Difference]: Finished difference Result 61 states and 88 transitions. [2023-12-26 02:03:39,728 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-12-26 02:03:39,729 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 4.5) internal successors, (9), 2 states have internal predecessors, (9), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) Word has length 16 [2023-12-26 02:03:39,730 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-26 02:03:39,733 INFO L225 Difference]: With dead ends: 61 [2023-12-26 02:03:39,733 INFO L226 Difference]: Without dead ends: 30 [2023-12-26 02:03:39,735 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 8 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-26 02:03:39,739 INFO L413 NwaCegarLoop]: 38 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 1 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 38 SdHoareTripleChecker+Invalid, 1 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 1 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-12-26 02:03:39,740 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 38 Invalid, 1 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 1 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-12-26 02:03:39,754 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30 states. [2023-12-26 02:03:39,767 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30 to 30. [2023-12-26 02:03:39,768 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 30 states, 26 states have (on average 1.3461538461538463) internal successors, (35), 26 states have internal predecessors, (35), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2023-12-26 02:03:39,769 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 39 transitions. [2023-12-26 02:03:39,770 INFO L78 Accepts]: Start accepts. Automaton has 30 states and 39 transitions. Word has length 16 [2023-12-26 02:03:39,770 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-26 02:03:39,770 INFO L495 AbstractCegarLoop]: Abstraction has 30 states and 39 transitions. [2023-12-26 02:03:39,770 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 4.5) internal successors, (9), 2 states have internal predecessors, (9), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) [2023-12-26 02:03:39,770 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 39 transitions. [2023-12-26 02:03:39,771 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2023-12-26 02:03:39,771 INFO L187 NwaCegarLoop]: Found error trace [2023-12-26 02:03:39,771 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-26 02:03:39,771 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2023-12-26 02:03:39,771 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-26 02:03:39,772 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-26 02:03:39,772 INFO L85 PathProgramCache]: Analyzing trace with hash -1975627507, now seen corresponding path program 1 times [2023-12-26 02:03:39,772 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-26 02:03:39,772 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [115142965] [2023-12-26 02:03:39,772 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-26 02:03:39,772 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-26 02:03:40,016 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-12-26 02:03:40,017 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-12-26 02:03:40,125 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-12-26 02:03:40,182 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-12-26 02:03:40,182 INFO L360 BasicCegarLoop]: Counterexample is feasible [2023-12-26 02:03:40,183 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2023-12-26 02:03:40,185 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2023-12-26 02:03:40,188 INFO L445 BasicCegarLoop]: Path program histogram: [1, 1] [2023-12-26 02:03:40,190 INFO L179 ceAbstractionStarter]: Computing trace abstraction results [2023-12-26 02:03:40,248 WARN L320 BoogieBacktranslator]: Removing null node from list of ATEs: ATE program state null [2023-12-26 02:03:40,261 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 26.12 02:03:40 BoogieIcfgContainer [2023-12-26 02:03:40,262 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2023-12-26 02:03:40,262 INFO L158 Benchmark]: Toolchain (without parser) took 2219.57ms. Allocated memory was 202.4MB in the beginning and 243.3MB in the end (delta: 40.9MB). Free memory was 141.8MB in the beginning and 195.0MB in the end (delta: -53.2MB). Peak memory consumption was 96.8MB. Max. memory is 8.0GB. [2023-12-26 02:03:40,262 INFO L158 Benchmark]: CDTParser took 0.10ms. Allocated memory is still 202.4MB. Free memory is still 152.3MB. There was no memory consumed. Max. memory is 8.0GB. [2023-12-26 02:03:40,263 INFO L158 Benchmark]: CACSL2BoogieTranslator took 372.17ms. Allocated memory was 202.4MB in the beginning and 243.3MB in the end (delta: 40.9MB). Free memory was 141.8MB in the beginning and 202.9MB in the end (delta: -61.1MB). Peak memory consumption was 39.1MB. Max. memory is 8.0GB. [2023-12-26 02:03:40,263 INFO L158 Benchmark]: Boogie Procedure Inliner took 81.87ms. Allocated memory is still 243.3MB. Free memory was 202.9MB in the beginning and 194.5MB in the end (delta: 8.4MB). Peak memory consumption was 8.4MB. Max. memory is 8.0GB. [2023-12-26 02:03:40,263 INFO L158 Benchmark]: Boogie Preprocessor took 69.90ms. Allocated memory is still 243.3MB. Free memory was 194.5MB in the beginning and 187.2MB in the end (delta: 7.3MB). Peak memory consumption was 7.3MB. Max. memory is 8.0GB. [2023-12-26 02:03:40,264 INFO L158 Benchmark]: RCFGBuilder took 778.19ms. Allocated memory is still 243.3MB. Free memory was 186.7MB in the beginning and 189.3MB in the end (delta: -2.6MB). Peak memory consumption was 77.1MB. Max. memory is 8.0GB. [2023-12-26 02:03:40,264 INFO L158 Benchmark]: TraceAbstraction took 911.80ms. Allocated memory is still 243.3MB. Free memory was 188.8MB in the beginning and 195.0MB in the end (delta: -6.2MB). Peak memory consumption was 102.2MB. Max. memory is 8.0GB. [2023-12-26 02:03:40,266 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 202.4MB. Free memory is still 152.3MB. There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 372.17ms. Allocated memory was 202.4MB in the beginning and 243.3MB in the end (delta: 40.9MB). Free memory was 141.8MB in the beginning and 202.9MB in the end (delta: -61.1MB). Peak memory consumption was 39.1MB. Max. memory is 8.0GB. * Boogie Procedure Inliner took 81.87ms. Allocated memory is still 243.3MB. Free memory was 202.9MB in the beginning and 194.5MB in the end (delta: 8.4MB). Peak memory consumption was 8.4MB. Max. memory is 8.0GB. * Boogie Preprocessor took 69.90ms. Allocated memory is still 243.3MB. Free memory was 194.5MB in the beginning and 187.2MB in the end (delta: 7.3MB). Peak memory consumption was 7.3MB. Max. memory is 8.0GB. * RCFGBuilder took 778.19ms. Allocated memory is still 243.3MB. Free memory was 186.7MB in the beginning and 189.3MB in the end (delta: -2.6MB). Peak memory consumption was 77.1MB. Max. memory is 8.0GB. * TraceAbstraction took 911.80ms. Allocated memory is still 243.3MB. Free memory was 188.8MB in the beginning and 195.0MB in the end (delta: -6.2MB). Peak memory consumption was 102.2MB. Max. memory is 8.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - UnprovableResult [Line: 21]: 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 bitwise operation at line 193. Possible FailurePath: [L26] EXPR (SORT_1)-1 >> (sizeof(SORT_1) * 8 - 1) [L26] const SORT_1 mask_SORT_1 = (SORT_1)-1 >> (sizeof(SORT_1) * 8 - 1); [L27] EXPR (SORT_1)1 << (1 - 1) [L27] const SORT_1 msb_SORT_1 = (SORT_1)1 << (1 - 1); [L29] const SORT_9 mask_SORT_9 = (SORT_9)-1 >> (sizeof(SORT_9) * 8 - 31); [L30] const SORT_9 msb_SORT_9 = (SORT_9)1 << (31 - 1); [L32] EXPR (SORT_11)-1 >> (sizeof(SORT_11) * 8 - 16) [L32] const SORT_11 mask_SORT_11 = (SORT_11)-1 >> (sizeof(SORT_11) * 8 - 16); [L33] EXPR (SORT_11)1 << (16 - 1) [L33] const SORT_11 msb_SORT_11 = (SORT_11)1 << (16 - 1); [L35] EXPR (SORT_12)-1 >> (sizeof(SORT_12) * 8 - 3) [L35] const SORT_12 mask_SORT_12 = (SORT_12)-1 >> (sizeof(SORT_12) * 8 - 3); [L36] EXPR (SORT_12)1 << (3 - 1) [L36] const SORT_12 msb_SORT_12 = (SORT_12)1 << (3 - 1); [L38] EXPR (SORT_15)-1 >> (sizeof(SORT_15) * 8 - 4) [L38] const SORT_15 mask_SORT_15 = (SORT_15)-1 >> (sizeof(SORT_15) * 8 - 4); [L39] EXPR (SORT_15)1 << (4 - 1) [L39] const SORT_15 msb_SORT_15 = (SORT_15)1 << (4 - 1); [L41] EXPR (SORT_17)-1 >> (sizeof(SORT_17) * 8 - 5) [L41] const SORT_17 mask_SORT_17 = (SORT_17)-1 >> (sizeof(SORT_17) * 8 - 5); [L42] EXPR (SORT_17)1 << (5 - 1) [L42] const SORT_17 msb_SORT_17 = (SORT_17)1 << (5 - 1); [L44] EXPR (SORT_19)-1 >> (sizeof(SORT_19) * 8 - 6) [L44] const SORT_19 mask_SORT_19 = (SORT_19)-1 >> (sizeof(SORT_19) * 8 - 6); [L45] EXPR (SORT_19)1 << (6 - 1) [L45] const SORT_19 msb_SORT_19 = (SORT_19)1 << (6 - 1); [L47] EXPR (SORT_21)-1 >> (sizeof(SORT_21) * 8 - 7) [L47] const SORT_21 mask_SORT_21 = (SORT_21)-1 >> (sizeof(SORT_21) * 8 - 7); [L48] EXPR (SORT_21)1 << (7 - 1) [L48] const SORT_21 msb_SORT_21 = (SORT_21)1 << (7 - 1); [L50] EXPR (SORT_23)-1 >> (sizeof(SORT_23) * 8 - 8) [L50] const SORT_23 mask_SORT_23 = (SORT_23)-1 >> (sizeof(SORT_23) * 8 - 8); [L51] EXPR (SORT_23)1 << (8 - 1) [L51] const SORT_23 msb_SORT_23 = (SORT_23)1 << (8 - 1); [L53] EXPR (SORT_25)-1 >> (sizeof(SORT_25) * 8 - 9) [L53] const SORT_25 mask_SORT_25 = (SORT_25)-1 >> (sizeof(SORT_25) * 8 - 9); [L54] EXPR (SORT_25)1 << (9 - 1) [L54] const SORT_25 msb_SORT_25 = (SORT_25)1 << (9 - 1); [L56] EXPR (SORT_27)-1 >> (sizeof(SORT_27) * 8 - 10) [L56] const SORT_27 mask_SORT_27 = (SORT_27)-1 >> (sizeof(SORT_27) * 8 - 10); [L57] EXPR (SORT_27)1 << (10 - 1) [L57] const SORT_27 msb_SORT_27 = (SORT_27)1 << (10 - 1); [L59] EXPR (SORT_29)-1 >> (sizeof(SORT_29) * 8 - 11) [L59] const SORT_29 mask_SORT_29 = (SORT_29)-1 >> (sizeof(SORT_29) * 8 - 11); [L60] EXPR (SORT_29)1 << (11 - 1) [L60] const SORT_29 msb_SORT_29 = (SORT_29)1 << (11 - 1); [L62] EXPR (SORT_31)-1 >> (sizeof(SORT_31) * 8 - 12) [L62] const SORT_31 mask_SORT_31 = (SORT_31)-1 >> (sizeof(SORT_31) * 8 - 12); [L63] EXPR (SORT_31)1 << (12 - 1) [L63] const SORT_31 msb_SORT_31 = (SORT_31)1 << (12 - 1); [L65] EXPR (SORT_33)-1 >> (sizeof(SORT_33) * 8 - 13) [L65] const SORT_33 mask_SORT_33 = (SORT_33)-1 >> (sizeof(SORT_33) * 8 - 13); [L66] EXPR (SORT_33)1 << (13 - 1) [L66] const SORT_33 msb_SORT_33 = (SORT_33)1 << (13 - 1); [L68] EXPR (SORT_35)-1 >> (sizeof(SORT_35) * 8 - 14) [L68] const SORT_35 mask_SORT_35 = (SORT_35)-1 >> (sizeof(SORT_35) * 8 - 14); [L69] EXPR (SORT_35)1 << (14 - 1) [L69] const SORT_35 msb_SORT_35 = (SORT_35)1 << (14 - 1); [L71] EXPR (SORT_37)-1 >> (sizeof(SORT_37) * 8 - 15) [L71] const SORT_37 mask_SORT_37 = (SORT_37)-1 >> (sizeof(SORT_37) * 8 - 15); [L72] EXPR (SORT_37)1 << (15 - 1) [L72] const SORT_37 msb_SORT_37 = (SORT_37)1 << (15 - 1); [L74] const SORT_62 mask_SORT_62 = (SORT_62)-1 >> (sizeof(SORT_62) * 8 - 32); [L75] const SORT_62 msb_SORT_62 = (SORT_62)1 << (32 - 1); [L77] const SORT_65 mask_SORT_65 = (SORT_65)-1 >> (sizeof(SORT_65) * 8 - 17); [L78] const SORT_65 msb_SORT_65 = (SORT_65)1 << (17 - 1); [L80] const SORT_68 mask_SORT_68 = (SORT_68)-1 >> (sizeof(SORT_68) * 8 - 18); [L81] const SORT_68 msb_SORT_68 = (SORT_68)1 << (18 - 1); [L83] const SORT_71 mask_SORT_71 = (SORT_71)-1 >> (sizeof(SORT_71) * 8 - 19); [L84] const SORT_71 msb_SORT_71 = (SORT_71)1 << (19 - 1); [L86] const SORT_74 mask_SORT_74 = (SORT_74)-1 >> (sizeof(SORT_74) * 8 - 20); [L87] const SORT_74 msb_SORT_74 = (SORT_74)1 << (20 - 1); [L89] const SORT_77 mask_SORT_77 = (SORT_77)-1 >> (sizeof(SORT_77) * 8 - 21); [L90] const SORT_77 msb_SORT_77 = (SORT_77)1 << (21 - 1); [L92] const SORT_80 mask_SORT_80 = (SORT_80)-1 >> (sizeof(SORT_80) * 8 - 22); [L93] const SORT_80 msb_SORT_80 = (SORT_80)1 << (22 - 1); [L95] const SORT_83 mask_SORT_83 = (SORT_83)-1 >> (sizeof(SORT_83) * 8 - 23); [L96] const SORT_83 msb_SORT_83 = (SORT_83)1 << (23 - 1); [L98] const SORT_86 mask_SORT_86 = (SORT_86)-1 >> (sizeof(SORT_86) * 8 - 24); [L99] const SORT_86 msb_SORT_86 = (SORT_86)1 << (24 - 1); [L101] const SORT_89 mask_SORT_89 = (SORT_89)-1 >> (sizeof(SORT_89) * 8 - 25); [L102] const SORT_89 msb_SORT_89 = (SORT_89)1 << (25 - 1); [L104] const SORT_92 mask_SORT_92 = (SORT_92)-1 >> (sizeof(SORT_92) * 8 - 26); [L105] const SORT_92 msb_SORT_92 = (SORT_92)1 << (26 - 1); [L107] const SORT_95 mask_SORT_95 = (SORT_95)-1 >> (sizeof(SORT_95) * 8 - 27); [L108] const SORT_95 msb_SORT_95 = (SORT_95)1 << (27 - 1); [L110] const SORT_98 mask_SORT_98 = (SORT_98)-1 >> (sizeof(SORT_98) * 8 - 28); [L111] const SORT_98 msb_SORT_98 = (SORT_98)1 << (28 - 1); [L113] const SORT_101 mask_SORT_101 = (SORT_101)-1 >> (sizeof(SORT_101) * 8 - 29); [L114] const SORT_101 msb_SORT_101 = (SORT_101)1 << (29 - 1); [L116] const SORT_104 mask_SORT_104 = (SORT_104)-1 >> (sizeof(SORT_104) * 8 - 30); [L117] const SORT_104 msb_SORT_104 = (SORT_104)1 << (30 - 1); [L119] EXPR (SORT_153)-1 >> (sizeof(SORT_153) * 8 - 2) [L119] const SORT_153 mask_SORT_153 = (SORT_153)-1 >> (sizeof(SORT_153) * 8 - 2); [L120] EXPR (SORT_153)1 << (2 - 1) [L120] const SORT_153 msb_SORT_153 = (SORT_153)1 << (2 - 1); [L122] const SORT_1 var_7 = 0; [L123] const SORT_1 var_8 = 1; [L124] const SORT_9 var_10 = 0; [L125] const SORT_12 var_13 = 4; [L126] const SORT_12 var_114 = 5; [L127] const SORT_11 var_116 = 0; [L128] const SORT_11 var_150 = 64; [L129] const SORT_153 var_154 = 1; [L130] const SORT_23 var_189 = 127; [L131] const SORT_11 var_197 = 1; [L132] const SORT_11 var_199 = 127; [L133] const SORT_12 var_247 = 6; [L134] const SORT_15 var_251 = 9; [L135] const SORT_21 var_269 = 64; [L136] const SORT_12 var_282 = 0; [L137] const SORT_15 var_285 = 0; [L139] SORT_1 input_2; [L140] SORT_1 input_3; [L141] SORT_1 input_4; [L143] EXPR __VERIFIER_nondet_uchar() & mask_SORT_1 [L143] SORT_1 state_5 = __VERIFIER_nondet_uchar() & mask_SORT_1; [L144] EXPR __VERIFIER_nondet_uchar() & mask_SORT_1 [L144] SORT_1 state_40 = __VERIFIER_nondet_uchar() & mask_SORT_1; [L145] EXPR __VERIFIER_nondet_ushort() & mask_SORT_11 [L145] SORT_11 state_56 = __VERIFIER_nondet_ushort() & mask_SORT_11; [L146] EXPR __VERIFIER_nondet_uchar() & mask_SORT_1 [L146] SORT_1 state_58 = __VERIFIER_nondet_uchar() & mask_SORT_1; [L147] EXPR __VERIFIER_nondet_ushort() & mask_SORT_11 [L147] SORT_11 state_117 = __VERIFIER_nondet_ushort() & mask_SORT_11; [L148] EXPR __VERIFIER_nondet_uchar() & mask_SORT_15 [L148] SORT_15 state_137 = __VERIFIER_nondet_uchar() & mask_SORT_15; [L149] EXPR __VERIFIER_nondet_uchar() & mask_SORT_15 [L149] SORT_15 state_140 = __VERIFIER_nondet_uchar() & mask_SORT_15; [L150] EXPR __VERIFIER_nondet_ushort() & mask_SORT_11 [L150] SORT_11 state_144 = __VERIFIER_nondet_ushort() & mask_SORT_11; [L152] SORT_11 init_118_arg_1 = var_116; [L153] state_117 = init_118_arg_1 VAL [init_118_arg_1=0, mask_SORT_11=0, mask_SORT_12=0, mask_SORT_153=0, mask_SORT_15=0, mask_SORT_17=0, mask_SORT_19=0, mask_SORT_1=0, mask_SORT_21=0, mask_SORT_23=0, mask_SORT_25=0, mask_SORT_27=0, mask_SORT_29=0, mask_SORT_31=0, mask_SORT_33=0, mask_SORT_35=0, mask_SORT_37=0, msb_SORT_11=0, msb_SORT_12=0, msb_SORT_153=0, msb_SORT_15=0, msb_SORT_17=0, msb_SORT_19=0, msb_SORT_1=0, msb_SORT_21=0, msb_SORT_23=0, msb_SORT_25=0, msb_SORT_27=0, msb_SORT_29=0, msb_SORT_31=0, msb_SORT_33=0, msb_SORT_35=0, msb_SORT_37=0, state_117=0, state_137=0, state_140=0, state_144=0, state_40=0, state_56=0, state_58=255, state_5=0, var_10=0, var_114=5, var_116=0, var_13=4, var_150=64, var_154=1, var_189=127, var_197=1, var_199=127, var_247=6, var_251=9, var_269=64, var_282=0, var_285=0, var_7=0, var_8=1] [L156] input_2 = __VERIFIER_nondet_uchar() [L157] input_3 = __VERIFIER_nondet_uchar() [L158] EXPR input_3 & mask_SORT_1 [L158] input_3 = input_3 & mask_SORT_1 [L159] input_4 = __VERIFIER_nondet_uchar() [L160] EXPR input_4 & mask_SORT_1 [L160] input_4 = input_4 & mask_SORT_1 [L162] SORT_1 var_125_arg_0 = state_5; [L163] SORT_1 var_125 = ~var_125_arg_0; [L164] SORT_1 var_126_arg_0 = var_125; [L165] SORT_1 var_126 = ~var_126_arg_0; [L166] SORT_1 var_127_arg_0 = state_5; [L167] SORT_1 var_127_arg_1 = var_126; [L168] EXPR var_127_arg_0 | var_127_arg_1 [L168] SORT_1 var_127 = var_127_arg_0 | var_127_arg_1; [L169] EXPR var_127 & mask_SORT_1 [L169] var_127 = var_127 & mask_SORT_1 [L170] SORT_1 constr_128_arg_0 = var_127; VAL [constr_128_arg_0=255, init_118_arg_1=0, input_3=0, input_4=253, mask_SORT_11=0, mask_SORT_12=0, mask_SORT_153=0, mask_SORT_15=0, mask_SORT_17=0, mask_SORT_19=0, mask_SORT_1=0, mask_SORT_21=0, mask_SORT_23=0, mask_SORT_25=0, mask_SORT_27=0, mask_SORT_29=0, mask_SORT_31=0, mask_SORT_33=0, mask_SORT_35=0, mask_SORT_37=0, msb_SORT_11=0, msb_SORT_12=0, msb_SORT_153=0, msb_SORT_15=0, msb_SORT_17=0, msb_SORT_19=0, msb_SORT_1=0, msb_SORT_21=0, msb_SORT_23=0, msb_SORT_25=0, msb_SORT_27=0, msb_SORT_29=0, msb_SORT_31=0, msb_SORT_33=0, msb_SORT_35=0, msb_SORT_37=0, state_117=0, state_137=0, state_140=0, state_144=0, state_40=0, state_56=0, state_58=255, state_5=0, var_10=0, var_114=5, var_116=0, var_125=255, var_125_arg_0=0, var_126=0, var_126_arg_0=255, var_127=255, var_127_arg_0=0, var_127_arg_1=0, var_13=4, var_150=64, var_154=1, var_189=127, var_197=1, var_199=127, var_247=6, var_251=9, var_269=64, var_282=0, var_285=0, var_7=0, var_8=1] [L171] CALL assume_abort_if_not(constr_128_arg_0) VAL [\old(cond)=255] [L22] COND FALSE !(!cond) VAL [\old(cond)=255, cond=255] [L171] RET assume_abort_if_not(constr_128_arg_0) VAL [constr_128_arg_0=255, init_118_arg_1=0, input_3=0, input_4=253, mask_SORT_11=0, mask_SORT_12=0, mask_SORT_153=0, mask_SORT_15=0, mask_SORT_17=0, mask_SORT_19=0, mask_SORT_1=0, mask_SORT_21=0, mask_SORT_23=0, mask_SORT_25=0, mask_SORT_27=0, mask_SORT_29=0, mask_SORT_31=0, mask_SORT_33=0, mask_SORT_35=0, mask_SORT_37=0, msb_SORT_11=0, msb_SORT_12=0, msb_SORT_153=0, msb_SORT_15=0, msb_SORT_17=0, msb_SORT_19=0, msb_SORT_1=0, msb_SORT_21=0, msb_SORT_23=0, msb_SORT_25=0, msb_SORT_27=0, msb_SORT_29=0, msb_SORT_31=0, msb_SORT_33=0, msb_SORT_35=0, msb_SORT_37=0, state_117=0, state_137=0, state_140=0, state_144=0, state_40=0, state_56=0, state_58=255, state_5=0, var_10=0, var_114=5, var_116=0, var_125=255, var_125_arg_0=0, var_126=0, var_126_arg_0=255, var_127=255, var_127_arg_0=0, var_127_arg_1=0, var_13=4, var_150=64, var_154=1, var_189=127, var_197=1, var_199=127, var_247=6, var_251=9, var_269=64, var_282=0, var_285=0, var_7=0, var_8=1] [L172] SORT_1 var_129_arg_0 = var_8; [L173] EXPR var_129_arg_0 & mask_SORT_1 [L173] var_129_arg_0 = var_129_arg_0 & mask_SORT_1 [L174] SORT_11 var_129 = var_129_arg_0; [L175] SORT_11 var_130_arg_0 = state_117; [L176] SORT_11 var_130_arg_1 = var_129; [L177] SORT_1 var_130 = var_130_arg_0 <= var_130_arg_1; [L178] SORT_1 var_131_arg_0 = input_4; [L179] SORT_1 var_131_arg_1 = var_130; [L180] EXPR var_131_arg_0 ^ var_131_arg_1 [L180] SORT_1 var_131 = var_131_arg_0 ^ var_131_arg_1; [L181] SORT_1 var_132_arg_0 = var_131; [L182] SORT_1 var_132 = ~var_132_arg_0; [L183] SORT_1 var_133_arg_0 = var_131; [L184] SORT_1 var_133 = ~var_133_arg_0; [L185] SORT_1 var_134_arg_0 = var_132; [L186] SORT_1 var_134_arg_1 = var_133; [L187] EXPR var_134_arg_0 | var_134_arg_1 [L187] SORT_1 var_134 = var_134_arg_0 | var_134_arg_1; [L188] EXPR var_134 & mask_SORT_1 [L188] var_134 = var_134 & mask_SORT_1 [L189] SORT_1 constr_135_arg_0 = var_134; VAL [constr_128_arg_0=255, constr_135_arg_0=255, init_118_arg_1=0, input_3=0, input_4=253, mask_SORT_11=0, mask_SORT_12=0, mask_SORT_153=0, mask_SORT_15=0, mask_SORT_17=0, mask_SORT_19=0, mask_SORT_1=0, mask_SORT_21=0, mask_SORT_23=0, mask_SORT_25=0, mask_SORT_27=0, mask_SORT_29=0, mask_SORT_31=0, mask_SORT_33=0, mask_SORT_35=0, mask_SORT_37=0, msb_SORT_11=0, msb_SORT_12=0, msb_SORT_153=0, msb_SORT_15=0, msb_SORT_17=0, msb_SORT_19=0, msb_SORT_1=0, msb_SORT_21=0, msb_SORT_23=0, msb_SORT_25=0, msb_SORT_27=0, msb_SORT_29=0, msb_SORT_31=0, msb_SORT_33=0, msb_SORT_35=0, msb_SORT_37=0, state_117=0, state_137=0, state_140=0, state_144=0, state_40=0, state_56=0, state_58=255, state_5=0, var_10=0, var_114=5, var_116=0, var_125=255, var_125_arg_0=0, var_126=0, var_126_arg_0=255, var_127=255, var_127_arg_0=0, var_127_arg_1=0, var_129=0, var_129_arg_0=0, var_130=1, var_130_arg_0=0, var_130_arg_1=0, var_131=0, var_131_arg_0=253, var_131_arg_1=1, var_132=255, var_132_arg_0=0, var_133=255, var_133_arg_0=0, var_134=255, var_134_arg_0=255, var_134_arg_1=255, var_13=4, var_150=64, var_154=1, var_189=127, var_197=1, var_199=127, var_247=6, var_251=9, var_269=64, var_282=0, var_285=0, var_7=0, var_8=1] [L190] CALL assume_abort_if_not(constr_135_arg_0) VAL [\old(cond)=255] [L22] COND FALSE !(!cond) VAL [\old(cond)=255, cond=255] [L190] RET assume_abort_if_not(constr_135_arg_0) VAL [constr_128_arg_0=255, constr_135_arg_0=255, init_118_arg_1=0, input_3=0, input_4=253, mask_SORT_11=0, mask_SORT_12=0, mask_SORT_153=0, mask_SORT_15=0, mask_SORT_17=0, mask_SORT_19=0, mask_SORT_1=0, mask_SORT_21=0, mask_SORT_23=0, mask_SORT_25=0, mask_SORT_27=0, mask_SORT_29=0, mask_SORT_31=0, mask_SORT_33=0, mask_SORT_35=0, mask_SORT_37=0, msb_SORT_11=0, msb_SORT_12=0, msb_SORT_153=0, msb_SORT_15=0, msb_SORT_17=0, msb_SORT_19=0, msb_SORT_1=0, msb_SORT_21=0, msb_SORT_23=0, msb_SORT_25=0, msb_SORT_27=0, msb_SORT_29=0, msb_SORT_31=0, msb_SORT_33=0, msb_SORT_35=0, msb_SORT_37=0, state_117=0, state_137=0, state_140=0, state_144=0, state_40=0, state_56=0, state_58=255, state_5=0, var_10=0, var_114=5, var_116=0, var_125=255, var_125_arg_0=0, var_126=0, var_126_arg_0=255, var_127=255, var_127_arg_0=0, var_127_arg_1=0, var_129=0, var_129_arg_0=0, var_130=1, var_130_arg_0=0, var_130_arg_1=0, var_131=0, var_131_arg_0=253, var_131_arg_1=1, var_132=255, var_132_arg_0=0, var_133=255, var_133_arg_0=0, var_134=255, var_134_arg_0=255, var_134_arg_1=255, var_13=4, var_150=64, var_154=1, var_189=127, var_197=1, var_199=127, var_247=6, var_251=9, var_269=64, var_282=0, var_285=0, var_7=0, var_8=1] [L192] SORT_12 var_115_arg_0 = var_114; [L193] EXPR var_115_arg_0 & mask_SORT_12 [L193] var_115_arg_0 = var_115_arg_0 & mask_SORT_12 [L194] SORT_11 var_115 = var_115_arg_0; [L195] SORT_11 var_119_arg_0 = var_115; [L196] SORT_11 var_119_arg_1 = state_117; [L197] SORT_1 var_119 = var_119_arg_0 < var_119_arg_1; [L198] SORT_1 var_14_arg_0 = input_3; [L199] SORT_1 var_14 = ~var_14_arg_0; [L200] SORT_1 var_16_arg_0 = var_14; [L201] SORT_12 var_16_arg_1 = var_13; [L202] EXPR (SORT_15)var_16_arg_0 << 3 [L202] EXPR ((SORT_15)var_16_arg_0 << 3) | var_16_arg_1 [L202] SORT_15 var_16 = ((SORT_15)var_16_arg_0 << 3) | var_16_arg_1; [L203] EXPR var_16 & mask_SORT_15 [L203] var_16 = var_16 & mask_SORT_15 [L204] SORT_1 var_18_arg_0 = input_3; [L205] SORT_15 var_18_arg_1 = var_16; [L206] EXPR (SORT_17)var_18_arg_0 << 4 [L206] EXPR ((SORT_17)var_18_arg_0 << 4) | var_18_arg_1 [L206] SORT_17 var_18 = ((SORT_17)var_18_arg_0 << 4) | var_18_arg_1; [L207] EXPR var_18 & mask_SORT_17 [L207] var_18 = var_18 & mask_SORT_17 [L208] SORT_1 var_20_arg_0 = input_3; [L209] SORT_17 var_20_arg_1 = var_18; [L210] EXPR (SORT_19)var_20_arg_0 << 5 [L210] EXPR ((SORT_19)var_20_arg_0 << 5) | var_20_arg_1 [L210] SORT_19 var_20 = ((SORT_19)var_20_arg_0 << 5) | var_20_arg_1; [L211] EXPR var_20 & mask_SORT_19 [L211] var_20 = var_20 & mask_SORT_19 [L212] SORT_1 var_22_arg_0 = input_3; [L213] SORT_19 var_22_arg_1 = var_20; [L214] EXPR (SORT_21)var_22_arg_0 << 6 [L214] EXPR ((SORT_21)var_22_arg_0 << 6) | var_22_arg_1 [L214] SORT_21 var_22 = ((SORT_21)var_22_arg_0 << 6) | var_22_arg_1; [L215] EXPR var_22 & mask_SORT_21 [L215] var_22 = var_22 & mask_SORT_21 [L216] SORT_1 var_24_arg_0 = input_3; [L217] SORT_21 var_24_arg_1 = var_22; [L218] EXPR (SORT_23)var_24_arg_0 << 7 [L218] EXPR ((SORT_23)var_24_arg_0 << 7) | var_24_arg_1 [L218] SORT_23 var_24 = ((SORT_23)var_24_arg_0 << 7) | var_24_arg_1; [L219] EXPR var_24 & mask_SORT_23 [L219] var_24 = var_24 & mask_SORT_23 [L220] SORT_1 var_26_arg_0 = input_3; [L221] SORT_23 var_26_arg_1 = var_24; [L222] EXPR (SORT_25)var_26_arg_0 << 8 [L222] EXPR ((SORT_25)var_26_arg_0 << 8) | var_26_arg_1 [L222] SORT_25 var_26 = ((SORT_25)var_26_arg_0 << 8) | var_26_arg_1; [L223] EXPR var_26 & mask_SORT_25 [L223] var_26 = var_26 & mask_SORT_25 [L224] SORT_1 var_28_arg_0 = var_14; [L225] SORT_25 var_28_arg_1 = var_26; [L226] EXPR (SORT_27)var_28_arg_0 << 9 [L226] EXPR ((SORT_27)var_28_arg_0 << 9) | var_28_arg_1 [L226] SORT_27 var_28 = ((SORT_27)var_28_arg_0 << 9) | var_28_arg_1; [L227] EXPR var_28 & mask_SORT_27 [L227] var_28 = var_28 & mask_SORT_27 [L228] SORT_1 var_30_arg_0 = var_14; [L229] SORT_27 var_30_arg_1 = var_28; [L230] EXPR (SORT_29)var_30_arg_0 << 10 [L230] EXPR ((SORT_29)var_30_arg_0 << 10) | var_30_arg_1 [L230] SORT_29 var_30 = ((SORT_29)var_30_arg_0 << 10) | var_30_arg_1; [L231] EXPR var_30 & mask_SORT_29 [L231] var_30 = var_30 & mask_SORT_29 [L232] SORT_1 var_32_arg_0 = var_14; [L233] SORT_29 var_32_arg_1 = var_30; [L234] EXPR (SORT_31)var_32_arg_0 << 11 [L234] EXPR ((SORT_31)var_32_arg_0 << 11) | var_32_arg_1 [L234] SORT_31 var_32 = ((SORT_31)var_32_arg_0 << 11) | var_32_arg_1; [L235] EXPR var_32 & mask_SORT_31 [L235] var_32 = var_32 & mask_SORT_31 [L236] SORT_1 var_34_arg_0 = var_14; [L237] SORT_31 var_34_arg_1 = var_32; [L238] EXPR (SORT_33)var_34_arg_0 << 12 [L238] EXPR ((SORT_33)var_34_arg_0 << 12) | var_34_arg_1 [L238] SORT_33 var_34 = ((SORT_33)var_34_arg_0 << 12) | var_34_arg_1; [L239] EXPR var_34 & mask_SORT_33 [L239] var_34 = var_34 & mask_SORT_33 [L240] SORT_1 var_36_arg_0 = var_14; [L241] SORT_33 var_36_arg_1 = var_34; [L242] EXPR (SORT_35)var_36_arg_0 << 13 [L242] EXPR ((SORT_35)var_36_arg_0 << 13) | var_36_arg_1 [L242] SORT_35 var_36 = ((SORT_35)var_36_arg_0 << 13) | var_36_arg_1; [L243] EXPR var_36 & mask_SORT_35 [L243] var_36 = var_36 & mask_SORT_35 [L244] SORT_1 var_38_arg_0 = var_14; [L245] SORT_35 var_38_arg_1 = var_36; [L246] EXPR (SORT_37)var_38_arg_0 << 14 [L246] EXPR ((SORT_37)var_38_arg_0 << 14) | var_38_arg_1 [L246] SORT_37 var_38 = ((SORT_37)var_38_arg_0 << 14) | var_38_arg_1; [L247] EXPR var_38 & mask_SORT_37 [L247] var_38 = var_38 & mask_SORT_37 [L248] SORT_1 var_39_arg_0 = var_14; [L249] SORT_37 var_39_arg_1 = var_38; [L250] EXPR (SORT_11)var_39_arg_0 << 15 [L250] EXPR ((SORT_11)var_39_arg_0 << 15) | var_39_arg_1 [L250] SORT_11 var_39 = ((SORT_11)var_39_arg_0 << 15) | var_39_arg_1; [L251] SORT_1 var_41_arg_0 = state_40; [L252] SORT_1 var_41 = ~var_41_arg_0; [L253] SORT_1 var_42_arg_0 = state_40; [L254] SORT_12 var_42_arg_1 = var_13; [L255] EXPR (SORT_15)var_42_arg_0 << 3 [L255] EXPR ((SORT_15)var_42_arg_0 << 3) | var_42_arg_1 [L255] SORT_15 var_42 = ((SORT_15)var_42_arg_0 << 3) | var_42_arg_1; [L256] EXPR var_42 & mask_SORT_15 [L256] var_42 = var_42 & mask_SORT_15 [L257] SORT_1 var_43_arg_0 = var_41; [L258] SORT_15 var_43_arg_1 = var_42; [L259] EXPR (SORT_17)var_43_arg_0 << 4 [L259] EXPR ((SORT_17)var_43_arg_0 << 4) | var_43_arg_1 [L259] SORT_17 var_43 = ((SORT_17)var_43_arg_0 << 4) | var_43_arg_1; [L260] EXPR var_43 & mask_SORT_17 [L260] var_43 = var_43 & mask_SORT_17 [L261] SORT_1 var_44_arg_0 = state_40; [L262] SORT_17 var_44_arg_1 = var_43; [L263] EXPR (SORT_19)var_44_arg_0 << 5 [L263] EXPR ((SORT_19)var_44_arg_0 << 5) | var_44_arg_1 [L263] SORT_19 var_44 = ((SORT_19)var_44_arg_0 << 5) | var_44_arg_1; [L264] EXPR var_44 & mask_SORT_19 [L264] var_44 = var_44 & mask_SORT_19 [L265] SORT_1 var_45_arg_0 = var_41; [L266] SORT_19 var_45_arg_1 = var_44; [L267] EXPR (SORT_21)var_45_arg_0 << 6 [L267] EXPR ((SORT_21)var_45_arg_0 << 6) | var_45_arg_1 [L267] SORT_21 var_45 = ((SORT_21)var_45_arg_0 << 6) | var_45_arg_1; [L268] EXPR var_45 & mask_SORT_21 [L268] var_45 = var_45 & mask_SORT_21 [L269] SORT_1 var_46_arg_0 = var_41; [L270] SORT_21 var_46_arg_1 = var_45; [L271] EXPR (SORT_23)var_46_arg_0 << 7 [L271] EXPR ((SORT_23)var_46_arg_0 << 7) | var_46_arg_1 [L271] SORT_23 var_46 = ((SORT_23)var_46_arg_0 << 7) | var_46_arg_1; [L272] EXPR var_46 & mask_SORT_23 [L272] var_46 = var_46 & mask_SORT_23 [L273] SORT_1 var_47_arg_0 = state_40; [L274] SORT_23 var_47_arg_1 = var_46; [L275] EXPR (SORT_25)var_47_arg_0 << 8 [L275] EXPR ((SORT_25)var_47_arg_0 << 8) | var_47_arg_1 [L275] SORT_25 var_47 = ((SORT_25)var_47_arg_0 << 8) | var_47_arg_1; [L276] EXPR var_47 & mask_SORT_25 [L276] var_47 = var_47 & mask_SORT_25 [L277] SORT_1 var_48_arg_0 = var_41; [L278] SORT_25 var_48_arg_1 = var_47; [L279] EXPR (SORT_27)var_48_arg_0 << 9 [L279] EXPR ((SORT_27)var_48_arg_0 << 9) | var_48_arg_1 [L279] SORT_27 var_48 = ((SORT_27)var_48_arg_0 << 9) | var_48_arg_1; [L280] EXPR var_48 & mask_SORT_27 [L280] var_48 = var_48 & mask_SORT_27 [L281] SORT_1 var_49_arg_0 = var_41; [L282] SORT_27 var_49_arg_1 = var_48; [L283] EXPR (SORT_29)var_49_arg_0 << 10 [L283] EXPR ((SORT_29)var_49_arg_0 << 10) | var_49_arg_1 [L283] SORT_29 var_49 = ((SORT_29)var_49_arg_0 << 10) | var_49_arg_1; [L284] EXPR var_49 & mask_SORT_29 [L284] var_49 = var_49 & mask_SORT_29 [L285] SORT_1 var_50_arg_0 = var_41; [L286] SORT_29 var_50_arg_1 = var_49; [L287] EXPR (SORT_31)var_50_arg_0 << 11 [L287] EXPR ((SORT_31)var_50_arg_0 << 11) | var_50_arg_1 [L287] SORT_31 var_50 = ((SORT_31)var_50_arg_0 << 11) | var_50_arg_1; [L288] EXPR var_50 & mask_SORT_31 [L288] var_50 = var_50 & mask_SORT_31 [L289] SORT_1 var_51_arg_0 = var_41; [L290] SORT_31 var_51_arg_1 = var_50; [L291] EXPR (SORT_33)var_51_arg_0 << 12 [L291] EXPR ((SORT_33)var_51_arg_0 << 12) | var_51_arg_1 [L291] SORT_33 var_51 = ((SORT_33)var_51_arg_0 << 12) | var_51_arg_1; [L292] EXPR var_51 & mask_SORT_33 [L292] var_51 = var_51 & mask_SORT_33 [L293] SORT_1 var_52_arg_0 = var_41; [L294] SORT_33 var_52_arg_1 = var_51; [L295] EXPR (SORT_35)var_52_arg_0 << 13 [L295] EXPR ((SORT_35)var_52_arg_0 << 13) | var_52_arg_1 [L295] SORT_35 var_52 = ((SORT_35)var_52_arg_0 << 13) | var_52_arg_1; [L296] EXPR var_52 & mask_SORT_35 [L296] var_52 = var_52 & mask_SORT_35 [L297] SORT_1 var_53_arg_0 = var_41; [L298] SORT_35 var_53_arg_1 = var_52; [L299] EXPR (SORT_37)var_53_arg_0 << 14 [L299] EXPR ((SORT_37)var_53_arg_0 << 14) | var_53_arg_1 [L299] SORT_37 var_53 = ((SORT_37)var_53_arg_0 << 14) | var_53_arg_1; [L300] EXPR var_53 & mask_SORT_37 [L300] var_53 = var_53 & mask_SORT_37 [L301] SORT_1 var_54_arg_0 = var_41; [L302] SORT_37 var_54_arg_1 = var_53; [L303] EXPR (SORT_11)var_54_arg_0 << 15 [L303] EXPR ((SORT_11)var_54_arg_0 << 15) | var_54_arg_1 [L303] SORT_11 var_54 = ((SORT_11)var_54_arg_0 << 15) | var_54_arg_1; [L304] SORT_11 var_55_arg_0 = var_39; [L305] SORT_11 var_55_arg_1 = var_54; [L306] SORT_11 var_55 = var_55_arg_0 + var_55_arg_1; [L307] SORT_11 var_57_arg_0 = state_56; [L308] SORT_11 var_57 = -var_57_arg_0; [L309] SORT_1 var_59_arg_0 = state_58; [L310] SORT_11 var_59_arg_1 = var_57; [L311] SORT_11 var_59_arg_2 = state_56; [L312] SORT_11 var_59 = var_59_arg_0 ? var_59_arg_1 : var_59_arg_2; [L313] SORT_11 var_60_arg_0 = var_55; [L314] SORT_11 var_60_arg_1 = var_59; [L315] SORT_11 var_60 = var_60_arg_0 + var_60_arg_1; [L316] EXPR var_60 & mask_SORT_11 [L316] var_60 = var_60 & mask_SORT_11 [L317] SORT_11 var_61_arg_0 = var_60; [L318] EXPR var_61_arg_0 >> 15 [L318] SORT_1 var_61 = var_61_arg_0 >> 15; [L319] SORT_1 var_63_arg_0 = var_61; [L320] SORT_9 var_63_arg_1 = var_10; [L321] SORT_62 var_63 = ((SORT_62)var_63_arg_0 << 31) | var_63_arg_1; [L322] var_63 = var_63 & mask_SORT_62 [L323] SORT_11 var_106_arg_0 = var_60; [L324] EXPR var_106_arg_0 >> 15 [L324] SORT_1 var_106 = var_106_arg_0 >> 15; [L325] SORT_11 var_103_arg_0 = var_60; [L326] EXPR var_103_arg_0 >> 15 [L326] SORT_1 var_103 = var_103_arg_0 >> 15; [L327] SORT_11 var_100_arg_0 = var_60; [L328] EXPR var_100_arg_0 >> 15 [L328] SORT_1 var_100 = var_100_arg_0 >> 15; [L329] SORT_11 var_97_arg_0 = var_60; [L330] EXPR var_97_arg_0 >> 15 [L330] SORT_1 var_97 = var_97_arg_0 >> 15; [L331] SORT_11 var_94_arg_0 = var_60; [L332] EXPR var_94_arg_0 >> 15 [L332] SORT_1 var_94 = var_94_arg_0 >> 15; [L333] SORT_11 var_91_arg_0 = var_60; [L334] EXPR var_91_arg_0 >> 15 [L334] SORT_1 var_91 = var_91_arg_0 >> 15; [L335] SORT_11 var_88_arg_0 = var_60; [L336] EXPR var_88_arg_0 >> 15 [L336] SORT_1 var_88 = var_88_arg_0 >> 15; [L337] SORT_11 var_85_arg_0 = var_60; [L338] EXPR var_85_arg_0 >> 15 [L338] SORT_1 var_85 = var_85_arg_0 >> 15; [L339] SORT_11 var_82_arg_0 = var_60; [L340] EXPR var_82_arg_0 >> 15 [L340] SORT_1 var_82 = var_82_arg_0 >> 15; [L341] SORT_11 var_79_arg_0 = var_60; [L342] EXPR var_79_arg_0 >> 15 [L342] SORT_1 var_79 = var_79_arg_0 >> 15; [L343] SORT_11 var_76_arg_0 = var_60; [L344] EXPR var_76_arg_0 >> 15 [L344] SORT_1 var_76 = var_76_arg_0 >> 15; [L345] SORT_11 var_73_arg_0 = var_60; [L346] EXPR var_73_arg_0 >> 15 [L346] SORT_1 var_73 = var_73_arg_0 >> 15; [L347] SORT_11 var_70_arg_0 = var_60; [L348] EXPR var_70_arg_0 >> 15 [L348] SORT_1 var_70 = var_70_arg_0 >> 15; [L349] SORT_11 var_67_arg_0 = var_60; [L350] EXPR var_67_arg_0 >> 15 [L350] SORT_1 var_67 = var_67_arg_0 >> 15; [L351] SORT_11 var_64_arg_0 = var_60; [L352] EXPR var_64_arg_0 >> 15 [L352] SORT_1 var_64 = var_64_arg_0 >> 15; [L353] SORT_1 var_66_arg_0 = var_64; [L354] SORT_11 var_66_arg_1 = var_60; [L355] SORT_65 var_66 = ((SORT_65)var_66_arg_0 << 16) | var_66_arg_1; [L356] var_66 = var_66 & mask_SORT_65 [L357] SORT_1 var_69_arg_0 = var_67; [L358] SORT_65 var_69_arg_1 = var_66; [L359] SORT_68 var_69 = ((SORT_68)var_69_arg_0 << 17) | var_69_arg_1; [L360] var_69 = var_69 & mask_SORT_68 [L361] SORT_1 var_72_arg_0 = var_70; [L362] SORT_68 var_72_arg_1 = var_69; [L363] SORT_71 var_72 = ((SORT_71)var_72_arg_0 << 18) | var_72_arg_1; [L364] var_72 = var_72 & mask_SORT_71 [L365] SORT_1 var_75_arg_0 = var_73; [L366] SORT_71 var_75_arg_1 = var_72; [L367] SORT_74 var_75 = ((SORT_74)var_75_arg_0 << 19) | var_75_arg_1; [L368] var_75 = var_75 & mask_SORT_74 [L369] SORT_1 var_78_arg_0 = var_76; [L370] SORT_74 var_78_arg_1 = var_75; [L371] SORT_77 var_78 = ((SORT_77)var_78_arg_0 << 20) | var_78_arg_1; [L372] var_78 = var_78 & mask_SORT_77 [L373] SORT_1 var_81_arg_0 = var_79; [L374] SORT_77 var_81_arg_1 = var_78; [L375] SORT_80 var_81 = ((SORT_80)var_81_arg_0 << 21) | var_81_arg_1; [L376] var_81 = var_81 & mask_SORT_80 [L377] SORT_1 var_84_arg_0 = var_82; [L378] SORT_80 var_84_arg_1 = var_81; [L379] SORT_83 var_84 = ((SORT_83)var_84_arg_0 << 22) | var_84_arg_1; [L380] var_84 = var_84 & mask_SORT_83 [L381] SORT_1 var_87_arg_0 = var_85; [L382] SORT_83 var_87_arg_1 = var_84; [L383] SORT_86 var_87 = ((SORT_86)var_87_arg_0 << 23) | var_87_arg_1; [L384] var_87 = var_87 & mask_SORT_86 [L385] SORT_1 var_90_arg_0 = var_88; [L386] SORT_86 var_90_arg_1 = var_87; [L387] SORT_89 var_90 = ((SORT_89)var_90_arg_0 << 24) | var_90_arg_1; [L388] var_90 = var_90 & mask_SORT_89 [L389] SORT_1 var_93_arg_0 = var_91; [L390] SORT_89 var_93_arg_1 = var_90; [L391] SORT_92 var_93 = ((SORT_92)var_93_arg_0 << 25) | var_93_arg_1; [L392] var_93 = var_93 & mask_SORT_92 [L393] SORT_1 var_96_arg_0 = var_94; [L394] SORT_92 var_96_arg_1 = var_93; [L395] SORT_95 var_96 = ((SORT_95)var_96_arg_0 << 26) | var_96_arg_1; [L396] var_96 = var_96 & mask_SORT_95 [L397] SORT_1 var_99_arg_0 = var_97; [L398] SORT_95 var_99_arg_1 = var_96; [L399] SORT_98 var_99 = ((SORT_98)var_99_arg_0 << 27) | var_99_arg_1; [L400] var_99 = var_99 & mask_SORT_98 [L401] SORT_1 var_102_arg_0 = var_100; [L402] SORT_98 var_102_arg_1 = var_99; [L403] SORT_101 var_102 = ((SORT_101)var_102_arg_0 << 28) | var_102_arg_1; [L404] var_102 = var_102 & mask_SORT_101 [L405] SORT_1 var_105_arg_0 = var_103; [L406] SORT_101 var_105_arg_1 = var_102; [L407] SORT_104 var_105 = ((SORT_104)var_105_arg_0 << 29) | var_105_arg_1; [L408] var_105 = var_105 & mask_SORT_104 [L409] SORT_1 var_107_arg_0 = var_106; [L410] SORT_104 var_107_arg_1 = var_105; [L411] SORT_9 var_107 = ((SORT_9)var_107_arg_0 << 30) | var_107_arg_1; [L412] SORT_9 var_108_arg_0 = var_107; [L413] var_108_arg_0 = var_108_arg_0 & mask_SORT_9 [L414] SORT_62 var_108 = var_108_arg_0; [L415] SORT_62 var_109_arg_0 = var_63; [L416] SORT_62 var_109_arg_1 = var_108; [L417] SORT_1 var_109 = var_109_arg_0 <= var_109_arg_1; [L418] SORT_1 var_110_arg_0 = var_109; [L419] SORT_1 var_110_arg_1 = var_8; [L420] SORT_1 var_110_arg_2 = var_7; [L421] SORT_1 var_110 = var_110_arg_0 ? var_110_arg_1 : var_110_arg_2; [L422] EXPR var_110 & mask_SORT_1 [L422] var_110 = var_110 & mask_SORT_1 [L423] SORT_1 var_111_arg_0 = input_3; [L424] SORT_1 var_111_arg_1 = var_110; [L425] EXPR var_111_arg_0 ^ var_111_arg_1 [L425] SORT_1 var_111 = var_111_arg_0 ^ var_111_arg_1; [L426] SORT_1 var_112_arg_0 = var_111; [L427] SORT_1 var_112 = ~var_112_arg_0; [L428] SORT_1 var_120_arg_0 = var_119; [L429] SORT_1 var_120_arg_1 = var_112; [L430] SORT_1 var_120_arg_2 = var_8; [L431] SORT_1 var_120 = var_120_arg_0 ? var_120_arg_1 : var_120_arg_2; [L432] SORT_1 var_121_arg_0 = var_120; [L433] SORT_1 var_121 = ~var_121_arg_0; [L434] SORT_1 var_122_arg_0 = var_120; [L435] SORT_1 var_122 = ~var_122_arg_0; [L436] SORT_1 var_123_arg_0 = var_121; [L437] SORT_1 var_123_arg_1 = var_122; [L438] EXPR var_123_arg_0 & var_123_arg_1 [L438] SORT_1 var_123 = var_123_arg_0 & var_123_arg_1; [L439] EXPR var_123 & mask_SORT_1 [L439] var_123 = var_123 & mask_SORT_1 [L440] SORT_1 bad_124_arg_0 = var_123; [L441] CALL __VERIFIER_assert(!(bad_124_arg_0)) [L21] COND TRUE !(cond) VAL [\old(cond)=0, cond=0] [L21] reach_error() VAL [\old(cond)=0, cond=0] - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 32 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 0.8s, OverallIterations: 2, TraceHistogramMax: 2, 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, 38 SdHoareTripleChecker+Invalid, 0.0s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 0 mSDsCounter, 0 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 1 IncrementalHoareTripleChecker+Invalid, 1 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 0 mSolverCounterUnsat, 38 mSDtfsCounter, 1 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 8 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=32occurred 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, 32 NumberOfCodeBlocks, 32 NumberOfCodeBlocksAsserted, 2 NumberOfCheckSat, 15 ConstructedInterpolants, 0 QuantifiedInterpolants, 15 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 1 InterpolantComputations, 1 PerfectInterpolantSequences, 4/4 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-26 02:03:40,291 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Ended with exit code 0 Received shutdown request...