/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.recount4.c -------------------------------------------------------------------------------- This is Ultimate 0.2.4-tmp.fs.bitabs-eval-d9c3e40-m [2023-12-16 22:21:40,288 INFO L188 SettingsManager]: Resetting all preferences to default values... [2023-12-16 22:21:40,346 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-16 22:21:40,350 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2023-12-16 22:21:40,350 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2023-12-16 22:21:40,377 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2023-12-16 22:21:40,378 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-12-16 22:21:40,378 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-12-16 22:21:40,379 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2023-12-16 22:21:40,382 INFO L153 SettingsManager]: * Use memory slicer=true [2023-12-16 22:21:40,382 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-12-16 22:21:40,382 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-12-16 22:21:40,383 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-12-16 22:21:40,383 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2023-12-16 22:21:40,383 INFO L153 SettingsManager]: * Use SBE=true [2023-12-16 22:21:40,384 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-12-16 22:21:40,384 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2023-12-16 22:21:40,384 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2023-12-16 22:21:40,384 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2023-12-16 22:21:40,385 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-12-16 22:21:40,385 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2023-12-16 22:21:40,385 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2023-12-16 22:21:40,386 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2023-12-16 22:21:40,386 INFO L153 SettingsManager]: * Allow undefined functions=false [2023-12-16 22:21:40,386 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2023-12-16 22:21:40,386 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2023-12-16 22:21:40,386 INFO L153 SettingsManager]: * Use constant arrays=true [2023-12-16 22:21:40,387 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-12-16 22:21:40,387 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-12-16 22:21:40,387 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2023-12-16 22:21:40,388 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2023-12-16 22:21:40,388 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2023-12-16 22:21:40,389 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-12-16 22:21:40,389 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-12-16 22:21:40,389 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2023-12-16 22:21:40,389 INFO L153 SettingsManager]: * Trace refinement strategy=WOLF [2023-12-16 22:21:40,389 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2023-12-16 22:21:40,390 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2023-12-16 22:21:40,390 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-12-16 22:21:40,390 INFO L153 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2023-12-16 22:21:40,390 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2023-12-16 22:21:40,390 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-12-16 22:21:40,391 INFO L153 SettingsManager]: * Logic for external solver=AUFBV [2023-12-16 22:21:40,391 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-16 22:21:40,611 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-12-16 22:21:40,629 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-12-16 22:21:40,631 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-12-16 22:21:40,632 INFO L270 PluginConnector]: Initializing CDTParser... [2023-12-16 22:21:40,632 INFO L274 PluginConnector]: CDTParser initialized [2023-12-16 22:21:40,633 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/hardware-verification-bv/btor2c-lazyMod.recount4.c [2023-12-16 22:21:41,838 INFO L533 CDTParser]: Created temporary CDT project at NULL [2023-12-16 22:21:42,015 INFO L384 CDTParser]: Found 1 translation units. [2023-12-16 22:21:42,016 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/hardware-verification-bv/btor2c-lazyMod.recount4.c [2023-12-16 22:21:42,022 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/cc7fe982a/a6e3bf7fb3ba4664becb1167abb06801/FLAGfe4686dc3 [2023-12-16 22:21:42,036 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/cc7fe982a/a6e3bf7fb3ba4664becb1167abb06801 [2023-12-16 22:21:42,040 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-12-16 22:21:42,041 INFO L133 ToolchainWalker]: Walking toolchain with 5 elements. [2023-12-16 22:21:42,042 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-12-16 22:21:42,042 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-12-16 22:21:42,046 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2023-12-16 22:21:42,047 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.12 10:21:42" (1/1) ... [2023-12-16 22:21:42,048 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@51caaa5c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.12 10:21:42, skipping insertion in model container [2023-12-16 22:21:42,048 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.12 10:21:42" (1/1) ... [2023-12-16 22:21:42,072 INFO L177 MainTranslator]: Built tables and reachable declarations [2023-12-16 22:21:42,188 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.recount4.c[1258,1271] [2023-12-16 22:21:42,216 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-12-16 22:21:42,226 INFO L202 MainTranslator]: Completed pre-run [2023-12-16 22:21:42,238 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.recount4.c[1258,1271] [2023-12-16 22:21:42,248 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-12-16 22:21:42,259 INFO L206 MainTranslator]: Completed translation [2023-12-16 22:21:42,259 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.12 10:21:42 WrapperNode [2023-12-16 22:21:42,260 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-12-16 22:21:42,260 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-12-16 22:21:42,260 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-12-16 22:21:42,261 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2023-12-16 22:21:42,266 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.12 10:21:42" (1/1) ... [2023-12-16 22:21:42,272 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.12 10:21:42" (1/1) ... [2023-12-16 22:21:42,288 INFO L138 Inliner]: procedures = 17, calls = 8, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 62 [2023-12-16 22:21:42,289 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-12-16 22:21:42,289 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-12-16 22:21:42,289 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2023-12-16 22:21:42,289 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2023-12-16 22:21:42,298 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.12 10:21:42" (1/1) ... [2023-12-16 22:21:42,298 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.12 10:21:42" (1/1) ... [2023-12-16 22:21:42,307 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.12 10:21:42" (1/1) ... [2023-12-16 22:21:42,317 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2023-12-16 22:21:42,317 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.12 10:21:42" (1/1) ... [2023-12-16 22:21:42,317 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.12 10:21:42" (1/1) ... [2023-12-16 22:21:42,321 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.12 10:21:42" (1/1) ... [2023-12-16 22:21:42,323 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.12 10:21:42" (1/1) ... [2023-12-16 22:21:42,324 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.12 10:21:42" (1/1) ... [2023-12-16 22:21:42,325 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.12 10:21:42" (1/1) ... [2023-12-16 22:21:42,326 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-12-16 22:21:42,327 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-12-16 22:21:42,327 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2023-12-16 22:21:42,327 INFO L274 PluginConnector]: RCFGBuilder initialized [2023-12-16 22:21:42,328 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.12 10:21:42" (1/1) ... [2023-12-16 22:21:42,342 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2023-12-16 22:21:42,353 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-12-16 22:21:42,372 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2023-12-16 22:21:42,385 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2023-12-16 22:21:42,401 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-12-16 22:21:42,401 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2023-12-16 22:21:42,401 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-12-16 22:21:42,401 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-12-16 22:21:42,467 INFO L241 CfgBuilder]: Building ICFG [2023-12-16 22:21:42,468 INFO L267 CfgBuilder]: Building CFG for each procedure with an implementation [2023-12-16 22:21:42,559 INFO L282 CfgBuilder]: Performing block encoding [2023-12-16 22:21:42,604 INFO L304 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-12-16 22:21:42,604 INFO L309 CfgBuilder]: Removed 1 assume(true) statements. [2023-12-16 22:21:42,604 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 16.12 10:21:42 BoogieIcfgContainer [2023-12-16 22:21:42,604 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-12-16 22:21:42,606 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-12-16 22:21:42,607 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2023-12-16 22:21:42,614 INFO L274 PluginConnector]: TraceAbstraction initialized [2023-12-16 22:21:42,614 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 16.12 10:21:42" (1/3) ... [2023-12-16 22:21:42,615 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@493a3d09 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.12 10:21:42, skipping insertion in model container [2023-12-16 22:21:42,615 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.12 10:21:42" (2/3) ... [2023-12-16 22:21:42,616 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@493a3d09 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.12 10:21:42, skipping insertion in model container [2023-12-16 22:21:42,616 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 16.12 10:21:42" (3/3) ... [2023-12-16 22:21:42,618 INFO L112 eAbstractionObserver]: Analyzing ICFG btor2c-lazyMod.recount4.c [2023-12-16 22:21:42,634 INFO L204 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-12-16 22:21:42,634 INFO L163 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2023-12-16 22:21:42,678 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-12-16 22:21:42,685 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;@770345f8, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2023-12-16 22:21:42,685 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2023-12-16 22:21:42,689 INFO L276 IsEmpty]: Start isEmpty. Operand has 8 states, 6 states have (on average 1.6666666666666667) internal successors, (10), 7 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-16 22:21:42,698 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2023-12-16 22:21:42,698 INFO L187 NwaCegarLoop]: Found error trace [2023-12-16 22:21:42,701 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1] [2023-12-16 22:21:42,702 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-16 22:21:42,708 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-16 22:21:42,708 INFO L85 PathProgramCache]: Analyzing trace with hash 1827279, now seen corresponding path program 1 times [2023-12-16 22:21:42,718 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-16 22:21:42,719 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [773416910] [2023-12-16 22:21:42,719 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-16 22:21:42,720 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-16 22:21:42,720 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-16 22:21:42,722 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-16 22:21:42,729 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-16 22:21:42,787 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 22:21:42,789 INFO L262 TraceCheckSpWp]: Trace formula consists of 31 conjuncts, 12 conjunts are in the unsatisfiable core [2023-12-16 22:21:42,793 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-16 22:21:42,891 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-16 22:21:42,891 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-16 22:21:42,891 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-16 22:21:42,892 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [773416910] [2023-12-16 22:21:42,892 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [773416910] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-16 22:21:42,892 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-16 22:21:42,892 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-12-16 22:21:42,894 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1346389721] [2023-12-16 22:21:42,894 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-16 22:21:42,902 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-12-16 22:21:42,902 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-16 22:21:42,924 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-12-16 22:21:42,925 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-12-16 22:21:42,926 INFO L87 Difference]: Start difference. First operand has 8 states, 6 states have (on average 1.6666666666666667) internal successors, (10), 7 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 4 states, 4 states have (on average 1.0) internal successors, (4), 3 states have internal predecessors, (4), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-16 22:21:42,965 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-16 22:21:42,965 INFO L93 Difference]: Finished difference Result 16 states and 24 transitions. [2023-12-16 22:21:42,968 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-12-16 22:21:42,969 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 1.0) internal successors, (4), 3 states have internal predecessors, (4), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 4 [2023-12-16 22:21:42,970 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-16 22:21:42,975 INFO L225 Difference]: With dead ends: 16 [2023-12-16 22:21:42,975 INFO L226 Difference]: Without dead ends: 9 [2023-12-16 22:21:42,977 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2023-12-16 22:21:42,980 INFO L413 NwaCegarLoop]: 2 mSDtfsCounter, 3 mSDsluCounter, 4 mSDsCounter, 0 mSdLazyCounter, 11 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3 SdHoareTripleChecker+Valid, 6 SdHoareTripleChecker+Invalid, 11 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 11 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-12-16 22:21:42,981 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [3 Valid, 6 Invalid, 11 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 11 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-12-16 22:21:42,995 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9 states. [2023-12-16 22:21:43,003 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9 to 8. [2023-12-16 22:21:43,004 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8 states, 7 states have (on average 1.1428571428571428) internal successors, (8), 7 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-16 22:21:43,004 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 8 transitions. [2023-12-16 22:21:43,005 INFO L78 Accepts]: Start accepts. Automaton has 8 states and 8 transitions. Word has length 4 [2023-12-16 22:21:43,006 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-16 22:21:43,006 INFO L495 AbstractCegarLoop]: Abstraction has 8 states and 8 transitions. [2023-12-16 22:21:43,006 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 1.0) internal successors, (4), 3 states have internal predecessors, (4), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-16 22:21:43,006 INFO L276 IsEmpty]: Start isEmpty. Operand 8 states and 8 transitions. [2023-12-16 22:21:43,006 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2023-12-16 22:21:43,007 INFO L187 NwaCegarLoop]: Found error trace [2023-12-16 22:21:43,007 INFO L195 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1] [2023-12-16 22:21:43,016 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 (2)] Forceful destruction successful, exit code 0 [2023-12-16 22:21:43,209 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-16 22:21:43,210 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-16 22:21:43,210 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-16 22:21:43,210 INFO L85 PathProgramCache]: Analyzing trace with hash -1393329571, now seen corresponding path program 1 times [2023-12-16 22:21:43,211 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-16 22:21:43,211 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2054781340] [2023-12-16 22:21:43,211 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-16 22:21:43,211 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-16 22:21:43,212 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-16 22:21:43,213 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-16 22:21:43,214 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-16 22:21:43,274 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 22:21:43,276 INFO L262 TraceCheckSpWp]: Trace formula consists of 53 conjuncts, 24 conjunts are in the unsatisfiable core [2023-12-16 22:21:43,278 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-16 22:21:43,593 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-16 22:21:43,594 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-16 22:21:43,770 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-16 22:21:43,770 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-16 22:21:43,774 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2054781340] [2023-12-16 22:21:43,774 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2054781340] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-16 22:21:43,775 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-12-16 22:21:43,775 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4] total 7 [2023-12-16 22:21:43,775 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1209545710] [2023-12-16 22:21:43,776 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-12-16 22:21:43,777 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2023-12-16 22:21:43,777 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-16 22:21:43,778 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2023-12-16 22:21:43,778 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=38, Unknown=0, NotChecked=0, Total=56 [2023-12-16 22:21:43,779 INFO L87 Difference]: Start difference. First operand 8 states and 8 transitions. Second operand has 8 states, 8 states have (on average 1.625) internal successors, (13), 7 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-16 22:21:43,906 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-16 22:21:43,907 INFO L93 Difference]: Finished difference Result 17 states and 18 transitions. [2023-12-16 22:21:43,907 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2023-12-16 22:21:43,908 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 1.625) internal successors, (13), 7 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 7 [2023-12-16 22:21:43,908 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-16 22:21:43,909 INFO L225 Difference]: With dead ends: 17 [2023-12-16 22:21:43,909 INFO L226 Difference]: Without dead ends: 15 [2023-12-16 22:21:43,911 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=49, Invalid=83, Unknown=0, NotChecked=0, Total=132 [2023-12-16 22:21:43,913 INFO L413 NwaCegarLoop]: 2 mSDtfsCounter, 9 mSDsluCounter, 9 mSDsCounter, 0 mSdLazyCounter, 24 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 9 SdHoareTripleChecker+Valid, 11 SdHoareTripleChecker+Invalid, 27 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 24 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-12-16 22:21:43,914 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [9 Valid, 11 Invalid, 27 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 24 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-12-16 22:21:43,915 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15 states. [2023-12-16 22:21:43,917 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15 to 14. [2023-12-16 22:21:43,918 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 14 states, 13 states have (on average 1.0769230769230769) internal successors, (14), 13 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-16 22:21:43,918 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 14 transitions. [2023-12-16 22:21:43,918 INFO L78 Accepts]: Start accepts. Automaton has 14 states and 14 transitions. Word has length 7 [2023-12-16 22:21:43,918 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-16 22:21:43,918 INFO L495 AbstractCegarLoop]: Abstraction has 14 states and 14 transitions. [2023-12-16 22:21:43,918 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 1.625) internal successors, (13), 7 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-16 22:21:43,918 INFO L276 IsEmpty]: Start isEmpty. Operand 14 states and 14 transitions. [2023-12-16 22:21:43,919 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2023-12-16 22:21:43,919 INFO L187 NwaCegarLoop]: Found error trace [2023-12-16 22:21:43,919 INFO L195 NwaCegarLoop]: trace histogram [4, 3, 3, 1, 1, 1] [2023-12-16 22:21:43,925 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 (3)] Forceful destruction successful, exit code 0 [2023-12-16 22:21:44,119 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-16 22:21:44,120 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-16 22:21:44,121 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-16 22:21:44,121 INFO L85 PathProgramCache]: Analyzing trace with hash -57678563, now seen corresponding path program 2 times [2023-12-16 22:21:44,121 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-16 22:21:44,121 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1122284318] [2023-12-16 22:21:44,122 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2023-12-16 22:21:44,122 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-16 22:21:44,122 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-16 22:21:44,123 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-16 22:21:44,126 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-16 22:21:44,182 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2023-12-16 22:21:44,183 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-12-16 22:21:44,186 INFO L262 TraceCheckSpWp]: Trace formula consists of 97 conjuncts, 46 conjunts are in the unsatisfiable core [2023-12-16 22:21:44,190 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-16 22:21:44,706 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-16 22:21:44,706 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-16 22:21:45,493 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-16 22:21:45,493 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-16 22:21:45,494 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1122284318] [2023-12-16 22:21:45,494 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1122284318] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-16 22:21:45,494 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-12-16 22:21:45,494 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 11 [2023-12-16 22:21:45,494 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1940885408] [2023-12-16 22:21:45,494 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-12-16 22:21:45,495 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2023-12-16 22:21:45,495 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-16 22:21:45,496 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2023-12-16 22:21:45,496 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=44, Invalid=88, Unknown=0, NotChecked=0, Total=132 [2023-12-16 22:21:45,496 INFO L87 Difference]: Start difference. First operand 14 states and 14 transitions. Second operand has 12 states, 12 states have (on average 2.0833333333333335) internal successors, (25), 11 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-16 22:21:46,045 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-16 22:21:46,045 INFO L93 Difference]: Finished difference Result 29 states and 32 transitions. [2023-12-16 22:21:46,046 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2023-12-16 22:21:46,046 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 2.0833333333333335) internal successors, (25), 11 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 13 [2023-12-16 22:21:46,046 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-16 22:21:46,047 INFO L225 Difference]: With dead ends: 29 [2023-12-16 22:21:46,047 INFO L226 Difference]: Without dead ends: 27 [2023-12-16 22:21:46,047 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 34 GetRequests, 14 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 71 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=168, Invalid=294, Unknown=0, NotChecked=0, Total=462 [2023-12-16 22:21:46,048 INFO L413 NwaCegarLoop]: 2 mSDtfsCounter, 15 mSDsluCounter, 13 mSDsCounter, 0 mSdLazyCounter, 36 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 15 SdHoareTripleChecker+Valid, 15 SdHoareTripleChecker+Invalid, 41 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 36 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-12-16 22:21:46,049 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [15 Valid, 15 Invalid, 41 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 36 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-12-16 22:21:46,049 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27 states. [2023-12-16 22:21:46,054 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27 to 26. [2023-12-16 22:21:46,055 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 26 states, 25 states have (on average 1.04) internal successors, (26), 25 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-16 22:21:46,056 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 26 transitions. [2023-12-16 22:21:46,056 INFO L78 Accepts]: Start accepts. Automaton has 26 states and 26 transitions. Word has length 13 [2023-12-16 22:21:46,056 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-16 22:21:46,056 INFO L495 AbstractCegarLoop]: Abstraction has 26 states and 26 transitions. [2023-12-16 22:21:46,057 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 2.0833333333333335) internal successors, (25), 11 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-16 22:21:46,057 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 26 transitions. [2023-12-16 22:21:46,058 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2023-12-16 22:21:46,058 INFO L187 NwaCegarLoop]: Found error trace [2023-12-16 22:21:46,059 INFO L195 NwaCegarLoop]: trace histogram [8, 7, 7, 1, 1, 1] [2023-12-16 22:21:46,071 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-16 22:21:46,261 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-16 22:21:46,262 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-16 22:21:46,262 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-16 22:21:46,262 INFO L85 PathProgramCache]: Analyzing trace with hash 284396189, now seen corresponding path program 3 times [2023-12-16 22:21:46,263 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-16 22:21:46,263 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [536577822] [2023-12-16 22:21:46,263 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2023-12-16 22:21:46,263 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-16 22:21:46,264 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-16 22:21:46,265 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-16 22:21:46,267 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-16 22:21:46,392 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 8 check-sat command(s) [2023-12-16 22:21:46,393 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-12-16 22:21:46,397 WARN L260 TraceCheckSpWp]: Trace formula consists of 185 conjuncts, 97 conjunts are in the unsatisfiable core [2023-12-16 22:21:46,401 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-16 22:21:47,569 INFO L134 CoverageAnalysis]: Checked inductivity of 77 backedges. 0 proven. 77 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-16 22:21:47,569 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-16 22:21:55,389 INFO L134 CoverageAnalysis]: Checked inductivity of 77 backedges. 0 proven. 77 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-16 22:21:55,390 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-16 22:21:55,390 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [536577822] [2023-12-16 22:21:55,390 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [536577822] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-16 22:21:55,390 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-12-16 22:21:55,390 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 12] total 22 [2023-12-16 22:21:55,391 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [766748487] [2023-12-16 22:21:55,391 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-12-16 22:21:55,391 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 23 states [2023-12-16 22:21:55,391 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-16 22:21:55,392 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2023-12-16 22:21:55,392 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=174, Invalid=332, Unknown=0, NotChecked=0, Total=506 [2023-12-16 22:21:55,393 INFO L87 Difference]: Start difference. First operand 26 states and 26 transitions. Second operand has 23 states, 23 states have (on average 2.130434782608696) internal successors, (49), 22 states have internal predecessors, (49), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-16 22:22:00,436 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-16 22:22:00,436 INFO L93 Difference]: Finished difference Result 53 states and 60 transitions. [2023-12-16 22:22:00,437 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 34 states. [2023-12-16 22:22:00,437 INFO L78 Accepts]: Start accepts. Automaton has has 23 states, 23 states have (on average 2.130434782608696) internal successors, (49), 22 states have internal predecessors, (49), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 25 [2023-12-16 22:22:00,438 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-16 22:22:00,439 INFO L225 Difference]: With dead ends: 53 [2023-12-16 22:22:00,439 INFO L226 Difference]: Without dead ends: 51 [2023-12-16 22:22:00,440 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 69 GetRequests, 27 SyntacticMatches, 0 SemanticMatches, 42 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 446 ImplicationChecksByTransitivity, 6.6s TimeCoverageRelationStatistics Valid=690, Invalid=1202, Unknown=0, NotChecked=0, Total=1892 [2023-12-16 22:22:00,441 INFO L413 NwaCegarLoop]: 2 mSDtfsCounter, 54 mSDsluCounter, 18 mSDsCounter, 0 mSdLazyCounter, 62 mSolverCounterSat, 17 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 54 SdHoareTripleChecker+Valid, 20 SdHoareTripleChecker+Invalid, 79 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 17 IncrementalHoareTripleChecker+Valid, 62 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2023-12-16 22:22:00,441 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [54 Valid, 20 Invalid, 79 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [17 Valid, 62 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2023-12-16 22:22:00,442 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 51 states. [2023-12-16 22:22:00,457 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 51 to 50. [2023-12-16 22:22:00,458 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 50 states, 49 states have (on average 1.0204081632653061) internal successors, (50), 49 states have internal predecessors, (50), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-16 22:22:00,458 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 50 states to 50 states and 50 transitions. [2023-12-16 22:22:00,459 INFO L78 Accepts]: Start accepts. Automaton has 50 states and 50 transitions. Word has length 25 [2023-12-16 22:22:00,459 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-16 22:22:00,459 INFO L495 AbstractCegarLoop]: Abstraction has 50 states and 50 transitions. [2023-12-16 22:22:00,459 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 23 states, 23 states have (on average 2.130434782608696) internal successors, (49), 22 states have internal predecessors, (49), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-16 22:22:00,459 INFO L276 IsEmpty]: Start isEmpty. Operand 50 states and 50 transitions. [2023-12-16 22:22:00,462 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2023-12-16 22:22:00,462 INFO L187 NwaCegarLoop]: Found error trace [2023-12-16 22:22:00,462 INFO L195 NwaCegarLoop]: trace histogram [16, 15, 15, 1, 1, 1] [2023-12-16 22:22:00,471 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-16 22:22:00,666 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 [2023-12-16 22:22:00,666 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-16 22:22:00,666 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-16 22:22:00,666 INFO L85 PathProgramCache]: Analyzing trace with hash 1924535709, now seen corresponding path program 4 times [2023-12-16 22:22:00,667 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-16 22:22:00,667 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [846530798] [2023-12-16 22:22:00,667 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2023-12-16 22:22:00,667 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-16 22:22:00,667 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-16 22:22:00,668 INFO L229 MonitoredProcess]: Starting monitored process 6 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-16 22:22:00,669 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 (6)] Waiting until timeout for monitored process [2023-12-16 22:22:00,991 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2023-12-16 22:22:00,991 INFO L229 tOrderPrioritization]: Conjunction of SSA is sat [2023-12-16 22:22:00,991 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-12-16 22:22:01,190 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-12-16 22:22:01,276 INFO L130 FreeRefinementEngine]: Strategy WOLF found a feasible trace [2023-12-16 22:22:01,276 INFO L360 BasicCegarLoop]: Counterexample is feasible [2023-12-16 22:22:01,277 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2023-12-16 22:22:01,287 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 (6)] Forceful destruction successful, exit code 0 [2023-12-16 22:22:01,479 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /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-16 22:22:01,482 INFO L445 BasicCegarLoop]: Path program histogram: [4, 1] [2023-12-16 22:22:01,484 INFO L179 ceAbstractionStarter]: Computing trace abstraction results [2023-12-16 22:22:01,547 WARN L320 BoogieBacktranslator]: Removing null node from list of ATEs: ATE program state null [2023-12-16 22:22:01,548 WARN L320 BoogieBacktranslator]: Removing null node from list of ATEs: ATE program state null [2023-12-16 22:22:01,548 WARN L320 BoogieBacktranslator]: Removing null node from list of ATEs: ATE program state null [2023-12-16 22:22:01,548 WARN L320 BoogieBacktranslator]: Removing null node from list of ATEs: ATE program state null [2023-12-16 22:22:01,548 WARN L320 BoogieBacktranslator]: Removing null node from list of ATEs: ATE program state null [2023-12-16 22:22:01,548 WARN L320 BoogieBacktranslator]: Removing null node from list of ATEs: ATE program state null [2023-12-16 22:22:01,548 WARN L320 BoogieBacktranslator]: Removing null node from list of ATEs: ATE program state null [2023-12-16 22:22:01,548 WARN L320 BoogieBacktranslator]: Removing null node from list of ATEs: ATE program state null [2023-12-16 22:22:01,548 WARN L320 BoogieBacktranslator]: Removing null node from list of ATEs: ATE program state null [2023-12-16 22:22:01,548 WARN L320 BoogieBacktranslator]: Removing null node from list of ATEs: ATE program state null [2023-12-16 22:22:01,549 WARN L320 BoogieBacktranslator]: Removing null node from list of ATEs: ATE program state null [2023-12-16 22:22:01,549 WARN L320 BoogieBacktranslator]: Removing null node from list of ATEs: ATE program state null [2023-12-16 22:22:01,549 WARN L320 BoogieBacktranslator]: Removing null node from list of ATEs: ATE program state null [2023-12-16 22:22:01,549 WARN L320 BoogieBacktranslator]: Removing null node from list of ATEs: ATE program state null [2023-12-16 22:22:01,549 WARN L320 BoogieBacktranslator]: Removing null node from list of ATEs: ATE program state null [2023-12-16 22:22:01,549 WARN L320 BoogieBacktranslator]: Removing null node from list of ATEs: ATE program state null [2023-12-16 22:22:01,568 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 16.12 10:22:01 BoogieIcfgContainer [2023-12-16 22:22:01,568 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2023-12-16 22:22:01,569 INFO L158 Benchmark]: Toolchain (without parser) took 19527.65ms. Allocated memory was 185.6MB in the beginning and 599.8MB in the end (delta: 414.2MB). Free memory was 142.9MB in the beginning and 331.6MB in the end (delta: -188.6MB). Peak memory consumption was 226.1MB. Max. memory is 8.0GB. [2023-12-16 22:22:01,569 INFO L158 Benchmark]: CDTParser took 0.12ms. Allocated memory is still 185.6MB. Free memory is still 144.0MB. There was no memory consumed. Max. memory is 8.0GB. [2023-12-16 22:22:01,569 INFO L158 Benchmark]: CACSL2BoogieTranslator took 217.59ms. Allocated memory is still 185.6MB. Free memory was 142.5MB in the beginning and 131.0MB in the end (delta: 11.5MB). Peak memory consumption was 11.5MB. Max. memory is 8.0GB. [2023-12-16 22:22:01,570 INFO L158 Benchmark]: Boogie Procedure Inliner took 28.23ms. Allocated memory is still 185.6MB. Free memory was 131.0MB in the beginning and 129.0MB in the end (delta: 2.0MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. [2023-12-16 22:22:01,570 INFO L158 Benchmark]: Boogie Preprocessor took 37.55ms. Allocated memory is still 185.6MB. Free memory was 129.0MB in the beginning and 127.4MB in the end (delta: 1.6MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. [2023-12-16 22:22:01,570 INFO L158 Benchmark]: RCFGBuilder took 277.39ms. Allocated memory is still 185.6MB. Free memory was 127.4MB in the beginning and 114.3MB in the end (delta: 13.0MB). Peak memory consumption was 12.6MB. Max. memory is 8.0GB. [2023-12-16 22:22:01,570 INFO L158 Benchmark]: TraceAbstraction took 18962.08ms. Allocated memory was 185.6MB in the beginning and 599.8MB in the end (delta: 414.2MB). Free memory was 113.3MB in the beginning and 331.6MB in the end (delta: -218.3MB). Peak memory consumption was 196.8MB. Max. memory is 8.0GB. [2023-12-16 22:22:01,572 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.12ms. Allocated memory is still 185.6MB. Free memory is still 144.0MB. There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 217.59ms. Allocated memory is still 185.6MB. Free memory was 142.5MB in the beginning and 131.0MB in the end (delta: 11.5MB). Peak memory consumption was 11.5MB. Max. memory is 8.0GB. * Boogie Procedure Inliner took 28.23ms. Allocated memory is still 185.6MB. Free memory was 131.0MB in the beginning and 129.0MB in the end (delta: 2.0MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. * Boogie Preprocessor took 37.55ms. Allocated memory is still 185.6MB. Free memory was 129.0MB in the beginning and 127.4MB in the end (delta: 1.6MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. * RCFGBuilder took 277.39ms. Allocated memory is still 185.6MB. Free memory was 127.4MB in the beginning and 114.3MB in the end (delta: 13.0MB). Peak memory consumption was 12.6MB. Max. memory is 8.0GB. * TraceAbstraction took 18962.08ms. Allocated memory was 185.6MB in the beginning and 599.8MB in the end (delta: 414.2MB). Free memory was 113.3MB in the beginning and 331.6MB in the end (delta: -218.3MB). Peak memory consumption was 196.8MB. 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: 22]: a call to reach_error is reachable a call to reach_error is reachable We found a FailurePath: [L27] const SORT_1 mask_SORT_1 = (SORT_1)-1 >> (sizeof(SORT_1) * 8 - 1); [L28] const SORT_1 msb_SORT_1 = (SORT_1)1 << (1 - 1); [L30] const SORT_4 mask_SORT_4 = (SORT_4)-1 >> (sizeof(SORT_4) * 8 - 4); [L31] const SORT_4 msb_SORT_4 = (SORT_4)1 << (4 - 1); [L33] const SORT_4 var_5 = 0; [L34] const SORT_4 var_8 = 1; [L35] const SORT_4 var_13 = mask_SORT_4; [L37] SORT_1 input_2; [L38] SORT_1 input_3; [L40] SORT_4 state_6 = __VERIFIER_nondet_uchar() & mask_SORT_4; [L42] SORT_4 init_7_arg_1 = var_5; [L43] state_6 = init_7_arg_1 VAL [init_7_arg_1=0, mask_SORT_1=1, mask_SORT_4=15, msb_SORT_1=1, msb_SORT_4=8, state_6=0, var_13=15, var_5=0, var_8=1] [L46] input_2 = __VERIFIER_nondet_uchar() [L47] input_2 = input_2 & mask_SORT_1 [L48] input_3 = __VERIFIER_nondet_uchar() [L49] input_3 = input_3 & mask_SORT_1 [L52] SORT_4 var_14_arg_0 = state_6; [L53] SORT_4 var_14_arg_1 = var_13; [L54] SORT_1 var_14 = var_14_arg_0 == var_14_arg_1; [L55] SORT_1 bad_15_arg_0 = var_14; [L56] CALL __VERIFIER_assert(!(bad_15_arg_0)) [L22] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1] [L56] RET __VERIFIER_assert(!(bad_15_arg_0)) [L58] SORT_4 var_9_arg_0 = state_6; [L59] SORT_4 var_9_arg_1 = var_8; [L60] SORT_4 var_9 = var_9_arg_0 + var_9_arg_1; [L61] SORT_1 var_10_arg_0 = input_2; [L62] SORT_4 var_10_arg_1 = var_9; [L63] SORT_4 var_10_arg_2 = state_6; [L64] SORT_4 var_10 = var_10_arg_0 ? var_10_arg_1 : var_10_arg_2; [L65] SORT_1 var_11_arg_0 = input_3; [L66] SORT_4 var_11_arg_1 = var_5; [L67] SORT_4 var_11_arg_2 = var_10; [L68] SORT_4 var_11 = var_11_arg_0 ? var_11_arg_1 : var_11_arg_2; [L69] var_11 = var_11 & mask_SORT_4 [L70] SORT_4 next_12_arg_1 = var_11; [L72] state_6 = next_12_arg_1 VAL [bad_15_arg_0=0, init_7_arg_1=0, input_2=1, input_3=0, mask_SORT_1=1, mask_SORT_4=15, msb_SORT_1=1, msb_SORT_4=8, next_12_arg_1=1, state_6=1, var_10=1, var_10_arg_0=1, var_10_arg_1=1, var_10_arg_2=0, var_11=1, var_11_arg_0=0, var_11_arg_1=0, var_11_arg_2=1, var_13=15, var_14=0, var_14_arg_0=0, var_14_arg_1=15, var_5=0, var_8=1, var_9=1, var_9_arg_0=0, var_9_arg_1=1] [L46] input_2 = __VERIFIER_nondet_uchar() [L47] input_2 = input_2 & mask_SORT_1 [L48] input_3 = __VERIFIER_nondet_uchar() [L49] input_3 = input_3 & mask_SORT_1 [L52] SORT_4 var_14_arg_0 = state_6; [L53] SORT_4 var_14_arg_1 = var_13; [L54] SORT_1 var_14 = var_14_arg_0 == var_14_arg_1; [L55] SORT_1 bad_15_arg_0 = var_14; [L56] CALL __VERIFIER_assert(!(bad_15_arg_0)) [L22] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1] [L56] RET __VERIFIER_assert(!(bad_15_arg_0)) [L58] SORT_4 var_9_arg_0 = state_6; [L59] SORT_4 var_9_arg_1 = var_8; [L60] SORT_4 var_9 = var_9_arg_0 + var_9_arg_1; [L61] SORT_1 var_10_arg_0 = input_2; [L62] SORT_4 var_10_arg_1 = var_9; [L63] SORT_4 var_10_arg_2 = state_6; [L64] SORT_4 var_10 = var_10_arg_0 ? var_10_arg_1 : var_10_arg_2; [L65] SORT_1 var_11_arg_0 = input_3; [L66] SORT_4 var_11_arg_1 = var_5; [L67] SORT_4 var_11_arg_2 = var_10; [L68] SORT_4 var_11 = var_11_arg_0 ? var_11_arg_1 : var_11_arg_2; [L69] var_11 = var_11 & mask_SORT_4 [L70] SORT_4 next_12_arg_1 = var_11; [L72] state_6 = next_12_arg_1 VAL [bad_15_arg_0=0, init_7_arg_1=0, input_2=1, input_3=0, mask_SORT_1=1, mask_SORT_4=15, msb_SORT_1=1, msb_SORT_4=8, next_12_arg_1=2, state_6=2, var_10=2, var_10_arg_0=1, var_10_arg_1=2, var_10_arg_2=1, var_11=2, var_11_arg_0=0, var_11_arg_1=0, var_11_arg_2=2, var_13=15, var_14=0, var_14_arg_0=1, var_14_arg_1=15, var_5=0, var_8=1, var_9=2, var_9_arg_0=1, var_9_arg_1=1] [L46] input_2 = __VERIFIER_nondet_uchar() [L47] input_2 = input_2 & mask_SORT_1 [L48] input_3 = __VERIFIER_nondet_uchar() [L49] input_3 = input_3 & mask_SORT_1 [L52] SORT_4 var_14_arg_0 = state_6; [L53] SORT_4 var_14_arg_1 = var_13; [L54] SORT_1 var_14 = var_14_arg_0 == var_14_arg_1; [L55] SORT_1 bad_15_arg_0 = var_14; [L56] CALL __VERIFIER_assert(!(bad_15_arg_0)) [L22] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1] [L56] RET __VERIFIER_assert(!(bad_15_arg_0)) [L58] SORT_4 var_9_arg_0 = state_6; [L59] SORT_4 var_9_arg_1 = var_8; [L60] SORT_4 var_9 = var_9_arg_0 + var_9_arg_1; [L61] SORT_1 var_10_arg_0 = input_2; [L62] SORT_4 var_10_arg_1 = var_9; [L63] SORT_4 var_10_arg_2 = state_6; [L64] SORT_4 var_10 = var_10_arg_0 ? var_10_arg_1 : var_10_arg_2; [L65] SORT_1 var_11_arg_0 = input_3; [L66] SORT_4 var_11_arg_1 = var_5; [L67] SORT_4 var_11_arg_2 = var_10; [L68] SORT_4 var_11 = var_11_arg_0 ? var_11_arg_1 : var_11_arg_2; [L69] var_11 = var_11 & mask_SORT_4 [L70] SORT_4 next_12_arg_1 = var_11; [L72] state_6 = next_12_arg_1 VAL [bad_15_arg_0=0, init_7_arg_1=0, input_2=1, input_3=0, mask_SORT_1=1, mask_SORT_4=15, msb_SORT_1=1, msb_SORT_4=8, next_12_arg_1=3, state_6=3, var_10=3, var_10_arg_0=1, var_10_arg_1=3, var_10_arg_2=2, var_11=3, var_11_arg_0=0, var_11_arg_1=0, var_11_arg_2=3, var_13=15, var_14=0, var_14_arg_0=2, var_14_arg_1=15, var_5=0, var_8=1, var_9=3, var_9_arg_0=2, var_9_arg_1=1] [L46] input_2 = __VERIFIER_nondet_uchar() [L47] input_2 = input_2 & mask_SORT_1 [L48] input_3 = __VERIFIER_nondet_uchar() [L49] input_3 = input_3 & mask_SORT_1 [L52] SORT_4 var_14_arg_0 = state_6; [L53] SORT_4 var_14_arg_1 = var_13; [L54] SORT_1 var_14 = var_14_arg_0 == var_14_arg_1; [L55] SORT_1 bad_15_arg_0 = var_14; [L56] CALL __VERIFIER_assert(!(bad_15_arg_0)) [L22] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1] [L56] RET __VERIFIER_assert(!(bad_15_arg_0)) [L58] SORT_4 var_9_arg_0 = state_6; [L59] SORT_4 var_9_arg_1 = var_8; [L60] SORT_4 var_9 = var_9_arg_0 + var_9_arg_1; [L61] SORT_1 var_10_arg_0 = input_2; [L62] SORT_4 var_10_arg_1 = var_9; [L63] SORT_4 var_10_arg_2 = state_6; [L64] SORT_4 var_10 = var_10_arg_0 ? var_10_arg_1 : var_10_arg_2; [L65] SORT_1 var_11_arg_0 = input_3; [L66] SORT_4 var_11_arg_1 = var_5; [L67] SORT_4 var_11_arg_2 = var_10; [L68] SORT_4 var_11 = var_11_arg_0 ? var_11_arg_1 : var_11_arg_2; [L69] var_11 = var_11 & mask_SORT_4 [L70] SORT_4 next_12_arg_1 = var_11; [L72] state_6 = next_12_arg_1 VAL [bad_15_arg_0=0, init_7_arg_1=0, input_2=1, input_3=0, mask_SORT_1=1, mask_SORT_4=15, msb_SORT_1=1, msb_SORT_4=8, next_12_arg_1=4, state_6=4, var_10=4, var_10_arg_0=1, var_10_arg_1=4, var_10_arg_2=3, var_11=4, var_11_arg_0=0, var_11_arg_1=0, var_11_arg_2=4, var_13=15, var_14=0, var_14_arg_0=3, var_14_arg_1=15, var_5=0, var_8=1, var_9=4, var_9_arg_0=3, var_9_arg_1=1] [L46] input_2 = __VERIFIER_nondet_uchar() [L47] input_2 = input_2 & mask_SORT_1 [L48] input_3 = __VERIFIER_nondet_uchar() [L49] input_3 = input_3 & mask_SORT_1 [L52] SORT_4 var_14_arg_0 = state_6; [L53] SORT_4 var_14_arg_1 = var_13; [L54] SORT_1 var_14 = var_14_arg_0 == var_14_arg_1; [L55] SORT_1 bad_15_arg_0 = var_14; [L56] CALL __VERIFIER_assert(!(bad_15_arg_0)) [L22] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1] [L56] RET __VERIFIER_assert(!(bad_15_arg_0)) [L58] SORT_4 var_9_arg_0 = state_6; [L59] SORT_4 var_9_arg_1 = var_8; [L60] SORT_4 var_9 = var_9_arg_0 + var_9_arg_1; [L61] SORT_1 var_10_arg_0 = input_2; [L62] SORT_4 var_10_arg_1 = var_9; [L63] SORT_4 var_10_arg_2 = state_6; [L64] SORT_4 var_10 = var_10_arg_0 ? var_10_arg_1 : var_10_arg_2; [L65] SORT_1 var_11_arg_0 = input_3; [L66] SORT_4 var_11_arg_1 = var_5; [L67] SORT_4 var_11_arg_2 = var_10; [L68] SORT_4 var_11 = var_11_arg_0 ? var_11_arg_1 : var_11_arg_2; [L69] var_11 = var_11 & mask_SORT_4 [L70] SORT_4 next_12_arg_1 = var_11; [L72] state_6 = next_12_arg_1 VAL [bad_15_arg_0=0, init_7_arg_1=0, input_2=1, input_3=0, mask_SORT_1=1, mask_SORT_4=15, msb_SORT_1=1, msb_SORT_4=8, next_12_arg_1=5, state_6=5, var_10=5, var_10_arg_0=1, var_10_arg_1=5, var_10_arg_2=4, var_11=5, var_11_arg_0=0, var_11_arg_1=0, var_11_arg_2=5, var_13=15, var_14=0, var_14_arg_0=4, var_14_arg_1=15, var_5=0, var_8=1, var_9=5, var_9_arg_0=4, var_9_arg_1=1] [L46] input_2 = __VERIFIER_nondet_uchar() [L47] input_2 = input_2 & mask_SORT_1 [L48] input_3 = __VERIFIER_nondet_uchar() [L49] input_3 = input_3 & mask_SORT_1 [L52] SORT_4 var_14_arg_0 = state_6; [L53] SORT_4 var_14_arg_1 = var_13; [L54] SORT_1 var_14 = var_14_arg_0 == var_14_arg_1; [L55] SORT_1 bad_15_arg_0 = var_14; [L56] CALL __VERIFIER_assert(!(bad_15_arg_0)) [L22] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1] [L56] RET __VERIFIER_assert(!(bad_15_arg_0)) [L58] SORT_4 var_9_arg_0 = state_6; [L59] SORT_4 var_9_arg_1 = var_8; [L60] SORT_4 var_9 = var_9_arg_0 + var_9_arg_1; [L61] SORT_1 var_10_arg_0 = input_2; [L62] SORT_4 var_10_arg_1 = var_9; [L63] SORT_4 var_10_arg_2 = state_6; [L64] SORT_4 var_10 = var_10_arg_0 ? var_10_arg_1 : var_10_arg_2; [L65] SORT_1 var_11_arg_0 = input_3; [L66] SORT_4 var_11_arg_1 = var_5; [L67] SORT_4 var_11_arg_2 = var_10; [L68] SORT_4 var_11 = var_11_arg_0 ? var_11_arg_1 : var_11_arg_2; [L69] var_11 = var_11 & mask_SORT_4 [L70] SORT_4 next_12_arg_1 = var_11; [L72] state_6 = next_12_arg_1 VAL [bad_15_arg_0=0, init_7_arg_1=0, input_2=1, input_3=0, mask_SORT_1=1, mask_SORT_4=15, msb_SORT_1=1, msb_SORT_4=8, next_12_arg_1=6, state_6=6, var_10=6, var_10_arg_0=1, var_10_arg_1=6, var_10_arg_2=5, var_11=6, var_11_arg_0=0, var_11_arg_1=0, var_11_arg_2=6, var_13=15, var_14=0, var_14_arg_0=5, var_14_arg_1=15, var_5=0, var_8=1, var_9=6, var_9_arg_0=5, var_9_arg_1=1] [L46] input_2 = __VERIFIER_nondet_uchar() [L47] input_2 = input_2 & mask_SORT_1 [L48] input_3 = __VERIFIER_nondet_uchar() [L49] input_3 = input_3 & mask_SORT_1 [L52] SORT_4 var_14_arg_0 = state_6; [L53] SORT_4 var_14_arg_1 = var_13; [L54] SORT_1 var_14 = var_14_arg_0 == var_14_arg_1; [L55] SORT_1 bad_15_arg_0 = var_14; [L56] CALL __VERIFIER_assert(!(bad_15_arg_0)) [L22] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1] [L56] RET __VERIFIER_assert(!(bad_15_arg_0)) [L58] SORT_4 var_9_arg_0 = state_6; [L59] SORT_4 var_9_arg_1 = var_8; [L60] SORT_4 var_9 = var_9_arg_0 + var_9_arg_1; [L61] SORT_1 var_10_arg_0 = input_2; [L62] SORT_4 var_10_arg_1 = var_9; [L63] SORT_4 var_10_arg_2 = state_6; [L64] SORT_4 var_10 = var_10_arg_0 ? var_10_arg_1 : var_10_arg_2; [L65] SORT_1 var_11_arg_0 = input_3; [L66] SORT_4 var_11_arg_1 = var_5; [L67] SORT_4 var_11_arg_2 = var_10; [L68] SORT_4 var_11 = var_11_arg_0 ? var_11_arg_1 : var_11_arg_2; [L69] var_11 = var_11 & mask_SORT_4 [L70] SORT_4 next_12_arg_1 = var_11; [L72] state_6 = next_12_arg_1 VAL [bad_15_arg_0=0, init_7_arg_1=0, input_2=1, input_3=0, mask_SORT_1=1, mask_SORT_4=15, msb_SORT_1=1, msb_SORT_4=8, next_12_arg_1=7, state_6=7, var_10=7, var_10_arg_0=1, var_10_arg_1=7, var_10_arg_2=6, var_11=7, var_11_arg_0=0, var_11_arg_1=0, var_11_arg_2=7, var_13=15, var_14=0, var_14_arg_0=6, var_14_arg_1=15, var_5=0, var_8=1, var_9=7, var_9_arg_0=6, var_9_arg_1=1] [L46] input_2 = __VERIFIER_nondet_uchar() [L47] input_2 = input_2 & mask_SORT_1 [L48] input_3 = __VERIFIER_nondet_uchar() [L49] input_3 = input_3 & mask_SORT_1 [L52] SORT_4 var_14_arg_0 = state_6; [L53] SORT_4 var_14_arg_1 = var_13; [L54] SORT_1 var_14 = var_14_arg_0 == var_14_arg_1; [L55] SORT_1 bad_15_arg_0 = var_14; [L56] CALL __VERIFIER_assert(!(bad_15_arg_0)) [L22] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1] [L56] RET __VERIFIER_assert(!(bad_15_arg_0)) [L58] SORT_4 var_9_arg_0 = state_6; [L59] SORT_4 var_9_arg_1 = var_8; [L60] SORT_4 var_9 = var_9_arg_0 + var_9_arg_1; [L61] SORT_1 var_10_arg_0 = input_2; [L62] SORT_4 var_10_arg_1 = var_9; [L63] SORT_4 var_10_arg_2 = state_6; [L64] SORT_4 var_10 = var_10_arg_0 ? var_10_arg_1 : var_10_arg_2; [L65] SORT_1 var_11_arg_0 = input_3; [L66] SORT_4 var_11_arg_1 = var_5; [L67] SORT_4 var_11_arg_2 = var_10; [L68] SORT_4 var_11 = var_11_arg_0 ? var_11_arg_1 : var_11_arg_2; [L69] var_11 = var_11 & mask_SORT_4 [L70] SORT_4 next_12_arg_1 = var_11; [L72] state_6 = next_12_arg_1 VAL [bad_15_arg_0=0, init_7_arg_1=0, input_2=1, input_3=0, mask_SORT_1=1, mask_SORT_4=15, msb_SORT_1=1, msb_SORT_4=8, next_12_arg_1=8, state_6=8, var_10=8, var_10_arg_0=1, var_10_arg_1=8, var_10_arg_2=7, var_11=8, var_11_arg_0=0, var_11_arg_1=0, var_11_arg_2=8, var_13=15, var_14=0, var_14_arg_0=7, var_14_arg_1=15, var_5=0, var_8=1, var_9=8, var_9_arg_0=7, var_9_arg_1=1] [L46] input_2 = __VERIFIER_nondet_uchar() [L47] input_2 = input_2 & mask_SORT_1 [L48] input_3 = __VERIFIER_nondet_uchar() [L49] input_3 = input_3 & mask_SORT_1 [L52] SORT_4 var_14_arg_0 = state_6; [L53] SORT_4 var_14_arg_1 = var_13; [L54] SORT_1 var_14 = var_14_arg_0 == var_14_arg_1; [L55] SORT_1 bad_15_arg_0 = var_14; [L56] CALL __VERIFIER_assert(!(bad_15_arg_0)) [L22] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1] [L56] RET __VERIFIER_assert(!(bad_15_arg_0)) [L58] SORT_4 var_9_arg_0 = state_6; [L59] SORT_4 var_9_arg_1 = var_8; [L60] SORT_4 var_9 = var_9_arg_0 + var_9_arg_1; [L61] SORT_1 var_10_arg_0 = input_2; [L62] SORT_4 var_10_arg_1 = var_9; [L63] SORT_4 var_10_arg_2 = state_6; [L64] SORT_4 var_10 = var_10_arg_0 ? var_10_arg_1 : var_10_arg_2; [L65] SORT_1 var_11_arg_0 = input_3; [L66] SORT_4 var_11_arg_1 = var_5; [L67] SORT_4 var_11_arg_2 = var_10; [L68] SORT_4 var_11 = var_11_arg_0 ? var_11_arg_1 : var_11_arg_2; [L69] var_11 = var_11 & mask_SORT_4 [L70] SORT_4 next_12_arg_1 = var_11; [L72] state_6 = next_12_arg_1 VAL [bad_15_arg_0=0, init_7_arg_1=0, input_2=1, input_3=0, mask_SORT_1=1, mask_SORT_4=15, msb_SORT_1=1, msb_SORT_4=8, next_12_arg_1=9, state_6=9, var_10=9, var_10_arg_0=1, var_10_arg_1=9, var_10_arg_2=8, var_11=9, var_11_arg_0=0, var_11_arg_1=0, var_11_arg_2=9, var_13=15, var_14=0, var_14_arg_0=8, var_14_arg_1=15, var_5=0, var_8=1, var_9=9, var_9_arg_0=8, var_9_arg_1=1] [L46] input_2 = __VERIFIER_nondet_uchar() [L47] input_2 = input_2 & mask_SORT_1 [L48] input_3 = __VERIFIER_nondet_uchar() [L49] input_3 = input_3 & mask_SORT_1 [L52] SORT_4 var_14_arg_0 = state_6; [L53] SORT_4 var_14_arg_1 = var_13; [L54] SORT_1 var_14 = var_14_arg_0 == var_14_arg_1; [L55] SORT_1 bad_15_arg_0 = var_14; [L56] CALL __VERIFIER_assert(!(bad_15_arg_0)) [L22] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1] [L56] RET __VERIFIER_assert(!(bad_15_arg_0)) [L58] SORT_4 var_9_arg_0 = state_6; [L59] SORT_4 var_9_arg_1 = var_8; [L60] SORT_4 var_9 = var_9_arg_0 + var_9_arg_1; [L61] SORT_1 var_10_arg_0 = input_2; [L62] SORT_4 var_10_arg_1 = var_9; [L63] SORT_4 var_10_arg_2 = state_6; [L64] SORT_4 var_10 = var_10_arg_0 ? var_10_arg_1 : var_10_arg_2; [L65] SORT_1 var_11_arg_0 = input_3; [L66] SORT_4 var_11_arg_1 = var_5; [L67] SORT_4 var_11_arg_2 = var_10; [L68] SORT_4 var_11 = var_11_arg_0 ? var_11_arg_1 : var_11_arg_2; [L69] var_11 = var_11 & mask_SORT_4 [L70] SORT_4 next_12_arg_1 = var_11; [L72] state_6 = next_12_arg_1 VAL [bad_15_arg_0=0, init_7_arg_1=0, input_2=1, input_3=0, mask_SORT_1=1, mask_SORT_4=15, msb_SORT_1=1, msb_SORT_4=8, next_12_arg_1=10, state_6=10, var_10=10, var_10_arg_0=1, var_10_arg_1=10, var_10_arg_2=9, var_11=10, var_11_arg_0=0, var_11_arg_1=0, var_11_arg_2=10, var_13=15, var_14=0, var_14_arg_0=9, var_14_arg_1=15, var_5=0, var_8=1, var_9=10, var_9_arg_0=9, var_9_arg_1=1] [L46] input_2 = __VERIFIER_nondet_uchar() [L47] input_2 = input_2 & mask_SORT_1 [L48] input_3 = __VERIFIER_nondet_uchar() [L49] input_3 = input_3 & mask_SORT_1 [L52] SORT_4 var_14_arg_0 = state_6; [L53] SORT_4 var_14_arg_1 = var_13; [L54] SORT_1 var_14 = var_14_arg_0 == var_14_arg_1; [L55] SORT_1 bad_15_arg_0 = var_14; [L56] CALL __VERIFIER_assert(!(bad_15_arg_0)) [L22] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1] [L56] RET __VERIFIER_assert(!(bad_15_arg_0)) [L58] SORT_4 var_9_arg_0 = state_6; [L59] SORT_4 var_9_arg_1 = var_8; [L60] SORT_4 var_9 = var_9_arg_0 + var_9_arg_1; [L61] SORT_1 var_10_arg_0 = input_2; [L62] SORT_4 var_10_arg_1 = var_9; [L63] SORT_4 var_10_arg_2 = state_6; [L64] SORT_4 var_10 = var_10_arg_0 ? var_10_arg_1 : var_10_arg_2; [L65] SORT_1 var_11_arg_0 = input_3; [L66] SORT_4 var_11_arg_1 = var_5; [L67] SORT_4 var_11_arg_2 = var_10; [L68] SORT_4 var_11 = var_11_arg_0 ? var_11_arg_1 : var_11_arg_2; [L69] var_11 = var_11 & mask_SORT_4 [L70] SORT_4 next_12_arg_1 = var_11; [L72] state_6 = next_12_arg_1 VAL [bad_15_arg_0=0, init_7_arg_1=0, input_2=1, input_3=0, mask_SORT_1=1, mask_SORT_4=15, msb_SORT_1=1, msb_SORT_4=8, next_12_arg_1=11, state_6=11, var_10=11, var_10_arg_0=1, var_10_arg_1=11, var_10_arg_2=10, var_11=11, var_11_arg_0=0, var_11_arg_1=0, var_11_arg_2=11, var_13=15, var_14=0, var_14_arg_0=10, var_14_arg_1=15, var_5=0, var_8=1, var_9=11, var_9_arg_0=10, var_9_arg_1=1] [L46] input_2 = __VERIFIER_nondet_uchar() [L47] input_2 = input_2 & mask_SORT_1 [L48] input_3 = __VERIFIER_nondet_uchar() [L49] input_3 = input_3 & mask_SORT_1 [L52] SORT_4 var_14_arg_0 = state_6; [L53] SORT_4 var_14_arg_1 = var_13; [L54] SORT_1 var_14 = var_14_arg_0 == var_14_arg_1; [L55] SORT_1 bad_15_arg_0 = var_14; [L56] CALL __VERIFIER_assert(!(bad_15_arg_0)) [L22] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1] [L56] RET __VERIFIER_assert(!(bad_15_arg_0)) [L58] SORT_4 var_9_arg_0 = state_6; [L59] SORT_4 var_9_arg_1 = var_8; [L60] SORT_4 var_9 = var_9_arg_0 + var_9_arg_1; [L61] SORT_1 var_10_arg_0 = input_2; [L62] SORT_4 var_10_arg_1 = var_9; [L63] SORT_4 var_10_arg_2 = state_6; [L64] SORT_4 var_10 = var_10_arg_0 ? var_10_arg_1 : var_10_arg_2; [L65] SORT_1 var_11_arg_0 = input_3; [L66] SORT_4 var_11_arg_1 = var_5; [L67] SORT_4 var_11_arg_2 = var_10; [L68] SORT_4 var_11 = var_11_arg_0 ? var_11_arg_1 : var_11_arg_2; [L69] var_11 = var_11 & mask_SORT_4 [L70] SORT_4 next_12_arg_1 = var_11; [L72] state_6 = next_12_arg_1 VAL [bad_15_arg_0=0, init_7_arg_1=0, input_2=1, input_3=0, mask_SORT_1=1, mask_SORT_4=15, msb_SORT_1=1, msb_SORT_4=8, next_12_arg_1=12, state_6=12, var_10=12, var_10_arg_0=1, var_10_arg_1=12, var_10_arg_2=11, var_11=12, var_11_arg_0=0, var_11_arg_1=0, var_11_arg_2=12, var_13=15, var_14=0, var_14_arg_0=11, var_14_arg_1=15, var_5=0, var_8=1, var_9=12, var_9_arg_0=11, var_9_arg_1=1] [L46] input_2 = __VERIFIER_nondet_uchar() [L47] input_2 = input_2 & mask_SORT_1 [L48] input_3 = __VERIFIER_nondet_uchar() [L49] input_3 = input_3 & mask_SORT_1 [L52] SORT_4 var_14_arg_0 = state_6; [L53] SORT_4 var_14_arg_1 = var_13; [L54] SORT_1 var_14 = var_14_arg_0 == var_14_arg_1; [L55] SORT_1 bad_15_arg_0 = var_14; [L56] CALL __VERIFIER_assert(!(bad_15_arg_0)) [L22] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1] [L56] RET __VERIFIER_assert(!(bad_15_arg_0)) [L58] SORT_4 var_9_arg_0 = state_6; [L59] SORT_4 var_9_arg_1 = var_8; [L60] SORT_4 var_9 = var_9_arg_0 + var_9_arg_1; [L61] SORT_1 var_10_arg_0 = input_2; [L62] SORT_4 var_10_arg_1 = var_9; [L63] SORT_4 var_10_arg_2 = state_6; [L64] SORT_4 var_10 = var_10_arg_0 ? var_10_arg_1 : var_10_arg_2; [L65] SORT_1 var_11_arg_0 = input_3; [L66] SORT_4 var_11_arg_1 = var_5; [L67] SORT_4 var_11_arg_2 = var_10; [L68] SORT_4 var_11 = var_11_arg_0 ? var_11_arg_1 : var_11_arg_2; [L69] var_11 = var_11 & mask_SORT_4 [L70] SORT_4 next_12_arg_1 = var_11; [L72] state_6 = next_12_arg_1 VAL [bad_15_arg_0=0, init_7_arg_1=0, input_2=1, input_3=0, mask_SORT_1=1, mask_SORT_4=15, msb_SORT_1=1, msb_SORT_4=8, next_12_arg_1=13, state_6=13, var_10=13, var_10_arg_0=1, var_10_arg_1=13, var_10_arg_2=12, var_11=13, var_11_arg_0=0, var_11_arg_1=0, var_11_arg_2=13, var_13=15, var_14=0, var_14_arg_0=12, var_14_arg_1=15, var_5=0, var_8=1, var_9=13, var_9_arg_0=12, var_9_arg_1=1] [L46] input_2 = __VERIFIER_nondet_uchar() [L47] input_2 = input_2 & mask_SORT_1 [L48] input_3 = __VERIFIER_nondet_uchar() [L49] input_3 = input_3 & mask_SORT_1 [L52] SORT_4 var_14_arg_0 = state_6; [L53] SORT_4 var_14_arg_1 = var_13; [L54] SORT_1 var_14 = var_14_arg_0 == var_14_arg_1; [L55] SORT_1 bad_15_arg_0 = var_14; [L56] CALL __VERIFIER_assert(!(bad_15_arg_0)) [L22] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1] [L56] RET __VERIFIER_assert(!(bad_15_arg_0)) [L58] SORT_4 var_9_arg_0 = state_6; [L59] SORT_4 var_9_arg_1 = var_8; [L60] SORT_4 var_9 = var_9_arg_0 + var_9_arg_1; [L61] SORT_1 var_10_arg_0 = input_2; [L62] SORT_4 var_10_arg_1 = var_9; [L63] SORT_4 var_10_arg_2 = state_6; [L64] SORT_4 var_10 = var_10_arg_0 ? var_10_arg_1 : var_10_arg_2; [L65] SORT_1 var_11_arg_0 = input_3; [L66] SORT_4 var_11_arg_1 = var_5; [L67] SORT_4 var_11_arg_2 = var_10; [L68] SORT_4 var_11 = var_11_arg_0 ? var_11_arg_1 : var_11_arg_2; [L69] var_11 = var_11 & mask_SORT_4 [L70] SORT_4 next_12_arg_1 = var_11; [L72] state_6 = next_12_arg_1 VAL [bad_15_arg_0=0, init_7_arg_1=0, input_2=1, input_3=0, mask_SORT_1=1, mask_SORT_4=15, msb_SORT_1=1, msb_SORT_4=8, next_12_arg_1=14, state_6=14, var_10=14, var_10_arg_0=1, var_10_arg_1=14, var_10_arg_2=13, var_11=14, var_11_arg_0=0, var_11_arg_1=0, var_11_arg_2=14, var_13=15, var_14=0, var_14_arg_0=13, var_14_arg_1=15, var_5=0, var_8=1, var_9=14, var_9_arg_0=13, var_9_arg_1=1] [L46] input_2 = __VERIFIER_nondet_uchar() [L47] input_2 = input_2 & mask_SORT_1 [L48] input_3 = __VERIFIER_nondet_uchar() [L49] input_3 = input_3 & mask_SORT_1 [L52] SORT_4 var_14_arg_0 = state_6; [L53] SORT_4 var_14_arg_1 = var_13; [L54] SORT_1 var_14 = var_14_arg_0 == var_14_arg_1; [L55] SORT_1 bad_15_arg_0 = var_14; [L56] CALL __VERIFIER_assert(!(bad_15_arg_0)) [L22] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1] [L56] RET __VERIFIER_assert(!(bad_15_arg_0)) [L58] SORT_4 var_9_arg_0 = state_6; [L59] SORT_4 var_9_arg_1 = var_8; [L60] SORT_4 var_9 = var_9_arg_0 + var_9_arg_1; [L61] SORT_1 var_10_arg_0 = input_2; [L62] SORT_4 var_10_arg_1 = var_9; [L63] SORT_4 var_10_arg_2 = state_6; [L64] SORT_4 var_10 = var_10_arg_0 ? var_10_arg_1 : var_10_arg_2; [L65] SORT_1 var_11_arg_0 = input_3; [L66] SORT_4 var_11_arg_1 = var_5; [L67] SORT_4 var_11_arg_2 = var_10; [L68] SORT_4 var_11 = var_11_arg_0 ? var_11_arg_1 : var_11_arg_2; [L69] var_11 = var_11 & mask_SORT_4 [L70] SORT_4 next_12_arg_1 = var_11; [L72] state_6 = next_12_arg_1 VAL [bad_15_arg_0=0, init_7_arg_1=0, input_2=1, input_3=0, mask_SORT_1=1, mask_SORT_4=15, msb_SORT_1=1, msb_SORT_4=8, next_12_arg_1=15, state_6=15, var_10=15, var_10_arg_0=1, var_10_arg_1=15, var_10_arg_2=14, var_11=15, var_11_arg_0=0, var_11_arg_1=0, var_11_arg_2=15, var_13=15, var_14=0, var_14_arg_0=14, var_14_arg_1=15, var_5=0, var_8=1, var_9=15, var_9_arg_0=14, var_9_arg_1=1] [L46] input_2 = __VERIFIER_nondet_uchar() [L47] input_2 = input_2 & mask_SORT_1 [L48] input_3 = __VERIFIER_nondet_uchar() [L49] input_3 = input_3 & mask_SORT_1 [L52] SORT_4 var_14_arg_0 = state_6; [L53] SORT_4 var_14_arg_1 = var_13; [L54] SORT_1 var_14 = var_14_arg_0 == var_14_arg_1; [L55] SORT_1 bad_15_arg_0 = var_14; [L56] CALL __VERIFIER_assert(!(bad_15_arg_0)) [L22] COND TRUE !(cond) VAL [\old(cond)=0, cond=0] [L22] reach_error() VAL [\old(cond)=0, cond=0] - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 8 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 18.8s, OverallIterations: 5, TraceHistogramMax: 16, PathProgramHistogramMax: 4, EmptinessCheckTime: 0.0s, AutomataDifference: 5.8s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 81 SdHoareTripleChecker+Valid, 0.9s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 81 mSDsluCounter, 52 SdHoareTripleChecker+Invalid, 0.8s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 44 mSDsCounter, 25 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 133 IncrementalHoareTripleChecker+Invalid, 158 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 25 mSolverCounterUnsat, 8 mSDtfsCounter, 133 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 123 GetRequests, 48 SyntacticMatches, 0 SemanticMatches, 75 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 528 ImplicationChecksByTransitivity, 7.5s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=50occurred in iteration=4, InterpolantAutomatonStates: 64, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.0s AutomataMinimizationTime, 4 MinimizatonAttempts, 4 StatesRemovedByMinimization, 4 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.4s SatisfiabilityAnalysisTime, 10.9s InterpolantComputationTime, 98 NumberOfCodeBlocks, 98 NumberOfCodeBlocksAsserted, 14 NumberOfCheckSat, 87 ConstructedInterpolants, 0 QuantifiedInterpolants, 25485 SizeOfPredicates, 181 NumberOfNonLiveVariables, 366 ConjunctsInSsa, 179 ConjunctsInUnsatCore, 7 InterpolantComputations, 1 PerfectInterpolantSequences, 0/188 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-16 22:22:01,596 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...