/usr/bin/java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata ./data -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml --traceabstraction.trace.refinement.strategy FIXED_PREFERENCES --cacsl2boogietranslator.allow.undefined.functions true --traceabstraction.smt.solver Internal_SMTInterpol -s ../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Bitvector.epf -i ../../../trunk/examples/svcomp/bitvector/byte_add-1.i -------------------------------------------------------------------------------- This is Ultimate 0.2.5-dev-b75d321-m [2024-11-02 19:54:37,743 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-02 19:54:37,818 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Bitvector.epf [2024-11-02 19:54:37,825 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-02 19:54:37,825 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-02 19:54:37,859 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-02 19:54:37,859 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-02 19:54:37,860 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-02 19:54:37,861 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-02 19:54:37,864 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-02 19:54:37,864 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-02 19:54:37,865 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-02 19:54:37,865 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-02 19:54:37,866 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-02 19:54:37,866 INFO L153 SettingsManager]: * Use SBE=true [2024-11-02 19:54:37,866 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-02 19:54:37,866 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-02 19:54:37,867 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-02 19:54:37,867 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-02 19:54:37,868 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-02 19:54:37,869 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-02 19:54:37,869 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-02 19:54:37,870 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-02 19:54:37,870 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-11-02 19:54:37,870 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2024-11-02 19:54:37,870 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-02 19:54:37,871 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2024-11-02 19:54:37,871 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-02 19:54:37,871 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-02 19:54:37,871 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-02 19:54:37,871 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-02 19:54:37,872 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-02 19:54:37,872 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-02 19:54:37,873 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-02 19:54:37,873 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-02 19:54:37,873 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-02 19:54:37,873 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-02 19:54:37,873 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-02 19:54:37,874 INFO L153 SettingsManager]: * Trace refinement strategy=WOLF [2024-11-02 19:54:37,874 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2024-11-02 19:54:37,874 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-02 19:54:37,875 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-02 19:54:37,875 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-02 19:54:37,875 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-02 19:54:37,875 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: Trace refinement strategy -> FIXED_PREFERENCES Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Allow undefined functions -> true Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: SMT solver -> Internal_SMTInterpol [2024-11-02 19:54:38,113 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-02 19:54:38,139 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-02 19:54:38,141 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-02 19:54:38,142 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-02 19:54:38,142 INFO L274 PluginConnector]: CDTParser initialized [2024-11-02 19:54:38,144 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/bitvector/byte_add-1.i [2024-11-02 19:54:39,643 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-02 19:54:39,825 INFO L384 CDTParser]: Found 1 translation units. [2024-11-02 19:54:39,826 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/bitvector/byte_add-1.i [2024-11-02 19:54:39,840 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/fdbe40014/e5b7f84bc5e0419e8859248a38e320f8/FLAG489ccc223 [2024-11-02 19:54:40,215 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/fdbe40014/e5b7f84bc5e0419e8859248a38e320f8 [2024-11-02 19:54:40,217 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-02 19:54:40,218 INFO L133 ToolchainWalker]: Walking toolchain with 5 elements. [2024-11-02 19:54:40,220 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-02 19:54:40,220 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-02 19:54:40,225 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-02 19:54:40,226 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 02.11 07:54:40" (1/1) ... [2024-11-02 19:54:40,227 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6730ef5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 07:54:40, skipping insertion in model container [2024-11-02 19:54:40,227 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 02.11 07:54:40" (1/1) ... [2024-11-02 19:54:40,254 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-02 19:54:40,442 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/bitvector/byte_add-1.i[1166,1179] [2024-11-02 19:54:40,496 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-02 19:54:40,514 INFO L200 MainTranslator]: Completed pre-run [2024-11-02 19:54:40,525 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/bitvector/byte_add-1.i[1166,1179] [2024-11-02 19:54:40,558 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-02 19:54:40,575 INFO L204 MainTranslator]: Completed translation [2024-11-02 19:54:40,577 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 07:54:40 WrapperNode [2024-11-02 19:54:40,578 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-02 19:54:40,579 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-02 19:54:40,579 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-02 19:54:40,579 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-02 19:54:40,585 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 07:54:40" (1/1) ... [2024-11-02 19:54:40,595 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 07:54:40" (1/1) ... [2024-11-02 19:54:40,624 INFO L138 Inliner]: procedures = 16, calls = 8, calls flagged for inlining = 4, calls inlined = 4, statements flattened = 125 [2024-11-02 19:54:40,624 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-02 19:54:40,628 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-02 19:54:40,628 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-02 19:54:40,628 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-02 19:54:40,638 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 07:54:40" (1/1) ... [2024-11-02 19:54:40,638 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 07:54:40" (1/1) ... [2024-11-02 19:54:40,640 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 07:54:40" (1/1) ... [2024-11-02 19:54:40,659 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]. [2024-11-02 19:54:40,660 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 07:54:40" (1/1) ... [2024-11-02 19:54:40,660 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 07:54:40" (1/1) ... [2024-11-02 19:54:40,666 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 07:54:40" (1/1) ... [2024-11-02 19:54:40,673 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 07:54:40" (1/1) ... [2024-11-02 19:54:40,678 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 07:54:40" (1/1) ... [2024-11-02 19:54:40,679 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 07:54:40" (1/1) ... [2024-11-02 19:54:40,683 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-02 19:54:40,684 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-02 19:54:40,684 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-02 19:54:40,684 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-02 19:54:40,685 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 07:54:40" (1/1) ... [2024-11-02 19:54:40,689 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-02 19:54:40,699 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-02 19:54:40,714 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) [2024-11-02 19:54:40,720 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 [2024-11-02 19:54:40,744 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-02 19:54:40,745 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2024-11-02 19:54:40,745 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-02 19:54:40,745 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-02 19:54:40,818 INFO L238 CfgBuilder]: Building ICFG [2024-11-02 19:54:40,819 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-02 19:54:41,160 INFO L? ?]: Removed 23 outVars from TransFormulas that were not future-live. [2024-11-02 19:54:41,160 INFO L287 CfgBuilder]: Performing block encoding [2024-11-02 19:54:41,174 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-02 19:54:41,174 INFO L316 CfgBuilder]: Removed 2 assume(true) statements. [2024-11-02 19:54:41,175 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.11 07:54:41 BoogieIcfgContainer [2024-11-02 19:54:41,175 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-02 19:54:41,178 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-02 19:54:41,179 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-02 19:54:41,181 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-02 19:54:41,182 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 02.11 07:54:40" (1/3) ... [2024-11-02 19:54:41,183 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@724a9719 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 02.11 07:54:41, skipping insertion in model container [2024-11-02 19:54:41,183 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 07:54:40" (2/3) ... [2024-11-02 19:54:41,183 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@724a9719 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 02.11 07:54:41, skipping insertion in model container [2024-11-02 19:54:41,183 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.11 07:54:41" (3/3) ... [2024-11-02 19:54:41,184 INFO L112 eAbstractionObserver]: Analyzing ICFG byte_add-1.i [2024-11-02 19:54:41,202 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-02 19:54:41,203 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-11-02 19:54:41,267 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-02 19:54:41,274 INFO L333 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, 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;@6fe27d9d, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-02 19:54:41,274 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-02 19:54:41,278 INFO L276 IsEmpty]: Start isEmpty. Operand has 42 states, 40 states have (on average 1.775) internal successors, (71), 41 states have internal predecessors, (71), 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) [2024-11-02 19:54:41,284 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2024-11-02 19:54:41,285 INFO L207 NwaCegarLoop]: Found error trace [2024-11-02 19:54:41,285 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-02 19:54:41,286 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-02 19:54:41,291 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-02 19:54:41,291 INFO L85 PathProgramCache]: Analyzing trace with hash 255061167, now seen corresponding path program 1 times [2024-11-02 19:54:41,299 INFO L118 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2024-11-02 19:54:41,300 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1897191057] [2024-11-02 19:54:41,300 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-02 19:54:41,302 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-02 19:54:41,470 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-02 19:54:41,476 INFO L255 TraceCheckSpWp]: Trace formula consists of 37 conjuncts, 1 conjuncts are in the unsatisfiable core [2024-11-02 19:54:41,480 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-02 19:54:41,493 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-02 19:54:41,493 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-02 19:54:41,499 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-02 19:54:41,500 INFO L136 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2024-11-02 19:54:41,500 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1897191057] [2024-11-02 19:54:41,500 INFO L158 FreeRefinementEngine]: IpTcStrategyModulePreferences [1897191057] provided 2 perfect and 0 imperfect interpolant sequences [2024-11-02 19:54:41,500 INFO L185 FreeRefinementEngine]: Found 2 perfect and 0 imperfect interpolant sequences. [2024-11-02 19:54:41,501 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2, 2] imperfect sequences [] total 2 [2024-11-02 19:54:41,502 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1299302471] [2024-11-02 19:54:41,503 INFO L85 oduleStraightlineAll]: Using 2 perfect interpolants to construct interpolant automaton [2024-11-02 19:54:41,505 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-11-02 19:54:41,506 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2024-11-02 19:54:41,526 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-11-02 19:54:41,526 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-02 19:54:41,528 INFO L87 Difference]: Start difference. First operand has 42 states, 40 states have (on average 1.775) internal successors, (71), 41 states have internal predecessors, (71), 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 2 states, 2 states have (on average 6.0) internal successors, (12), 2 states have internal predecessors, (12), 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) [2024-11-02 19:54:41,561 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-02 19:54:41,562 INFO L93 Difference]: Finished difference Result 57 states and 92 transitions. [2024-11-02 19:54:41,563 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-02 19:54:41,564 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 6.0) internal successors, (12), 2 states have internal predecessors, (12), 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 12 [2024-11-02 19:54:41,564 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-02 19:54:41,569 INFO L225 Difference]: With dead ends: 57 [2024-11-02 19:54:41,569 INFO L226 Difference]: Without dead ends: 38 [2024-11-02 19:54:41,571 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 22 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-02 19:54:41,574 INFO L432 NwaCegarLoop]: 68 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 0 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 68 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-02 19:54:41,574 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 68 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-02 19:54:41,587 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 38 states. [2024-11-02 19:54:41,601 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 38 to 38. [2024-11-02 19:54:41,603 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 38 states, 37 states have (on average 1.7297297297297298) internal successors, (64), 37 states have internal predecessors, (64), 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) [2024-11-02 19:54:41,604 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38 states to 38 states and 64 transitions. [2024-11-02 19:54:41,605 INFO L78 Accepts]: Start accepts. Automaton has 38 states and 64 transitions. Word has length 12 [2024-11-02 19:54:41,605 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-02 19:54:41,605 INFO L471 AbstractCegarLoop]: Abstraction has 38 states and 64 transitions. [2024-11-02 19:54:41,605 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 6.0) internal successors, (12), 2 states have internal predecessors, (12), 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) [2024-11-02 19:54:41,606 INFO L276 IsEmpty]: Start isEmpty. Operand 38 states and 64 transitions. [2024-11-02 19:54:41,607 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2024-11-02 19:54:41,607 INFO L207 NwaCegarLoop]: Found error trace [2024-11-02 19:54:41,608 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-02 19:54:41,608 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-02 19:54:41,608 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-02 19:54:41,609 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-02 19:54:41,609 INFO L85 PathProgramCache]: Analyzing trace with hash 1803477009, now seen corresponding path program 1 times [2024-11-02 19:54:41,609 INFO L118 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2024-11-02 19:54:41,610 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [8117285] [2024-11-02 19:54:41,610 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-02 19:54:41,610 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-02 19:54:41,987 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-02 19:54:42,007 INFO L255 TraceCheckSpWp]: Trace formula consists of 39 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-11-02 19:54:42,010 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-02 19:54:42,070 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-02 19:54:42,071 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-02 19:54:42,107 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-02 19:54:42,108 INFO L136 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2024-11-02 19:54:42,108 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [8117285] [2024-11-02 19:54:42,108 INFO L158 FreeRefinementEngine]: IpTcStrategyModulePreferences [8117285] provided 2 perfect and 0 imperfect interpolant sequences [2024-11-02 19:54:42,108 INFO L185 FreeRefinementEngine]: Found 2 perfect and 0 imperfect interpolant sequences. [2024-11-02 19:54:42,108 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [] total 4 [2024-11-02 19:54:42,108 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1054544937] [2024-11-02 19:54:42,108 INFO L85 oduleStraightlineAll]: Using 2 perfect interpolants to construct interpolant automaton [2024-11-02 19:54:42,110 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-02 19:54:42,111 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2024-11-02 19:54:42,112 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-02 19:54:42,112 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-11-02 19:54:42,112 INFO L87 Difference]: Start difference. First operand 38 states and 64 transitions. Second operand has 4 states, 4 states have (on average 3.75) internal successors, (15), 4 states have internal predecessors, (15), 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) [2024-11-02 19:54:42,346 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-02 19:54:42,346 INFO L93 Difference]: Finished difference Result 107 states and 191 transitions. [2024-11-02 19:54:42,347 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-02 19:54:42,347 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 3.75) internal successors, (15), 4 states have internal predecessors, (15), 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 12 [2024-11-02 19:54:42,347 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-02 19:54:42,348 INFO L225 Difference]: With dead ends: 107 [2024-11-02 19:54:42,348 INFO L226 Difference]: Without dead ends: 79 [2024-11-02 19:54:42,349 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 19 SyntacticMatches, 1 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-11-02 19:54:42,350 INFO L432 NwaCegarLoop]: 23 mSDtfsCounter, 60 mSDsluCounter, 38 mSDsCounter, 0 mSdLazyCounter, 104 mSolverCounterSat, 35 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 60 SdHoareTripleChecker+Valid, 61 SdHoareTripleChecker+Invalid, 139 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 35 IncrementalHoareTripleChecker+Valid, 104 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-02 19:54:42,350 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [60 Valid, 61 Invalid, 139 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [35 Valid, 104 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-02 19:54:42,351 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 79 states. [2024-11-02 19:54:42,359 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 79 to 63. [2024-11-02 19:54:42,360 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 63 states, 62 states have (on average 1.5161290322580645) internal successors, (94), 62 states have internal predecessors, (94), 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) [2024-11-02 19:54:42,364 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 63 states to 63 states and 94 transitions. [2024-11-02 19:54:42,364 INFO L78 Accepts]: Start accepts. Automaton has 63 states and 94 transitions. Word has length 12 [2024-11-02 19:54:42,364 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-02 19:54:42,365 INFO L471 AbstractCegarLoop]: Abstraction has 63 states and 94 transitions. [2024-11-02 19:54:42,365 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 3.75) internal successors, (15), 4 states have internal predecessors, (15), 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) [2024-11-02 19:54:42,365 INFO L276 IsEmpty]: Start isEmpty. Operand 63 states and 94 transitions. [2024-11-02 19:54:42,366 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2024-11-02 19:54:42,366 INFO L207 NwaCegarLoop]: Found error trace [2024-11-02 19:54:42,366 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-02 19:54:42,366 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-02 19:54:42,366 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-02 19:54:42,367 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-02 19:54:42,367 INFO L85 PathProgramCache]: Analyzing trace with hash -235076041, now seen corresponding path program 1 times [2024-11-02 19:54:42,367 INFO L118 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2024-11-02 19:54:42,367 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1560681287] [2024-11-02 19:54:42,367 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-02 19:54:42,368 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-02 19:54:42,572 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-02 19:54:42,586 INFO L255 TraceCheckSpWp]: Trace formula consists of 55 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-11-02 19:54:42,588 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-02 19:54:42,619 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-11-02 19:54:42,619 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-02 19:54:42,635 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2024-11-02 19:54:42,635 INFO L136 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2024-11-02 19:54:42,635 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1560681287] [2024-11-02 19:54:42,636 INFO L158 FreeRefinementEngine]: IpTcStrategyModulePreferences [1560681287] provided 2 perfect and 0 imperfect interpolant sequences [2024-11-02 19:54:42,636 INFO L185 FreeRefinementEngine]: Found 2 perfect and 0 imperfect interpolant sequences. [2024-11-02 19:54:42,636 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4, 3] imperfect sequences [] total 5 [2024-11-02 19:54:42,639 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [784302944] [2024-11-02 19:54:42,639 INFO L85 oduleStraightlineAll]: Using 2 perfect interpolants to construct interpolant automaton [2024-11-02 19:54:42,641 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-02 19:54:42,641 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2024-11-02 19:54:42,641 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-02 19:54:42,642 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-11-02 19:54:42,642 INFO L87 Difference]: Start difference. First operand 63 states and 94 transitions. Second operand has 5 states, 5 states have (on average 5.2) internal successors, (26), 5 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) [2024-11-02 19:54:42,914 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-02 19:54:42,914 INFO L93 Difference]: Finished difference Result 150 states and 239 transitions. [2024-11-02 19:54:42,915 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-02 19:54:42,915 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 5.2) internal successors, (26), 5 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) Word has length 24 [2024-11-02 19:54:42,915 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-02 19:54:42,916 INFO L225 Difference]: With dead ends: 150 [2024-11-02 19:54:42,916 INFO L226 Difference]: Without dead ends: 102 [2024-11-02 19:54:42,917 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 48 GetRequests, 44 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=14, Invalid=16, Unknown=0, NotChecked=0, Total=30 [2024-11-02 19:54:42,918 INFO L432 NwaCegarLoop]: 28 mSDtfsCounter, 91 mSDsluCounter, 42 mSDsCounter, 0 mSdLazyCounter, 167 mSolverCounterSat, 43 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 91 SdHoareTripleChecker+Valid, 70 SdHoareTripleChecker+Invalid, 210 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 43 IncrementalHoareTripleChecker+Valid, 167 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-02 19:54:42,918 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [91 Valid, 70 Invalid, 210 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [43 Valid, 167 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-02 19:54:42,919 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 102 states. [2024-11-02 19:54:42,927 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 102 to 98. [2024-11-02 19:54:42,928 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 98 states, 97 states have (on average 1.4639175257731958) internal successors, (142), 97 states have internal predecessors, (142), 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) [2024-11-02 19:54:42,929 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 98 states to 98 states and 142 transitions. [2024-11-02 19:54:42,930 INFO L78 Accepts]: Start accepts. Automaton has 98 states and 142 transitions. Word has length 24 [2024-11-02 19:54:42,930 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-02 19:54:42,931 INFO L471 AbstractCegarLoop]: Abstraction has 98 states and 142 transitions. [2024-11-02 19:54:42,931 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 5.2) internal successors, (26), 5 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) [2024-11-02 19:54:42,931 INFO L276 IsEmpty]: Start isEmpty. Operand 98 states and 142 transitions. [2024-11-02 19:54:42,932 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2024-11-02 19:54:42,932 INFO L207 NwaCegarLoop]: Found error trace [2024-11-02 19:54:42,932 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-02 19:54:42,932 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-11-02 19:54:42,933 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-02 19:54:42,934 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-02 19:54:42,935 INFO L85 PathProgramCache]: Analyzing trace with hash 730584695, now seen corresponding path program 1 times [2024-11-02 19:54:42,935 INFO L118 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2024-11-02 19:54:42,936 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [265935177] [2024-11-02 19:54:42,936 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-02 19:54:42,936 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-02 19:54:43,115 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-02 19:54:43,123 INFO L255 TraceCheckSpWp]: Trace formula consists of 53 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-11-02 19:54:43,124 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-02 19:54:43,156 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2024-11-02 19:54:43,157 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-02 19:54:43,206 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2024-11-02 19:54:43,206 INFO L136 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2024-11-02 19:54:43,206 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [265935177] [2024-11-02 19:54:43,207 INFO L158 FreeRefinementEngine]: IpTcStrategyModulePreferences [265935177] provided 2 perfect and 0 imperfect interpolant sequences [2024-11-02 19:54:43,207 INFO L185 FreeRefinementEngine]: Found 2 perfect and 0 imperfect interpolant sequences. [2024-11-02 19:54:43,207 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4, 5] imperfect sequences [] total 7 [2024-11-02 19:54:43,207 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [58750104] [2024-11-02 19:54:43,207 INFO L85 oduleStraightlineAll]: Using 2 perfect interpolants to construct interpolant automaton [2024-11-02 19:54:43,208 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-02 19:54:43,208 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2024-11-02 19:54:43,208 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-02 19:54:43,208 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2024-11-02 19:54:43,209 INFO L87 Difference]: Start difference. First operand 98 states and 142 transitions. Second operand has 7 states, 7 states have (on average 3.857142857142857) internal successors, (27), 7 states have internal predecessors, (27), 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) [2024-11-02 19:54:43,531 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-02 19:54:43,531 INFO L93 Difference]: Finished difference Result 351 states and 521 transitions. [2024-11-02 19:54:43,532 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-11-02 19:54:43,532 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 3.857142857142857) internal successors, (27), 7 states have internal predecessors, (27), 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 24 [2024-11-02 19:54:43,532 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-02 19:54:43,534 INFO L225 Difference]: With dead ends: 351 [2024-11-02 19:54:43,534 INFO L226 Difference]: Without dead ends: 260 [2024-11-02 19:54:43,535 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 49 GetRequests, 41 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=37, Invalid=53, Unknown=0, NotChecked=0, Total=90 [2024-11-02 19:54:43,536 INFO L432 NwaCegarLoop]: 68 mSDtfsCounter, 205 mSDsluCounter, 88 mSDsCounter, 0 mSdLazyCounter, 251 mSolverCounterSat, 18 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 205 SdHoareTripleChecker+Valid, 156 SdHoareTripleChecker+Invalid, 269 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 18 IncrementalHoareTripleChecker+Valid, 251 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-11-02 19:54:43,536 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [205 Valid, 156 Invalid, 269 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [18 Valid, 251 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-11-02 19:54:43,537 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 260 states. [2024-11-02 19:54:43,560 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 260 to 182. [2024-11-02 19:54:43,561 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 182 states, 181 states have (on average 1.4364640883977902) internal successors, (260), 181 states have internal predecessors, (260), 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) [2024-11-02 19:54:43,562 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 182 states to 182 states and 260 transitions. [2024-11-02 19:54:43,563 INFO L78 Accepts]: Start accepts. Automaton has 182 states and 260 transitions. Word has length 24 [2024-11-02 19:54:43,563 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-02 19:54:43,563 INFO L471 AbstractCegarLoop]: Abstraction has 182 states and 260 transitions. [2024-11-02 19:54:43,565 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 3.857142857142857) internal successors, (27), 7 states have internal predecessors, (27), 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) [2024-11-02 19:54:43,565 INFO L276 IsEmpty]: Start isEmpty. Operand 182 states and 260 transitions. [2024-11-02 19:54:43,568 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2024-11-02 19:54:43,569 INFO L207 NwaCegarLoop]: Found error trace [2024-11-02 19:54:43,569 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-02 19:54:43,569 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-11-02 19:54:43,569 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-02 19:54:43,570 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-02 19:54:43,570 INFO L85 PathProgramCache]: Analyzing trace with hash 1578156322, now seen corresponding path program 1 times [2024-11-02 19:54:43,570 INFO L118 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2024-11-02 19:54:43,572 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1645478] [2024-11-02 19:54:43,573 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-02 19:54:43,573 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-02 19:54:43,794 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-02 19:54:43,809 INFO L255 TraceCheckSpWp]: Trace formula consists of 58 conjuncts, 5 conjuncts are in the unsatisfiable core [2024-11-02 19:54:43,812 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-02 19:54:43,840 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2024-11-02 19:54:43,840 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-02 19:54:43,881 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2024-11-02 19:54:43,882 INFO L136 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2024-11-02 19:54:43,882 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1645478] [2024-11-02 19:54:43,882 INFO L158 FreeRefinementEngine]: IpTcStrategyModulePreferences [1645478] provided 2 perfect and 0 imperfect interpolant sequences [2024-11-02 19:54:43,882 INFO L185 FreeRefinementEngine]: Found 2 perfect and 0 imperfect interpolant sequences. [2024-11-02 19:54:43,882 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4, 5] imperfect sequences [] total 7 [2024-11-02 19:54:43,882 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1442098470] [2024-11-02 19:54:43,882 INFO L85 oduleStraightlineAll]: Using 2 perfect interpolants to construct interpolant automaton [2024-11-02 19:54:43,883 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-02 19:54:43,883 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2024-11-02 19:54:43,883 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-02 19:54:43,884 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2024-11-02 19:54:43,884 INFO L87 Difference]: Start difference. First operand 182 states and 260 transitions. Second operand has 7 states, 7 states have (on average 3.857142857142857) internal successors, (27), 7 states have internal predecessors, (27), 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) [2024-11-02 19:54:44,202 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-02 19:54:44,202 INFO L93 Difference]: Finished difference Result 658 states and 945 transitions. [2024-11-02 19:54:44,203 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-11-02 19:54:44,203 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 3.857142857142857) internal successors, (27), 7 states have internal predecessors, (27), 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 26 [2024-11-02 19:54:44,204 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-02 19:54:44,206 INFO L225 Difference]: With dead ends: 658 [2024-11-02 19:54:44,206 INFO L226 Difference]: Without dead ends: 492 [2024-11-02 19:54:44,207 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 53 GetRequests, 45 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=37, Invalid=53, Unknown=0, NotChecked=0, Total=90 [2024-11-02 19:54:44,208 INFO L432 NwaCegarLoop]: 62 mSDtfsCounter, 158 mSDsluCounter, 129 mSDsCounter, 0 mSdLazyCounter, 244 mSolverCounterSat, 13 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 158 SdHoareTripleChecker+Valid, 191 SdHoareTripleChecker+Invalid, 257 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 13 IncrementalHoareTripleChecker+Valid, 244 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-11-02 19:54:44,208 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [158 Valid, 191 Invalid, 257 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [13 Valid, 244 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-11-02 19:54:44,210 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 492 states. [2024-11-02 19:54:44,249 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 492 to 430. [2024-11-02 19:54:44,251 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 430 states, 429 states have (on average 1.4195804195804196) internal successors, (609), 429 states have internal predecessors, (609), 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) [2024-11-02 19:54:44,255 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 430 states to 430 states and 609 transitions. [2024-11-02 19:54:44,255 INFO L78 Accepts]: Start accepts. Automaton has 430 states and 609 transitions. Word has length 26 [2024-11-02 19:54:44,256 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-02 19:54:44,256 INFO L471 AbstractCegarLoop]: Abstraction has 430 states and 609 transitions. [2024-11-02 19:54:44,257 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 3.857142857142857) internal successors, (27), 7 states have internal predecessors, (27), 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) [2024-11-02 19:54:44,257 INFO L276 IsEmpty]: Start isEmpty. Operand 430 states and 609 transitions. [2024-11-02 19:54:44,259 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2024-11-02 19:54:44,259 INFO L207 NwaCegarLoop]: Found error trace [2024-11-02 19:54:44,259 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-02 19:54:44,260 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-11-02 19:54:44,260 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-02 19:54:44,260 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-02 19:54:44,260 INFO L85 PathProgramCache]: Analyzing trace with hash 1110801003, now seen corresponding path program 1 times [2024-11-02 19:54:44,261 INFO L118 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2024-11-02 19:54:44,261 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [444751234] [2024-11-02 19:54:44,261 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-02 19:54:44,261 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-02 19:54:44,463 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-02 19:54:44,472 INFO L255 TraceCheckSpWp]: Trace formula consists of 62 conjuncts, 7 conjuncts are in the unsatisfiable core [2024-11-02 19:54:44,474 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-02 19:54:44,555 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2024-11-02 19:54:44,555 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-02 19:54:44,664 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2024-11-02 19:54:44,665 INFO L136 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2024-11-02 19:54:44,665 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [444751234] [2024-11-02 19:54:44,665 INFO L158 FreeRefinementEngine]: IpTcStrategyModulePreferences [444751234] provided 2 perfect and 0 imperfect interpolant sequences [2024-11-02 19:54:44,665 INFO L185 FreeRefinementEngine]: Found 2 perfect and 0 imperfect interpolant sequences. [2024-11-02 19:54:44,665 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7, 8] imperfect sequences [] total 13 [2024-11-02 19:54:44,665 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [787661683] [2024-11-02 19:54:44,665 INFO L85 oduleStraightlineAll]: Using 2 perfect interpolants to construct interpolant automaton [2024-11-02 19:54:44,666 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2024-11-02 19:54:44,666 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2024-11-02 19:54:44,670 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2024-11-02 19:54:44,670 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=43, Invalid=113, Unknown=0, NotChecked=0, Total=156 [2024-11-02 19:54:44,671 INFO L87 Difference]: Start difference. First operand 430 states and 609 transitions. Second operand has 13 states, 13 states have (on average 2.6923076923076925) internal successors, (35), 13 states have internal predecessors, (35), 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) [2024-11-02 19:54:45,232 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-02 19:54:45,232 INFO L93 Difference]: Finished difference Result 1019 states and 1467 transitions. [2024-11-02 19:54:45,232 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-11-02 19:54:45,233 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 2.6923076923076925) internal successors, (35), 13 states have internal predecessors, (35), 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 28 [2024-11-02 19:54:45,233 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-02 19:54:45,237 INFO L225 Difference]: With dead ends: 1019 [2024-11-02 19:54:45,237 INFO L226 Difference]: Without dead ends: 812 [2024-11-02 19:54:45,238 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 58 GetRequests, 43 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 28 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=75, Invalid=197, Unknown=0, NotChecked=0, Total=272 [2024-11-02 19:54:45,239 INFO L432 NwaCegarLoop]: 111 mSDtfsCounter, 440 mSDsluCounter, 435 mSDsCounter, 0 mSdLazyCounter, 634 mSolverCounterSat, 33 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 440 SdHoareTripleChecker+Valid, 546 SdHoareTripleChecker+Invalid, 667 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 33 IncrementalHoareTripleChecker+Valid, 634 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-11-02 19:54:45,239 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [440 Valid, 546 Invalid, 667 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [33 Valid, 634 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2024-11-02 19:54:45,245 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 812 states. [2024-11-02 19:54:45,266 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 812 to 780. [2024-11-02 19:54:45,267 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 780 states, 779 states have (on average 1.4094993581514763) internal successors, (1098), 779 states have internal predecessors, (1098), 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) [2024-11-02 19:54:45,270 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 780 states to 780 states and 1098 transitions. [2024-11-02 19:54:45,270 INFO L78 Accepts]: Start accepts. Automaton has 780 states and 1098 transitions. Word has length 28 [2024-11-02 19:54:45,270 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-02 19:54:45,270 INFO L471 AbstractCegarLoop]: Abstraction has 780 states and 1098 transitions. [2024-11-02 19:54:45,271 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 2.6923076923076925) internal successors, (35), 13 states have internal predecessors, (35), 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) [2024-11-02 19:54:45,271 INFO L276 IsEmpty]: Start isEmpty. Operand 780 states and 1098 transitions. [2024-11-02 19:54:45,272 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2024-11-02 19:54:45,272 INFO L207 NwaCegarLoop]: Found error trace [2024-11-02 19:54:45,273 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-02 19:54:45,273 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-11-02 19:54:45,273 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-02 19:54:45,273 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-02 19:54:45,273 INFO L85 PathProgramCache]: Analyzing trace with hash -2082362030, now seen corresponding path program 1 times [2024-11-02 19:54:45,274 INFO L118 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2024-11-02 19:54:45,274 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1664972668] [2024-11-02 19:54:45,274 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-02 19:54:45,274 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-02 19:54:45,376 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-02 19:54:45,383 INFO L255 TraceCheckSpWp]: Trace formula consists of 71 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-11-02 19:54:45,385 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-02 19:54:45,401 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-11-02 19:54:45,402 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-02 19:54:45,417 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-11-02 19:54:45,417 INFO L136 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2024-11-02 19:54:45,418 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1664972668] [2024-11-02 19:54:45,418 INFO L158 FreeRefinementEngine]: IpTcStrategyModulePreferences [1664972668] provided 2 perfect and 0 imperfect interpolant sequences [2024-11-02 19:54:45,418 INFO L185 FreeRefinementEngine]: Found 2 perfect and 0 imperfect interpolant sequences. [2024-11-02 19:54:45,418 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [] total 4 [2024-11-02 19:54:45,418 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [746348126] [2024-11-02 19:54:45,418 INFO L85 oduleStraightlineAll]: Using 2 perfect interpolants to construct interpolant automaton [2024-11-02 19:54:45,419 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-02 19:54:45,419 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2024-11-02 19:54:45,419 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-02 19:54:45,419 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-11-02 19:54:45,419 INFO L87 Difference]: Start difference. First operand 780 states and 1098 transitions. Second operand has 4 states, 4 states have (on average 10.25) internal successors, (41), 4 states have internal predecessors, (41), 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) [2024-11-02 19:54:45,451 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-02 19:54:45,451 INFO L93 Difference]: Finished difference Result 1099 states and 1513 transitions. [2024-11-02 19:54:45,452 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-02 19:54:45,452 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 10.25) internal successors, (41), 4 states have internal predecessors, (41), 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 34 [2024-11-02 19:54:45,452 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-02 19:54:45,456 INFO L225 Difference]: With dead ends: 1099 [2024-11-02 19:54:45,456 INFO L226 Difference]: Without dead ends: 1077 [2024-11-02 19:54:45,457 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 66 GetRequests, 64 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-11-02 19:54:45,459 INFO L432 NwaCegarLoop]: 64 mSDtfsCounter, 8 mSDsluCounter, 58 mSDsCounter, 0 mSdLazyCounter, 7 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 8 SdHoareTripleChecker+Valid, 122 SdHoareTripleChecker+Invalid, 7 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 7 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-02 19:54:45,460 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [8 Valid, 122 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 7 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-02 19:54:45,461 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1077 states. [2024-11-02 19:54:45,490 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1077 to 991. [2024-11-02 19:54:45,491 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 991 states, 990 states have (on average 1.3838383838383839) internal successors, (1370), 990 states have internal predecessors, (1370), 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) [2024-11-02 19:54:45,494 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 991 states to 991 states and 1370 transitions. [2024-11-02 19:54:45,495 INFO L78 Accepts]: Start accepts. Automaton has 991 states and 1370 transitions. Word has length 34 [2024-11-02 19:54:45,495 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-02 19:54:45,496 INFO L471 AbstractCegarLoop]: Abstraction has 991 states and 1370 transitions. [2024-11-02 19:54:45,496 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 10.25) internal successors, (41), 4 states have internal predecessors, (41), 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) [2024-11-02 19:54:45,496 INFO L276 IsEmpty]: Start isEmpty. Operand 991 states and 1370 transitions. [2024-11-02 19:54:45,499 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2024-11-02 19:54:45,499 INFO L207 NwaCegarLoop]: Found error trace [2024-11-02 19:54:45,499 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-02 19:54:45,499 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-11-02 19:54:45,499 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-02 19:54:45,500 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-02 19:54:45,500 INFO L85 PathProgramCache]: Analyzing trace with hash 218460560, now seen corresponding path program 1 times [2024-11-02 19:54:45,500 INFO L118 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2024-11-02 19:54:45,500 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [15147929] [2024-11-02 19:54:45,500 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-02 19:54:45,500 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-02 19:54:45,703 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-02 19:54:45,711 INFO L255 TraceCheckSpWp]: Trace formula consists of 69 conjuncts, 14 conjuncts are in the unsatisfiable core [2024-11-02 19:54:45,714 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-02 19:54:45,841 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-11-02 19:54:45,842 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-02 19:54:46,024 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-02 19:54:46,025 INFO L136 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2024-11-02 19:54:46,025 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [15147929] [2024-11-02 19:54:46,025 INFO L158 FreeRefinementEngine]: IpTcStrategyModulePreferences [15147929] provided 2 perfect and 0 imperfect interpolant sequences [2024-11-02 19:54:46,025 INFO L185 FreeRefinementEngine]: Found 2 perfect and 0 imperfect interpolant sequences. [2024-11-02 19:54:46,025 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8, 9] imperfect sequences [] total 15 [2024-11-02 19:54:46,025 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1494110749] [2024-11-02 19:54:46,026 INFO L85 oduleStraightlineAll]: Using 2 perfect interpolants to construct interpolant automaton [2024-11-02 19:54:46,026 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2024-11-02 19:54:46,026 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2024-11-02 19:54:46,026 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2024-11-02 19:54:46,027 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=77, Invalid=133, Unknown=0, NotChecked=0, Total=210 [2024-11-02 19:54:46,027 INFO L87 Difference]: Start difference. First operand 991 states and 1370 transitions. Second operand has 15 states, 15 states have (on average 3.933333333333333) internal successors, (59), 15 states have internal predecessors, (59), 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) [2024-11-02 19:54:47,338 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-02 19:54:47,339 INFO L93 Difference]: Finished difference Result 2442 states and 3378 transitions. [2024-11-02 19:54:47,339 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2024-11-02 19:54:47,340 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 15 states have (on average 3.933333333333333) internal successors, (59), 15 states have internal predecessors, (59), 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 34 [2024-11-02 19:54:47,340 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-02 19:54:47,345 INFO L225 Difference]: With dead ends: 2442 [2024-11-02 19:54:47,346 INFO L226 Difference]: Without dead ends: 1504 [2024-11-02 19:54:47,348 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 83 GetRequests, 53 SyntacticMatches, 0 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 265 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=350, Invalid=642, Unknown=0, NotChecked=0, Total=992 [2024-11-02 19:54:47,349 INFO L432 NwaCegarLoop]: 63 mSDtfsCounter, 933 mSDsluCounter, 259 mSDsCounter, 0 mSdLazyCounter, 940 mSolverCounterSat, 54 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 933 SdHoareTripleChecker+Valid, 322 SdHoareTripleChecker+Invalid, 994 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 54 IncrementalHoareTripleChecker+Valid, 940 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2024-11-02 19:54:47,349 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [933 Valid, 322 Invalid, 994 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [54 Valid, 940 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2024-11-02 19:54:47,351 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1504 states. [2024-11-02 19:54:47,389 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1504 to 1297. [2024-11-02 19:54:47,392 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1297 states, 1296 states have (on average 1.3209876543209877) internal successors, (1712), 1296 states have internal predecessors, (1712), 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) [2024-11-02 19:54:47,395 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1297 states to 1297 states and 1712 transitions. [2024-11-02 19:54:47,396 INFO L78 Accepts]: Start accepts. Automaton has 1297 states and 1712 transitions. Word has length 34 [2024-11-02 19:54:47,396 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-02 19:54:47,396 INFO L471 AbstractCegarLoop]: Abstraction has 1297 states and 1712 transitions. [2024-11-02 19:54:47,396 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 15 states have (on average 3.933333333333333) internal successors, (59), 15 states have internal predecessors, (59), 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) [2024-11-02 19:54:47,397 INFO L276 IsEmpty]: Start isEmpty. Operand 1297 states and 1712 transitions. [2024-11-02 19:54:47,398 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2024-11-02 19:54:47,399 INFO L207 NwaCegarLoop]: Found error trace [2024-11-02 19:54:47,399 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-02 19:54:47,399 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-11-02 19:54:47,399 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-02 19:54:47,400 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-02 19:54:47,400 INFO L85 PathProgramCache]: Analyzing trace with hash -1990369840, now seen corresponding path program 1 times [2024-11-02 19:54:47,400 INFO L118 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2024-11-02 19:54:47,400 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1598507439] [2024-11-02 19:54:47,400 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-02 19:54:47,400 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-02 19:54:47,471 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-02 19:54:47,478 INFO L255 TraceCheckSpWp]: Trace formula consists of 71 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-11-02 19:54:47,479 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-02 19:54:47,495 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-11-02 19:54:47,496 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-02 19:54:47,502 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-11-02 19:54:47,502 INFO L136 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2024-11-02 19:54:47,503 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1598507439] [2024-11-02 19:54:47,503 INFO L158 FreeRefinementEngine]: IpTcStrategyModulePreferences [1598507439] provided 2 perfect and 0 imperfect interpolant sequences [2024-11-02 19:54:47,503 INFO L185 FreeRefinementEngine]: Found 2 perfect and 0 imperfect interpolant sequences. [2024-11-02 19:54:47,503 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [] total 4 [2024-11-02 19:54:47,503 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1268335957] [2024-11-02 19:54:47,503 INFO L85 oduleStraightlineAll]: Using 2 perfect interpolants to construct interpolant automaton [2024-11-02 19:54:47,504 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-02 19:54:47,504 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2024-11-02 19:54:47,504 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-02 19:54:47,504 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-11-02 19:54:47,504 INFO L87 Difference]: Start difference. First operand 1297 states and 1712 transitions. Second operand has 4 states, 4 states have (on average 9.0) internal successors, (36), 4 states have internal predecessors, (36), 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) [2024-11-02 19:54:47,664 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-02 19:54:47,665 INFO L93 Difference]: Finished difference Result 2783 states and 3665 transitions. [2024-11-02 19:54:47,665 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-02 19:54:47,665 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 9.0) internal successors, (36), 4 states have internal predecessors, (36), 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 34 [2024-11-02 19:54:47,665 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-02 19:54:47,671 INFO L225 Difference]: With dead ends: 2783 [2024-11-02 19:54:47,671 INFO L226 Difference]: Without dead ends: 1545 [2024-11-02 19:54:47,673 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 66 GetRequests, 64 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-11-02 19:54:47,674 INFO L432 NwaCegarLoop]: 45 mSDtfsCounter, 35 mSDsluCounter, 38 mSDsCounter, 0 mSdLazyCounter, 116 mSolverCounterSat, 23 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 35 SdHoareTripleChecker+Valid, 83 SdHoareTripleChecker+Invalid, 139 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 23 IncrementalHoareTripleChecker+Valid, 116 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-02 19:54:47,675 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [35 Valid, 83 Invalid, 139 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [23 Valid, 116 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-02 19:54:47,676 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1545 states. [2024-11-02 19:54:47,714 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1545 to 1326. [2024-11-02 19:54:47,716 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1326 states, 1325 states have (on average 1.2883018867924527) internal successors, (1707), 1325 states have internal predecessors, (1707), 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) [2024-11-02 19:54:47,720 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1326 states to 1326 states and 1707 transitions. [2024-11-02 19:54:47,721 INFO L78 Accepts]: Start accepts. Automaton has 1326 states and 1707 transitions. Word has length 34 [2024-11-02 19:54:47,721 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-02 19:54:47,721 INFO L471 AbstractCegarLoop]: Abstraction has 1326 states and 1707 transitions. [2024-11-02 19:54:47,722 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 9.0) internal successors, (36), 4 states have internal predecessors, (36), 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) [2024-11-02 19:54:47,722 INFO L276 IsEmpty]: Start isEmpty. Operand 1326 states and 1707 transitions. [2024-11-02 19:54:47,724 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2024-11-02 19:54:47,724 INFO L207 NwaCegarLoop]: Found error trace [2024-11-02 19:54:47,724 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-02 19:54:47,724 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-11-02 19:54:47,724 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-02 19:54:47,725 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-02 19:54:47,725 INFO L85 PathProgramCache]: Analyzing trace with hash -215362478, now seen corresponding path program 1 times [2024-11-02 19:54:47,725 INFO L118 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2024-11-02 19:54:47,725 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1275979393] [2024-11-02 19:54:47,725 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-02 19:54:47,725 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-02 19:54:47,899 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-02 19:54:47,907 INFO L255 TraceCheckSpWp]: Trace formula consists of 70 conjuncts, 12 conjuncts are in the unsatisfiable core [2024-11-02 19:54:47,910 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-02 19:54:48,025 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-02 19:54:48,025 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-02 19:54:48,195 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-02 19:54:48,195 INFO L136 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2024-11-02 19:54:48,195 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1275979393] [2024-11-02 19:54:48,195 INFO L158 FreeRefinementEngine]: IpTcStrategyModulePreferences [1275979393] provided 1 perfect and 1 imperfect interpolant sequences [2024-11-02 19:54:48,195 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-02 19:54:48,195 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [7] total 14 [2024-11-02 19:54:48,195 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [642890770] [2024-11-02 19:54:48,196 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-02 19:54:48,196 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-11-02 19:54:48,196 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2024-11-02 19:54:48,196 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-11-02 19:54:48,197 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=56, Invalid=126, Unknown=0, NotChecked=0, Total=182 [2024-11-02 19:54:48,197 INFO L87 Difference]: Start difference. First operand 1326 states and 1707 transitions. Second operand has 9 states, 9 states have (on average 3.7777777777777777) internal successors, (34), 9 states have internal predecessors, (34), 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) [2024-11-02 19:54:48,797 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-02 19:54:48,797 INFO L93 Difference]: Finished difference Result 2114 states and 2686 transitions. [2024-11-02 19:54:48,797 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2024-11-02 19:54:48,798 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 3.7777777777777777) internal successors, (34), 9 states have internal predecessors, (34), 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 34 [2024-11-02 19:54:48,798 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-02 19:54:48,805 INFO L225 Difference]: With dead ends: 2114 [2024-11-02 19:54:48,805 INFO L226 Difference]: Without dead ends: 1649 [2024-11-02 19:54:48,807 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 74 GetRequests, 53 SyntacticMatches, 1 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 84 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=138, Invalid=324, Unknown=0, NotChecked=0, Total=462 [2024-11-02 19:54:48,807 INFO L432 NwaCegarLoop]: 35 mSDtfsCounter, 432 mSDsluCounter, 111 mSDsCounter, 0 mSdLazyCounter, 350 mSolverCounterSat, 46 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 432 SdHoareTripleChecker+Valid, 146 SdHoareTripleChecker+Invalid, 396 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 46 IncrementalHoareTripleChecker+Valid, 350 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-11-02 19:54:48,808 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [432 Valid, 146 Invalid, 396 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [46 Valid, 350 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-11-02 19:54:48,810 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1649 states. [2024-11-02 19:54:48,875 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1649 to 1319. [2024-11-02 19:54:48,879 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1319 states, 1318 states have (on average 1.282245827010622) internal successors, (1690), 1318 states have internal predecessors, (1690), 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) [2024-11-02 19:54:48,882 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1319 states to 1319 states and 1690 transitions. [2024-11-02 19:54:48,883 INFO L78 Accepts]: Start accepts. Automaton has 1319 states and 1690 transitions. Word has length 34 [2024-11-02 19:54:48,883 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-02 19:54:48,883 INFO L471 AbstractCegarLoop]: Abstraction has 1319 states and 1690 transitions. [2024-11-02 19:54:48,884 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 3.7777777777777777) internal successors, (34), 9 states have internal predecessors, (34), 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) [2024-11-02 19:54:48,884 INFO L276 IsEmpty]: Start isEmpty. Operand 1319 states and 1690 transitions. [2024-11-02 19:54:48,886 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2024-11-02 19:54:48,886 INFO L207 NwaCegarLoop]: Found error trace [2024-11-02 19:54:48,886 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-02 19:54:48,886 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2024-11-02 19:54:48,886 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-02 19:54:48,887 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-02 19:54:48,887 INFO L85 PathProgramCache]: Analyzing trace with hash 1495250830, now seen corresponding path program 1 times [2024-11-02 19:54:48,887 INFO L118 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2024-11-02 19:54:48,887 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [884494009] [2024-11-02 19:54:48,887 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-02 19:54:48,888 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-02 19:54:49,042 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-02 19:54:49,050 INFO L255 TraceCheckSpWp]: Trace formula consists of 70 conjuncts, 12 conjuncts are in the unsatisfiable core [2024-11-02 19:54:49,052 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-02 19:54:49,172 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-11-02 19:54:49,172 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-02 19:54:49,504 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-02 19:54:49,504 INFO L136 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2024-11-02 19:54:49,505 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [884494009] [2024-11-02 19:54:49,505 INFO L158 FreeRefinementEngine]: IpTcStrategyModulePreferences [884494009] provided 2 perfect and 0 imperfect interpolant sequences [2024-11-02 19:54:49,505 INFO L185 FreeRefinementEngine]: Found 2 perfect and 0 imperfect interpolant sequences. [2024-11-02 19:54:49,505 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9, 10] imperfect sequences [] total 17 [2024-11-02 19:54:49,505 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [214533419] [2024-11-02 19:54:49,505 INFO L85 oduleStraightlineAll]: Using 2 perfect interpolants to construct interpolant automaton [2024-11-02 19:54:49,505 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2024-11-02 19:54:49,506 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2024-11-02 19:54:49,507 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2024-11-02 19:54:49,507 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=73, Invalid=199, Unknown=0, NotChecked=0, Total=272 [2024-11-02 19:54:49,507 INFO L87 Difference]: Start difference. First operand 1319 states and 1690 transitions. Second operand has 17 states, 17 states have (on average 3.3529411764705883) internal successors, (57), 17 states have internal predecessors, (57), 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) [2024-11-02 19:54:51,064 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-02 19:54:51,064 INFO L93 Difference]: Finished difference Result 2956 states and 3773 transitions. [2024-11-02 19:54:51,065 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2024-11-02 19:54:51,065 INFO L78 Accepts]: Start accepts. Automaton has has 17 states, 17 states have (on average 3.3529411764705883) internal successors, (57), 17 states have internal predecessors, (57), 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 34 [2024-11-02 19:54:51,067 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-02 19:54:51,075 INFO L225 Difference]: With dead ends: 2956 [2024-11-02 19:54:51,075 INFO L226 Difference]: Without dead ends: 2075 [2024-11-02 19:54:51,078 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 82 GetRequests, 51 SyntacticMatches, 0 SemanticMatches, 31 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 205 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=293, Invalid=763, Unknown=0, NotChecked=0, Total=1056 [2024-11-02 19:54:51,079 INFO L432 NwaCegarLoop]: 87 mSDtfsCounter, 1463 mSDsluCounter, 363 mSDsCounter, 0 mSdLazyCounter, 992 mSolverCounterSat, 73 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1463 SdHoareTripleChecker+Valid, 450 SdHoareTripleChecker+Invalid, 1065 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 73 IncrementalHoareTripleChecker+Valid, 992 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2024-11-02 19:54:51,079 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1463 Valid, 450 Invalid, 1065 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [73 Valid, 992 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2024-11-02 19:54:51,081 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2075 states. [2024-11-02 19:54:51,131 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2075 to 1275. [2024-11-02 19:54:51,133 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1275 states, 1274 states have (on average 1.251177394034537) internal successors, (1594), 1274 states have internal predecessors, (1594), 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) [2024-11-02 19:54:51,135 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1275 states to 1275 states and 1594 transitions. [2024-11-02 19:54:51,136 INFO L78 Accepts]: Start accepts. Automaton has 1275 states and 1594 transitions. Word has length 34 [2024-11-02 19:54:51,136 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-02 19:54:51,136 INFO L471 AbstractCegarLoop]: Abstraction has 1275 states and 1594 transitions. [2024-11-02 19:54:51,137 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 17 states have (on average 3.3529411764705883) internal successors, (57), 17 states have internal predecessors, (57), 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) [2024-11-02 19:54:51,137 INFO L276 IsEmpty]: Start isEmpty. Operand 1275 states and 1594 transitions. [2024-11-02 19:54:51,138 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2024-11-02 19:54:51,139 INFO L207 NwaCegarLoop]: Found error trace [2024-11-02 19:54:51,139 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-02 19:54:51,139 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2024-11-02 19:54:51,139 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-02 19:54:51,140 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-02 19:54:51,140 INFO L85 PathProgramCache]: Analyzing trace with hash -645546130, now seen corresponding path program 1 times [2024-11-02 19:54:51,140 INFO L118 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2024-11-02 19:54:51,140 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [767153575] [2024-11-02 19:54:51,140 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-02 19:54:51,140 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-02 19:54:51,357 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-02 19:54:51,364 INFO L255 TraceCheckSpWp]: Trace formula consists of 73 conjuncts, 11 conjuncts are in the unsatisfiable core [2024-11-02 19:54:51,367 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-02 19:54:51,486 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2024-11-02 19:54:51,486 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-02 19:54:51,596 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 3 proven. 2 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2024-11-02 19:54:51,597 INFO L136 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2024-11-02 19:54:51,597 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [767153575] [2024-11-02 19:54:51,597 INFO L158 FreeRefinementEngine]: IpTcStrategyModulePreferences [767153575] provided 1 perfect and 1 imperfect interpolant sequences [2024-11-02 19:54:51,597 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-02 19:54:51,597 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [8] total 13 [2024-11-02 19:54:51,597 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1948376416] [2024-11-02 19:54:51,597 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-02 19:54:51,598 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-02 19:54:51,598 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2024-11-02 19:54:51,598 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-02 19:54:51,598 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=111, Unknown=0, NotChecked=0, Total=156 [2024-11-02 19:54:51,599 INFO L87 Difference]: Start difference. First operand 1275 states and 1594 transitions. Second operand has 7 states, 7 states have (on average 4.571428571428571) internal successors, (32), 7 states have internal predecessors, (32), 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) [2024-11-02 19:54:51,863 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-02 19:54:51,863 INFO L93 Difference]: Finished difference Result 1601 states and 2000 transitions. [2024-11-02 19:54:51,864 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-02 19:54:51,864 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 4.571428571428571) internal successors, (32), 7 states have internal predecessors, (32), 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 36 [2024-11-02 19:54:51,864 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-02 19:54:51,869 INFO L225 Difference]: With dead ends: 1601 [2024-11-02 19:54:51,869 INFO L226 Difference]: Without dead ends: 1451 [2024-11-02 19:54:51,870 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 70 GetRequests, 58 SyntacticMatches, 1 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 37 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=45, Invalid=111, Unknown=0, NotChecked=0, Total=156 [2024-11-02 19:54:51,870 INFO L432 NwaCegarLoop]: 119 mSDtfsCounter, 169 mSDsluCounter, 298 mSDsCounter, 0 mSdLazyCounter, 267 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 169 SdHoareTripleChecker+Valid, 417 SdHoareTripleChecker+Invalid, 268 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 267 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-02 19:54:51,871 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [169 Valid, 417 Invalid, 268 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 267 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-02 19:54:51,872 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1451 states. [2024-11-02 19:54:51,919 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1451 to 1275. [2024-11-02 19:54:51,921 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1275 states, 1274 states have (on average 1.251177394034537) internal successors, (1594), 1274 states have internal predecessors, (1594), 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) [2024-11-02 19:54:51,925 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1275 states to 1275 states and 1594 transitions. [2024-11-02 19:54:51,926 INFO L78 Accepts]: Start accepts. Automaton has 1275 states and 1594 transitions. Word has length 36 [2024-11-02 19:54:51,926 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-02 19:54:51,926 INFO L471 AbstractCegarLoop]: Abstraction has 1275 states and 1594 transitions. [2024-11-02 19:54:51,926 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 4.571428571428571) internal successors, (32), 7 states have internal predecessors, (32), 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) [2024-11-02 19:54:51,926 INFO L276 IsEmpty]: Start isEmpty. Operand 1275 states and 1594 transitions. [2024-11-02 19:54:51,928 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2024-11-02 19:54:51,928 INFO L207 NwaCegarLoop]: Found error trace [2024-11-02 19:54:51,929 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-02 19:54:51,929 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2024-11-02 19:54:51,929 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-02 19:54:51,929 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-02 19:54:51,929 INFO L85 PathProgramCache]: Analyzing trace with hash -668178384, now seen corresponding path program 1 times [2024-11-02 19:54:51,929 INFO L118 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2024-11-02 19:54:51,930 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [159888083] [2024-11-02 19:54:51,930 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-02 19:54:51,930 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-02 19:54:52,095 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-02 19:54:52,101 INFO L255 TraceCheckSpWp]: Trace formula consists of 74 conjuncts, 12 conjuncts are in the unsatisfiable core [2024-11-02 19:54:52,102 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-02 19:54:52,204 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2024-11-02 19:54:52,204 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-02 19:54:52,327 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 3 proven. 2 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2024-11-02 19:54:52,327 INFO L136 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2024-11-02 19:54:52,327 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [159888083] [2024-11-02 19:54:52,327 INFO L158 FreeRefinementEngine]: IpTcStrategyModulePreferences [159888083] provided 1 perfect and 1 imperfect interpolant sequences [2024-11-02 19:54:52,327 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-02 19:54:52,327 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [9] total 15 [2024-11-02 19:54:52,327 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [763776231] [2024-11-02 19:54:52,328 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-02 19:54:52,328 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-11-02 19:54:52,328 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2024-11-02 19:54:52,328 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-11-02 19:54:52,328 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=56, Invalid=154, Unknown=0, NotChecked=0, Total=210 [2024-11-02 19:54:52,329 INFO L87 Difference]: Start difference. First operand 1275 states and 1594 transitions. Second operand has 8 states, 8 states have (on average 4.0) internal successors, (32), 8 states have internal predecessors, (32), 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) [2024-11-02 19:54:52,611 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-02 19:54:52,611 INFO L93 Difference]: Finished difference Result 1527 states and 1905 transitions. [2024-11-02 19:54:52,612 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-11-02 19:54:52,612 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 4.0) internal successors, (32), 8 states have internal predecessors, (32), 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 36 [2024-11-02 19:54:52,612 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-02 19:54:52,617 INFO L225 Difference]: With dead ends: 1527 [2024-11-02 19:54:52,617 INFO L226 Difference]: Without dead ends: 1373 [2024-11-02 19:54:52,618 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 70 GetRequests, 56 SyntacticMatches, 1 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 54 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=56, Invalid=154, Unknown=0, NotChecked=0, Total=210 [2024-11-02 19:54:52,618 INFO L432 NwaCegarLoop]: 129 mSDtfsCounter, 238 mSDsluCounter, 387 mSDsCounter, 0 mSdLazyCounter, 296 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 238 SdHoareTripleChecker+Valid, 516 SdHoareTripleChecker+Invalid, 299 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 296 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-02 19:54:52,619 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [238 Valid, 516 Invalid, 299 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 296 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-02 19:54:52,620 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1373 states. [2024-11-02 19:54:52,663 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1373 to 1279. [2024-11-02 19:54:52,665 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1279 states, 1278 states have (on average 1.2464788732394365) internal successors, (1593), 1278 states have internal predecessors, (1593), 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) [2024-11-02 19:54:52,668 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1279 states to 1279 states and 1593 transitions. [2024-11-02 19:54:52,668 INFO L78 Accepts]: Start accepts. Automaton has 1279 states and 1593 transitions. Word has length 36 [2024-11-02 19:54:52,668 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-02 19:54:52,669 INFO L471 AbstractCegarLoop]: Abstraction has 1279 states and 1593 transitions. [2024-11-02 19:54:52,669 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 4.0) internal successors, (32), 8 states have internal predecessors, (32), 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) [2024-11-02 19:54:52,669 INFO L276 IsEmpty]: Start isEmpty. Operand 1279 states and 1593 transitions. [2024-11-02 19:54:52,671 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2024-11-02 19:54:52,671 INFO L207 NwaCegarLoop]: Found error trace [2024-11-02 19:54:52,671 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-02 19:54:52,671 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2024-11-02 19:54:52,671 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-02 19:54:52,672 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-02 19:54:52,672 INFO L85 PathProgramCache]: Analyzing trace with hash 1154382336, now seen corresponding path program 1 times [2024-11-02 19:54:52,672 INFO L118 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2024-11-02 19:54:52,672 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1365424403] [2024-11-02 19:54:52,672 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-02 19:54:52,672 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-02 19:54:52,767 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-02 19:54:52,774 INFO L255 TraceCheckSpWp]: Trace formula consists of 72 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-11-02 19:54:52,777 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-02 19:54:52,818 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-02 19:54:52,819 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-02 19:54:52,879 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-02 19:54:52,880 INFO L136 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2024-11-02 19:54:52,880 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1365424403] [2024-11-02 19:54:52,880 INFO L158 FreeRefinementEngine]: IpTcStrategyModulePreferences [1365424403] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-02 19:54:52,880 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-02 19:54:52,880 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 8 [2024-11-02 19:54:52,880 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [820052649] [2024-11-02 19:54:52,880 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-02 19:54:52,881 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-11-02 19:54:52,881 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2024-11-02 19:54:52,881 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-11-02 19:54:52,881 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=35, Unknown=0, NotChecked=0, Total=56 [2024-11-02 19:54:52,881 INFO L87 Difference]: Start difference. First operand 1279 states and 1593 transitions. Second operand has 8 states, 8 states have (on average 7.875) internal successors, (63), 8 states have internal predecessors, (63), 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) [2024-11-02 19:54:53,288 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-02 19:54:53,289 INFO L93 Difference]: Finished difference Result 3630 states and 4687 transitions. [2024-11-02 19:54:53,289 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-11-02 19:54:53,289 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 7.875) internal successors, (63), 8 states have internal predecessors, (63), 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 37 [2024-11-02 19:54:53,290 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-02 19:54:53,296 INFO L225 Difference]: With dead ends: 3630 [2024-11-02 19:54:53,297 INFO L226 Difference]: Without dead ends: 1876 [2024-11-02 19:54:53,299 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 74 GetRequests, 66 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=36, Invalid=54, Unknown=0, NotChecked=0, Total=90 [2024-11-02 19:54:53,300 INFO L432 NwaCegarLoop]: 27 mSDtfsCounter, 144 mSDsluCounter, 69 mSDsCounter, 0 mSdLazyCounter, 313 mSolverCounterSat, 82 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 144 SdHoareTripleChecker+Valid, 96 SdHoareTripleChecker+Invalid, 395 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 82 IncrementalHoareTripleChecker+Valid, 313 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-11-02 19:54:53,300 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [144 Valid, 96 Invalid, 395 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [82 Valid, 313 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-11-02 19:54:53,302 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1876 states. [2024-11-02 19:54:53,357 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1876 to 1515. [2024-11-02 19:54:53,359 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1515 states, 1514 states have (on average 1.2932628797886394) internal successors, (1958), 1514 states have internal predecessors, (1958), 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) [2024-11-02 19:54:53,363 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1515 states to 1515 states and 1958 transitions. [2024-11-02 19:54:53,364 INFO L78 Accepts]: Start accepts. Automaton has 1515 states and 1958 transitions. Word has length 37 [2024-11-02 19:54:53,364 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-02 19:54:53,364 INFO L471 AbstractCegarLoop]: Abstraction has 1515 states and 1958 transitions. [2024-11-02 19:54:53,364 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 7.875) internal successors, (63), 8 states have internal predecessors, (63), 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) [2024-11-02 19:54:53,364 INFO L276 IsEmpty]: Start isEmpty. Operand 1515 states and 1958 transitions. [2024-11-02 19:54:53,365 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2024-11-02 19:54:53,366 INFO L207 NwaCegarLoop]: Found error trace [2024-11-02 19:54:53,366 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-02 19:54:53,366 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2024-11-02 19:54:53,366 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-02 19:54:53,366 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-02 19:54:53,367 INFO L85 PathProgramCache]: Analyzing trace with hash -2126140849, now seen corresponding path program 1 times [2024-11-02 19:54:53,367 INFO L118 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2024-11-02 19:54:53,367 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1388721446] [2024-11-02 19:54:53,367 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-02 19:54:53,367 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-02 19:54:53,476 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-02 19:54:53,485 INFO L255 TraceCheckSpWp]: Trace formula consists of 89 conjuncts, 9 conjuncts are in the unsatisfiable core [2024-11-02 19:54:53,487 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-02 19:54:53,576 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2024-11-02 19:54:53,577 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-02 19:54:53,737 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 3 proven. 1 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2024-11-02 19:54:53,737 INFO L136 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2024-11-02 19:54:53,737 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1388721446] [2024-11-02 19:54:53,737 INFO L158 FreeRefinementEngine]: IpTcStrategyModulePreferences [1388721446] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-02 19:54:53,737 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-02 19:54:53,737 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 8] total 12 [2024-11-02 19:54:53,738 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [795566170] [2024-11-02 19:54:53,738 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-02 19:54:53,738 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-11-02 19:54:53,738 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2024-11-02 19:54:53,738 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-11-02 19:54:53,739 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=43, Invalid=89, Unknown=0, NotChecked=0, Total=132 [2024-11-02 19:54:53,739 INFO L87 Difference]: Start difference. First operand 1515 states and 1958 transitions. Second operand has 12 states, 12 states have (on average 5.333333333333333) internal successors, (64), 12 states have internal predecessors, (64), 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) [2024-11-02 19:54:55,513 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-02 19:54:55,513 INFO L93 Difference]: Finished difference Result 5850 states and 7677 transitions. [2024-11-02 19:54:55,514 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 35 states. [2024-11-02 19:54:55,514 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 5.333333333333333) internal successors, (64), 12 states have internal predecessors, (64), 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 50 [2024-11-02 19:54:55,514 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-02 19:54:55,533 INFO L225 Difference]: With dead ends: 5850 [2024-11-02 19:54:55,533 INFO L226 Difference]: Without dead ends: 4620 [2024-11-02 19:54:55,538 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 121 GetRequests, 88 SyntacticMatches, 0 SemanticMatches, 33 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 245 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=366, Invalid=824, Unknown=0, NotChecked=0, Total=1190 [2024-11-02 19:54:55,539 INFO L432 NwaCegarLoop]: 81 mSDtfsCounter, 531 mSDsluCounter, 263 mSDsCounter, 0 mSdLazyCounter, 1117 mSolverCounterSat, 89 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 531 SdHoareTripleChecker+Valid, 344 SdHoareTripleChecker+Invalid, 1206 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 89 IncrementalHoareTripleChecker+Valid, 1117 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2024-11-02 19:54:55,539 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [531 Valid, 344 Invalid, 1206 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [89 Valid, 1117 Invalid, 0 Unknown, 0 Unchecked, 1.1s Time] [2024-11-02 19:54:55,544 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4620 states. [2024-11-02 19:54:55,762 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4620 to 3480. [2024-11-02 19:54:55,768 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3480 states, 3479 states have (on average 1.313595860879563) internal successors, (4570), 3479 states have internal predecessors, (4570), 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) [2024-11-02 19:54:55,778 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3480 states to 3480 states and 4570 transitions. [2024-11-02 19:54:55,779 INFO L78 Accepts]: Start accepts. Automaton has 3480 states and 4570 transitions. Word has length 50 [2024-11-02 19:54:55,779 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-02 19:54:55,779 INFO L471 AbstractCegarLoop]: Abstraction has 3480 states and 4570 transitions. [2024-11-02 19:54:55,780 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 5.333333333333333) internal successors, (64), 12 states have internal predecessors, (64), 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) [2024-11-02 19:54:55,780 INFO L276 IsEmpty]: Start isEmpty. Operand 3480 states and 4570 transitions. [2024-11-02 19:54:55,782 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2024-11-02 19:54:55,782 INFO L207 NwaCegarLoop]: Found error trace [2024-11-02 19:54:55,782 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-02 19:54:55,782 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2024-11-02 19:54:55,782 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-02 19:54:55,783 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-02 19:54:55,783 INFO L85 PathProgramCache]: Analyzing trace with hash 945650591, now seen corresponding path program 1 times [2024-11-02 19:54:55,783 INFO L118 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2024-11-02 19:54:55,783 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [546998027] [2024-11-02 19:54:55,783 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-02 19:54:55,784 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-02 19:54:59,977 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-02 19:54:59,991 INFO L255 TraceCheckSpWp]: Trace formula consists of 92 conjuncts, 36 conjuncts are in the unsatisfiable core [2024-11-02 19:54:59,994 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-02 19:55:02,096 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 19 proven. 1 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-11-02 19:55:02,097 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-02 19:55:03,563 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 0 proven. 20 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-11-02 19:55:03,563 INFO L136 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2024-11-02 19:55:03,564 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [546998027] [2024-11-02 19:55:03,564 INFO L158 FreeRefinementEngine]: IpTcStrategyModulePreferences [546998027] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-02 19:55:03,564 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-02 19:55:03,564 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [21, 21] total 40 [2024-11-02 19:55:03,564 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [652187207] [2024-11-02 19:55:03,564 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-02 19:55:03,564 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 40 states [2024-11-02 19:55:03,565 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2024-11-02 19:55:03,565 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 40 interpolants. [2024-11-02 19:55:03,566 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=173, Invalid=1387, Unknown=0, NotChecked=0, Total=1560 [2024-11-02 19:55:03,566 INFO L87 Difference]: Start difference. First operand 3480 states and 4570 transitions. Second operand has 40 states, 40 states have (on average 2.5) internal successors, (100), 40 states have internal predecessors, (100), 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) [2024-11-02 19:55:17,494 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-02 19:55:17,495 INFO L93 Difference]: Finished difference Result 6735 states and 8989 transitions. [2024-11-02 19:55:17,496 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 83 states. [2024-11-02 19:55:17,496 INFO L78 Accepts]: Start accepts. Automaton has has 40 states, 40 states have (on average 2.5) internal successors, (100), 40 states have internal predecessors, (100), 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 51 [2024-11-02 19:55:17,496 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-02 19:55:17,517 INFO L225 Difference]: With dead ends: 6735 [2024-11-02 19:55:17,517 INFO L226 Difference]: Without dead ends: 6163 [2024-11-02 19:55:17,523 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 179 GetRequests, 62 SyntacticMatches, 0 SemanticMatches, 117 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2686 ImplicationChecksByTransitivity, 10.4s TimeCoverageRelationStatistics Valid=3148, Invalid=10894, Unknown=0, NotChecked=0, Total=14042 [2024-11-02 19:55:17,524 INFO L432 NwaCegarLoop]: 320 mSDtfsCounter, 1949 mSDsluCounter, 4689 mSDsCounter, 0 mSdLazyCounter, 5137 mSolverCounterSat, 56 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1949 SdHoareTripleChecker+Valid, 5009 SdHoareTripleChecker+Invalid, 5193 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 56 IncrementalHoareTripleChecker+Valid, 5137 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.7s IncrementalHoareTripleChecker+Time [2024-11-02 19:55:17,524 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1949 Valid, 5009 Invalid, 5193 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [56 Valid, 5137 Invalid, 0 Unknown, 0 Unchecked, 4.7s Time] [2024-11-02 19:55:17,529 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6163 states. [2024-11-02 19:55:17,839 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6163 to 4459. [2024-11-02 19:55:17,846 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4459 states, 4458 states have (on average 1.3308658591296545) internal successors, (5933), 4458 states have internal predecessors, (5933), 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) [2024-11-02 19:55:17,857 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4459 states to 4459 states and 5933 transitions. [2024-11-02 19:55:17,859 INFO L78 Accepts]: Start accepts. Automaton has 4459 states and 5933 transitions. Word has length 51 [2024-11-02 19:55:17,860 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-02 19:55:17,860 INFO L471 AbstractCegarLoop]: Abstraction has 4459 states and 5933 transitions. [2024-11-02 19:55:17,860 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 40 states, 40 states have (on average 2.5) internal successors, (100), 40 states have internal predecessors, (100), 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) [2024-11-02 19:55:17,860 INFO L276 IsEmpty]: Start isEmpty. Operand 4459 states and 5933 transitions. [2024-11-02 19:55:17,862 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2024-11-02 19:55:17,862 INFO L207 NwaCegarLoop]: Found error trace [2024-11-02 19:55:17,863 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-02 19:55:17,863 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2024-11-02 19:55:17,863 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-02 19:55:17,863 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-02 19:55:17,863 INFO L85 PathProgramCache]: Analyzing trace with hash -1950719985, now seen corresponding path program 1 times [2024-11-02 19:55:17,864 INFO L118 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2024-11-02 19:55:17,864 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [237762997] [2024-11-02 19:55:17,864 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-02 19:55:17,864 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-02 19:55:23,895 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-02 19:55:23,896 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-02 19:55:27,844 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-02 19:55:27,890 INFO L130 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found a feasible trace [2024-11-02 19:55:27,890 INFO L325 BasicCegarLoop]: Counterexample is feasible [2024-11-02 19:55:27,891 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2024-11-02 19:55:27,893 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2024-11-02 19:55:27,896 INFO L407 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-02 19:55:27,951 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2024-11-02 19:55:27,953 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 02.11 07:55:27 BoogieIcfgContainer [2024-11-02 19:55:27,953 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-11-02 19:55:27,954 INFO L158 Benchmark]: Toolchain (without parser) took 47735.91ms. Allocated memory was 196.1MB in the beginning and 1.7GB in the end (delta: 1.5GB). Free memory was 158.8MB in the beginning and 1.6GB in the end (delta: -1.4GB). Peak memory consumption was 1.0GB. Max. memory is 8.0GB. [2024-11-02 19:55:27,954 INFO L158 Benchmark]: CDTParser took 0.15ms. Allocated memory is still 196.1MB. Free memory is still 152.7MB. There was no memory consumed. Max. memory is 8.0GB. [2024-11-02 19:55:27,954 INFO L158 Benchmark]: CACSL2BoogieTranslator took 358.35ms. Allocated memory is still 196.1MB. Free memory was 158.8MB in the beginning and 143.8MB in the end (delta: 15.0MB). Peak memory consumption was 15.7MB. Max. memory is 8.0GB. [2024-11-02 19:55:27,954 INFO L158 Benchmark]: Boogie Procedure Inliner took 45.78ms. Allocated memory is still 196.1MB. Free memory was 143.8MB in the beginning and 142.0MB in the end (delta: 1.8MB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. [2024-11-02 19:55:27,955 INFO L158 Benchmark]: Boogie Preprocessor took 55.17ms. Allocated memory is still 196.1MB. Free memory was 142.0MB in the beginning and 139.6MB in the end (delta: 2.4MB). Peak memory consumption was 3.1MB. Max. memory is 8.0GB. [2024-11-02 19:55:27,955 INFO L158 Benchmark]: RCFGBuilder took 491.69ms. Allocated memory is still 196.1MB. Free memory was 139.6MB in the beginning and 122.1MB in the end (delta: 17.4MB). Peak memory consumption was 16.8MB. Max. memory is 8.0GB. [2024-11-02 19:55:27,955 INFO L158 Benchmark]: TraceAbstraction took 46774.85ms. Allocated memory was 196.1MB in the beginning and 1.7GB in the end (delta: 1.5GB). Free memory was 121.4MB in the beginning and 1.6GB in the end (delta: -1.5GB). Peak memory consumption was 989.3MB. Max. memory is 8.0GB. [2024-11-02 19:55:27,956 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.15ms. Allocated memory is still 196.1MB. Free memory is still 152.7MB. There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 358.35ms. Allocated memory is still 196.1MB. Free memory was 158.8MB in the beginning and 143.8MB in the end (delta: 15.0MB). Peak memory consumption was 15.7MB. Max. memory is 8.0GB. * Boogie Procedure Inliner took 45.78ms. Allocated memory is still 196.1MB. Free memory was 143.8MB in the beginning and 142.0MB in the end (delta: 1.8MB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. * Boogie Preprocessor took 55.17ms. Allocated memory is still 196.1MB. Free memory was 142.0MB in the beginning and 139.6MB in the end (delta: 2.4MB). Peak memory consumption was 3.1MB. Max. memory is 8.0GB. * RCFGBuilder took 491.69ms. Allocated memory is still 196.1MB. Free memory was 139.6MB in the beginning and 122.1MB in the end (delta: 17.4MB). Peak memory consumption was 16.8MB. Max. memory is 8.0GB. * TraceAbstraction took 46774.85ms. Allocated memory was 196.1MB in the beginning and 1.7GB in the end (delta: 1.5GB). Free memory was 121.4MB in the beginning and 1.6GB in the end (delta: -1.5GB). Peak memory consumption was 989.3MB. 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: 25]: a call to reach_error is reachable a call to reach_error is reachable We found a FailurePath: [L124] unsigned int a, b, r; [L126] a = __VERIFIER_nondet_uint() [L127] b = __VERIFIER_nondet_uint() [L129] CALL, EXPR mp_add(a, b) [L42] unsigned char a0, a1, a2, a3; [L43] unsigned char b0, b1, b2, b3; [L44] unsigned char r0, r1, r2, r3; [L45] unsigned short carry; [L46] unsigned short partial_sum; [L47] unsigned int r; [L48] unsigned char i; [L49] unsigned char na, nb; [L50] a0 = a [L51] a1 = a >> 8 [L52] a2 = a >> 16U [L53] a3 = a >> 24U [L54] b0 = b [L55] b1 = b >> 8U [L56] b2 = b >> 16U [L57] b3 = b >> 24U [L58] na = (unsigned char)4 VAL [a0=6, a1=0, a2=0, a3=0, b0=-7, b1=0, b2=0, b3=0, na=4] [L59] COND TRUE a3 == (unsigned char)0 [L60] na = na - 1 VAL [a0=6, a1=0, a2=0, a3=0, b0=-7, b1=0, b2=0, b3=0, na=3] [L61] COND TRUE a2 == (unsigned char)0 [L62] na = na - 1 VAL [a0=6, a1=0, a2=0, a3=0, b0=-7, b1=0, b2=0, b3=0, na=2] [L63] COND TRUE a1 == (unsigned char)0 [L64] na = na - 1 VAL [a0=6, a1=0, a2=0, a3=0, b0=-7, b1=0, b2=0, b3=0, na=1] [L68] nb = (unsigned char)4 VAL [a0=6, a1=0, a2=0, a3=0, b0=-7, b1=0, b2=0, b3=0, na=1, nb=4] [L69] COND TRUE b3 == (unsigned char)0 [L70] nb = nb - 1 VAL [a0=6, a1=0, a2=0, a3=0, b0=-7, b1=0, b2=0, b3=0, na=1, nb=3] [L71] COND TRUE b2 == (unsigned char)0 [L72] nb = nb - 1 VAL [a0=6, a1=0, a2=0, a3=0, b0=-7, b1=0, b2=0, b3=0, na=1, nb=2] [L73] COND TRUE b1 == (unsigned char)0 [L74] nb = nb - 1 VAL [a0=6, a1=0, a2=0, a3=0, b0=-7, b1=0, b2=0, b3=0, na=1, nb=1] [L78] carry = (unsigned short)0 [L79] i = (unsigned char)0 VAL [a0=6, a1=0, a2=0, a3=0, b0=-7, b1=0, b2=0, b3=0, carry=0, i=0, na=1, nb=1] [L80] COND TRUE (i < na) || (i < nb) || (carry != (unsigned short)0) [L81] partial_sum = carry [L82] carry = (unsigned short)0 VAL [a0=6, a1=0, a2=0, a3=0, b0=-7, b1=0, b2=0, b3=0, carry=0, i=0, na=1, nb=1, partial_sum=0] [L83] COND TRUE i < na VAL [a0=6, a1=0, a2=0, a3=0, b0=-7, b1=0, b2=0, b3=0, carry=0, i=0, na=1, nb=1, partial_sum=0] [L84] COND TRUE i == (unsigned char)0 [L84] partial_sum = partial_sum + a0 VAL [a0=6, a1=0, a2=0, a3=0, b0=-7, b1=0, b2=0, b3=0, carry=0, i=0, na=1, nb=1, partial_sum=6] [L85] COND FALSE !(i == (unsigned char)1) VAL [a0=6, a1=0, a2=0, a3=0, b0=-7, b1=0, b2=0, b3=0, carry=0, i=0, na=1, nb=1, partial_sum=6] [L86] COND FALSE !(i == (unsigned char)2) VAL [a0=6, a1=0, a2=0, a3=0, b0=-7, b1=0, b2=0, b3=0, carry=0, i=0, na=1, nb=1, partial_sum=6] [L87] COND FALSE !(i == (unsigned char)3) VAL [a0=6, a1=0, a2=0, a3=0, b0=-7, b1=0, b2=0, b3=0, carry=0, i=0, na=1, nb=1, partial_sum=6] [L89] COND TRUE i < nb VAL [a0=6, a1=0, a2=0, a3=0, b0=-7, b1=0, b2=0, b3=0, carry=0, i=0, na=1, nb=1, partial_sum=6] [L90] COND TRUE i == (unsigned char)0 [L90] partial_sum = partial_sum + b0 VAL [a0=6, a1=0, a2=0, a3=0, b0=-7, b1=0, b2=0, b3=0, carry=0, i=0, na=1, nb=1, partial_sum=255] [L91] COND FALSE !(i == (unsigned char)1) VAL [a0=6, a1=0, a2=0, a3=0, b0=-7, b1=0, b2=0, b3=0, carry=0, i=0, na=1, nb=1, partial_sum=255] [L92] COND FALSE !(i == (unsigned char)2) VAL [a0=6, a1=0, a2=0, a3=0, b0=-7, b1=0, b2=0, b3=0, carry=0, i=0, na=1, nb=1, partial_sum=255] [L93] COND FALSE !(i == (unsigned char)3) VAL [a0=6, a1=0, a2=0, a3=0, b0=-7, b1=0, b2=0, b3=0, carry=0, i=0, na=1, nb=1, partial_sum=255] [L95] COND TRUE partial_sum > ((unsigned char)254) [L96] partial_sum = partial_sum & ((unsigned char)255) [L97] carry = (unsigned short)1 VAL [a0=6, a1=0, a2=0, a3=0, b0=-7, b1=0, b2=0, b3=0, carry=1, i=0, na=1, nb=1, partial_sum=255] [L99] COND TRUE i == (unsigned char)0 [L99] r0 = (unsigned char)partial_sum VAL [a0=6, a1=0, a2=0, a3=0, b0=-7, b1=0, b2=0, b3=0, carry=1, i=0, na=1, nb=1, partial_sum=255, r0=-1] [L100] COND FALSE !(i == (unsigned char)1) VAL [a0=6, a1=0, a2=0, a3=0, b0=-7, b1=0, b2=0, b3=0, carry=1, i=0, na=1, nb=1, partial_sum=255, r0=-1] [L101] COND FALSE !(i == (unsigned char)2) VAL [a0=6, a1=0, a2=0, a3=0, b0=-7, b1=0, b2=0, b3=0, carry=1, i=0, na=1, nb=1, partial_sum=255, r0=-1] [L102] COND FALSE !(i == (unsigned char)3) VAL [a0=6, a1=0, a2=0, a3=0, b0=-7, b1=0, b2=0, b3=0, carry=1, i=0, na=1, nb=1, partial_sum=255, r0=-1] [L104] i = i + (unsigned char)1 VAL [a0=6, a1=0, a2=0, a3=0, b0=-7, b1=0, b2=0, b3=0, carry=1, i=1, na=1, nb=1, partial_sum=255, r0=-1] [L80] COND TRUE (i < na) || (i < nb) || (carry != (unsigned short)0) [L81] partial_sum = carry [L82] carry = (unsigned short)0 VAL [a0=6, a1=0, a2=0, a3=0, b0=-7, b1=0, b2=0, b3=0, carry=0, i=1, na=1, nb=1, partial_sum=1, r0=-1] [L83] COND FALSE !(i < na) VAL [a0=6, a1=0, a2=0, a3=0, b0=-7, b1=0, b2=0, b3=0, carry=0, i=1, na=1, nb=1, partial_sum=1, r0=-1] [L89] COND FALSE !(i < nb) VAL [a0=6, a1=0, a2=0, a3=0, b0=-7, b1=0, b2=0, b3=0, carry=0, i=1, na=1, nb=1, partial_sum=1, r0=-1] [L95] COND FALSE !(partial_sum > ((unsigned char)254)) VAL [a0=6, a1=0, a2=0, a3=0, b0=-7, b1=0, b2=0, b3=0, carry=0, i=1, na=1, nb=1, partial_sum=1, r0=-1] [L99] COND FALSE !(i == (unsigned char)0) VAL [a0=6, a1=0, a2=0, a3=0, b0=-7, b1=0, b2=0, b3=0, carry=0, i=1, na=1, nb=1, partial_sum=1, r0=-1] [L100] COND TRUE i == (unsigned char)1 [L100] r1 = (unsigned char)partial_sum VAL [a0=6, a1=0, a2=0, a3=0, b0=-7, b1=0, b2=0, b3=0, carry=0, i=1, na=1, nb=1, partial_sum=1, r0=-1, r1=1] [L101] COND FALSE !(i == (unsigned char)2) VAL [a0=6, a1=0, a2=0, a3=0, b0=-7, b1=0, b2=0, b3=0, carry=0, i=1, na=1, nb=1, partial_sum=1, r0=-1, r1=1] [L102] COND FALSE !(i == (unsigned char)3) VAL [a0=6, a1=0, a2=0, a3=0, b0=-7, b1=0, b2=0, b3=0, carry=0, i=1, na=1, nb=1, partial_sum=1, r0=-1, r1=1] [L104] i = i + (unsigned char)1 VAL [a0=6, a1=0, a2=0, a3=0, b0=-7, b1=0, b2=0, b3=0, carry=0, i=2, na=1, nb=1, partial_sum=1, r0=-1, r1=1] [L80] COND FALSE !((i < na) || (i < nb) || (carry != (unsigned short)0)) VAL [a0=6, a1=0, a2=0, a3=0, b0=-7, b1=0, b2=0, b3=0, i=2, partial_sum=1, r0=-1, r1=1] [L107] COND TRUE i < (unsigned char)4 VAL [a0=6, a1=0, a2=0, a3=0, b0=-7, b1=0, b2=0, b3=0, i=2, partial_sum=1, r0=-1, r1=1] [L108] COND FALSE !(i == (unsigned char)0) VAL [a0=6, a1=0, a2=0, a3=0, b0=-7, b1=0, b2=0, b3=0, i=2, partial_sum=1, r0=-1, r1=1] [L109] COND FALSE !(i == (unsigned char)1) VAL [a0=6, a1=0, a2=0, a3=0, b0=-7, b1=0, b2=0, b3=0, i=2, partial_sum=1, r0=-1, r1=1] [L110] COND TRUE i == (unsigned char)2 [L110] r2 = (unsigned char)0 VAL [a0=6, a1=0, a2=0, a3=0, b0=-7, b1=0, b2=0, b3=0, i=2, partial_sum=1, r0=-1, r1=1, r2=0] [L111] COND FALSE !(i == (unsigned char)3) VAL [a0=6, a1=0, a2=0, a3=0, b0=-7, b1=0, b2=0, b3=0, i=2, partial_sum=1, r0=-1, r1=1, r2=0] [L113] i = i + (unsigned char)1 VAL [a0=6, a1=0, a2=0, a3=0, b0=-7, b1=0, b2=0, b3=0, i=3, partial_sum=1, r0=-1, r1=1, r2=0] [L107] COND TRUE i < (unsigned char)4 VAL [a0=6, a1=0, a2=0, a3=0, b0=-7, b1=0, b2=0, b3=0, i=3, partial_sum=1, r0=-1, r1=1, r2=0] [L108] COND FALSE !(i == (unsigned char)0) VAL [a0=6, a1=0, a2=0, a3=0, b0=-7, b1=0, b2=0, b3=0, i=3, partial_sum=1, r0=-1, r1=1, r2=0] [L109] COND FALSE !(i == (unsigned char)1) VAL [a0=6, a1=0, a2=0, a3=0, b0=-7, b1=0, b2=0, b3=0, i=3, partial_sum=1, r0=-1, r1=1, r2=0] [L110] COND FALSE !(i == (unsigned char)2) VAL [a0=6, a1=0, a2=0, a3=0, b0=-7, b1=0, b2=0, b3=0, i=3, partial_sum=1, r0=-1, r1=1, r2=0] [L111] COND TRUE i == (unsigned char)3 [L111] r3 = (unsigned char)0 VAL [a0=6, a1=0, a2=0, a3=0, b0=-7, b1=0, b2=0, b3=0, i=3, partial_sum=1, r0=-1, r1=1, r2=0, r3=0] [L113] i = i + (unsigned char)1 VAL [a0=6, a1=0, a2=0, a3=0, b0=-7, b1=0, b2=0, b3=0, i=4, partial_sum=1, r0=-1, r1=1, r2=0, r3=0] [L107] COND FALSE !(i < (unsigned char)4) VAL [a0=6, a1=0, a2=0, a3=0, b0=-7, b1=0, b2=0, b3=0, partial_sum=1, r0=-1, r1=1, r2=0, r3=0] [L116] r = r0 | (r1 << 8U) | (r2 << 16U) | ((unsigned int)r3 << 24U) [L118] return r; VAL [\result=511, a0=6, a1=0, a2=0, a3=0, b0=-7, b1=0, b2=0, b3=0, partial_sum=1] [L129] RET, EXPR mp_add(a, b) [L129] r = mp_add(a, b) [L131] CALL __VERIFIER_assert(r == a + b) [L24] COND TRUE !(cond) [L25] reach_error() - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 42 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 46.6s, OverallIterations: 17, TraceHistogramMax: 3, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 22.3s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 6856 SdHoareTripleChecker+Valid, 10.3s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 6856 mSDsluCounter, 8597 SdHoareTripleChecker+Invalid, 8.7s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 7267 mSDsCounter, 569 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 10935 IncrementalHoareTripleChecker+Invalid, 11504 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 569 mSolverCounterUnsat, 1330 mSDtfsCounter, 10935 mSolverCounterSat, 0.1s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 1137 GetRequests, 829 SyntacticMatches, 4 SemanticMatches, 304 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3625 ImplicationChecksByTransitivity, 12.9s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=4459occurred in iteration=16, InterpolantAutomatonStates: 265, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 1.1s AutomataMinimizationTime, 16 MinimizatonAttempts, 5309 StatesRemovedByMinimization, 15 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 12.7s SatisfiabilityAnalysisTime, 6.2s InterpolantComputationTime, 560 NumberOfCodeBlocks, 560 NumberOfCodeBlocksAsserted, 17 NumberOfCheckSat, 980 ConstructedInterpolants, 18 QuantifiedInterpolants, 7395 SizeOfPredicates, 29 NumberOfNonLiveVariables, 1055 ConjunctsInSsa, 141 ConjunctsInUnsatCore, 32 InterpolantComputations, 23 PerfectInterpolantSequences, 188/220 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! [2024-11-02 19:55:27,986 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Ended with exit code 0 Received shutdown request...