/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_Bitvector.epf -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml -i ../../../trunk/examples/svcomp/hardware-verification-bv/btor2c-lazyMod.factorial4even.c -------------------------------------------------------------------------------- This is Ultimate 0.2.4-tmp.fs.bitabs-eval-d9c3e40-m [2023-12-26 09:49:08,910 INFO L188 SettingsManager]: Resetting all preferences to default values... [2023-12-26 09:49:08,976 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/default/automizer/svcomp-Reach-64bit-Automizer_Bitvector.epf [2023-12-26 09:49:08,980 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2023-12-26 09:49:08,980 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2023-12-26 09:49:09,006 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2023-12-26 09:49:09,007 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-12-26 09:49:09,007 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-12-26 09:49:09,007 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2023-12-26 09:49:09,010 INFO L153 SettingsManager]: * Use memory slicer=true [2023-12-26 09:49:09,011 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-12-26 09:49:09,011 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-12-26 09:49:09,012 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-12-26 09:49:09,013 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2023-12-26 09:49:09,013 INFO L153 SettingsManager]: * Use SBE=true [2023-12-26 09:49:09,013 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-12-26 09:49:09,013 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2023-12-26 09:49:09,013 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2023-12-26 09:49:09,013 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2023-12-26 09:49:09,014 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-12-26 09:49:09,014 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2023-12-26 09:49:09,014 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2023-12-26 09:49:09,014 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2023-12-26 09:49:09,014 INFO L153 SettingsManager]: * Allow undefined functions=false [2023-12-26 09:49:09,014 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2023-12-26 09:49:09,015 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2023-12-26 09:49:09,015 INFO L153 SettingsManager]: * Use constant arrays=true [2023-12-26 09:49:09,015 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-12-26 09:49:09,015 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-12-26 09:49:09,016 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2023-12-26 09:49:09,016 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2023-12-26 09:49:09,016 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2023-12-26 09:49:09,017 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-12-26 09:49:09,017 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-12-26 09:49:09,017 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2023-12-26 09:49:09,017 INFO L153 SettingsManager]: * Trace refinement strategy=WOLF [2023-12-26 09:49:09,017 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2023-12-26 09:49:09,017 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2023-12-26 09:49:09,017 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-12-26 09:49:09,017 INFO L153 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2023-12-26 09:49:09,017 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2023-12-26 09:49:09,018 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-12-26 09:49:09,018 INFO L153 SettingsManager]: * Logic for external solver=AUFBV [2023-12-26 09:49:09,018 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 [2023-12-26 09:49:09,209 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-12-26 09:49:09,231 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-12-26 09:49:09,233 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-12-26 09:49:09,234 INFO L270 PluginConnector]: Initializing CDTParser... [2023-12-26 09:49:09,234 INFO L274 PluginConnector]: CDTParser initialized [2023-12-26 09:49:09,235 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/hardware-verification-bv/btor2c-lazyMod.factorial4even.c [2023-12-26 09:49:10,266 INFO L533 CDTParser]: Created temporary CDT project at NULL [2023-12-26 09:49:10,388 INFO L384 CDTParser]: Found 1 translation units. [2023-12-26 09:49:10,389 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/hardware-verification-bv/btor2c-lazyMod.factorial4even.c [2023-12-26 09:49:10,394 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/54ea46787/dba1f6b4cd29451489e3666fce86a669/FLAG55616d39c [2023-12-26 09:49:10,405 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/54ea46787/dba1f6b4cd29451489e3666fce86a669 [2023-12-26 09:49:10,407 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-12-26 09:49:10,409 INFO L133 ToolchainWalker]: Walking toolchain with 5 elements. [2023-12-26 09:49:10,412 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-12-26 09:49:10,413 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-12-26 09:49:10,416 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2023-12-26 09:49:10,417 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 26.12 09:49:10" (1/1) ... [2023-12-26 09:49:10,418 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@1c387a1e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.12 09:49:10, skipping insertion in model container [2023-12-26 09:49:10,418 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 26.12 09:49:10" (1/1) ... [2023-12-26 09:49:10,436 INFO L177 MainTranslator]: Built tables and reachable declarations [2023-12-26 09:49:10,534 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.factorial4even.c[1439,1452] [2023-12-26 09:49:10,555 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-12-26 09:49:10,565 INFO L202 MainTranslator]: Completed pre-run [2023-12-26 09:49:10,574 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.factorial4even.c[1439,1452] [2023-12-26 09:49:10,583 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-12-26 09:49:10,594 INFO L206 MainTranslator]: Completed translation [2023-12-26 09:49:10,594 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.12 09:49:10 WrapperNode [2023-12-26 09:49:10,594 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-12-26 09:49:10,595 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-12-26 09:49:10,595 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-12-26 09:49:10,595 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2023-12-26 09:49:10,600 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.12 09:49:10" (1/1) ... [2023-12-26 09:49:10,608 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.12 09:49:10" (1/1) ... [2023-12-26 09:49:10,620 INFO L138 Inliner]: procedures = 17, calls = 9, calls flagged for inlining = 2, calls inlined = 2, statements flattened = 60 [2023-12-26 09:49:10,621 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-12-26 09:49:10,621 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-12-26 09:49:10,621 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2023-12-26 09:49:10,621 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2023-12-26 09:49:10,628 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.12 09:49:10" (1/1) ... [2023-12-26 09:49:10,628 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.12 09:49:10" (1/1) ... [2023-12-26 09:49:10,630 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.12 09:49:10" (1/1) ... [2023-12-26 09:49:10,638 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 09:49:10,639 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.12 09:49:10" (1/1) ... [2023-12-26 09:49:10,639 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.12 09:49:10" (1/1) ... [2023-12-26 09:49:10,642 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.12 09:49:10" (1/1) ... [2023-12-26 09:49:10,644 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.12 09:49:10" (1/1) ... [2023-12-26 09:49:10,645 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.12 09:49:10" (1/1) ... [2023-12-26 09:49:10,645 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.12 09:49:10" (1/1) ... [2023-12-26 09:49:10,647 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-12-26 09:49:10,647 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-12-26 09:49:10,647 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2023-12-26 09:49:10,648 INFO L274 PluginConnector]: RCFGBuilder initialized [2023-12-26 09:49:10,648 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.12 09:49:10" (1/1) ... [2023-12-26 09:49:10,652 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2023-12-26 09:49:10,665 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-12-26 09:49:10,677 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 09:49:10,730 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 09:49:10,741 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-12-26 09:49:10,741 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2023-12-26 09:49:10,741 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-12-26 09:49:10,741 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-12-26 09:49:10,741 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2023-12-26 09:49:10,742 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2023-12-26 09:49:10,798 INFO L241 CfgBuilder]: Building ICFG [2023-12-26 09:49:10,799 INFO L267 CfgBuilder]: Building CFG for each procedure with an implementation [2023-12-26 09:49:10,937 INFO L282 CfgBuilder]: Performing block encoding [2023-12-26 09:49:10,959 INFO L304 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-12-26 09:49:10,959 INFO L309 CfgBuilder]: Removed 1 assume(true) statements. [2023-12-26 09:49:10,959 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 26.12 09:49:10 BoogieIcfgContainer [2023-12-26 09:49:10,960 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-12-26 09:49:10,961 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-12-26 09:49:10,961 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2023-12-26 09:49:10,964 INFO L274 PluginConnector]: TraceAbstraction initialized [2023-12-26 09:49:10,964 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 26.12 09:49:10" (1/3) ... [2023-12-26 09:49:10,964 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@49275e35 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 26.12 09:49:10, skipping insertion in model container [2023-12-26 09:49:10,964 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.12 09:49:10" (2/3) ... [2023-12-26 09:49:10,965 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@49275e35 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 26.12 09:49:10, skipping insertion in model container [2023-12-26 09:49:10,965 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 26.12 09:49:10" (3/3) ... [2023-12-26 09:49:10,966 INFO L112 eAbstractionObserver]: Analyzing ICFG btor2c-lazyMod.factorial4even.c [2023-12-26 09:49:10,977 INFO L204 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-12-26 09:49:10,978 INFO L163 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2023-12-26 09:49:11,009 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-12-26 09:49:11,014 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;@4668a6de, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2023-12-26 09:49:11,014 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2023-12-26 09:49:11,017 INFO L276 IsEmpty]: Start isEmpty. Operand has 14 states, 9 states have (on average 1.4444444444444444) internal successors, (13), 10 states have internal predecessors, (13), 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 09:49:11,021 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2023-12-26 09:49:11,021 INFO L187 NwaCegarLoop]: Found error trace [2023-12-26 09:49:11,021 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2023-12-26 09:49:11,022 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-26 09:49:11,025 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-26 09:49:11,026 INFO L85 PathProgramCache]: Analyzing trace with hash 1985682460, now seen corresponding path program 1 times [2023-12-26 09:49:11,034 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-26 09:49:11,034 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [397419980] [2023-12-26 09:49:11,034 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-26 09:49:11,035 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-26 09:49:11,035 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-26 09:49:11,038 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-12-26 09:49:11,057 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Waiting until timeout for monitored process [2023-12-26 09:49:11,099 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-26 09:49:11,102 INFO L262 TraceCheckSpWp]: Trace formula consists of 33 conjuncts, 12 conjunts are in the unsatisfiable core [2023-12-26 09:49:11,110 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-26 09:49:11,216 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-26 09:49:11,216 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-26 09:49:11,217 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-26 09:49:11,217 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [397419980] [2023-12-26 09:49:11,217 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [397419980] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-26 09:49:11,217 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-26 09:49:11,217 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-12-26 09:49:11,218 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1462316651] [2023-12-26 09:49:11,219 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-26 09:49:11,221 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-12-26 09:49:11,221 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-26 09:49:11,237 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-12-26 09:49:11,237 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2023-12-26 09:49:11,239 INFO L87 Difference]: Start difference. First operand has 14 states, 9 states have (on average 1.4444444444444444) internal successors, (13), 10 states have internal predecessors, (13), 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 6 states, 5 states have (on average 1.0) internal successors, (5), 4 states have internal predecessors, (5), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-26 09:49:11,315 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-26 09:49:11,316 INFO L93 Difference]: Finished difference Result 35 states and 52 transitions. [2023-12-26 09:49:11,317 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-12-26 09:49:11,318 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 1.0) internal successors, (5), 4 states have internal predecessors, (5), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 6 [2023-12-26 09:49:11,319 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-26 09:49:11,324 INFO L225 Difference]: With dead ends: 35 [2023-12-26 09:49:11,324 INFO L226 Difference]: Without dead ends: 22 [2023-12-26 09:49:11,327 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2023-12-26 09:49:11,331 INFO L413 NwaCegarLoop]: 7 mSDtfsCounter, 9 mSDsluCounter, 28 mSDsCounter, 0 mSdLazyCounter, 32 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 9 SdHoareTripleChecker+Valid, 35 SdHoareTripleChecker+Invalid, 36 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 32 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-12-26 09:49:11,332 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [9 Valid, 35 Invalid, 36 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 32 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-12-26 09:49:11,343 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22 states. [2023-12-26 09:49:11,357 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22 to 18. [2023-12-26 09:49:11,358 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 18 states, 12 states have (on average 1.0833333333333333) internal successors, (13), 13 states have internal predecessors, (13), 3 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (3), 2 states have call predecessors, (3), 3 states have call successors, (3) [2023-12-26 09:49:11,359 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 19 transitions. [2023-12-26 09:49:11,359 INFO L78 Accepts]: Start accepts. Automaton has 18 states and 19 transitions. Word has length 6 [2023-12-26 09:49:11,360 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-26 09:49:11,360 INFO L495 AbstractCegarLoop]: Abstraction has 18 states and 19 transitions. [2023-12-26 09:49:11,360 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 1.0) internal successors, (5), 4 states have internal predecessors, (5), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-26 09:49:11,360 INFO L276 IsEmpty]: Start isEmpty. Operand 18 states and 19 transitions. [2023-12-26 09:49:11,360 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2023-12-26 09:49:11,360 INFO L187 NwaCegarLoop]: Found error trace [2023-12-26 09:49:11,361 INFO L195 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-26 09:49:11,363 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Ended with exit code 0 [2023-12-26 09:49:11,562 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-26 09:49:11,563 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-26 09:49:11,563 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-26 09:49:11,564 INFO L85 PathProgramCache]: Analyzing trace with hash 1243418234, now seen corresponding path program 1 times [2023-12-26 09:49:11,564 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-26 09:49:11,564 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [163146068] [2023-12-26 09:49:11,564 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-26 09:49:11,565 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-26 09:49:11,565 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-26 09:49:11,566 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-12-26 09:49:11,567 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Waiting until timeout for monitored process [2023-12-26 09:49:11,598 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-26 09:49:11,599 INFO L262 TraceCheckSpWp]: Trace formula consists of 49 conjuncts, 14 conjunts are in the unsatisfiable core [2023-12-26 09:49:11,601 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-26 09:49:11,668 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-26 09:49:11,668 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-26 09:49:11,669 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-26 09:49:11,671 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [163146068] [2023-12-26 09:49:11,672 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [163146068] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-26 09:49:11,672 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-26 09:49:11,673 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-12-26 09:49:11,673 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1504077535] [2023-12-26 09:49:11,673 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-26 09:49:11,674 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-12-26 09:49:11,674 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-26 09:49:11,676 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-12-26 09:49:11,676 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2023-12-26 09:49:11,676 INFO L87 Difference]: Start difference. First operand 18 states and 19 transitions. Second operand has 6 states, 5 states have (on average 1.8) internal successors, (9), 5 states have internal predecessors, (9), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2023-12-26 09:49:11,739 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-26 09:49:11,739 INFO L93 Difference]: Finished difference Result 30 states and 32 transitions. [2023-12-26 09:49:11,739 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-12-26 09:49:11,740 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 1.8) internal successors, (9), 5 states have internal predecessors, (9), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 12 [2023-12-26 09:49:11,740 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-26 09:49:11,741 INFO L225 Difference]: With dead ends: 30 [2023-12-26 09:49:11,742 INFO L226 Difference]: Without dead ends: 28 [2023-12-26 09:49:11,742 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2023-12-26 09:49:11,743 INFO L413 NwaCegarLoop]: 13 mSDtfsCounter, 8 mSDsluCounter, 40 mSDsCounter, 0 mSdLazyCounter, 34 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 9 SdHoareTripleChecker+Valid, 53 SdHoareTripleChecker+Invalid, 36 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 34 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-12-26 09:49:11,743 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [9 Valid, 53 Invalid, 36 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 34 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-12-26 09:49:11,745 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28 states. [2023-12-26 09:49:11,751 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28 to 24. [2023-12-26 09:49:11,751 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 24 states, 16 states have (on average 1.0625) internal successors, (17), 17 states have internal predecessors, (17), 4 states have call successors, (4), 3 states have call predecessors, (4), 3 states have return successors, (4), 3 states have call predecessors, (4), 4 states have call successors, (4) [2023-12-26 09:49:11,752 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 25 transitions. [2023-12-26 09:49:11,752 INFO L78 Accepts]: Start accepts. Automaton has 24 states and 25 transitions. Word has length 12 [2023-12-26 09:49:11,752 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-26 09:49:11,752 INFO L495 AbstractCegarLoop]: Abstraction has 24 states and 25 transitions. [2023-12-26 09:49:11,752 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 1.8) internal successors, (9), 5 states have internal predecessors, (9), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2023-12-26 09:49:11,753 INFO L276 IsEmpty]: Start isEmpty. Operand 24 states and 25 transitions. [2023-12-26 09:49:11,753 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2023-12-26 09:49:11,753 INFO L187 NwaCegarLoop]: Found error trace [2023-12-26 09:49:11,753 INFO L195 NwaCegarLoop]: trace histogram [3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-26 09:49:11,767 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Ended with exit code 0 [2023-12-26 09:49:11,955 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-26 09:49:11,956 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-26 09:49:11,956 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-26 09:49:11,956 INFO L85 PathProgramCache]: Analyzing trace with hash 126468606, now seen corresponding path program 1 times [2023-12-26 09:49:11,956 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-26 09:49:11,957 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [698759491] [2023-12-26 09:49:11,957 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-26 09:49:11,957 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-26 09:49:11,957 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-26 09:49:11,958 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-12-26 09:49:11,965 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Waiting until timeout for monitored process [2023-12-26 09:49:11,992 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-26 09:49:11,993 INFO L262 TraceCheckSpWp]: Trace formula consists of 70 conjuncts, 17 conjunts are in the unsatisfiable core [2023-12-26 09:49:11,994 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-26 09:49:12,104 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 4 proven. 2 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2023-12-26 09:49:12,104 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-26 09:49:12,183 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 4 proven. 2 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2023-12-26 09:49:12,184 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-26 09:49:12,185 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [698759491] [2023-12-26 09:49:12,187 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [698759491] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-26 09:49:12,187 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-12-26 09:49:12,187 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 11 [2023-12-26 09:49:12,187 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [168140389] [2023-12-26 09:49:12,187 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-12-26 09:49:12,188 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2023-12-26 09:49:12,188 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-26 09:49:12,188 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2023-12-26 09:49:12,189 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=86, Unknown=0, NotChecked=0, Total=110 [2023-12-26 09:49:12,189 INFO L87 Difference]: Start difference. First operand 24 states and 25 transitions. Second operand has 11 states, 10 states have (on average 1.8) internal successors, (18), 9 states have internal predecessors, (18), 3 states have call successors, (6), 3 states have call predecessors, (6), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2023-12-26 09:49:12,338 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-26 09:49:12,338 INFO L93 Difference]: Finished difference Result 47 states and 53 transitions. [2023-12-26 09:49:12,338 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2023-12-26 09:49:12,339 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 10 states have (on average 1.8) internal successors, (18), 9 states have internal predecessors, (18), 3 states have call successors, (6), 3 states have call predecessors, (6), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) Word has length 19 [2023-12-26 09:49:12,339 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-26 09:49:12,340 INFO L225 Difference]: With dead ends: 47 [2023-12-26 09:49:12,341 INFO L226 Difference]: Without dead ends: 45 [2023-12-26 09:49:12,341 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 41 GetRequests, 27 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 16 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=56, Invalid=184, Unknown=0, NotChecked=0, Total=240 [2023-12-26 09:49:12,343 INFO L413 NwaCegarLoop]: 9 mSDtfsCounter, 25 mSDsluCounter, 48 mSDsCounter, 0 mSdLazyCounter, 76 mSolverCounterSat, 19 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 25 SdHoareTripleChecker+Valid, 57 SdHoareTripleChecker+Invalid, 95 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 19 IncrementalHoareTripleChecker+Valid, 76 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-12-26 09:49:12,344 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [25 Valid, 57 Invalid, 95 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [19 Valid, 76 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-12-26 09:49:12,345 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 45 states. [2023-12-26 09:49:12,357 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 45 to 41. [2023-12-26 09:49:12,357 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 41 states, 27 states have (on average 1.037037037037037) internal successors, (28), 28 states have internal predecessors, (28), 9 states have call successors, (9), 4 states have call predecessors, (9), 4 states have return successors, (9), 8 states have call predecessors, (9), 9 states have call successors, (9) [2023-12-26 09:49:12,360 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41 states to 41 states and 46 transitions. [2023-12-26 09:49:12,360 INFO L78 Accepts]: Start accepts. Automaton has 41 states and 46 transitions. Word has length 19 [2023-12-26 09:49:12,360 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-26 09:49:12,360 INFO L495 AbstractCegarLoop]: Abstraction has 41 states and 46 transitions. [2023-12-26 09:49:12,361 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 10 states have (on average 1.8) internal successors, (18), 9 states have internal predecessors, (18), 3 states have call successors, (6), 3 states have call predecessors, (6), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2023-12-26 09:49:12,361 INFO L276 IsEmpty]: Start isEmpty. Operand 41 states and 46 transitions. [2023-12-26 09:49:12,368 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2023-12-26 09:49:12,368 INFO L187 NwaCegarLoop]: Found error trace [2023-12-26 09:49:12,369 INFO L195 NwaCegarLoop]: trace histogram [4, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1] [2023-12-26 09:49:12,375 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Forceful destruction successful, exit code 0 [2023-12-26 09:49:12,571 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-26 09:49:12,571 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-26 09:49:12,572 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-26 09:49:12,572 INFO L85 PathProgramCache]: Analyzing trace with hash -667139364, now seen corresponding path program 2 times [2023-12-26 09:49:12,573 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-26 09:49:12,573 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1461334606] [2023-12-26 09:49:12,573 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2023-12-26 09:49:12,573 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-26 09:49:12,573 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-26 09:49:12,582 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-12-26 09:49:12,583 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (5)] Waiting until timeout for monitored process [2023-12-26 09:49:12,615 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2023-12-26 09:49:12,615 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-12-26 09:49:12,616 INFO L262 TraceCheckSpWp]: Trace formula consists of 86 conjuncts, 20 conjunts are in the unsatisfiable core [2023-12-26 09:49:12,618 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-26 09:49:12,795 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 6 proven. 4 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2023-12-26 09:49:12,796 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-26 09:49:12,874 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-26 09:49:12,875 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1461334606] [2023-12-26 09:49:12,875 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1461334606] provided 0 perfect and 1 imperfect interpolant sequences [2023-12-26 09:49:12,875 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [1561879329] [2023-12-26 09:49:12,875 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2023-12-26 09:49:12,875 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2023-12-26 09:49:12,875 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 [2023-12-26 09:49:12,905 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2023-12-26 09:49:12,927 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (6)] Waiting until timeout for monitored process [2023-12-26 09:49:12,967 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2023-12-26 09:49:12,967 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-12-26 09:49:12,969 INFO L262 TraceCheckSpWp]: Trace formula consists of 86 conjuncts, 20 conjunts are in the unsatisfiable core [2023-12-26 09:49:12,971 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-26 09:49:13,062 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 6 proven. 4 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2023-12-26 09:49:13,062 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-26 09:49:13,106 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [1561879329] provided 0 perfect and 1 imperfect interpolant sequences [2023-12-26 09:49:13,106 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-12-26 09:49:13,106 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 7 [2023-12-26 09:49:13,106 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [914625551] [2023-12-26 09:49:13,107 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-12-26 09:49:13,108 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-12-26 09:49:13,108 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-26 09:49:13,108 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-12-26 09:49:13,109 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90 [2023-12-26 09:49:13,109 INFO L87 Difference]: Start difference. First operand 41 states and 46 transitions. Second operand has 7 states, 6 states have (on average 2.0) internal successors, (12), 6 states have internal predecessors, (12), 3 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2023-12-26 09:49:13,193 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-26 09:49:13,193 INFO L93 Difference]: Finished difference Result 47 states and 51 transitions. [2023-12-26 09:49:13,196 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2023-12-26 09:49:13,197 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 2.0) internal successors, (12), 6 states have internal predecessors, (12), 3 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) Word has length 25 [2023-12-26 09:49:13,197 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-26 09:49:13,200 INFO L225 Difference]: With dead ends: 47 [2023-12-26 09:49:13,200 INFO L226 Difference]: Without dead ends: 45 [2023-12-26 09:49:13,200 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 63 GetRequests, 51 SyntacticMatches, 1 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=37, Invalid=119, Unknown=0, NotChecked=0, Total=156 [2023-12-26 09:49:13,201 INFO L413 NwaCegarLoop]: 12 mSDtfsCounter, 10 mSDsluCounter, 48 mSDsCounter, 0 mSdLazyCounter, 59 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 11 SdHoareTripleChecker+Valid, 60 SdHoareTripleChecker+Invalid, 64 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 59 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-12-26 09:49:13,202 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [11 Valid, 60 Invalid, 64 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 59 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-12-26 09:49:13,203 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 45 states. [2023-12-26 09:49:13,214 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 45 to 45. [2023-12-26 09:49:13,215 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 45 states, 30 states have (on average 1.0333333333333334) internal successors, (31), 31 states have internal predecessors, (31), 9 states have call successors, (9), 5 states have call predecessors, (9), 5 states have return successors, (9), 8 states have call predecessors, (9), 9 states have call successors, (9) [2023-12-26 09:49:13,219 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 45 states to 45 states and 49 transitions. [2023-12-26 09:49:13,220 INFO L78 Accepts]: Start accepts. Automaton has 45 states and 49 transitions. Word has length 25 [2023-12-26 09:49:13,220 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-26 09:49:13,220 INFO L495 AbstractCegarLoop]: Abstraction has 45 states and 49 transitions. [2023-12-26 09:49:13,220 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 2.0) internal successors, (12), 6 states have internal predecessors, (12), 3 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2023-12-26 09:49:13,220 INFO L276 IsEmpty]: Start isEmpty. Operand 45 states and 49 transitions. [2023-12-26 09:49:13,221 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2023-12-26 09:49:13,221 INFO L187 NwaCegarLoop]: Found error trace [2023-12-26 09:49:13,221 INFO L195 NwaCegarLoop]: trace histogram [6, 5, 5, 3, 3, 3, 3, 3, 2, 2, 1, 1, 1] [2023-12-26 09:49:13,235 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (5)] Forceful destruction successful, exit code 0 [2023-12-26 09:49:13,425 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (6)] Forceful destruction successful, exit code 0 [2023-12-26 09:49:13,627 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3,6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt [2023-12-26 09:49:13,627 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-26 09:49:13,628 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-26 09:49:13,628 INFO L85 PathProgramCache]: Analyzing trace with hash -128401990, now seen corresponding path program 3 times [2023-12-26 09:49:13,629 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-26 09:49:13,629 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1999955058] [2023-12-26 09:49:13,629 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2023-12-26 09:49:13,629 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-26 09:49:13,629 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-26 09:49:13,637 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-12-26 09:49:13,661 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (7)] Waiting until timeout for monitored process [2023-12-26 09:49:13,708 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2023-12-26 09:49:13,708 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-12-26 09:49:13,710 INFO L262 TraceCheckSpWp]: Trace formula consists of 107 conjuncts, 21 conjunts are in the unsatisfiable core [2023-12-26 09:49:13,713 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-26 09:49:13,866 INFO L134 CoverageAnalysis]: Checked inductivity of 63 backedges. 10 proven. 13 refuted. 0 times theorem prover too weak. 40 trivial. 0 not checked. [2023-12-26 09:49:13,867 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-26 09:49:13,920 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-26 09:49:13,921 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1999955058] [2023-12-26 09:49:13,921 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1999955058] provided 0 perfect and 1 imperfect interpolant sequences [2023-12-26 09:49:13,921 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [1804475147] [2023-12-26 09:49:13,921 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2023-12-26 09:49:13,921 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2023-12-26 09:49:13,922 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 [2023-12-26 09:49:13,949 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2023-12-26 09:49:13,950 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (8)] Waiting until timeout for monitored process [2023-12-26 09:49:14,020 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2023-12-26 09:49:14,021 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-12-26 09:49:14,023 INFO L262 TraceCheckSpWp]: Trace formula consists of 107 conjuncts, 21 conjunts are in the unsatisfiable core [2023-12-26 09:49:14,025 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-26 09:49:14,088 INFO L134 CoverageAnalysis]: Checked inductivity of 63 backedges. 10 proven. 13 refuted. 0 times theorem prover too weak. 40 trivial. 0 not checked. [2023-12-26 09:49:14,088 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-26 09:49:14,110 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [1804475147] provided 0 perfect and 1 imperfect interpolant sequences [2023-12-26 09:49:14,110 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-12-26 09:49:14,110 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 9 [2023-12-26 09:49:14,110 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1816874018] [2023-12-26 09:49:14,110 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-12-26 09:49:14,110 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2023-12-26 09:49:14,111 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-26 09:49:14,111 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2023-12-26 09:49:14,111 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=106, Unknown=0, NotChecked=0, Total=132 [2023-12-26 09:49:14,111 INFO L87 Difference]: Start difference. First operand 45 states and 49 transitions. Second operand has 9 states, 7 states have (on average 2.2857142857142856) internal successors, (16), 8 states have internal predecessors, (16), 5 states have call successors, (7), 2 states have call predecessors, (7), 1 states have return successors, (5), 3 states have call predecessors, (5), 3 states have call successors, (5) [2023-12-26 09:49:14,425 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-26 09:49:14,426 INFO L93 Difference]: Finished difference Result 51 states and 54 transitions. [2023-12-26 09:49:14,426 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2023-12-26 09:49:14,426 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 7 states have (on average 2.2857142857142856) internal successors, (16), 8 states have internal predecessors, (16), 5 states have call successors, (7), 2 states have call predecessors, (7), 1 states have return successors, (5), 3 states have call predecessors, (5), 3 states have call successors, (5) Word has length 38 [2023-12-26 09:49:14,426 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-26 09:49:14,427 INFO L225 Difference]: With dead ends: 51 [2023-12-26 09:49:14,427 INFO L226 Difference]: Without dead ends: 49 [2023-12-26 09:49:14,427 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 88 GetRequests, 75 SyntacticMatches, 1 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 1 DeprecatedPredicates, 13 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=38, Invalid=144, Unknown=0, NotChecked=0, Total=182 [2023-12-26 09:49:14,428 INFO L413 NwaCegarLoop]: 21 mSDtfsCounter, 8 mSDsluCounter, 87 mSDsCounter, 0 mSdLazyCounter, 98 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 8 SdHoareTripleChecker+Valid, 108 SdHoareTripleChecker+Invalid, 102 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 98 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2023-12-26 09:49:14,428 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [8 Valid, 108 Invalid, 102 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 98 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2023-12-26 09:49:14,428 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 49 states. [2023-12-26 09:49:14,433 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 49 to 49. [2023-12-26 09:49:14,434 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 49 states, 33 states have (on average 1.0303030303030303) internal successors, (34), 34 states have internal predecessors, (34), 9 states have call successors, (9), 6 states have call predecessors, (9), 6 states have return successors, (9), 8 states have call predecessors, (9), 9 states have call successors, (9) [2023-12-26 09:49:14,434 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 49 states to 49 states and 52 transitions. [2023-12-26 09:49:14,434 INFO L78 Accepts]: Start accepts. Automaton has 49 states and 52 transitions. Word has length 38 [2023-12-26 09:49:14,434 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-26 09:49:14,434 INFO L495 AbstractCegarLoop]: Abstraction has 49 states and 52 transitions. [2023-12-26 09:49:14,435 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 7 states have (on average 2.2857142857142856) internal successors, (16), 8 states have internal predecessors, (16), 5 states have call successors, (7), 2 states have call predecessors, (7), 1 states have return successors, (5), 3 states have call predecessors, (5), 3 states have call successors, (5) [2023-12-26 09:49:14,435 INFO L276 IsEmpty]: Start isEmpty. Operand 49 states and 52 transitions. [2023-12-26 09:49:14,435 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2023-12-26 09:49:14,436 INFO L187 NwaCegarLoop]: Found error trace [2023-12-26 09:49:14,436 INFO L195 NwaCegarLoop]: trace histogram [9, 8, 8, 5, 5, 4, 4, 4, 4, 4, 1, 1, 1] [2023-12-26 09:49:14,440 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (7)] Forceful destruction successful, exit code 0 [2023-12-26 09:49:14,641 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (8)] Forceful destruction successful, exit code 0 [2023-12-26 09:49:14,840 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt [2023-12-26 09:49:14,841 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-26 09:49:14,841 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-26 09:49:14,842 INFO L85 PathProgramCache]: Analyzing trace with hash -1566127460, now seen corresponding path program 4 times [2023-12-26 09:49:14,842 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-26 09:49:14,843 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [971519445] [2023-12-26 09:49:14,843 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2023-12-26 09:49:14,843 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-26 09:49:14,843 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-26 09:49:14,844 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-12-26 09:49:14,845 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (9)] Waiting until timeout for monitored process [2023-12-26 09:49:14,905 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2023-12-26 09:49:14,905 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-12-26 09:49:14,908 INFO L262 TraceCheckSpWp]: Trace formula consists of 181 conjuncts, 32 conjunts are in the unsatisfiable core [2023-12-26 09:49:14,910 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-26 09:49:15,124 INFO L134 CoverageAnalysis]: Checked inductivity of 166 backedges. 16 proven. 38 refuted. 0 times theorem prover too weak. 112 trivial. 0 not checked. [2023-12-26 09:49:15,124 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-26 09:49:15,321 INFO L134 CoverageAnalysis]: Checked inductivity of 166 backedges. 16 proven. 38 refuted. 0 times theorem prover too weak. 112 trivial. 0 not checked. [2023-12-26 09:49:15,322 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-26 09:49:15,322 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [971519445] [2023-12-26 09:49:15,322 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [971519445] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-26 09:49:15,322 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-12-26 09:49:15,322 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10] total 17 [2023-12-26 09:49:15,322 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [153307844] [2023-12-26 09:49:15,322 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-12-26 09:49:15,323 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2023-12-26 09:49:15,323 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-26 09:49:15,323 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2023-12-26 09:49:15,324 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=55, Invalid=217, Unknown=0, NotChecked=0, Total=272 [2023-12-26 09:49:15,324 INFO L87 Difference]: Start difference. First operand 49 states and 52 transitions. Second operand has 17 states, 16 states have (on average 2.25) internal successors, (36), 15 states have internal predecessors, (36), 9 states have call successors, (18), 3 states have call predecessors, (18), 1 states have return successors, (16), 8 states have call predecessors, (16), 8 states have call successors, (16) [2023-12-26 09:49:15,660 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-26 09:49:15,660 INFO L93 Difference]: Finished difference Result 84 states and 97 transitions. [2023-12-26 09:49:15,660 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2023-12-26 09:49:15,661 INFO L78 Accepts]: Start accepts. Automaton has has 17 states, 16 states have (on average 2.25) internal successors, (36), 15 states have internal predecessors, (36), 9 states have call successors, (18), 3 states have call predecessors, (18), 1 states have return successors, (16), 8 states have call predecessors, (16), 8 states have call successors, (16) Word has length 58 [2023-12-26 09:49:15,661 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-26 09:49:15,661 INFO L225 Difference]: With dead ends: 84 [2023-12-26 09:49:15,661 INFO L226 Difference]: Without dead ends: 82 [2023-12-26 09:49:15,662 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 124 GetRequests, 99 SyntacticMatches, 0 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 59 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=154, Invalid=548, Unknown=0, NotChecked=0, Total=702 [2023-12-26 09:49:15,662 INFO L413 NwaCegarLoop]: 18 mSDtfsCounter, 39 mSDsluCounter, 110 mSDsCounter, 0 mSdLazyCounter, 212 mSolverCounterSat, 29 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 39 SdHoareTripleChecker+Valid, 128 SdHoareTripleChecker+Invalid, 241 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 29 IncrementalHoareTripleChecker+Valid, 212 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-12-26 09:49:15,662 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [39 Valid, 128 Invalid, 241 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [29 Valid, 212 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2023-12-26 09:49:15,663 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 82 states. [2023-12-26 09:49:15,674 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 82 to 78. [2023-12-26 09:49:15,675 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 78 states, 51 states have (on average 1.0196078431372548) internal successors, (52), 52 states have internal predecessors, (52), 19 states have call successors, (19), 7 states have call predecessors, (19), 7 states have return successors, (19), 18 states have call predecessors, (19), 19 states have call successors, (19) [2023-12-26 09:49:15,675 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 78 states to 78 states and 90 transitions. [2023-12-26 09:49:15,675 INFO L78 Accepts]: Start accepts. Automaton has 78 states and 90 transitions. Word has length 58 [2023-12-26 09:49:15,676 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-26 09:49:15,676 INFO L495 AbstractCegarLoop]: Abstraction has 78 states and 90 transitions. [2023-12-26 09:49:15,676 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 16 states have (on average 2.25) internal successors, (36), 15 states have internal predecessors, (36), 9 states have call successors, (18), 3 states have call predecessors, (18), 1 states have return successors, (16), 8 states have call predecessors, (16), 8 states have call successors, (16) [2023-12-26 09:49:15,676 INFO L276 IsEmpty]: Start isEmpty. Operand 78 states and 90 transitions. [2023-12-26 09:49:15,677 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 124 [2023-12-26 09:49:15,677 INFO L187 NwaCegarLoop]: Found error trace [2023-12-26 09:49:15,677 INFO L195 NwaCegarLoop]: trace histogram [19, 18, 18, 10, 10, 9, 9, 9, 9, 9, 1, 1, 1] [2023-12-26 09:49:15,680 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (9)] Forceful destruction successful, exit code 0 [2023-12-26 09:49:15,880 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-26 09:49:15,880 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-26 09:49:15,880 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-26 09:49:15,881 INFO L85 PathProgramCache]: Analyzing trace with hash -1234451202, now seen corresponding path program 5 times [2023-12-26 09:49:15,881 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-26 09:49:15,881 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [635495899] [2023-12-26 09:49:15,881 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2023-12-26 09:49:15,881 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-26 09:49:15,881 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-26 09:49:15,882 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-12-26 09:49:15,886 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (10)] Waiting until timeout for monitored process [2023-12-26 09:49:16,043 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 15 check-sat command(s) [2023-12-26 09:49:16,043 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-12-26 09:49:16,048 INFO L262 TraceCheckSpWp]: Trace formula consists of 366 conjuncts, 57 conjunts are in the unsatisfiable core [2023-12-26 09:49:16,051 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-26 09:49:16,453 INFO L134 CoverageAnalysis]: Checked inductivity of 846 backedges. 36 proven. 198 refuted. 0 times theorem prover too weak. 612 trivial. 0 not checked. [2023-12-26 09:49:16,453 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-26 09:49:17,056 INFO L134 CoverageAnalysis]: Checked inductivity of 846 backedges. 36 proven. 198 refuted. 0 times theorem prover too weak. 612 trivial. 0 not checked. [2023-12-26 09:49:17,056 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-26 09:49:17,056 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [635495899] [2023-12-26 09:49:17,057 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [635495899] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-26 09:49:17,057 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-12-26 09:49:17,057 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 15] total 27 [2023-12-26 09:49:17,057 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [885422462] [2023-12-26 09:49:17,057 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-12-26 09:49:17,058 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 27 states [2023-12-26 09:49:17,058 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-26 09:49:17,059 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2023-12-26 09:49:17,059 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=144, Invalid=558, Unknown=0, NotChecked=0, Total=702 [2023-12-26 09:49:17,059 INFO L87 Difference]: Start difference. First operand 78 states and 90 transitions. Second operand has 27 states, 26 states have (on average 2.5384615384615383) internal successors, (66), 25 states have internal predecessors, (66), 19 states have call successors, (38), 3 states have call predecessors, (38), 1 states have return successors, (36), 18 states have call predecessors, (36), 18 states have call successors, (36) [2023-12-26 09:49:18,484 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-26 09:49:18,484 INFO L93 Difference]: Finished difference Result 143 states and 177 transitions. [2023-12-26 09:49:18,485 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2023-12-26 09:49:18,485 INFO L78 Accepts]: Start accepts. Automaton has has 27 states, 26 states have (on average 2.5384615384615383) internal successors, (66), 25 states have internal predecessors, (66), 19 states have call successors, (38), 3 states have call predecessors, (38), 1 states have return successors, (36), 18 states have call predecessors, (36), 18 states have call successors, (36) Word has length 123 [2023-12-26 09:49:18,486 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-26 09:49:18,487 INFO L225 Difference]: With dead ends: 143 [2023-12-26 09:49:18,487 INFO L226 Difference]: Without dead ends: 141 [2023-12-26 09:49:18,488 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 267 GetRequests, 219 SyntacticMatches, 0 SemanticMatches, 48 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 327 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=523, Invalid=1927, Unknown=0, NotChecked=0, Total=2450 [2023-12-26 09:49:18,489 INFO L413 NwaCegarLoop]: 33 mSDtfsCounter, 69 mSDsluCounter, 324 mSDsCounter, 0 mSdLazyCounter, 555 mSolverCounterSat, 61 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 69 SdHoareTripleChecker+Valid, 357 SdHoareTripleChecker+Invalid, 616 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 61 IncrementalHoareTripleChecker+Valid, 555 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2023-12-26 09:49:18,489 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [69 Valid, 357 Invalid, 616 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [61 Valid, 555 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2023-12-26 09:49:18,489 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 141 states. [2023-12-26 09:49:18,554 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 141 to 137. [2023-12-26 09:49:18,554 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 137 states, 87 states have (on average 1.0114942528735633) internal successors, (88), 88 states have internal predecessors, (88), 41 states have call successors, (41), 8 states have call predecessors, (41), 8 states have return successors, (41), 40 states have call predecessors, (41), 41 states have call successors, (41) [2023-12-26 09:49:18,555 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 137 states to 137 states and 170 transitions. [2023-12-26 09:49:18,556 INFO L78 Accepts]: Start accepts. Automaton has 137 states and 170 transitions. Word has length 123 [2023-12-26 09:49:18,556 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-26 09:49:18,556 INFO L495 AbstractCegarLoop]: Abstraction has 137 states and 170 transitions. [2023-12-26 09:49:18,556 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 27 states, 26 states have (on average 2.5384615384615383) internal successors, (66), 25 states have internal predecessors, (66), 19 states have call successors, (38), 3 states have call predecessors, (38), 1 states have return successors, (36), 18 states have call predecessors, (36), 18 states have call successors, (36) [2023-12-26 09:49:18,556 INFO L276 IsEmpty]: Start isEmpty. Operand 137 states and 170 transitions. [2023-12-26 09:49:18,558 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 189 [2023-12-26 09:49:18,558 INFO L187 NwaCegarLoop]: Found error trace [2023-12-26 09:49:18,558 INFO L195 NwaCegarLoop]: trace histogram [29, 28, 28, 15, 15, 14, 14, 14, 14, 14, 1, 1, 1] [2023-12-26 09:49:18,564 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (10)] Ended with exit code 0 [2023-12-26 09:49:18,762 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-26 09:49:18,763 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-26 09:49:18,763 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-26 09:49:18,763 INFO L85 PathProgramCache]: Analyzing trace with hash 1279796956, now seen corresponding path program 6 times [2023-12-26 09:49:18,764 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-26 09:49:18,764 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [383516433] [2023-12-26 09:49:18,764 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2023-12-26 09:49:18,764 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-26 09:49:18,764 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-26 09:49:18,779 INFO L229 MonitoredProcess]: Starting monitored process 11 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-12-26 09:49:18,803 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (11)] Waiting until timeout for monitored process [2023-12-26 09:49:19,139 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 22 check-sat command(s) [2023-12-26 09:49:19,140 INFO L229 tOrderPrioritization]: Conjunction of SSA is sat [2023-12-26 09:49:19,140 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-12-26 09:49:19,311 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-12-26 09:49:19,401 INFO L130 FreeRefinementEngine]: Strategy WOLF found a feasible trace [2023-12-26 09:49:19,401 INFO L360 BasicCegarLoop]: Counterexample is feasible [2023-12-26 09:49:19,402 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2023-12-26 09:49:19,416 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (11)] Forceful destruction successful, exit code 0 [2023-12-26 09:49:19,609 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-26 09:49:19,612 INFO L445 BasicCegarLoop]: Path program histogram: [6, 1, 1] [2023-12-26 09:49:19,614 INFO L179 ceAbstractionStarter]: Computing trace abstraction results [2023-12-26 09:49:19,676 WARN L320 BoogieBacktranslator]: Removing null node from list of ATEs: ATE program state null [2023-12-26 09:49:19,676 WARN L320 BoogieBacktranslator]: Removing null node from list of ATEs: ATE program state null [2023-12-26 09:49:19,676 WARN L320 BoogieBacktranslator]: Removing null node from list of ATEs: ATE program state null [2023-12-26 09:49:19,676 WARN L320 BoogieBacktranslator]: Removing null node from list of ATEs: ATE program state null [2023-12-26 09:49:19,677 WARN L320 BoogieBacktranslator]: Removing null node from list of ATEs: ATE program state null [2023-12-26 09:49:19,677 WARN L320 BoogieBacktranslator]: Removing null node from list of ATEs: ATE program state null [2023-12-26 09:49:19,677 WARN L320 BoogieBacktranslator]: Removing null node from list of ATEs: ATE program state null [2023-12-26 09:49:19,677 WARN L320 BoogieBacktranslator]: Removing null node from list of ATEs: ATE program state null [2023-12-26 09:49:19,677 WARN L320 BoogieBacktranslator]: Removing null node from list of ATEs: ATE program state null [2023-12-26 09:49:19,677 WARN L320 BoogieBacktranslator]: Removing null node from list of ATEs: ATE program state null [2023-12-26 09:49:19,677 WARN L320 BoogieBacktranslator]: Removing null node from list of ATEs: ATE program state null [2023-12-26 09:49:19,677 WARN L320 BoogieBacktranslator]: Removing null node from list of ATEs: ATE program state null [2023-12-26 09:49:19,677 WARN L320 BoogieBacktranslator]: Removing null node from list of ATEs: ATE program state null [2023-12-26 09:49:19,677 WARN L320 BoogieBacktranslator]: Removing null node from list of ATEs: ATE program state null [2023-12-26 09:49:19,677 WARN L320 BoogieBacktranslator]: Removing null node from list of ATEs: ATE program state null [2023-12-26 09:49:19,703 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 26.12 09:49:19 BoogieIcfgContainer [2023-12-26 09:49:19,703 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2023-12-26 09:49:19,703 INFO L158 Benchmark]: Toolchain (without parser) took 9294.31ms. Allocated memory was 277.9MB in the beginning and 334.5MB in the end (delta: 56.6MB). Free memory was 227.2MB in the beginning and 232.2MB in the end (delta: -5.0MB). Peak memory consumption was 52.5MB. Max. memory is 8.0GB. [2023-12-26 09:49:19,704 INFO L158 Benchmark]: CDTParser took 0.09ms. Allocated memory is still 203.4MB. Free memory is still 154.0MB. There was no memory consumed. Max. memory is 8.0GB. [2023-12-26 09:49:19,704 INFO L158 Benchmark]: CACSL2BoogieTranslator took 182.13ms. Allocated memory is still 277.9MB. Free memory was 226.7MB in the beginning and 214.6MB in the end (delta: 12.1MB). Peak memory consumption was 11.5MB. Max. memory is 8.0GB. [2023-12-26 09:49:19,704 INFO L158 Benchmark]: Boogie Procedure Inliner took 25.57ms. Allocated memory is still 277.9MB. Free memory was 214.6MB in the beginning and 213.1MB in the end (delta: 1.5MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. [2023-12-26 09:49:19,704 INFO L158 Benchmark]: Boogie Preprocessor took 25.59ms. Allocated memory is still 277.9MB. Free memory was 213.1MB in the beginning and 211.0MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. [2023-12-26 09:49:19,704 INFO L158 Benchmark]: RCFGBuilder took 312.25ms. Allocated memory is still 277.9MB. Free memory was 211.0MB in the beginning and 198.1MB in the end (delta: 12.9MB). Peak memory consumption was 12.6MB. Max. memory is 8.0GB. [2023-12-26 09:49:19,704 INFO L158 Benchmark]: TraceAbstraction took 8741.87ms. Allocated memory was 277.9MB in the beginning and 334.5MB in the end (delta: 56.6MB). Free memory was 197.4MB in the beginning and 232.2MB in the end (delta: -34.8MB). Peak memory consumption was 22.1MB. Max. memory is 8.0GB. [2023-12-26 09:49:19,705 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.09ms. Allocated memory is still 203.4MB. Free memory is still 154.0MB. There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 182.13ms. Allocated memory is still 277.9MB. Free memory was 226.7MB in the beginning and 214.6MB in the end (delta: 12.1MB). Peak memory consumption was 11.5MB. Max. memory is 8.0GB. * Boogie Procedure Inliner took 25.57ms. Allocated memory is still 277.9MB. Free memory was 214.6MB in the beginning and 213.1MB in the end (delta: 1.5MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. * Boogie Preprocessor took 25.59ms. Allocated memory is still 277.9MB. Free memory was 213.1MB in the beginning and 211.0MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. * RCFGBuilder took 312.25ms. Allocated memory is still 277.9MB. Free memory was 211.0MB in the beginning and 198.1MB in the end (delta: 12.9MB). Peak memory consumption was 12.6MB. Max. memory is 8.0GB. * TraceAbstraction took 8741.87ms. Allocated memory was 277.9MB in the beginning and 334.5MB in the end (delta: 56.6MB). Free memory was 197.4MB in the beginning and 232.2MB in the end (delta: -34.8MB). Peak memory consumption was 22.1MB. 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 - CounterExampleResult [Line: 29]: a call to reach_error is reachable a call to reach_error is reachable We found a FailurePath: [L34] const SORT_1 mask_SORT_1 = (SORT_1)-1 >> (sizeof(SORT_1) * 8 - 4); [L35] const SORT_1 msb_SORT_1 = (SORT_1)1 << (4 - 1); [L37] const SORT_12 mask_SORT_12 = (SORT_12)-1 >> (sizeof(SORT_12) * 8 - 1); [L38] const SORT_12 msb_SORT_12 = (SORT_12)1 << (1 - 1); [L40] const SORT_1 var_2 = 1; [L41] const SORT_1 var_11 = mask_SORT_1; [L42] const SORT_1 var_16 = 3; [L45] SORT_1 state_3 = __VERIFIER_nondet_uchar() & mask_SORT_1; [L46] SORT_1 state_4 = __VERIFIER_nondet_uchar() & mask_SORT_1; [L48] SORT_1 init_5_arg_1 = var_2; [L49] state_3 = init_5_arg_1 [L50] SORT_1 init_6_arg_1 = var_2; [L51] state_4 = init_6_arg_1 VAL [init_5_arg_1=1, init_6_arg_1=1, mask_SORT_12=1, mask_SORT_1=15, msb_SORT_12=1, msb_SORT_1=8, state_3=1, state_4=1, var_11=15, var_16=3, var_2=1] [L56] SORT_1 var_13_arg_0 = state_4; [L57] SORT_1 var_13_arg_1 = var_11; [L58] SORT_12 var_13 = var_13_arg_0 == var_13_arg_1; [L59] SORT_12 bad_14_arg_0 = var_13; VAL [bad_14_arg_0=0, init_5_arg_1=1, init_6_arg_1=1, mask_SORT_12=1, mask_SORT_1=15, msb_SORT_12=1, msb_SORT_1=8, state_3=1, state_4=1, var_11=15, var_13=0, var_13_arg_0=1, var_13_arg_1=15, var_16=3, var_2=1] [L60] CALL __VERIFIER_assert(!(bad_14_arg_0)) VAL [\old(cond)=1] [L29] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1] [L60] RET __VERIFIER_assert(!(bad_14_arg_0)) VAL [bad_14_arg_0=0, init_5_arg_1=1, init_6_arg_1=1, mask_SORT_12=1, mask_SORT_1=15, msb_SORT_12=1, msb_SORT_1=8, state_3=1, state_4=1, var_11=15, var_13=0, var_13_arg_0=1, var_13_arg_1=15, var_16=3, var_2=1] [L61] SORT_1 var_17_arg_0 = state_4; [L62] SORT_1 var_17_arg_1 = var_16; [L63] SORT_12 var_17 = var_17_arg_0 > var_17_arg_1; [L64] SORT_1 var_15_arg_0 = state_3; [L65] SORT_12 var_15 = var_15_arg_0 >> 0; [L66] SORT_12 var_18_arg_0 = var_17; [L67] SORT_12 var_18_arg_1 = var_15; [L68] SORT_12 var_18 = var_18_arg_0 & var_18_arg_1; [L69] var_18 = var_18 & mask_SORT_12 [L70] SORT_12 bad_19_arg_0 = var_18; VAL [bad_14_arg_0=0, bad_19_arg_0=0, init_5_arg_1=1, init_6_arg_1=1, mask_SORT_12=1, mask_SORT_1=15, msb_SORT_12=1, msb_SORT_1=8, state_3=1, state_4=1, var_11=15, var_13=0, var_13_arg_0=1, var_13_arg_1=15, var_15=1, var_15_arg_0=1, var_16=3, var_17=0, var_17_arg_0=1, var_17_arg_1=3, var_18=0, var_18_arg_0=0, var_18_arg_1=1, var_2=1] [L71] CALL __VERIFIER_assert(!(bad_19_arg_0)) VAL [\old(cond)=1] [L29] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1] [L71] RET __VERIFIER_assert(!(bad_19_arg_0)) VAL [bad_14_arg_0=0, bad_19_arg_0=0, init_5_arg_1=1, init_6_arg_1=1, mask_SORT_12=1, mask_SORT_1=15, msb_SORT_12=1, msb_SORT_1=8, state_3=1, state_4=1, var_11=15, var_13=0, var_13_arg_0=1, var_13_arg_1=15, var_15=1, var_15_arg_0=1, var_16=3, var_17=0, var_17_arg_0=1, var_17_arg_1=3, var_18=0, var_18_arg_0=0, var_18_arg_1=1, var_2=1] [L73] SORT_1 var_7_arg_0 = state_4; [L74] SORT_1 var_7_arg_1 = var_2; [L75] SORT_1 var_7 = var_7_arg_0 + var_7_arg_1; [L76] var_7 = var_7 & mask_SORT_1 [L77] SORT_1 next_9_arg_1 = var_7; [L78] SORT_1 var_8_arg_0 = state_3; [L79] SORT_1 var_8_arg_1 = state_4; [L80] SORT_1 var_8 = var_8_arg_0 * var_8_arg_1; [L81] SORT_1 next_10_arg_1 = var_8; [L83] state_4 = next_9_arg_1 [L84] state_3 = next_10_arg_1 VAL [bad_14_arg_0=0, bad_19_arg_0=0, init_5_arg_1=1, init_6_arg_1=1, mask_SORT_12=1, mask_SORT_1=15, msb_SORT_12=1, msb_SORT_1=8, next_10_arg_1=1, next_9_arg_1=2, state_3=1, state_4=2, var_11=15, var_13=0, var_13_arg_0=1, var_13_arg_1=15, var_15=1, var_15_arg_0=1, var_16=3, var_17=0, var_17_arg_0=1, var_17_arg_1=3, var_18=0, var_18_arg_0=0, var_18_arg_1=1, var_2=1, var_7=2, var_7_arg_0=1, var_7_arg_1=1, var_8=1, var_8_arg_0=1, var_8_arg_1=1] [L56] SORT_1 var_13_arg_0 = state_4; [L57] SORT_1 var_13_arg_1 = var_11; [L58] SORT_12 var_13 = var_13_arg_0 == var_13_arg_1; [L59] SORT_12 bad_14_arg_0 = var_13; VAL [bad_14_arg_0=0, bad_19_arg_0=0, init_5_arg_1=1, init_6_arg_1=1, mask_SORT_12=1, mask_SORT_1=15, msb_SORT_12=1, msb_SORT_1=8, next_10_arg_1=1, next_9_arg_1=2, state_3=1, state_4=2, var_11=15, var_13=0, var_13_arg_0=2, var_13_arg_1=15, var_15=1, var_15_arg_0=1, var_16=3, var_17=0, var_17_arg_0=1, var_17_arg_1=3, var_18=0, var_18_arg_0=0, var_18_arg_1=1, var_2=1, var_7=2, var_7_arg_0=1, var_7_arg_1=1, var_8=1, var_8_arg_0=1, var_8_arg_1=1] [L60] CALL __VERIFIER_assert(!(bad_14_arg_0)) VAL [\old(cond)=1] [L29] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1] [L60] RET __VERIFIER_assert(!(bad_14_arg_0)) VAL [bad_14_arg_0=0, bad_19_arg_0=0, init_5_arg_1=1, init_6_arg_1=1, mask_SORT_12=1, mask_SORT_1=15, msb_SORT_12=1, msb_SORT_1=8, next_10_arg_1=1, next_9_arg_1=2, state_3=1, state_4=2, var_11=15, var_13=0, var_13_arg_0=2, var_13_arg_1=15, var_15=1, var_15_arg_0=1, var_16=3, var_17=0, var_17_arg_0=1, var_17_arg_1=3, var_18=0, var_18_arg_0=0, var_18_arg_1=1, var_2=1, var_7=2, var_7_arg_0=1, var_7_arg_1=1, var_8=1, var_8_arg_0=1, var_8_arg_1=1] [L61] SORT_1 var_17_arg_0 = state_4; [L62] SORT_1 var_17_arg_1 = var_16; [L63] SORT_12 var_17 = var_17_arg_0 > var_17_arg_1; [L64] SORT_1 var_15_arg_0 = state_3; [L65] SORT_12 var_15 = var_15_arg_0 >> 0; [L66] SORT_12 var_18_arg_0 = var_17; [L67] SORT_12 var_18_arg_1 = var_15; [L68] SORT_12 var_18 = var_18_arg_0 & var_18_arg_1; [L69] var_18 = var_18 & mask_SORT_12 [L70] SORT_12 bad_19_arg_0 = var_18; VAL [bad_14_arg_0=0, bad_19_arg_0=0, init_5_arg_1=1, init_6_arg_1=1, mask_SORT_12=1, mask_SORT_1=15, msb_SORT_12=1, msb_SORT_1=8, next_10_arg_1=1, next_9_arg_1=2, state_3=1, state_4=2, var_11=15, var_13=0, var_13_arg_0=2, var_13_arg_1=15, var_15=1, var_15_arg_0=1, var_16=3, var_17=0, var_17_arg_0=2, var_17_arg_1=3, var_18=0, var_18_arg_0=0, var_18_arg_1=1, var_2=1, var_7=2, var_7_arg_0=1, var_7_arg_1=1, var_8=1, var_8_arg_0=1, var_8_arg_1=1] [L71] CALL __VERIFIER_assert(!(bad_19_arg_0)) VAL [\old(cond)=1] [L29] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1] [L71] RET __VERIFIER_assert(!(bad_19_arg_0)) VAL [bad_14_arg_0=0, bad_19_arg_0=0, init_5_arg_1=1, init_6_arg_1=1, mask_SORT_12=1, mask_SORT_1=15, msb_SORT_12=1, msb_SORT_1=8, next_10_arg_1=1, next_9_arg_1=2, state_3=1, state_4=2, var_11=15, var_13=0, var_13_arg_0=2, var_13_arg_1=15, var_15=1, var_15_arg_0=1, var_16=3, var_17=0, var_17_arg_0=2, var_17_arg_1=3, var_18=0, var_18_arg_0=0, var_18_arg_1=1, var_2=1, var_7=2, var_7_arg_0=1, var_7_arg_1=1, var_8=1, var_8_arg_0=1, var_8_arg_1=1] [L73] SORT_1 var_7_arg_0 = state_4; [L74] SORT_1 var_7_arg_1 = var_2; [L75] SORT_1 var_7 = var_7_arg_0 + var_7_arg_1; [L76] var_7 = var_7 & mask_SORT_1 [L77] SORT_1 next_9_arg_1 = var_7; [L78] SORT_1 var_8_arg_0 = state_3; [L79] SORT_1 var_8_arg_1 = state_4; [L80] SORT_1 var_8 = var_8_arg_0 * var_8_arg_1; [L81] SORT_1 next_10_arg_1 = var_8; [L83] state_4 = next_9_arg_1 [L84] state_3 = next_10_arg_1 VAL [bad_14_arg_0=0, bad_19_arg_0=0, init_5_arg_1=1, init_6_arg_1=1, mask_SORT_12=1, mask_SORT_1=15, msb_SORT_12=1, msb_SORT_1=8, next_10_arg_1=2, next_9_arg_1=3, state_3=2, state_4=3, var_11=15, var_13=0, var_13_arg_0=2, var_13_arg_1=15, var_15=1, var_15_arg_0=1, var_16=3, var_17=0, var_17_arg_0=2, var_17_arg_1=3, var_18=0, var_18_arg_0=0, var_18_arg_1=1, var_2=1, var_7=3, var_7_arg_0=2, var_7_arg_1=1, var_8=2, var_8_arg_0=1, var_8_arg_1=2] [L56] SORT_1 var_13_arg_0 = state_4; [L57] SORT_1 var_13_arg_1 = var_11; [L58] SORT_12 var_13 = var_13_arg_0 == var_13_arg_1; [L59] SORT_12 bad_14_arg_0 = var_13; VAL [bad_14_arg_0=0, bad_19_arg_0=0, init_5_arg_1=1, init_6_arg_1=1, mask_SORT_12=1, mask_SORT_1=15, msb_SORT_12=1, msb_SORT_1=8, next_10_arg_1=2, next_9_arg_1=3, state_3=2, state_4=3, var_11=15, var_13=0, var_13_arg_0=3, var_13_arg_1=15, var_15=1, var_15_arg_0=1, var_16=3, var_17=0, var_17_arg_0=2, var_17_arg_1=3, var_18=0, var_18_arg_0=0, var_18_arg_1=1, var_2=1, var_7=3, var_7_arg_0=2, var_7_arg_1=1, var_8=2, var_8_arg_0=1, var_8_arg_1=2] [L60] CALL __VERIFIER_assert(!(bad_14_arg_0)) VAL [\old(cond)=1] [L29] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1] [L60] RET __VERIFIER_assert(!(bad_14_arg_0)) VAL [bad_14_arg_0=0, bad_19_arg_0=0, init_5_arg_1=1, init_6_arg_1=1, mask_SORT_12=1, mask_SORT_1=15, msb_SORT_12=1, msb_SORT_1=8, next_10_arg_1=2, next_9_arg_1=3, state_3=2, state_4=3, var_11=15, var_13=0, var_13_arg_0=3, var_13_arg_1=15, var_15=1, var_15_arg_0=1, var_16=3, var_17=0, var_17_arg_0=2, var_17_arg_1=3, var_18=0, var_18_arg_0=0, var_18_arg_1=1, var_2=1, var_7=3, var_7_arg_0=2, var_7_arg_1=1, var_8=2, var_8_arg_0=1, var_8_arg_1=2] [L61] SORT_1 var_17_arg_0 = state_4; [L62] SORT_1 var_17_arg_1 = var_16; [L63] SORT_12 var_17 = var_17_arg_0 > var_17_arg_1; [L64] SORT_1 var_15_arg_0 = state_3; [L65] SORT_12 var_15 = var_15_arg_0 >> 0; [L66] SORT_12 var_18_arg_0 = var_17; [L67] SORT_12 var_18_arg_1 = var_15; [L68] SORT_12 var_18 = var_18_arg_0 & var_18_arg_1; [L69] var_18 = var_18 & mask_SORT_12 [L70] SORT_12 bad_19_arg_0 = var_18; VAL [bad_14_arg_0=0, bad_19_arg_0=0, init_5_arg_1=1, init_6_arg_1=1, mask_SORT_12=1, mask_SORT_1=15, msb_SORT_12=1, msb_SORT_1=8, next_10_arg_1=2, next_9_arg_1=3, state_3=2, state_4=3, var_11=15, var_13=0, var_13_arg_0=3, var_13_arg_1=15, var_15=2, var_15_arg_0=2, var_16=3, var_17=0, var_17_arg_0=3, var_17_arg_1=3, var_18=0, var_18_arg_0=0, var_18_arg_1=2, var_2=1, var_7=3, var_7_arg_0=2, var_7_arg_1=1, var_8=2, var_8_arg_0=1, var_8_arg_1=2] [L71] CALL __VERIFIER_assert(!(bad_19_arg_0)) VAL [\old(cond)=1] [L29] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1] [L71] RET __VERIFIER_assert(!(bad_19_arg_0)) VAL [bad_14_arg_0=0, bad_19_arg_0=0, init_5_arg_1=1, init_6_arg_1=1, mask_SORT_12=1, mask_SORT_1=15, msb_SORT_12=1, msb_SORT_1=8, next_10_arg_1=2, next_9_arg_1=3, state_3=2, state_4=3, var_11=15, var_13=0, var_13_arg_0=3, var_13_arg_1=15, var_15=2, var_15_arg_0=2, var_16=3, var_17=0, var_17_arg_0=3, var_17_arg_1=3, var_18=0, var_18_arg_0=0, var_18_arg_1=2, var_2=1, var_7=3, var_7_arg_0=2, var_7_arg_1=1, var_8=2, var_8_arg_0=1, var_8_arg_1=2] [L73] SORT_1 var_7_arg_0 = state_4; [L74] SORT_1 var_7_arg_1 = var_2; [L75] SORT_1 var_7 = var_7_arg_0 + var_7_arg_1; [L76] var_7 = var_7 & mask_SORT_1 [L77] SORT_1 next_9_arg_1 = var_7; [L78] SORT_1 var_8_arg_0 = state_3; [L79] SORT_1 var_8_arg_1 = state_4; [L80] SORT_1 var_8 = var_8_arg_0 * var_8_arg_1; [L81] SORT_1 next_10_arg_1 = var_8; [L83] state_4 = next_9_arg_1 [L84] state_3 = next_10_arg_1 VAL [bad_14_arg_0=0, bad_19_arg_0=0, init_5_arg_1=1, init_6_arg_1=1, mask_SORT_12=1, mask_SORT_1=15, msb_SORT_12=1, msb_SORT_1=8, next_10_arg_1=6, next_9_arg_1=4, state_3=6, state_4=4, var_11=15, var_13=0, var_13_arg_0=3, var_13_arg_1=15, var_15=2, var_15_arg_0=2, var_16=3, var_17=0, var_17_arg_0=3, var_17_arg_1=3, var_18=0, var_18_arg_0=0, var_18_arg_1=2, var_2=1, var_7=4, var_7_arg_0=3, var_7_arg_1=1, var_8=6, var_8_arg_0=2, var_8_arg_1=3] [L56] SORT_1 var_13_arg_0 = state_4; [L57] SORT_1 var_13_arg_1 = var_11; [L58] SORT_12 var_13 = var_13_arg_0 == var_13_arg_1; [L59] SORT_12 bad_14_arg_0 = var_13; VAL [bad_14_arg_0=0, bad_19_arg_0=0, init_5_arg_1=1, init_6_arg_1=1, mask_SORT_12=1, mask_SORT_1=15, msb_SORT_12=1, msb_SORT_1=8, next_10_arg_1=6, next_9_arg_1=4, state_3=6, state_4=4, var_11=15, var_13=0, var_13_arg_0=4, var_13_arg_1=15, var_15=2, var_15_arg_0=2, var_16=3, var_17=0, var_17_arg_0=3, var_17_arg_1=3, var_18=0, var_18_arg_0=0, var_18_arg_1=2, var_2=1, var_7=4, var_7_arg_0=3, var_7_arg_1=1, var_8=6, var_8_arg_0=2, var_8_arg_1=3] [L60] CALL __VERIFIER_assert(!(bad_14_arg_0)) VAL [\old(cond)=1] [L29] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1] [L60] RET __VERIFIER_assert(!(bad_14_arg_0)) VAL [bad_14_arg_0=0, bad_19_arg_0=0, init_5_arg_1=1, init_6_arg_1=1, mask_SORT_12=1, mask_SORT_1=15, msb_SORT_12=1, msb_SORT_1=8, next_10_arg_1=6, next_9_arg_1=4, state_3=6, state_4=4, var_11=15, var_13=0, var_13_arg_0=4, var_13_arg_1=15, var_15=2, var_15_arg_0=2, var_16=3, var_17=0, var_17_arg_0=3, var_17_arg_1=3, var_18=0, var_18_arg_0=0, var_18_arg_1=2, var_2=1, var_7=4, var_7_arg_0=3, var_7_arg_1=1, var_8=6, var_8_arg_0=2, var_8_arg_1=3] [L61] SORT_1 var_17_arg_0 = state_4; [L62] SORT_1 var_17_arg_1 = var_16; [L63] SORT_12 var_17 = var_17_arg_0 > var_17_arg_1; [L64] SORT_1 var_15_arg_0 = state_3; [L65] SORT_12 var_15 = var_15_arg_0 >> 0; [L66] SORT_12 var_18_arg_0 = var_17; [L67] SORT_12 var_18_arg_1 = var_15; [L68] SORT_12 var_18 = var_18_arg_0 & var_18_arg_1; [L69] var_18 = var_18 & mask_SORT_12 [L70] SORT_12 bad_19_arg_0 = var_18; VAL [bad_14_arg_0=0, bad_19_arg_0=0, init_5_arg_1=1, init_6_arg_1=1, mask_SORT_12=1, mask_SORT_1=15, msb_SORT_12=1, msb_SORT_1=8, next_10_arg_1=6, next_9_arg_1=4, state_3=6, state_4=4, var_11=15, var_13=0, var_13_arg_0=4, var_13_arg_1=15, var_15=6, var_15_arg_0=6, var_16=3, var_17=1, var_17_arg_0=4, var_17_arg_1=3, var_18=0, var_18_arg_0=1, var_18_arg_1=6, var_2=1, var_7=4, var_7_arg_0=3, var_7_arg_1=1, var_8=6, var_8_arg_0=2, var_8_arg_1=3] [L71] CALL __VERIFIER_assert(!(bad_19_arg_0)) VAL [\old(cond)=1] [L29] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1] [L71] RET __VERIFIER_assert(!(bad_19_arg_0)) VAL [bad_14_arg_0=0, bad_19_arg_0=0, init_5_arg_1=1, init_6_arg_1=1, mask_SORT_12=1, mask_SORT_1=15, msb_SORT_12=1, msb_SORT_1=8, next_10_arg_1=6, next_9_arg_1=4, state_3=6, state_4=4, var_11=15, var_13=0, var_13_arg_0=4, var_13_arg_1=15, var_15=6, var_15_arg_0=6, var_16=3, var_17=1, var_17_arg_0=4, var_17_arg_1=3, var_18=0, var_18_arg_0=1, var_18_arg_1=6, var_2=1, var_7=4, var_7_arg_0=3, var_7_arg_1=1, var_8=6, var_8_arg_0=2, var_8_arg_1=3] [L73] SORT_1 var_7_arg_0 = state_4; [L74] SORT_1 var_7_arg_1 = var_2; [L75] SORT_1 var_7 = var_7_arg_0 + var_7_arg_1; [L76] var_7 = var_7 & mask_SORT_1 [L77] SORT_1 next_9_arg_1 = var_7; [L78] SORT_1 var_8_arg_0 = state_3; [L79] SORT_1 var_8_arg_1 = state_4; [L80] SORT_1 var_8 = var_8_arg_0 * var_8_arg_1; [L81] SORT_1 next_10_arg_1 = var_8; [L83] state_4 = next_9_arg_1 [L84] state_3 = next_10_arg_1 VAL [bad_14_arg_0=0, bad_19_arg_0=0, init_5_arg_1=1, init_6_arg_1=1, mask_SORT_12=1, mask_SORT_1=15, msb_SORT_12=1, msb_SORT_1=8, next_10_arg_1=24, next_9_arg_1=5, state_3=24, state_4=5, var_11=15, var_13=0, var_13_arg_0=4, var_13_arg_1=15, var_15=6, var_15_arg_0=6, var_16=3, var_17=1, var_17_arg_0=4, var_17_arg_1=3, var_18=0, var_18_arg_0=1, var_18_arg_1=6, var_2=1, var_7=5, var_7_arg_0=4, var_7_arg_1=1, var_8=24, var_8_arg_0=6, var_8_arg_1=4] [L56] SORT_1 var_13_arg_0 = state_4; [L57] SORT_1 var_13_arg_1 = var_11; [L58] SORT_12 var_13 = var_13_arg_0 == var_13_arg_1; [L59] SORT_12 bad_14_arg_0 = var_13; VAL [bad_14_arg_0=0, bad_19_arg_0=0, init_5_arg_1=1, init_6_arg_1=1, mask_SORT_12=1, mask_SORT_1=15, msb_SORT_12=1, msb_SORT_1=8, next_10_arg_1=24, next_9_arg_1=5, state_3=24, state_4=5, var_11=15, var_13=0, var_13_arg_0=5, var_13_arg_1=15, var_15=6, var_15_arg_0=6, var_16=3, var_17=1, var_17_arg_0=4, var_17_arg_1=3, var_18=0, var_18_arg_0=1, var_18_arg_1=6, var_2=1, var_7=5, var_7_arg_0=4, var_7_arg_1=1, var_8=24, var_8_arg_0=6, var_8_arg_1=4] [L60] CALL __VERIFIER_assert(!(bad_14_arg_0)) VAL [\old(cond)=1] [L29] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1] [L60] RET __VERIFIER_assert(!(bad_14_arg_0)) VAL [bad_14_arg_0=0, bad_19_arg_0=0, init_5_arg_1=1, init_6_arg_1=1, mask_SORT_12=1, mask_SORT_1=15, msb_SORT_12=1, msb_SORT_1=8, next_10_arg_1=24, next_9_arg_1=5, state_3=24, state_4=5, var_11=15, var_13=0, var_13_arg_0=5, var_13_arg_1=15, var_15=6, var_15_arg_0=6, var_16=3, var_17=1, var_17_arg_0=4, var_17_arg_1=3, var_18=0, var_18_arg_0=1, var_18_arg_1=6, var_2=1, var_7=5, var_7_arg_0=4, var_7_arg_1=1, var_8=24, var_8_arg_0=6, var_8_arg_1=4] [L61] SORT_1 var_17_arg_0 = state_4; [L62] SORT_1 var_17_arg_1 = var_16; [L63] SORT_12 var_17 = var_17_arg_0 > var_17_arg_1; [L64] SORT_1 var_15_arg_0 = state_3; [L65] SORT_12 var_15 = var_15_arg_0 >> 0; [L66] SORT_12 var_18_arg_0 = var_17; [L67] SORT_12 var_18_arg_1 = var_15; [L68] SORT_12 var_18 = var_18_arg_0 & var_18_arg_1; [L69] var_18 = var_18 & mask_SORT_12 [L70] SORT_12 bad_19_arg_0 = var_18; VAL [bad_14_arg_0=0, bad_19_arg_0=0, init_5_arg_1=1, init_6_arg_1=1, mask_SORT_12=1, mask_SORT_1=15, msb_SORT_12=1, msb_SORT_1=8, next_10_arg_1=24, next_9_arg_1=5, state_3=24, state_4=5, var_11=15, var_13=0, var_13_arg_0=5, var_13_arg_1=15, var_15=24, var_15_arg_0=24, var_16=3, var_17=1, var_17_arg_0=5, var_17_arg_1=3, var_18=0, var_18_arg_0=1, var_18_arg_1=24, var_2=1, var_7=5, var_7_arg_0=4, var_7_arg_1=1, var_8=24, var_8_arg_0=6, var_8_arg_1=4] [L71] CALL __VERIFIER_assert(!(bad_19_arg_0)) VAL [\old(cond)=1] [L29] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1] [L71] RET __VERIFIER_assert(!(bad_19_arg_0)) VAL [bad_14_arg_0=0, bad_19_arg_0=0, init_5_arg_1=1, init_6_arg_1=1, mask_SORT_12=1, mask_SORT_1=15, msb_SORT_12=1, msb_SORT_1=8, next_10_arg_1=24, next_9_arg_1=5, state_3=24, state_4=5, var_11=15, var_13=0, var_13_arg_0=5, var_13_arg_1=15, var_15=24, var_15_arg_0=24, var_16=3, var_17=1, var_17_arg_0=5, var_17_arg_1=3, var_18=0, var_18_arg_0=1, var_18_arg_1=24, var_2=1, var_7=5, var_7_arg_0=4, var_7_arg_1=1, var_8=24, var_8_arg_0=6, var_8_arg_1=4] [L73] SORT_1 var_7_arg_0 = state_4; [L74] SORT_1 var_7_arg_1 = var_2; [L75] SORT_1 var_7 = var_7_arg_0 + var_7_arg_1; [L76] var_7 = var_7 & mask_SORT_1 [L77] SORT_1 next_9_arg_1 = var_7; [L78] SORT_1 var_8_arg_0 = state_3; [L79] SORT_1 var_8_arg_1 = state_4; [L80] SORT_1 var_8 = var_8_arg_0 * var_8_arg_1; [L81] SORT_1 next_10_arg_1 = var_8; [L83] state_4 = next_9_arg_1 [L84] state_3 = next_10_arg_1 VAL [bad_14_arg_0=0, bad_19_arg_0=0, init_5_arg_1=1, init_6_arg_1=1, mask_SORT_12=1, mask_SORT_1=15, msb_SORT_12=1, msb_SORT_1=8, next_10_arg_1=120, next_9_arg_1=6, state_3=120, state_4=6, var_11=15, var_13=0, var_13_arg_0=5, var_13_arg_1=15, var_15=24, var_15_arg_0=24, var_16=3, var_17=1, var_17_arg_0=5, var_17_arg_1=3, var_18=0, var_18_arg_0=1, var_18_arg_1=24, var_2=1, var_7=6, var_7_arg_0=5, var_7_arg_1=1, var_8=120, var_8_arg_0=24, var_8_arg_1=5] [L56] SORT_1 var_13_arg_0 = state_4; [L57] SORT_1 var_13_arg_1 = var_11; [L58] SORT_12 var_13 = var_13_arg_0 == var_13_arg_1; [L59] SORT_12 bad_14_arg_0 = var_13; VAL [bad_14_arg_0=0, bad_19_arg_0=0, init_5_arg_1=1, init_6_arg_1=1, mask_SORT_12=1, mask_SORT_1=15, msb_SORT_12=1, msb_SORT_1=8, next_10_arg_1=120, next_9_arg_1=6, state_3=120, state_4=6, var_11=15, var_13=0, var_13_arg_0=6, var_13_arg_1=15, var_15=24, var_15_arg_0=24, var_16=3, var_17=1, var_17_arg_0=5, var_17_arg_1=3, var_18=0, var_18_arg_0=1, var_18_arg_1=24, var_2=1, var_7=6, var_7_arg_0=5, var_7_arg_1=1, var_8=120, var_8_arg_0=24, var_8_arg_1=5] [L60] CALL __VERIFIER_assert(!(bad_14_arg_0)) VAL [\old(cond)=1] [L29] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1] [L60] RET __VERIFIER_assert(!(bad_14_arg_0)) VAL [bad_14_arg_0=0, bad_19_arg_0=0, init_5_arg_1=1, init_6_arg_1=1, mask_SORT_12=1, mask_SORT_1=15, msb_SORT_12=1, msb_SORT_1=8, next_10_arg_1=120, next_9_arg_1=6, state_3=120, state_4=6, var_11=15, var_13=0, var_13_arg_0=6, var_13_arg_1=15, var_15=24, var_15_arg_0=24, var_16=3, var_17=1, var_17_arg_0=5, var_17_arg_1=3, var_18=0, var_18_arg_0=1, var_18_arg_1=24, var_2=1, var_7=6, var_7_arg_0=5, var_7_arg_1=1, var_8=120, var_8_arg_0=24, var_8_arg_1=5] [L61] SORT_1 var_17_arg_0 = state_4; [L62] SORT_1 var_17_arg_1 = var_16; [L63] SORT_12 var_17 = var_17_arg_0 > var_17_arg_1; [L64] SORT_1 var_15_arg_0 = state_3; [L65] SORT_12 var_15 = var_15_arg_0 >> 0; [L66] SORT_12 var_18_arg_0 = var_17; [L67] SORT_12 var_18_arg_1 = var_15; [L68] SORT_12 var_18 = var_18_arg_0 & var_18_arg_1; [L69] var_18 = var_18 & mask_SORT_12 [L70] SORT_12 bad_19_arg_0 = var_18; VAL [bad_14_arg_0=0, bad_19_arg_0=0, init_5_arg_1=1, init_6_arg_1=1, mask_SORT_12=1, mask_SORT_1=15, msb_SORT_12=1, msb_SORT_1=8, next_10_arg_1=120, next_9_arg_1=6, state_3=120, state_4=6, var_11=15, var_13=0, var_13_arg_0=6, var_13_arg_1=15, var_15=120, var_15_arg_0=120, var_16=3, var_17=1, var_17_arg_0=6, var_17_arg_1=3, var_18=0, var_18_arg_0=1, var_18_arg_1=120, var_2=1, var_7=6, var_7_arg_0=5, var_7_arg_1=1, var_8=120, var_8_arg_0=24, var_8_arg_1=5] [L71] CALL __VERIFIER_assert(!(bad_19_arg_0)) VAL [\old(cond)=1] [L29] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1] [L71] RET __VERIFIER_assert(!(bad_19_arg_0)) VAL [bad_14_arg_0=0, bad_19_arg_0=0, init_5_arg_1=1, init_6_arg_1=1, mask_SORT_12=1, mask_SORT_1=15, msb_SORT_12=1, msb_SORT_1=8, next_10_arg_1=120, next_9_arg_1=6, state_3=120, state_4=6, var_11=15, var_13=0, var_13_arg_0=6, var_13_arg_1=15, var_15=120, var_15_arg_0=120, var_16=3, var_17=1, var_17_arg_0=6, var_17_arg_1=3, var_18=0, var_18_arg_0=1, var_18_arg_1=120, var_2=1, var_7=6, var_7_arg_0=5, var_7_arg_1=1, var_8=120, var_8_arg_0=24, var_8_arg_1=5] [L73] SORT_1 var_7_arg_0 = state_4; [L74] SORT_1 var_7_arg_1 = var_2; [L75] SORT_1 var_7 = var_7_arg_0 + var_7_arg_1; [L76] var_7 = var_7 & mask_SORT_1 [L77] SORT_1 next_9_arg_1 = var_7; [L78] SORT_1 var_8_arg_0 = state_3; [L79] SORT_1 var_8_arg_1 = state_4; [L80] SORT_1 var_8 = var_8_arg_0 * var_8_arg_1; [L81] SORT_1 next_10_arg_1 = var_8; [L83] state_4 = next_9_arg_1 [L84] state_3 = next_10_arg_1 VAL [bad_14_arg_0=0, bad_19_arg_0=0, init_5_arg_1=1, init_6_arg_1=1, mask_SORT_12=1, mask_SORT_1=15, msb_SORT_12=1, msb_SORT_1=8, next_10_arg_1=208, next_9_arg_1=7, state_3=208, state_4=7, var_11=15, var_13=0, var_13_arg_0=6, var_13_arg_1=15, var_15=120, var_15_arg_0=120, var_16=3, var_17=1, var_17_arg_0=6, var_17_arg_1=3, var_18=0, var_18_arg_0=1, var_18_arg_1=120, var_2=1, var_7=7, var_7_arg_0=6, var_7_arg_1=1, var_8=208, var_8_arg_0=120, var_8_arg_1=6] [L56] SORT_1 var_13_arg_0 = state_4; [L57] SORT_1 var_13_arg_1 = var_11; [L58] SORT_12 var_13 = var_13_arg_0 == var_13_arg_1; [L59] SORT_12 bad_14_arg_0 = var_13; VAL [bad_14_arg_0=0, bad_19_arg_0=0, init_5_arg_1=1, init_6_arg_1=1, mask_SORT_12=1, mask_SORT_1=15, msb_SORT_12=1, msb_SORT_1=8, next_10_arg_1=208, next_9_arg_1=7, state_3=208, state_4=7, var_11=15, var_13=0, var_13_arg_0=7, var_13_arg_1=15, var_15=120, var_15_arg_0=120, var_16=3, var_17=1, var_17_arg_0=6, var_17_arg_1=3, var_18=0, var_18_arg_0=1, var_18_arg_1=120, var_2=1, var_7=7, var_7_arg_0=6, var_7_arg_1=1, var_8=208, var_8_arg_0=120, var_8_arg_1=6] [L60] CALL __VERIFIER_assert(!(bad_14_arg_0)) VAL [\old(cond)=1] [L29] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1] [L60] RET __VERIFIER_assert(!(bad_14_arg_0)) VAL [bad_14_arg_0=0, bad_19_arg_0=0, init_5_arg_1=1, init_6_arg_1=1, mask_SORT_12=1, mask_SORT_1=15, msb_SORT_12=1, msb_SORT_1=8, next_10_arg_1=208, next_9_arg_1=7, state_3=208, state_4=7, var_11=15, var_13=0, var_13_arg_0=7, var_13_arg_1=15, var_15=120, var_15_arg_0=120, var_16=3, var_17=1, var_17_arg_0=6, var_17_arg_1=3, var_18=0, var_18_arg_0=1, var_18_arg_1=120, var_2=1, var_7=7, var_7_arg_0=6, var_7_arg_1=1, var_8=208, var_8_arg_0=120, var_8_arg_1=6] [L61] SORT_1 var_17_arg_0 = state_4; [L62] SORT_1 var_17_arg_1 = var_16; [L63] SORT_12 var_17 = var_17_arg_0 > var_17_arg_1; [L64] SORT_1 var_15_arg_0 = state_3; [L65] SORT_12 var_15 = var_15_arg_0 >> 0; [L66] SORT_12 var_18_arg_0 = var_17; [L67] SORT_12 var_18_arg_1 = var_15; [L68] SORT_12 var_18 = var_18_arg_0 & var_18_arg_1; [L69] var_18 = var_18 & mask_SORT_12 [L70] SORT_12 bad_19_arg_0 = var_18; VAL [bad_14_arg_0=0, bad_19_arg_0=0, init_5_arg_1=1, init_6_arg_1=1, mask_SORT_12=1, mask_SORT_1=15, msb_SORT_12=1, msb_SORT_1=8, next_10_arg_1=208, next_9_arg_1=7, state_3=208, state_4=7, var_11=15, var_13=0, var_13_arg_0=7, var_13_arg_1=15, var_15=208, var_15_arg_0=208, var_16=3, var_17=1, var_17_arg_0=7, var_17_arg_1=3, var_18=0, var_18_arg_0=1, var_18_arg_1=208, var_2=1, var_7=7, var_7_arg_0=6, var_7_arg_1=1, var_8=208, var_8_arg_0=120, var_8_arg_1=6] [L71] CALL __VERIFIER_assert(!(bad_19_arg_0)) VAL [\old(cond)=1] [L29] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1] [L71] RET __VERIFIER_assert(!(bad_19_arg_0)) VAL [bad_14_arg_0=0, bad_19_arg_0=0, init_5_arg_1=1, init_6_arg_1=1, mask_SORT_12=1, mask_SORT_1=15, msb_SORT_12=1, msb_SORT_1=8, next_10_arg_1=208, next_9_arg_1=7, state_3=208, state_4=7, var_11=15, var_13=0, var_13_arg_0=7, var_13_arg_1=15, var_15=208, var_15_arg_0=208, var_16=3, var_17=1, var_17_arg_0=7, var_17_arg_1=3, var_18=0, var_18_arg_0=1, var_18_arg_1=208, var_2=1, var_7=7, var_7_arg_0=6, var_7_arg_1=1, var_8=208, var_8_arg_0=120, var_8_arg_1=6] [L73] SORT_1 var_7_arg_0 = state_4; [L74] SORT_1 var_7_arg_1 = var_2; [L75] SORT_1 var_7 = var_7_arg_0 + var_7_arg_1; [L76] var_7 = var_7 & mask_SORT_1 [L77] SORT_1 next_9_arg_1 = var_7; [L78] SORT_1 var_8_arg_0 = state_3; [L79] SORT_1 var_8_arg_1 = state_4; [L80] SORT_1 var_8 = var_8_arg_0 * var_8_arg_1; [L81] SORT_1 next_10_arg_1 = var_8; [L83] state_4 = next_9_arg_1 [L84] state_3 = next_10_arg_1 VAL [bad_14_arg_0=0, bad_19_arg_0=0, init_5_arg_1=1, init_6_arg_1=1, mask_SORT_12=1, mask_SORT_1=15, msb_SORT_12=1, msb_SORT_1=8, next_10_arg_1=176, next_9_arg_1=8, state_3=176, state_4=8, var_11=15, var_13=0, var_13_arg_0=7, var_13_arg_1=15, var_15=208, var_15_arg_0=208, var_16=3, var_17=1, var_17_arg_0=7, var_17_arg_1=3, var_18=0, var_18_arg_0=1, var_18_arg_1=208, var_2=1, var_7=8, var_7_arg_0=7, var_7_arg_1=1, var_8=176, var_8_arg_0=208, var_8_arg_1=7] [L56] SORT_1 var_13_arg_0 = state_4; [L57] SORT_1 var_13_arg_1 = var_11; [L58] SORT_12 var_13 = var_13_arg_0 == var_13_arg_1; [L59] SORT_12 bad_14_arg_0 = var_13; VAL [bad_14_arg_0=0, bad_19_arg_0=0, init_5_arg_1=1, init_6_arg_1=1, mask_SORT_12=1, mask_SORT_1=15, msb_SORT_12=1, msb_SORT_1=8, next_10_arg_1=176, next_9_arg_1=8, state_3=176, state_4=8, var_11=15, var_13=0, var_13_arg_0=8, var_13_arg_1=15, var_15=208, var_15_arg_0=208, var_16=3, var_17=1, var_17_arg_0=7, var_17_arg_1=3, var_18=0, var_18_arg_0=1, var_18_arg_1=208, var_2=1, var_7=8, var_7_arg_0=7, var_7_arg_1=1, var_8=176, var_8_arg_0=208, var_8_arg_1=7] [L60] CALL __VERIFIER_assert(!(bad_14_arg_0)) VAL [\old(cond)=1] [L29] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1] [L60] RET __VERIFIER_assert(!(bad_14_arg_0)) VAL [bad_14_arg_0=0, bad_19_arg_0=0, init_5_arg_1=1, init_6_arg_1=1, mask_SORT_12=1, mask_SORT_1=15, msb_SORT_12=1, msb_SORT_1=8, next_10_arg_1=176, next_9_arg_1=8, state_3=176, state_4=8, var_11=15, var_13=0, var_13_arg_0=8, var_13_arg_1=15, var_15=208, var_15_arg_0=208, var_16=3, var_17=1, var_17_arg_0=7, var_17_arg_1=3, var_18=0, var_18_arg_0=1, var_18_arg_1=208, var_2=1, var_7=8, var_7_arg_0=7, var_7_arg_1=1, var_8=176, var_8_arg_0=208, var_8_arg_1=7] [L61] SORT_1 var_17_arg_0 = state_4; [L62] SORT_1 var_17_arg_1 = var_16; [L63] SORT_12 var_17 = var_17_arg_0 > var_17_arg_1; [L64] SORT_1 var_15_arg_0 = state_3; [L65] SORT_12 var_15 = var_15_arg_0 >> 0; [L66] SORT_12 var_18_arg_0 = var_17; [L67] SORT_12 var_18_arg_1 = var_15; [L68] SORT_12 var_18 = var_18_arg_0 & var_18_arg_1; [L69] var_18 = var_18 & mask_SORT_12 [L70] SORT_12 bad_19_arg_0 = var_18; VAL [bad_14_arg_0=0, bad_19_arg_0=0, init_5_arg_1=1, init_6_arg_1=1, mask_SORT_12=1, mask_SORT_1=15, msb_SORT_12=1, msb_SORT_1=8, next_10_arg_1=176, next_9_arg_1=8, state_3=176, state_4=8, var_11=15, var_13=0, var_13_arg_0=8, var_13_arg_1=15, var_15=176, var_15_arg_0=176, var_16=3, var_17=1, var_17_arg_0=8, var_17_arg_1=3, var_18=0, var_18_arg_0=1, var_18_arg_1=176, var_2=1, var_7=8, var_7_arg_0=7, var_7_arg_1=1, var_8=176, var_8_arg_0=208, var_8_arg_1=7] [L71] CALL __VERIFIER_assert(!(bad_19_arg_0)) VAL [\old(cond)=1] [L29] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1] [L71] RET __VERIFIER_assert(!(bad_19_arg_0)) VAL [bad_14_arg_0=0, bad_19_arg_0=0, init_5_arg_1=1, init_6_arg_1=1, mask_SORT_12=1, mask_SORT_1=15, msb_SORT_12=1, msb_SORT_1=8, next_10_arg_1=176, next_9_arg_1=8, state_3=176, state_4=8, var_11=15, var_13=0, var_13_arg_0=8, var_13_arg_1=15, var_15=176, var_15_arg_0=176, var_16=3, var_17=1, var_17_arg_0=8, var_17_arg_1=3, var_18=0, var_18_arg_0=1, var_18_arg_1=176, var_2=1, var_7=8, var_7_arg_0=7, var_7_arg_1=1, var_8=176, var_8_arg_0=208, var_8_arg_1=7] [L73] SORT_1 var_7_arg_0 = state_4; [L74] SORT_1 var_7_arg_1 = var_2; [L75] SORT_1 var_7 = var_7_arg_0 + var_7_arg_1; [L76] var_7 = var_7 & mask_SORT_1 [L77] SORT_1 next_9_arg_1 = var_7; [L78] SORT_1 var_8_arg_0 = state_3; [L79] SORT_1 var_8_arg_1 = state_4; [L80] SORT_1 var_8 = var_8_arg_0 * var_8_arg_1; [L81] SORT_1 next_10_arg_1 = var_8; [L83] state_4 = next_9_arg_1 [L84] state_3 = next_10_arg_1 VAL [bad_14_arg_0=0, bad_19_arg_0=0, init_5_arg_1=1, init_6_arg_1=1, mask_SORT_12=1, mask_SORT_1=15, msb_SORT_12=1, msb_SORT_1=8, next_10_arg_1=128, next_9_arg_1=9, state_3=128, state_4=9, var_11=15, var_13=0, var_13_arg_0=8, var_13_arg_1=15, var_15=176, var_15_arg_0=176, var_16=3, var_17=1, var_17_arg_0=8, var_17_arg_1=3, var_18=0, var_18_arg_0=1, var_18_arg_1=176, var_2=1, var_7=9, var_7_arg_0=8, var_7_arg_1=1, var_8=128, var_8_arg_0=176, var_8_arg_1=8] [L56] SORT_1 var_13_arg_0 = state_4; [L57] SORT_1 var_13_arg_1 = var_11; [L58] SORT_12 var_13 = var_13_arg_0 == var_13_arg_1; [L59] SORT_12 bad_14_arg_0 = var_13; VAL [bad_14_arg_0=0, bad_19_arg_0=0, init_5_arg_1=1, init_6_arg_1=1, mask_SORT_12=1, mask_SORT_1=15, msb_SORT_12=1, msb_SORT_1=8, next_10_arg_1=128, next_9_arg_1=9, state_3=128, state_4=9, var_11=15, var_13=0, var_13_arg_0=9, var_13_arg_1=15, var_15=176, var_15_arg_0=176, var_16=3, var_17=1, var_17_arg_0=8, var_17_arg_1=3, var_18=0, var_18_arg_0=1, var_18_arg_1=176, var_2=1, var_7=9, var_7_arg_0=8, var_7_arg_1=1, var_8=128, var_8_arg_0=176, var_8_arg_1=8] [L60] CALL __VERIFIER_assert(!(bad_14_arg_0)) VAL [\old(cond)=1] [L29] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1] [L60] RET __VERIFIER_assert(!(bad_14_arg_0)) VAL [bad_14_arg_0=0, bad_19_arg_0=0, init_5_arg_1=1, init_6_arg_1=1, mask_SORT_12=1, mask_SORT_1=15, msb_SORT_12=1, msb_SORT_1=8, next_10_arg_1=128, next_9_arg_1=9, state_3=128, state_4=9, var_11=15, var_13=0, var_13_arg_0=9, var_13_arg_1=15, var_15=176, var_15_arg_0=176, var_16=3, var_17=1, var_17_arg_0=8, var_17_arg_1=3, var_18=0, var_18_arg_0=1, var_18_arg_1=176, var_2=1, var_7=9, var_7_arg_0=8, var_7_arg_1=1, var_8=128, var_8_arg_0=176, var_8_arg_1=8] [L61] SORT_1 var_17_arg_0 = state_4; [L62] SORT_1 var_17_arg_1 = var_16; [L63] SORT_12 var_17 = var_17_arg_0 > var_17_arg_1; [L64] SORT_1 var_15_arg_0 = state_3; [L65] SORT_12 var_15 = var_15_arg_0 >> 0; [L66] SORT_12 var_18_arg_0 = var_17; [L67] SORT_12 var_18_arg_1 = var_15; [L68] SORT_12 var_18 = var_18_arg_0 & var_18_arg_1; [L69] var_18 = var_18 & mask_SORT_12 [L70] SORT_12 bad_19_arg_0 = var_18; VAL [bad_14_arg_0=0, bad_19_arg_0=0, init_5_arg_1=1, init_6_arg_1=1, mask_SORT_12=1, mask_SORT_1=15, msb_SORT_12=1, msb_SORT_1=8, next_10_arg_1=128, next_9_arg_1=9, state_3=128, state_4=9, var_11=15, var_13=0, var_13_arg_0=9, var_13_arg_1=15, var_15=128, var_15_arg_0=128, var_16=3, var_17=1, var_17_arg_0=9, var_17_arg_1=3, var_18=0, var_18_arg_0=1, var_18_arg_1=128, var_2=1, var_7=9, var_7_arg_0=8, var_7_arg_1=1, var_8=128, var_8_arg_0=176, var_8_arg_1=8] [L71] CALL __VERIFIER_assert(!(bad_19_arg_0)) VAL [\old(cond)=1] [L29] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1] [L71] RET __VERIFIER_assert(!(bad_19_arg_0)) VAL [bad_14_arg_0=0, bad_19_arg_0=0, init_5_arg_1=1, init_6_arg_1=1, mask_SORT_12=1, mask_SORT_1=15, msb_SORT_12=1, msb_SORT_1=8, next_10_arg_1=128, next_9_arg_1=9, state_3=128, state_4=9, var_11=15, var_13=0, var_13_arg_0=9, var_13_arg_1=15, var_15=128, var_15_arg_0=128, var_16=3, var_17=1, var_17_arg_0=9, var_17_arg_1=3, var_18=0, var_18_arg_0=1, var_18_arg_1=128, var_2=1, var_7=9, var_7_arg_0=8, var_7_arg_1=1, var_8=128, var_8_arg_0=176, var_8_arg_1=8] [L73] SORT_1 var_7_arg_0 = state_4; [L74] SORT_1 var_7_arg_1 = var_2; [L75] SORT_1 var_7 = var_7_arg_0 + var_7_arg_1; [L76] var_7 = var_7 & mask_SORT_1 [L77] SORT_1 next_9_arg_1 = var_7; [L78] SORT_1 var_8_arg_0 = state_3; [L79] SORT_1 var_8_arg_1 = state_4; [L80] SORT_1 var_8 = var_8_arg_0 * var_8_arg_1; [L81] SORT_1 next_10_arg_1 = var_8; [L83] state_4 = next_9_arg_1 [L84] state_3 = next_10_arg_1 VAL [bad_14_arg_0=0, bad_19_arg_0=0, init_5_arg_1=1, init_6_arg_1=1, mask_SORT_12=1, mask_SORT_1=15, msb_SORT_12=1, msb_SORT_1=8, next_10_arg_1=128, next_9_arg_1=10, state_3=128, state_4=10, var_11=15, var_13=0, var_13_arg_0=9, var_13_arg_1=15, var_15=128, var_15_arg_0=128, var_16=3, var_17=1, var_17_arg_0=9, var_17_arg_1=3, var_18=0, var_18_arg_0=1, var_18_arg_1=128, var_2=1, var_7=10, var_7_arg_0=9, var_7_arg_1=1, var_8=128, var_8_arg_0=128, var_8_arg_1=9] [L56] SORT_1 var_13_arg_0 = state_4; [L57] SORT_1 var_13_arg_1 = var_11; [L58] SORT_12 var_13 = var_13_arg_0 == var_13_arg_1; [L59] SORT_12 bad_14_arg_0 = var_13; VAL [bad_14_arg_0=0, bad_19_arg_0=0, init_5_arg_1=1, init_6_arg_1=1, mask_SORT_12=1, mask_SORT_1=15, msb_SORT_12=1, msb_SORT_1=8, next_10_arg_1=128, next_9_arg_1=10, state_3=128, state_4=10, var_11=15, var_13=0, var_13_arg_0=10, var_13_arg_1=15, var_15=128, var_15_arg_0=128, var_16=3, var_17=1, var_17_arg_0=9, var_17_arg_1=3, var_18=0, var_18_arg_0=1, var_18_arg_1=128, var_2=1, var_7=10, var_7_arg_0=9, var_7_arg_1=1, var_8=128, var_8_arg_0=128, var_8_arg_1=9] [L60] CALL __VERIFIER_assert(!(bad_14_arg_0)) VAL [\old(cond)=1] [L29] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1] [L60] RET __VERIFIER_assert(!(bad_14_arg_0)) VAL [bad_14_arg_0=0, bad_19_arg_0=0, init_5_arg_1=1, init_6_arg_1=1, mask_SORT_12=1, mask_SORT_1=15, msb_SORT_12=1, msb_SORT_1=8, next_10_arg_1=128, next_9_arg_1=10, state_3=128, state_4=10, var_11=15, var_13=0, var_13_arg_0=10, var_13_arg_1=15, var_15=128, var_15_arg_0=128, var_16=3, var_17=1, var_17_arg_0=9, var_17_arg_1=3, var_18=0, var_18_arg_0=1, var_18_arg_1=128, var_2=1, var_7=10, var_7_arg_0=9, var_7_arg_1=1, var_8=128, var_8_arg_0=128, var_8_arg_1=9] [L61] SORT_1 var_17_arg_0 = state_4; [L62] SORT_1 var_17_arg_1 = var_16; [L63] SORT_12 var_17 = var_17_arg_0 > var_17_arg_1; [L64] SORT_1 var_15_arg_0 = state_3; [L65] SORT_12 var_15 = var_15_arg_0 >> 0; [L66] SORT_12 var_18_arg_0 = var_17; [L67] SORT_12 var_18_arg_1 = var_15; [L68] SORT_12 var_18 = var_18_arg_0 & var_18_arg_1; [L69] var_18 = var_18 & mask_SORT_12 [L70] SORT_12 bad_19_arg_0 = var_18; VAL [bad_14_arg_0=0, bad_19_arg_0=0, init_5_arg_1=1, init_6_arg_1=1, mask_SORT_12=1, mask_SORT_1=15, msb_SORT_12=1, msb_SORT_1=8, next_10_arg_1=128, next_9_arg_1=10, state_3=128, state_4=10, var_11=15, var_13=0, var_13_arg_0=10, var_13_arg_1=15, var_15=128, var_15_arg_0=128, var_16=3, var_17=1, var_17_arg_0=10, var_17_arg_1=3, var_18=0, var_18_arg_0=1, var_18_arg_1=128, var_2=1, var_7=10, var_7_arg_0=9, var_7_arg_1=1, var_8=128, var_8_arg_0=128, var_8_arg_1=9] [L71] CALL __VERIFIER_assert(!(bad_19_arg_0)) VAL [\old(cond)=1] [L29] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1] [L71] RET __VERIFIER_assert(!(bad_19_arg_0)) VAL [bad_14_arg_0=0, bad_19_arg_0=0, init_5_arg_1=1, init_6_arg_1=1, mask_SORT_12=1, mask_SORT_1=15, msb_SORT_12=1, msb_SORT_1=8, next_10_arg_1=128, next_9_arg_1=10, state_3=128, state_4=10, var_11=15, var_13=0, var_13_arg_0=10, var_13_arg_1=15, var_15=128, var_15_arg_0=128, var_16=3, var_17=1, var_17_arg_0=10, var_17_arg_1=3, var_18=0, var_18_arg_0=1, var_18_arg_1=128, var_2=1, var_7=10, var_7_arg_0=9, var_7_arg_1=1, var_8=128, var_8_arg_0=128, var_8_arg_1=9] [L73] SORT_1 var_7_arg_0 = state_4; [L74] SORT_1 var_7_arg_1 = var_2; [L75] SORT_1 var_7 = var_7_arg_0 + var_7_arg_1; [L76] var_7 = var_7 & mask_SORT_1 [L77] SORT_1 next_9_arg_1 = var_7; [L78] SORT_1 var_8_arg_0 = state_3; [L79] SORT_1 var_8_arg_1 = state_4; [L80] SORT_1 var_8 = var_8_arg_0 * var_8_arg_1; [L81] SORT_1 next_10_arg_1 = var_8; [L83] state_4 = next_9_arg_1 [L84] state_3 = next_10_arg_1 VAL [bad_14_arg_0=0, bad_19_arg_0=0, init_5_arg_1=1, init_6_arg_1=1, mask_SORT_12=1, mask_SORT_1=15, msb_SORT_12=1, msb_SORT_1=8, next_10_arg_1=0, next_9_arg_1=11, state_3=0, state_4=11, var_11=15, var_13=0, var_13_arg_0=10, var_13_arg_1=15, var_15=128, var_15_arg_0=128, var_16=3, var_17=1, var_17_arg_0=10, var_17_arg_1=3, var_18=0, var_18_arg_0=1, var_18_arg_1=128, var_2=1, var_7=11, var_7_arg_0=10, var_7_arg_1=1, var_8=0, var_8_arg_0=128, var_8_arg_1=10] [L56] SORT_1 var_13_arg_0 = state_4; [L57] SORT_1 var_13_arg_1 = var_11; [L58] SORT_12 var_13 = var_13_arg_0 == var_13_arg_1; [L59] SORT_12 bad_14_arg_0 = var_13; VAL [bad_14_arg_0=0, bad_19_arg_0=0, init_5_arg_1=1, init_6_arg_1=1, mask_SORT_12=1, mask_SORT_1=15, msb_SORT_12=1, msb_SORT_1=8, next_10_arg_1=0, next_9_arg_1=11, state_3=0, state_4=11, var_11=15, var_13=0, var_13_arg_0=11, var_13_arg_1=15, var_15=128, var_15_arg_0=128, var_16=3, var_17=1, var_17_arg_0=10, var_17_arg_1=3, var_18=0, var_18_arg_0=1, var_18_arg_1=128, var_2=1, var_7=11, var_7_arg_0=10, var_7_arg_1=1, var_8=0, var_8_arg_0=128, var_8_arg_1=10] [L60] CALL __VERIFIER_assert(!(bad_14_arg_0)) VAL [\old(cond)=1] [L29] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1] [L60] RET __VERIFIER_assert(!(bad_14_arg_0)) VAL [bad_14_arg_0=0, bad_19_arg_0=0, init_5_arg_1=1, init_6_arg_1=1, mask_SORT_12=1, mask_SORT_1=15, msb_SORT_12=1, msb_SORT_1=8, next_10_arg_1=0, next_9_arg_1=11, state_3=0, state_4=11, var_11=15, var_13=0, var_13_arg_0=11, var_13_arg_1=15, var_15=128, var_15_arg_0=128, var_16=3, var_17=1, var_17_arg_0=10, var_17_arg_1=3, var_18=0, var_18_arg_0=1, var_18_arg_1=128, var_2=1, var_7=11, var_7_arg_0=10, var_7_arg_1=1, var_8=0, var_8_arg_0=128, var_8_arg_1=10] [L61] SORT_1 var_17_arg_0 = state_4; [L62] SORT_1 var_17_arg_1 = var_16; [L63] SORT_12 var_17 = var_17_arg_0 > var_17_arg_1; [L64] SORT_1 var_15_arg_0 = state_3; [L65] SORT_12 var_15 = var_15_arg_0 >> 0; [L66] SORT_12 var_18_arg_0 = var_17; [L67] SORT_12 var_18_arg_1 = var_15; [L68] SORT_12 var_18 = var_18_arg_0 & var_18_arg_1; [L69] var_18 = var_18 & mask_SORT_12 [L70] SORT_12 bad_19_arg_0 = var_18; VAL [bad_14_arg_0=0, bad_19_arg_0=0, init_5_arg_1=1, init_6_arg_1=1, mask_SORT_12=1, mask_SORT_1=15, msb_SORT_12=1, msb_SORT_1=8, next_10_arg_1=0, next_9_arg_1=11, state_3=0, state_4=11, var_11=15, var_13=0, var_13_arg_0=11, var_13_arg_1=15, var_15=0, var_15_arg_0=0, var_16=3, var_17=1, var_17_arg_0=11, var_17_arg_1=3, var_18=0, var_18_arg_0=1, var_18_arg_1=0, var_2=1, var_7=11, var_7_arg_0=10, var_7_arg_1=1, var_8=0, var_8_arg_0=128, var_8_arg_1=10] [L71] CALL __VERIFIER_assert(!(bad_19_arg_0)) VAL [\old(cond)=1] [L29] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1] [L71] RET __VERIFIER_assert(!(bad_19_arg_0)) VAL [bad_14_arg_0=0, bad_19_arg_0=0, init_5_arg_1=1, init_6_arg_1=1, mask_SORT_12=1, mask_SORT_1=15, msb_SORT_12=1, msb_SORT_1=8, next_10_arg_1=0, next_9_arg_1=11, state_3=0, state_4=11, var_11=15, var_13=0, var_13_arg_0=11, var_13_arg_1=15, var_15=0, var_15_arg_0=0, var_16=3, var_17=1, var_17_arg_0=11, var_17_arg_1=3, var_18=0, var_18_arg_0=1, var_18_arg_1=0, var_2=1, var_7=11, var_7_arg_0=10, var_7_arg_1=1, var_8=0, var_8_arg_0=128, var_8_arg_1=10] [L73] SORT_1 var_7_arg_0 = state_4; [L74] SORT_1 var_7_arg_1 = var_2; [L75] SORT_1 var_7 = var_7_arg_0 + var_7_arg_1; [L76] var_7 = var_7 & mask_SORT_1 [L77] SORT_1 next_9_arg_1 = var_7; [L78] SORT_1 var_8_arg_0 = state_3; [L79] SORT_1 var_8_arg_1 = state_4; [L80] SORT_1 var_8 = var_8_arg_0 * var_8_arg_1; [L81] SORT_1 next_10_arg_1 = var_8; [L83] state_4 = next_9_arg_1 [L84] state_3 = next_10_arg_1 VAL [bad_14_arg_0=0, bad_19_arg_0=0, init_5_arg_1=1, init_6_arg_1=1, mask_SORT_12=1, mask_SORT_1=15, msb_SORT_12=1, msb_SORT_1=8, next_10_arg_1=0, next_9_arg_1=12, state_3=0, state_4=12, var_11=15, var_13=0, var_13_arg_0=11, var_13_arg_1=15, var_15=0, var_15_arg_0=0, var_16=3, var_17=1, var_17_arg_0=11, var_17_arg_1=3, var_18=0, var_18_arg_0=1, var_18_arg_1=0, var_2=1, var_7=12, var_7_arg_0=11, var_7_arg_1=1, var_8=0, var_8_arg_0=0, var_8_arg_1=11] [L56] SORT_1 var_13_arg_0 = state_4; [L57] SORT_1 var_13_arg_1 = var_11; [L58] SORT_12 var_13 = var_13_arg_0 == var_13_arg_1; [L59] SORT_12 bad_14_arg_0 = var_13; VAL [bad_14_arg_0=0, bad_19_arg_0=0, init_5_arg_1=1, init_6_arg_1=1, mask_SORT_12=1, mask_SORT_1=15, msb_SORT_12=1, msb_SORT_1=8, next_10_arg_1=0, next_9_arg_1=12, state_3=0, state_4=12, var_11=15, var_13=0, var_13_arg_0=12, var_13_arg_1=15, var_15=0, var_15_arg_0=0, var_16=3, var_17=1, var_17_arg_0=11, var_17_arg_1=3, var_18=0, var_18_arg_0=1, var_18_arg_1=0, var_2=1, var_7=12, var_7_arg_0=11, var_7_arg_1=1, var_8=0, var_8_arg_0=0, var_8_arg_1=11] [L60] CALL __VERIFIER_assert(!(bad_14_arg_0)) VAL [\old(cond)=1] [L29] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1] [L60] RET __VERIFIER_assert(!(bad_14_arg_0)) VAL [bad_14_arg_0=0, bad_19_arg_0=0, init_5_arg_1=1, init_6_arg_1=1, mask_SORT_12=1, mask_SORT_1=15, msb_SORT_12=1, msb_SORT_1=8, next_10_arg_1=0, next_9_arg_1=12, state_3=0, state_4=12, var_11=15, var_13=0, var_13_arg_0=12, var_13_arg_1=15, var_15=0, var_15_arg_0=0, var_16=3, var_17=1, var_17_arg_0=11, var_17_arg_1=3, var_18=0, var_18_arg_0=1, var_18_arg_1=0, var_2=1, var_7=12, var_7_arg_0=11, var_7_arg_1=1, var_8=0, var_8_arg_0=0, var_8_arg_1=11] [L61] SORT_1 var_17_arg_0 = state_4; [L62] SORT_1 var_17_arg_1 = var_16; [L63] SORT_12 var_17 = var_17_arg_0 > var_17_arg_1; [L64] SORT_1 var_15_arg_0 = state_3; [L65] SORT_12 var_15 = var_15_arg_0 >> 0; [L66] SORT_12 var_18_arg_0 = var_17; [L67] SORT_12 var_18_arg_1 = var_15; [L68] SORT_12 var_18 = var_18_arg_0 & var_18_arg_1; [L69] var_18 = var_18 & mask_SORT_12 [L70] SORT_12 bad_19_arg_0 = var_18; VAL [bad_14_arg_0=0, bad_19_arg_0=0, init_5_arg_1=1, init_6_arg_1=1, mask_SORT_12=1, mask_SORT_1=15, msb_SORT_12=1, msb_SORT_1=8, next_10_arg_1=0, next_9_arg_1=12, state_3=0, state_4=12, var_11=15, var_13=0, var_13_arg_0=12, var_13_arg_1=15, var_15=0, var_15_arg_0=0, var_16=3, var_17=1, var_17_arg_0=12, var_17_arg_1=3, var_18=0, var_18_arg_0=1, var_18_arg_1=0, var_2=1, var_7=12, var_7_arg_0=11, var_7_arg_1=1, var_8=0, var_8_arg_0=0, var_8_arg_1=11] [L71] CALL __VERIFIER_assert(!(bad_19_arg_0)) VAL [\old(cond)=1] [L29] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1] [L71] RET __VERIFIER_assert(!(bad_19_arg_0)) VAL [bad_14_arg_0=0, bad_19_arg_0=0, init_5_arg_1=1, init_6_arg_1=1, mask_SORT_12=1, mask_SORT_1=15, msb_SORT_12=1, msb_SORT_1=8, next_10_arg_1=0, next_9_arg_1=12, state_3=0, state_4=12, var_11=15, var_13=0, var_13_arg_0=12, var_13_arg_1=15, var_15=0, var_15_arg_0=0, var_16=3, var_17=1, var_17_arg_0=12, var_17_arg_1=3, var_18=0, var_18_arg_0=1, var_18_arg_1=0, var_2=1, var_7=12, var_7_arg_0=11, var_7_arg_1=1, var_8=0, var_8_arg_0=0, var_8_arg_1=11] [L73] SORT_1 var_7_arg_0 = state_4; [L74] SORT_1 var_7_arg_1 = var_2; [L75] SORT_1 var_7 = var_7_arg_0 + var_7_arg_1; [L76] var_7 = var_7 & mask_SORT_1 [L77] SORT_1 next_9_arg_1 = var_7; [L78] SORT_1 var_8_arg_0 = state_3; [L79] SORT_1 var_8_arg_1 = state_4; [L80] SORT_1 var_8 = var_8_arg_0 * var_8_arg_1; [L81] SORT_1 next_10_arg_1 = var_8; [L83] state_4 = next_9_arg_1 [L84] state_3 = next_10_arg_1 VAL [bad_14_arg_0=0, bad_19_arg_0=0, init_5_arg_1=1, init_6_arg_1=1, mask_SORT_12=1, mask_SORT_1=15, msb_SORT_12=1, msb_SORT_1=8, next_10_arg_1=0, next_9_arg_1=13, state_3=0, state_4=13, var_11=15, var_13=0, var_13_arg_0=12, var_13_arg_1=15, var_15=0, var_15_arg_0=0, var_16=3, var_17=1, var_17_arg_0=12, var_17_arg_1=3, var_18=0, var_18_arg_0=1, var_18_arg_1=0, var_2=1, var_7=13, var_7_arg_0=12, var_7_arg_1=1, var_8=0, var_8_arg_0=0, var_8_arg_1=12] [L56] SORT_1 var_13_arg_0 = state_4; [L57] SORT_1 var_13_arg_1 = var_11; [L58] SORT_12 var_13 = var_13_arg_0 == var_13_arg_1; [L59] SORT_12 bad_14_arg_0 = var_13; VAL [bad_14_arg_0=0, bad_19_arg_0=0, init_5_arg_1=1, init_6_arg_1=1, mask_SORT_12=1, mask_SORT_1=15, msb_SORT_12=1, msb_SORT_1=8, next_10_arg_1=0, next_9_arg_1=13, state_3=0, state_4=13, var_11=15, var_13=0, var_13_arg_0=13, var_13_arg_1=15, var_15=0, var_15_arg_0=0, var_16=3, var_17=1, var_17_arg_0=12, var_17_arg_1=3, var_18=0, var_18_arg_0=1, var_18_arg_1=0, var_2=1, var_7=13, var_7_arg_0=12, var_7_arg_1=1, var_8=0, var_8_arg_0=0, var_8_arg_1=12] [L60] CALL __VERIFIER_assert(!(bad_14_arg_0)) VAL [\old(cond)=1] [L29] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1] [L60] RET __VERIFIER_assert(!(bad_14_arg_0)) VAL [bad_14_arg_0=0, bad_19_arg_0=0, init_5_arg_1=1, init_6_arg_1=1, mask_SORT_12=1, mask_SORT_1=15, msb_SORT_12=1, msb_SORT_1=8, next_10_arg_1=0, next_9_arg_1=13, state_3=0, state_4=13, var_11=15, var_13=0, var_13_arg_0=13, var_13_arg_1=15, var_15=0, var_15_arg_0=0, var_16=3, var_17=1, var_17_arg_0=12, var_17_arg_1=3, var_18=0, var_18_arg_0=1, var_18_arg_1=0, var_2=1, var_7=13, var_7_arg_0=12, var_7_arg_1=1, var_8=0, var_8_arg_0=0, var_8_arg_1=12] [L61] SORT_1 var_17_arg_0 = state_4; [L62] SORT_1 var_17_arg_1 = var_16; [L63] SORT_12 var_17 = var_17_arg_0 > var_17_arg_1; [L64] SORT_1 var_15_arg_0 = state_3; [L65] SORT_12 var_15 = var_15_arg_0 >> 0; [L66] SORT_12 var_18_arg_0 = var_17; [L67] SORT_12 var_18_arg_1 = var_15; [L68] SORT_12 var_18 = var_18_arg_0 & var_18_arg_1; [L69] var_18 = var_18 & mask_SORT_12 [L70] SORT_12 bad_19_arg_0 = var_18; VAL [bad_14_arg_0=0, bad_19_arg_0=0, init_5_arg_1=1, init_6_arg_1=1, mask_SORT_12=1, mask_SORT_1=15, msb_SORT_12=1, msb_SORT_1=8, next_10_arg_1=0, next_9_arg_1=13, state_3=0, state_4=13, var_11=15, var_13=0, var_13_arg_0=13, var_13_arg_1=15, var_15=0, var_15_arg_0=0, var_16=3, var_17=1, var_17_arg_0=13, var_17_arg_1=3, var_18=0, var_18_arg_0=1, var_18_arg_1=0, var_2=1, var_7=13, var_7_arg_0=12, var_7_arg_1=1, var_8=0, var_8_arg_0=0, var_8_arg_1=12] [L71] CALL __VERIFIER_assert(!(bad_19_arg_0)) VAL [\old(cond)=1] [L29] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1] [L71] RET __VERIFIER_assert(!(bad_19_arg_0)) VAL [bad_14_arg_0=0, bad_19_arg_0=0, init_5_arg_1=1, init_6_arg_1=1, mask_SORT_12=1, mask_SORT_1=15, msb_SORT_12=1, msb_SORT_1=8, next_10_arg_1=0, next_9_arg_1=13, state_3=0, state_4=13, var_11=15, var_13=0, var_13_arg_0=13, var_13_arg_1=15, var_15=0, var_15_arg_0=0, var_16=3, var_17=1, var_17_arg_0=13, var_17_arg_1=3, var_18=0, var_18_arg_0=1, var_18_arg_1=0, var_2=1, var_7=13, var_7_arg_0=12, var_7_arg_1=1, var_8=0, var_8_arg_0=0, var_8_arg_1=12] [L73] SORT_1 var_7_arg_0 = state_4; [L74] SORT_1 var_7_arg_1 = var_2; [L75] SORT_1 var_7 = var_7_arg_0 + var_7_arg_1; [L76] var_7 = var_7 & mask_SORT_1 [L77] SORT_1 next_9_arg_1 = var_7; [L78] SORT_1 var_8_arg_0 = state_3; [L79] SORT_1 var_8_arg_1 = state_4; [L80] SORT_1 var_8 = var_8_arg_0 * var_8_arg_1; [L81] SORT_1 next_10_arg_1 = var_8; [L83] state_4 = next_9_arg_1 [L84] state_3 = next_10_arg_1 VAL [bad_14_arg_0=0, bad_19_arg_0=0, init_5_arg_1=1, init_6_arg_1=1, mask_SORT_12=1, mask_SORT_1=15, msb_SORT_12=1, msb_SORT_1=8, next_10_arg_1=0, next_9_arg_1=14, state_3=0, state_4=14, var_11=15, var_13=0, var_13_arg_0=13, var_13_arg_1=15, var_15=0, var_15_arg_0=0, var_16=3, var_17=1, var_17_arg_0=13, var_17_arg_1=3, var_18=0, var_18_arg_0=1, var_18_arg_1=0, var_2=1, var_7=14, var_7_arg_0=13, var_7_arg_1=1, var_8=0, var_8_arg_0=0, var_8_arg_1=13] [L56] SORT_1 var_13_arg_0 = state_4; [L57] SORT_1 var_13_arg_1 = var_11; [L58] SORT_12 var_13 = var_13_arg_0 == var_13_arg_1; [L59] SORT_12 bad_14_arg_0 = var_13; VAL [bad_14_arg_0=0, bad_19_arg_0=0, init_5_arg_1=1, init_6_arg_1=1, mask_SORT_12=1, mask_SORT_1=15, msb_SORT_12=1, msb_SORT_1=8, next_10_arg_1=0, next_9_arg_1=14, state_3=0, state_4=14, var_11=15, var_13=0, var_13_arg_0=14, var_13_arg_1=15, var_15=0, var_15_arg_0=0, var_16=3, var_17=1, var_17_arg_0=13, var_17_arg_1=3, var_18=0, var_18_arg_0=1, var_18_arg_1=0, var_2=1, var_7=14, var_7_arg_0=13, var_7_arg_1=1, var_8=0, var_8_arg_0=0, var_8_arg_1=13] [L60] CALL __VERIFIER_assert(!(bad_14_arg_0)) VAL [\old(cond)=1] [L29] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1] [L60] RET __VERIFIER_assert(!(bad_14_arg_0)) VAL [bad_14_arg_0=0, bad_19_arg_0=0, init_5_arg_1=1, init_6_arg_1=1, mask_SORT_12=1, mask_SORT_1=15, msb_SORT_12=1, msb_SORT_1=8, next_10_arg_1=0, next_9_arg_1=14, state_3=0, state_4=14, var_11=15, var_13=0, var_13_arg_0=14, var_13_arg_1=15, var_15=0, var_15_arg_0=0, var_16=3, var_17=1, var_17_arg_0=13, var_17_arg_1=3, var_18=0, var_18_arg_0=1, var_18_arg_1=0, var_2=1, var_7=14, var_7_arg_0=13, var_7_arg_1=1, var_8=0, var_8_arg_0=0, var_8_arg_1=13] [L61] SORT_1 var_17_arg_0 = state_4; [L62] SORT_1 var_17_arg_1 = var_16; [L63] SORT_12 var_17 = var_17_arg_0 > var_17_arg_1; [L64] SORT_1 var_15_arg_0 = state_3; [L65] SORT_12 var_15 = var_15_arg_0 >> 0; [L66] SORT_12 var_18_arg_0 = var_17; [L67] SORT_12 var_18_arg_1 = var_15; [L68] SORT_12 var_18 = var_18_arg_0 & var_18_arg_1; [L69] var_18 = var_18 & mask_SORT_12 [L70] SORT_12 bad_19_arg_0 = var_18; VAL [bad_14_arg_0=0, bad_19_arg_0=0, init_5_arg_1=1, init_6_arg_1=1, mask_SORT_12=1, mask_SORT_1=15, msb_SORT_12=1, msb_SORT_1=8, next_10_arg_1=0, next_9_arg_1=14, state_3=0, state_4=14, var_11=15, var_13=0, var_13_arg_0=14, var_13_arg_1=15, var_15=0, var_15_arg_0=0, var_16=3, var_17=1, var_17_arg_0=14, var_17_arg_1=3, var_18=0, var_18_arg_0=1, var_18_arg_1=0, var_2=1, var_7=14, var_7_arg_0=13, var_7_arg_1=1, var_8=0, var_8_arg_0=0, var_8_arg_1=13] [L71] CALL __VERIFIER_assert(!(bad_19_arg_0)) VAL [\old(cond)=1] [L29] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1] [L71] RET __VERIFIER_assert(!(bad_19_arg_0)) VAL [bad_14_arg_0=0, bad_19_arg_0=0, init_5_arg_1=1, init_6_arg_1=1, mask_SORT_12=1, mask_SORT_1=15, msb_SORT_12=1, msb_SORT_1=8, next_10_arg_1=0, next_9_arg_1=14, state_3=0, state_4=14, var_11=15, var_13=0, var_13_arg_0=14, var_13_arg_1=15, var_15=0, var_15_arg_0=0, var_16=3, var_17=1, var_17_arg_0=14, var_17_arg_1=3, var_18=0, var_18_arg_0=1, var_18_arg_1=0, var_2=1, var_7=14, var_7_arg_0=13, var_7_arg_1=1, var_8=0, var_8_arg_0=0, var_8_arg_1=13] [L73] SORT_1 var_7_arg_0 = state_4; [L74] SORT_1 var_7_arg_1 = var_2; [L75] SORT_1 var_7 = var_7_arg_0 + var_7_arg_1; [L76] var_7 = var_7 & mask_SORT_1 [L77] SORT_1 next_9_arg_1 = var_7; [L78] SORT_1 var_8_arg_0 = state_3; [L79] SORT_1 var_8_arg_1 = state_4; [L80] SORT_1 var_8 = var_8_arg_0 * var_8_arg_1; [L81] SORT_1 next_10_arg_1 = var_8; [L83] state_4 = next_9_arg_1 [L84] state_3 = next_10_arg_1 VAL [bad_14_arg_0=0, bad_19_arg_0=0, init_5_arg_1=1, init_6_arg_1=1, mask_SORT_12=1, mask_SORT_1=15, msb_SORT_12=1, msb_SORT_1=8, next_10_arg_1=0, next_9_arg_1=15, state_3=0, state_4=15, var_11=15, var_13=0, var_13_arg_0=14, var_13_arg_1=15, var_15=0, var_15_arg_0=0, var_16=3, var_17=1, var_17_arg_0=14, var_17_arg_1=3, var_18=0, var_18_arg_0=1, var_18_arg_1=0, var_2=1, var_7=15, var_7_arg_0=14, var_7_arg_1=1, var_8=0, var_8_arg_0=0, var_8_arg_1=14] [L56] SORT_1 var_13_arg_0 = state_4; [L57] SORT_1 var_13_arg_1 = var_11; [L58] SORT_12 var_13 = var_13_arg_0 == var_13_arg_1; [L59] SORT_12 bad_14_arg_0 = var_13; VAL [bad_14_arg_0=1, bad_19_arg_0=0, init_5_arg_1=1, init_6_arg_1=1, mask_SORT_12=1, mask_SORT_1=15, msb_SORT_12=1, msb_SORT_1=8, next_10_arg_1=0, next_9_arg_1=15, state_3=0, state_4=15, var_11=15, var_13=1, var_13_arg_0=15, var_13_arg_1=15, var_15=0, var_15_arg_0=0, var_16=3, var_17=1, var_17_arg_0=14, var_17_arg_1=3, var_18=0, var_18_arg_0=1, var_18_arg_1=0, var_2=1, var_7=15, var_7_arg_0=14, var_7_arg_1=1, var_8=0, var_8_arg_0=0, var_8_arg_1=14] [L60] CALL __VERIFIER_assert(!(bad_14_arg_0)) VAL [\old(cond)=0] [L29] COND TRUE !(cond) VAL [\old(cond)=0, cond=0] [L29] reach_error() VAL [\old(cond)=0, cond=0] - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 14 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 8.6s, OverallIterations: 8, TraceHistogramMax: 29, PathProgramHistogramMax: 6, EmptinessCheckTime: 0.0s, AutomataDifference: 2.5s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 170 SdHoareTripleChecker+Valid, 1.1s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 168 mSDsluCounter, 798 SdHoareTripleChecker+Invalid, 1.0s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 685 mSDsCounter, 124 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 1066 IncrementalHoareTripleChecker+Invalid, 1190 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 124 mSolverCounterUnsat, 113 mSDtfsCounter, 1066 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 603 GetRequests, 479 SyntacticMatches, 2 SemanticMatches, 122 ConstructedPredicates, 0 IntricatePredicates, 1 DeprecatedPredicates, 425 ImplicationChecksByTransitivity, 2.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=137occurred in iteration=7, InterpolantAutomatonStates: 86, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.1s AutomataMinimizationTime, 7 MinimizatonAttempts, 20 StatesRemovedByMinimization, 5 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.6s SatisfiabilityAnalysisTime, 2.5s InterpolantComputationTime, 532 NumberOfCodeBlocks, 520 NumberOfCodeBlocksAsserted, 51 NumberOfCheckSat, 532 ConstructedInterpolants, 17 QuantifiedInterpolants, 5187 SizeOfPredicates, 173 NumberOfNonLiveVariables, 1085 ConjunctsInSsa, 214 ConjunctsInUnsatCore, 12 InterpolantComputations, 2 PerfectInterpolantSequences, 1706/2216 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 proved your program to be incorrect! [2023-12-26 09:49:19,726 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...