./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/hardware-verification-bv/btor2c-lazyMod.diagonal.c --full-output --architecture 64bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version e2fb8bed Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/hardware-verification-bv/btor2c-lazyMod.diagonal.c -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-64bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 64bit --witnessprinter.graph.data.programhash 16f8726a4add15d0bf2494bd44888be53eb7bc01110882b6fc03ef148c6d9055 --- Real Ultimate output --- This is Ultimate 0.3.0-?-e2fb8be-m [2025-03-08 08:34:11,762 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-08 08:34:11,809 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-64bit-Automizer_Default.epf [2025-03-08 08:34:11,812 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-08 08:34:11,815 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-08 08:34:11,835 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-08 08:34:11,836 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-08 08:34:11,836 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-08 08:34:11,836 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-08 08:34:11,836 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-08 08:34:11,836 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-08 08:34:11,836 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-08 08:34:11,837 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-08 08:34:11,837 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-08 08:34:11,837 INFO L153 SettingsManager]: * Use SBE=true [2025-03-08 08:34:11,837 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-08 08:34:11,837 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-08 08:34:11,837 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-08 08:34:11,837 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-08 08:34:11,837 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-08 08:34:11,837 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-08 08:34:11,838 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-08 08:34:11,838 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-08 08:34:11,838 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-08 08:34:11,838 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-08 08:34:11,838 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-08 08:34:11,838 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-08 08:34:11,838 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-08 08:34:11,838 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-08 08:34:11,838 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-08 08:34:11,838 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-08 08:34:11,838 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-08 08:34:11,839 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-08 08:34:11,839 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-08 08:34:11,839 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-08 08:34:11,839 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-08 08:34:11,839 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-08 08:34:11,839 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-08 08:34:11,839 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-08 08:34:11,839 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-08 08:34:11,839 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(reach_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 64bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 16f8726a4add15d0bf2494bd44888be53eb7bc01110882b6fc03ef148c6d9055 [2025-03-08 08:34:12,049 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-08 08:34:12,058 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-08 08:34:12,059 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-08 08:34:12,060 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-08 08:34:12,060 INFO L274 PluginConnector]: CDTParser initialized [2025-03-08 08:34:12,062 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardware-verification-bv/btor2c-lazyMod.diagonal.c [2025-03-08 08:34:13,224 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ae4409206/fbcd192ba39048bc92dcc18bd038e06f/FLAGd6c64798e [2025-03-08 08:34:13,459 INFO L384 CDTParser]: Found 1 translation units. [2025-03-08 08:34:13,460 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardware-verification-bv/btor2c-lazyMod.diagonal.c [2025-03-08 08:34:13,466 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ae4409206/fbcd192ba39048bc92dcc18bd038e06f/FLAGd6c64798e [2025-03-08 08:34:13,781 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ae4409206/fbcd192ba39048bc92dcc18bd038e06f [2025-03-08 08:34:13,783 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-08 08:34:13,784 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-08 08:34:13,785 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-08 08:34:13,785 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-08 08:34:13,787 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-08 08:34:13,788 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.03 08:34:13" (1/1) ... [2025-03-08 08:34:13,789 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@7cc80e2d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 08:34:13, skipping insertion in model container [2025-03-08 08:34:13,789 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.03 08:34:13" (1/1) ... [2025-03-08 08:34:13,801 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-08 08:34:13,897 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardware-verification-bv/btor2c-lazyMod.diagonal.c[1248,1261] [2025-03-08 08:34:13,956 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-08 08:34:13,967 INFO L200 MainTranslator]: Completed pre-run [2025-03-08 08:34:13,977 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardware-verification-bv/btor2c-lazyMod.diagonal.c[1248,1261] [2025-03-08 08:34:14,010 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-08 08:34:14,022 INFO L204 MainTranslator]: Completed translation [2025-03-08 08:34:14,023 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 08:34:14 WrapperNode [2025-03-08 08:34:14,023 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-08 08:34:14,024 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-08 08:34:14,024 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-08 08:34:14,024 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-08 08:34:14,028 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 08:34:14" (1/1) ... [2025-03-08 08:34:14,039 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 08:34:14" (1/1) ... [2025-03-08 08:34:14,069 INFO L138 Inliner]: procedures = 17, calls = 8, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 265 [2025-03-08 08:34:14,070 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-08 08:34:14,070 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-08 08:34:14,070 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-08 08:34:14,070 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-08 08:34:14,076 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 08:34:14" (1/1) ... [2025-03-08 08:34:14,076 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 08:34:14" (1/1) ... [2025-03-08 08:34:14,080 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 08:34:14" (1/1) ... [2025-03-08 08:34:14,096 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]. [2025-03-08 08:34:14,097 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 08:34:14" (1/1) ... [2025-03-08 08:34:14,097 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 08:34:14" (1/1) ... [2025-03-08 08:34:14,106 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 08:34:14" (1/1) ... [2025-03-08 08:34:14,111 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 08:34:14" (1/1) ... [2025-03-08 08:34:14,115 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 08:34:14" (1/1) ... [2025-03-08 08:34:14,116 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 08:34:14" (1/1) ... [2025-03-08 08:34:14,119 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-08 08:34:14,120 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-08 08:34:14,120 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-08 08:34:14,120 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-08 08:34:14,121 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 08:34:14" (1/1) ... [2025-03-08 08:34:14,125 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-08 08:34:14,135 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 08:34:14,147 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) [2025-03-08 08:34:14,150 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 [2025-03-08 08:34:14,170 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-08 08:34:14,171 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-03-08 08:34:14,171 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-08 08:34:14,171 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-08 08:34:14,248 INFO L256 CfgBuilder]: Building ICFG [2025-03-08 08:34:14,249 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-08 08:34:14,648 INFO L? ?]: Removed 152 outVars from TransFormulas that were not future-live. [2025-03-08 08:34:14,648 INFO L307 CfgBuilder]: Performing block encoding [2025-03-08 08:34:14,671 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-08 08:34:14,671 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-08 08:34:14,672 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.03 08:34:14 BoogieIcfgContainer [2025-03-08 08:34:14,672 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-08 08:34:14,673 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-08 08:34:14,674 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-08 08:34:14,677 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-08 08:34:14,677 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 08.03 08:34:13" (1/3) ... [2025-03-08 08:34:14,677 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@431cc987 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.03 08:34:14, skipping insertion in model container [2025-03-08 08:34:14,677 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 08:34:14" (2/3) ... [2025-03-08 08:34:14,678 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@431cc987 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.03 08:34:14, skipping insertion in model container [2025-03-08 08:34:14,678 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.03 08:34:14" (3/3) ... [2025-03-08 08:34:14,679 INFO L128 eAbstractionObserver]: Analyzing ICFG btor2c-lazyMod.diagonal.c [2025-03-08 08:34:14,688 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-08 08:34:14,689 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG btor2c-lazyMod.diagonal.c that has 1 procedures, 72 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-03-08 08:34:14,726 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-08 08:34:14,737 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;@3c217a07, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-08 08:34:14,737 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-03-08 08:34:14,740 INFO L276 IsEmpty]: Start isEmpty. Operand has 72 states, 70 states have (on average 1.4714285714285715) internal successors, (103), 71 states have internal predecessors, (103), 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) [2025-03-08 08:34:14,743 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2025-03-08 08:34:14,743 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 08:34:14,743 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 08:34:14,744 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 08:34:14,747 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 08:34:14,747 INFO L85 PathProgramCache]: Analyzing trace with hash -1585251547, now seen corresponding path program 1 times [2025-03-08 08:34:14,752 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 08:34:14,752 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1123735756] [2025-03-08 08:34:14,752 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 08:34:14,752 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 08:34:14,800 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 13 statements into 1 equivalence classes. [2025-03-08 08:34:14,834 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 13 of 13 statements. [2025-03-08 08:34:14,834 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 08:34:14,834 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 08:34:15,066 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 08:34:15,068 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 08:34:15,068 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1123735756] [2025-03-08 08:34:15,069 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1123735756] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 08:34:15,069 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 08:34:15,069 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-08 08:34:15,070 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1621323321] [2025-03-08 08:34:15,070 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 08:34:15,074 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-08 08:34:15,074 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 08:34:15,086 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-08 08:34:15,086 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-08 08:34:15,087 INFO L87 Difference]: Start difference. First operand has 72 states, 70 states have (on average 1.4714285714285715) internal successors, (103), 71 states have internal predecessors, (103), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 4 states, 4 states have (on average 3.25) internal successors, (13), 4 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 08:34:15,142 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 08:34:15,142 INFO L93 Difference]: Finished difference Result 133 states and 193 transitions. [2025-03-08 08:34:15,143 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-08 08:34:15,144 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 3.25) internal successors, (13), 4 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 13 [2025-03-08 08:34:15,144 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 08:34:15,148 INFO L225 Difference]: With dead ends: 133 [2025-03-08 08:34:15,148 INFO L226 Difference]: Without dead ends: 71 [2025-03-08 08:34:15,150 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-08 08:34:15,155 INFO L435 NwaCegarLoop]: 81 mSDtfsCounter, 0 mSDsluCounter, 157 mSDsCounter, 0 mSdLazyCounter, 58 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 238 SdHoareTripleChecker+Invalid, 58 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 58 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-08 08:34:15,156 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 238 Invalid, 58 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 58 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-08 08:34:15,165 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 71 states. [2025-03-08 08:34:15,176 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 71 to 71. [2025-03-08 08:34:15,176 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 71 states, 70 states have (on average 1.4428571428571428) internal successors, (101), 70 states have internal predecessors, (101), 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) [2025-03-08 08:34:15,180 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 71 states to 71 states and 101 transitions. [2025-03-08 08:34:15,181 INFO L78 Accepts]: Start accepts. Automaton has 71 states and 101 transitions. Word has length 13 [2025-03-08 08:34:15,182 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 08:34:15,182 INFO L471 AbstractCegarLoop]: Abstraction has 71 states and 101 transitions. [2025-03-08 08:34:15,182 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 3.25) internal successors, (13), 4 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 08:34:15,182 INFO L276 IsEmpty]: Start isEmpty. Operand 71 states and 101 transitions. [2025-03-08 08:34:15,182 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2025-03-08 08:34:15,182 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 08:34:15,182 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 08:34:15,184 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-03-08 08:34:15,185 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 08:34:15,185 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 08:34:15,186 INFO L85 PathProgramCache]: Analyzing trace with hash -1893478476, now seen corresponding path program 1 times [2025-03-08 08:34:15,186 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 08:34:15,186 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [958935554] [2025-03-08 08:34:15,186 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 08:34:15,186 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 08:34:15,198 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 14 statements into 1 equivalence classes. [2025-03-08 08:34:15,226 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 14 of 14 statements. [2025-03-08 08:34:15,226 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 08:34:15,226 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 08:34:15,298 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 08:34:15,300 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 08:34:15,300 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [958935554] [2025-03-08 08:34:15,300 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [958935554] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 08:34:15,300 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 08:34:15,300 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-08 08:34:15,301 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [423571325] [2025-03-08 08:34:15,301 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 08:34:15,301 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-08 08:34:15,302 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 08:34:15,302 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-08 08:34:15,302 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-08 08:34:15,303 INFO L87 Difference]: Start difference. First operand 71 states and 101 transitions. Second operand has 4 states, 4 states have (on average 3.5) internal successors, (14), 4 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 08:34:15,371 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 08:34:15,371 INFO L93 Difference]: Finished difference Result 134 states and 191 transitions. [2025-03-08 08:34:15,373 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-08 08:34:15,373 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 3.5) internal successors, (14), 4 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 14 [2025-03-08 08:34:15,373 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 08:34:15,374 INFO L225 Difference]: With dead ends: 134 [2025-03-08 08:34:15,374 INFO L226 Difference]: Without dead ends: 73 [2025-03-08 08:34:15,375 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-08 08:34:15,376 INFO L435 NwaCegarLoop]: 81 mSDtfsCounter, 0 mSDsluCounter, 154 mSDsCounter, 0 mSdLazyCounter, 61 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 235 SdHoareTripleChecker+Invalid, 61 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 61 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-08 08:34:15,376 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 235 Invalid, 61 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 61 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-08 08:34:15,377 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 73 states. [2025-03-08 08:34:15,381 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 73 to 73. [2025-03-08 08:34:15,381 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 73 states, 72 states have (on average 1.4305555555555556) internal successors, (103), 72 states have internal predecessors, (103), 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) [2025-03-08 08:34:15,381 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 73 states to 73 states and 103 transitions. [2025-03-08 08:34:15,382 INFO L78 Accepts]: Start accepts. Automaton has 73 states and 103 transitions. Word has length 14 [2025-03-08 08:34:15,382 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 08:34:15,382 INFO L471 AbstractCegarLoop]: Abstraction has 73 states and 103 transitions. [2025-03-08 08:34:15,382 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 3.5) internal successors, (14), 4 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 08:34:15,382 INFO L276 IsEmpty]: Start isEmpty. Operand 73 states and 103 transitions. [2025-03-08 08:34:15,382 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2025-03-08 08:34:15,382 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 08:34:15,382 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 08:34:15,383 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-03-08 08:34:15,383 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 08:34:15,383 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 08:34:15,383 INFO L85 PathProgramCache]: Analyzing trace with hash -931748608, now seen corresponding path program 1 times [2025-03-08 08:34:15,383 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 08:34:15,383 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [959613400] [2025-03-08 08:34:15,383 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 08:34:15,384 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 08:34:15,391 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 15 statements into 1 equivalence classes. [2025-03-08 08:34:15,403 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 15 of 15 statements. [2025-03-08 08:34:15,404 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 08:34:15,404 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 08:34:15,562 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 08:34:15,562 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 08:34:15,562 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [959613400] [2025-03-08 08:34:15,562 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [959613400] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 08:34:15,562 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 08:34:15,562 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-08 08:34:15,562 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2131349670] [2025-03-08 08:34:15,562 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 08:34:15,563 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-08 08:34:15,563 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 08:34:15,563 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-08 08:34:15,563 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-08 08:34:15,563 INFO L87 Difference]: Start difference. First operand 73 states and 103 transitions. Second operand has 5 states, 5 states have (on average 3.0) internal successors, (15), 5 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) [2025-03-08 08:34:15,693 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 08:34:15,693 INFO L93 Difference]: Finished difference Result 185 states and 262 transitions. [2025-03-08 08:34:15,694 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-08 08:34:15,695 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 3.0) internal successors, (15), 5 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 15 [2025-03-08 08:34:15,695 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 08:34:15,695 INFO L225 Difference]: With dead ends: 185 [2025-03-08 08:34:15,695 INFO L226 Difference]: Without dead ends: 122 [2025-03-08 08:34:15,696 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2025-03-08 08:34:15,696 INFO L435 NwaCegarLoop]: 73 mSDtfsCounter, 76 mSDsluCounter, 203 mSDsCounter, 0 mSdLazyCounter, 107 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 76 SdHoareTripleChecker+Valid, 276 SdHoareTripleChecker+Invalid, 107 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 107 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-08 08:34:15,696 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [76 Valid, 276 Invalid, 107 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 107 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-08 08:34:15,697 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 122 states. [2025-03-08 08:34:15,701 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 122 to 75. [2025-03-08 08:34:15,701 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 75 states, 74 states have (on average 1.4189189189189189) internal successors, (105), 74 states have internal predecessors, (105), 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) [2025-03-08 08:34:15,702 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 75 states to 75 states and 105 transitions. [2025-03-08 08:34:15,702 INFO L78 Accepts]: Start accepts. Automaton has 75 states and 105 transitions. Word has length 15 [2025-03-08 08:34:15,702 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 08:34:15,702 INFO L471 AbstractCegarLoop]: Abstraction has 75 states and 105 transitions. [2025-03-08 08:34:15,702 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.0) internal successors, (15), 5 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) [2025-03-08 08:34:15,702 INFO L276 IsEmpty]: Start isEmpty. Operand 75 states and 105 transitions. [2025-03-08 08:34:15,703 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2025-03-08 08:34:15,703 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 08:34:15,703 INFO L218 NwaCegarLoop]: trace histogram [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, 1, 1] [2025-03-08 08:34:15,703 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-03-08 08:34:15,703 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 08:34:15,706 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 08:34:15,706 INFO L85 PathProgramCache]: Analyzing trace with hash -377592472, now seen corresponding path program 1 times [2025-03-08 08:34:15,706 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 08:34:15,706 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [920616635] [2025-03-08 08:34:15,706 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 08:34:15,706 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 08:34:15,727 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 46 statements into 1 equivalence classes. [2025-03-08 08:34:15,846 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 46 of 46 statements. [2025-03-08 08:34:15,847 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 08:34:15,847 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 08:34:16,236 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 2 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 08:34:16,236 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 08:34:16,236 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [920616635] [2025-03-08 08:34:16,236 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [920616635] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-08 08:34:16,236 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [580069696] [2025-03-08 08:34:16,236 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 08:34:16,236 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 08:34:16,236 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 08:34:16,241 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-08 08:34:16,242 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2025-03-08 08:34:16,319 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 46 statements into 1 equivalence classes. [2025-03-08 08:34:16,369 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 46 of 46 statements. [2025-03-08 08:34:16,370 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 08:34:16,370 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 08:34:16,373 INFO L256 TraceCheckSpWp]: Trace formula consists of 331 conjuncts, 12 conjuncts are in the unsatisfiable core [2025-03-08 08:34:16,378 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 08:34:16,532 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 08:34:16,534 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-08 08:34:16,534 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [580069696] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 08:34:16,534 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-08 08:34:16,534 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [8] total 10 [2025-03-08 08:34:16,535 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2046995974] [2025-03-08 08:34:16,535 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 08:34:16,535 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-08 08:34:16,536 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 08:34:16,536 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-08 08:34:16,536 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=73, Unknown=0, NotChecked=0, Total=90 [2025-03-08 08:34:16,537 INFO L87 Difference]: Start difference. First operand 75 states and 105 transitions. Second operand has 4 states, 4 states have (on average 11.5) internal successors, (46), 4 states have internal predecessors, (46), 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) [2025-03-08 08:34:16,625 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 08:34:16,625 INFO L93 Difference]: Finished difference Result 138 states and 194 transitions. [2025-03-08 08:34:16,625 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-08 08:34:16,625 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 11.5) internal successors, (46), 4 states have internal predecessors, (46), 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 46 [2025-03-08 08:34:16,626 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 08:34:16,627 INFO L225 Difference]: With dead ends: 138 [2025-03-08 08:34:16,627 INFO L226 Difference]: Without dead ends: 75 [2025-03-08 08:34:16,628 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 54 GetRequests, 45 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=21, Invalid=89, Unknown=0, NotChecked=0, Total=110 [2025-03-08 08:34:16,629 INFO L435 NwaCegarLoop]: 55 mSDtfsCounter, 82 mSDsluCounter, 54 mSDsCounter, 0 mSdLazyCounter, 87 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 82 SdHoareTripleChecker+Valid, 109 SdHoareTripleChecker+Invalid, 87 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 87 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-08 08:34:16,630 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [82 Valid, 109 Invalid, 87 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 87 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-08 08:34:16,630 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 75 states. [2025-03-08 08:34:16,635 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 75 to 75. [2025-03-08 08:34:16,636 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 75 states, 74 states have (on average 1.4054054054054055) internal successors, (104), 74 states have internal predecessors, (104), 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) [2025-03-08 08:34:16,637 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 75 states to 75 states and 104 transitions. [2025-03-08 08:34:16,637 INFO L78 Accepts]: Start accepts. Automaton has 75 states and 104 transitions. Word has length 46 [2025-03-08 08:34:16,637 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 08:34:16,637 INFO L471 AbstractCegarLoop]: Abstraction has 75 states and 104 transitions. [2025-03-08 08:34:16,637 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 11.5) internal successors, (46), 4 states have internal predecessors, (46), 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) [2025-03-08 08:34:16,637 INFO L276 IsEmpty]: Start isEmpty. Operand 75 states and 104 transitions. [2025-03-08 08:34:16,638 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2025-03-08 08:34:16,638 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 08:34:16,638 INFO L218 NwaCegarLoop]: trace histogram [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, 1, 1, 1] [2025-03-08 08:34:16,647 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2025-03-08 08:34:16,838 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 08:34:16,839 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 08:34:16,839 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 08:34:16,839 INFO L85 PathProgramCache]: Analyzing trace with hash 1401143458, now seen corresponding path program 1 times [2025-03-08 08:34:16,839 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 08:34:16,839 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1029813106] [2025-03-08 08:34:16,839 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 08:34:16,839 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 08:34:16,856 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 47 statements into 1 equivalence classes. [2025-03-08 08:34:16,922 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 47 of 47 statements. [2025-03-08 08:34:16,922 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 08:34:16,922 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 08:34:17,241 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 2 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 08:34:17,242 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 08:34:17,243 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1029813106] [2025-03-08 08:34:17,243 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1029813106] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-08 08:34:17,243 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1767306320] [2025-03-08 08:34:17,243 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 08:34:17,243 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 08:34:17,243 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 08:34:17,246 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-08 08:34:17,247 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2025-03-08 08:34:17,337 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 47 statements into 1 equivalence classes. [2025-03-08 08:34:17,391 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 47 of 47 statements. [2025-03-08 08:34:17,391 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 08:34:17,391 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 08:34:17,394 INFO L256 TraceCheckSpWp]: Trace formula consists of 331 conjuncts, 88 conjuncts are in the unsatisfiable core [2025-03-08 08:34:17,399 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 08:34:17,934 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 08:34:17,935 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-08 08:34:17,935 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1767306320] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 08:34:17,935 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-08 08:34:17,935 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [8] total 17 [2025-03-08 08:34:17,935 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [367798695] [2025-03-08 08:34:17,935 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 08:34:17,935 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2025-03-08 08:34:17,935 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 08:34:17,936 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2025-03-08 08:34:17,936 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=43, Invalid=229, Unknown=0, NotChecked=0, Total=272 [2025-03-08 08:34:17,936 INFO L87 Difference]: Start difference. First operand 75 states and 104 transitions. Second operand has 11 states, 11 states have (on average 4.2727272727272725) internal successors, (47), 11 states have internal predecessors, (47), 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) [2025-03-08 08:34:18,329 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 08:34:18,329 INFO L93 Difference]: Finished difference Result 193 states and 270 transitions. [2025-03-08 08:34:18,329 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2025-03-08 08:34:18,329 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 4.2727272727272725) internal successors, (47), 11 states have internal predecessors, (47), 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 47 [2025-03-08 08:34:18,330 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 08:34:18,331 INFO L225 Difference]: With dead ends: 193 [2025-03-08 08:34:18,331 INFO L226 Difference]: Without dead ends: 130 [2025-03-08 08:34:18,331 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 62 GetRequests, 39 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 48 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=91, Invalid=509, Unknown=0, NotChecked=0, Total=600 [2025-03-08 08:34:18,332 INFO L435 NwaCegarLoop]: 43 mSDtfsCounter, 181 mSDsluCounter, 260 mSDsCounter, 0 mSdLazyCounter, 420 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 181 SdHoareTripleChecker+Valid, 303 SdHoareTripleChecker+Invalid, 422 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 420 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-08 08:34:18,332 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [181 Valid, 303 Invalid, 422 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 420 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-08 08:34:18,334 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 130 states. [2025-03-08 08:34:18,337 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 130 to 75. [2025-03-08 08:34:18,340 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 75 states, 74 states have (on average 1.3918918918918919) internal successors, (103), 74 states have internal predecessors, (103), 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) [2025-03-08 08:34:18,340 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 75 states to 75 states and 103 transitions. [2025-03-08 08:34:18,342 INFO L78 Accepts]: Start accepts. Automaton has 75 states and 103 transitions. Word has length 47 [2025-03-08 08:34:18,342 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 08:34:18,342 INFO L471 AbstractCegarLoop]: Abstraction has 75 states and 103 transitions. [2025-03-08 08:34:18,342 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 4.2727272727272725) internal successors, (47), 11 states have internal predecessors, (47), 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) [2025-03-08 08:34:18,342 INFO L276 IsEmpty]: Start isEmpty. Operand 75 states and 103 transitions. [2025-03-08 08:34:18,343 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2025-03-08 08:34:18,343 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 08:34:18,343 INFO L218 NwaCegarLoop]: trace histogram [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, 1, 1, 1, 1] [2025-03-08 08:34:18,351 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2025-03-08 08:34:18,544 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 08:34:18,544 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 08:34:18,544 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 08:34:18,544 INFO L85 PathProgramCache]: Analyzing trace with hash 1550176778, now seen corresponding path program 1 times [2025-03-08 08:34:18,544 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 08:34:18,544 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1795680315] [2025-03-08 08:34:18,544 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 08:34:18,544 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 08:34:18,560 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 48 statements into 1 equivalence classes. [2025-03-08 08:34:18,578 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 48 of 48 statements. [2025-03-08 08:34:18,578 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 08:34:18,578 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 08:34:18,703 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 08:34:18,703 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 08:34:18,703 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1795680315] [2025-03-08 08:34:18,703 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1795680315] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 08:34:18,703 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 08:34:18,703 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-08 08:34:18,703 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [301738056] [2025-03-08 08:34:18,703 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 08:34:18,704 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-08 08:34:18,704 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 08:34:18,704 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-08 08:34:18,704 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-03-08 08:34:18,704 INFO L87 Difference]: Start difference. First operand 75 states and 103 transitions. Second operand has 6 states, 6 states have (on average 8.0) internal successors, (48), 6 states have internal predecessors, (48), 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) [2025-03-08 08:34:18,834 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 08:34:18,834 INFO L93 Difference]: Finished difference Result 193 states and 267 transitions. [2025-03-08 08:34:18,834 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-03-08 08:34:18,834 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 8.0) internal successors, (48), 6 states have internal predecessors, (48), 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 48 [2025-03-08 08:34:18,835 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 08:34:18,836 INFO L225 Difference]: With dead ends: 193 [2025-03-08 08:34:18,836 INFO L226 Difference]: Without dead ends: 79 [2025-03-08 08:34:18,837 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2025-03-08 08:34:18,837 INFO L435 NwaCegarLoop]: 109 mSDtfsCounter, 58 mSDsluCounter, 375 mSDsCounter, 0 mSdLazyCounter, 193 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 58 SdHoareTripleChecker+Valid, 484 SdHoareTripleChecker+Invalid, 199 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 193 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-08 08:34:18,837 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [58 Valid, 484 Invalid, 199 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 193 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-08 08:34:18,837 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 79 states. [2025-03-08 08:34:18,841 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 79 to 77. [2025-03-08 08:34:18,842 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 77 states, 76 states have (on average 1.381578947368421) internal successors, (105), 76 states have internal predecessors, (105), 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) [2025-03-08 08:34:18,843 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 77 states to 77 states and 105 transitions. [2025-03-08 08:34:18,843 INFO L78 Accepts]: Start accepts. Automaton has 77 states and 105 transitions. Word has length 48 [2025-03-08 08:34:18,843 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 08:34:18,843 INFO L471 AbstractCegarLoop]: Abstraction has 77 states and 105 transitions. [2025-03-08 08:34:18,843 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 8.0) internal successors, (48), 6 states have internal predecessors, (48), 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) [2025-03-08 08:34:18,843 INFO L276 IsEmpty]: Start isEmpty. Operand 77 states and 105 transitions. [2025-03-08 08:34:18,844 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2025-03-08 08:34:18,844 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 08:34:18,844 INFO L218 NwaCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1] [2025-03-08 08:34:18,844 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-03-08 08:34:18,844 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 08:34:18,845 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 08:34:18,846 INFO L85 PathProgramCache]: Analyzing trace with hash 1624965287, now seen corresponding path program 1 times [2025-03-08 08:34:18,846 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 08:34:18,846 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1684205254] [2025-03-08 08:34:18,846 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 08:34:18,846 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 08:34:18,859 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 49 statements into 1 equivalence classes. [2025-03-08 08:34:18,906 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 49 of 49 statements. [2025-03-08 08:34:18,906 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 08:34:18,906 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 08:34:19,327 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 08:34:19,328 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 08:34:19,328 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1684205254] [2025-03-08 08:34:19,328 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1684205254] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 08:34:19,328 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 08:34:19,328 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-03-08 08:34:19,329 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1079016477] [2025-03-08 08:34:19,329 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 08:34:19,329 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-03-08 08:34:19,329 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 08:34:19,329 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-03-08 08:34:19,331 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2025-03-08 08:34:19,331 INFO L87 Difference]: Start difference. First operand 77 states and 105 transitions. Second operand has 8 states, 8 states have (on average 6.125) internal successors, (49), 8 states have internal predecessors, (49), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 08:34:19,577 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 08:34:19,577 INFO L93 Difference]: Finished difference Result 263 states and 360 transitions. [2025-03-08 08:34:19,577 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-03-08 08:34:19,578 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 6.125) internal successors, (49), 8 states have internal predecessors, (49), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 49 [2025-03-08 08:34:19,578 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 08:34:19,579 INFO L225 Difference]: With dead ends: 263 [2025-03-08 08:34:19,579 INFO L226 Difference]: Without dead ends: 128 [2025-03-08 08:34:19,579 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=29, Invalid=103, Unknown=0, NotChecked=0, Total=132 [2025-03-08 08:34:19,580 INFO L435 NwaCegarLoop]: 82 mSDtfsCounter, 151 mSDsluCounter, 409 mSDsCounter, 0 mSdLazyCounter, 313 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 151 SdHoareTripleChecker+Valid, 491 SdHoareTripleChecker+Invalid, 321 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 313 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-08 08:34:19,580 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [151 Valid, 491 Invalid, 321 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 313 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-08 08:34:19,581 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 128 states. [2025-03-08 08:34:19,587 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 128 to 100. [2025-03-08 08:34:19,589 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 100 states, 99 states have (on average 1.3636363636363635) internal successors, (135), 99 states have internal predecessors, (135), 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) [2025-03-08 08:34:19,590 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 100 states to 100 states and 135 transitions. [2025-03-08 08:34:19,590 INFO L78 Accepts]: Start accepts. Automaton has 100 states and 135 transitions. Word has length 49 [2025-03-08 08:34:19,590 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 08:34:19,590 INFO L471 AbstractCegarLoop]: Abstraction has 100 states and 135 transitions. [2025-03-08 08:34:19,590 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 6.125) internal successors, (49), 8 states have internal predecessors, (49), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 08:34:19,591 INFO L276 IsEmpty]: Start isEmpty. Operand 100 states and 135 transitions. [2025-03-08 08:34:19,591 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2025-03-08 08:34:19,591 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 08:34:19,591 INFO L218 NwaCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1, 1] [2025-03-08 08:34:19,591 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-03-08 08:34:19,592 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 08:34:19,592 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 08:34:19,592 INFO L85 PathProgramCache]: Analyzing trace with hash -529447557, now seen corresponding path program 1 times [2025-03-08 08:34:19,592 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 08:34:19,592 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1448134908] [2025-03-08 08:34:19,592 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 08:34:19,592 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 08:34:19,607 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 50 statements into 1 equivalence classes. [2025-03-08 08:34:19,639 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 50 of 50 statements. [2025-03-08 08:34:19,639 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 08:34:19,639 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 08:34:19,828 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 08:34:19,828 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 08:34:19,829 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1448134908] [2025-03-08 08:34:19,829 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1448134908] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 08:34:19,829 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 08:34:19,829 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-08 08:34:19,829 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [664511254] [2025-03-08 08:34:19,829 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 08:34:19,829 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-08 08:34:19,829 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 08:34:19,829 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-08 08:34:19,829 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-08 08:34:19,829 INFO L87 Difference]: Start difference. First operand 100 states and 135 transitions. Second operand has 5 states, 5 states have (on average 10.0) internal successors, (50), 5 states have internal predecessors, (50), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 08:34:19,919 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 08:34:19,919 INFO L93 Difference]: Finished difference Result 191 states and 261 transitions. [2025-03-08 08:34:19,919 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-08 08:34:19,920 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 10.0) internal successors, (50), 5 states have internal predecessors, (50), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 50 [2025-03-08 08:34:19,920 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 08:34:19,920 INFO L225 Difference]: With dead ends: 191 [2025-03-08 08:34:19,920 INFO L226 Difference]: Without dead ends: 126 [2025-03-08 08:34:19,921 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2025-03-08 08:34:19,921 INFO L435 NwaCegarLoop]: 69 mSDtfsCounter, 48 mSDsluCounter, 194 mSDsCounter, 0 mSdLazyCounter, 112 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 48 SdHoareTripleChecker+Valid, 263 SdHoareTripleChecker+Invalid, 112 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 112 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-08 08:34:19,921 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [48 Valid, 263 Invalid, 112 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 112 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-08 08:34:19,922 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 126 states. [2025-03-08 08:34:19,925 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 126 to 120. [2025-03-08 08:34:19,925 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 120 states, 119 states have (on average 1.3697478991596639) internal successors, (163), 119 states have internal predecessors, (163), 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) [2025-03-08 08:34:19,926 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 120 states to 120 states and 163 transitions. [2025-03-08 08:34:19,926 INFO L78 Accepts]: Start accepts. Automaton has 120 states and 163 transitions. Word has length 50 [2025-03-08 08:34:19,926 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 08:34:19,926 INFO L471 AbstractCegarLoop]: Abstraction has 120 states and 163 transitions. [2025-03-08 08:34:19,926 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 10.0) internal successors, (50), 5 states have internal predecessors, (50), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 08:34:19,926 INFO L276 IsEmpty]: Start isEmpty. Operand 120 states and 163 transitions. [2025-03-08 08:34:19,926 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2025-03-08 08:34:19,932 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 08:34:19,932 INFO L218 NwaCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1, 1] [2025-03-08 08:34:19,932 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-03-08 08:34:19,932 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 08:34:19,933 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 08:34:19,933 INFO L85 PathProgramCache]: Analyzing trace with hash -475751380, now seen corresponding path program 1 times [2025-03-08 08:34:19,933 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 08:34:19,933 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [186130028] [2025-03-08 08:34:19,934 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 08:34:19,934 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 08:34:19,951 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 50 statements into 1 equivalence classes. [2025-03-08 08:34:19,982 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 50 of 50 statements. [2025-03-08 08:34:19,982 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 08:34:19,982 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 08:34:20,212 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 08:34:20,212 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 08:34:20,212 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [186130028] [2025-03-08 08:34:20,212 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [186130028] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 08:34:20,212 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 08:34:20,213 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-03-08 08:34:20,213 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [815437868] [2025-03-08 08:34:20,213 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 08:34:20,213 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-03-08 08:34:20,213 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 08:34:20,213 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-03-08 08:34:20,213 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2025-03-08 08:34:20,214 INFO L87 Difference]: Start difference. First operand 120 states and 163 transitions. Second operand has 7 states, 7 states have (on average 7.142857142857143) internal successors, (50), 7 states have internal predecessors, (50), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 08:34:20,375 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 08:34:20,375 INFO L93 Difference]: Finished difference Result 290 states and 396 transitions. [2025-03-08 08:34:20,376 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-03-08 08:34:20,376 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 7.142857142857143) internal successors, (50), 7 states have internal predecessors, (50), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 50 [2025-03-08 08:34:20,376 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 08:34:20,377 INFO L225 Difference]: With dead ends: 290 [2025-03-08 08:34:20,377 INFO L226 Difference]: Without dead ends: 225 [2025-03-08 08:34:20,377 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=24, Invalid=66, Unknown=0, NotChecked=0, Total=90 [2025-03-08 08:34:20,377 INFO L435 NwaCegarLoop]: 125 mSDtfsCounter, 107 mSDsluCounter, 555 mSDsCounter, 0 mSdLazyCounter, 230 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 107 SdHoareTripleChecker+Valid, 680 SdHoareTripleChecker+Invalid, 230 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 230 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-08 08:34:20,378 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [107 Valid, 680 Invalid, 230 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 230 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-08 08:34:20,381 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 225 states. [2025-03-08 08:34:20,384 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 225 to 154. [2025-03-08 08:34:20,388 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 154 states, 153 states have (on average 1.3660130718954249) internal successors, (209), 153 states have internal predecessors, (209), 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) [2025-03-08 08:34:20,388 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 154 states to 154 states and 209 transitions. [2025-03-08 08:34:20,389 INFO L78 Accepts]: Start accepts. Automaton has 154 states and 209 transitions. Word has length 50 [2025-03-08 08:34:20,389 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 08:34:20,389 INFO L471 AbstractCegarLoop]: Abstraction has 154 states and 209 transitions. [2025-03-08 08:34:20,389 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 7.142857142857143) internal successors, (50), 7 states have internal predecessors, (50), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 08:34:20,390 INFO L276 IsEmpty]: Start isEmpty. Operand 154 states and 209 transitions. [2025-03-08 08:34:20,390 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2025-03-08 08:34:20,390 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 08:34:20,390 INFO L218 NwaCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 08:34:20,390 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-03-08 08:34:20,392 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 08:34:20,392 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 08:34:20,392 INFO L85 PathProgramCache]: Analyzing trace with hash 139299594, now seen corresponding path program 1 times [2025-03-08 08:34:20,392 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 08:34:20,392 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [453976347] [2025-03-08 08:34:20,392 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 08:34:20,392 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 08:34:20,405 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 51 statements into 1 equivalence classes. [2025-03-08 08:34:20,457 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 51 of 51 statements. [2025-03-08 08:34:20,458 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 08:34:20,458 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 08:34:20,781 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 08:34:20,781 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 08:34:20,781 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [453976347] [2025-03-08 08:34:20,781 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [453976347] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 08:34:20,781 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 08:34:20,781 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-03-08 08:34:20,782 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1295853041] [2025-03-08 08:34:20,782 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 08:34:20,782 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-03-08 08:34:20,782 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 08:34:20,782 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-03-08 08:34:20,782 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2025-03-08 08:34:20,783 INFO L87 Difference]: Start difference. First operand 154 states and 209 transitions. Second operand has 8 states, 8 states have (on average 6.375) internal successors, (51), 8 states have internal predecessors, (51), 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) [2025-03-08 08:34:20,952 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 08:34:20,953 INFO L93 Difference]: Finished difference Result 278 states and 376 transitions. [2025-03-08 08:34:20,953 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-03-08 08:34:20,953 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 6.375) internal successors, (51), 8 states have internal predecessors, (51), 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 [2025-03-08 08:34:20,954 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 08:34:20,954 INFO L225 Difference]: With dead ends: 278 [2025-03-08 08:34:20,954 INFO L226 Difference]: Without dead ends: 190 [2025-03-08 08:34:20,955 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2025-03-08 08:34:20,955 INFO L435 NwaCegarLoop]: 57 mSDtfsCounter, 52 mSDsluCounter, 310 mSDsCounter, 0 mSdLazyCounter, 299 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 52 SdHoareTripleChecker+Valid, 367 SdHoareTripleChecker+Invalid, 299 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 299 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-08 08:34:20,955 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [52 Valid, 367 Invalid, 299 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 299 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-08 08:34:20,956 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 190 states. [2025-03-08 08:34:20,959 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 190 to 171. [2025-03-08 08:34:20,960 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 171 states, 170 states have (on average 1.3529411764705883) internal successors, (230), 170 states have internal predecessors, (230), 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) [2025-03-08 08:34:20,960 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 171 states to 171 states and 230 transitions. [2025-03-08 08:34:20,960 INFO L78 Accepts]: Start accepts. Automaton has 171 states and 230 transitions. Word has length 51 [2025-03-08 08:34:20,961 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 08:34:20,961 INFO L471 AbstractCegarLoop]: Abstraction has 171 states and 230 transitions. [2025-03-08 08:34:20,961 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 6.375) internal successors, (51), 8 states have internal predecessors, (51), 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) [2025-03-08 08:34:20,961 INFO L276 IsEmpty]: Start isEmpty. Operand 171 states and 230 transitions. [2025-03-08 08:34:20,961 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2025-03-08 08:34:20,961 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 08:34:20,962 INFO L218 NwaCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 08:34:20,962 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-03-08 08:34:20,962 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 08:34:20,962 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 08:34:20,962 INFO L85 PathProgramCache]: Analyzing trace with hash -1821916515, now seen corresponding path program 1 times [2025-03-08 08:34:20,962 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 08:34:20,963 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1149859785] [2025-03-08 08:34:20,963 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 08:34:20,963 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 08:34:20,977 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 51 statements into 1 equivalence classes. [2025-03-08 08:34:21,020 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 51 of 51 statements. [2025-03-08 08:34:21,021 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 08:34:21,021 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 08:34:21,480 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 08:34:21,480 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 08:34:21,480 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1149859785] [2025-03-08 08:34:21,481 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1149859785] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 08:34:21,481 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 08:34:21,481 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2025-03-08 08:34:21,481 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1631544641] [2025-03-08 08:34:21,481 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 08:34:21,481 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-03-08 08:34:21,481 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 08:34:21,481 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-03-08 08:34:21,482 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=50, Unknown=0, NotChecked=0, Total=72 [2025-03-08 08:34:21,482 INFO L87 Difference]: Start difference. First operand 171 states and 230 transitions. Second operand has 9 states, 9 states have (on average 5.666666666666667) internal successors, (51), 9 states have internal predecessors, (51), 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) [2025-03-08 08:34:21,666 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 08:34:21,666 INFO L93 Difference]: Finished difference Result 313 states and 421 transitions. [2025-03-08 08:34:21,666 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-03-08 08:34:21,666 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 5.666666666666667) internal successors, (51), 9 states have internal predecessors, (51), 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 [2025-03-08 08:34:21,667 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 08:34:21,667 INFO L225 Difference]: With dead ends: 313 [2025-03-08 08:34:21,668 INFO L226 Difference]: Without dead ends: 205 [2025-03-08 08:34:21,668 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=26, Invalid=64, Unknown=0, NotChecked=0, Total=90 [2025-03-08 08:34:21,668 INFO L435 NwaCegarLoop]: 57 mSDtfsCounter, 87 mSDsluCounter, 262 mSDsCounter, 0 mSdLazyCounter, 287 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 87 SdHoareTripleChecker+Valid, 319 SdHoareTripleChecker+Invalid, 287 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 287 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-08 08:34:21,668 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [87 Valid, 319 Invalid, 287 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 287 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-08 08:34:21,669 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 205 states. [2025-03-08 08:34:21,672 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 205 to 189. [2025-03-08 08:34:21,672 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 189 states, 188 states have (on average 1.351063829787234) internal successors, (254), 188 states have internal predecessors, (254), 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) [2025-03-08 08:34:21,673 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 189 states to 189 states and 254 transitions. [2025-03-08 08:34:21,673 INFO L78 Accepts]: Start accepts. Automaton has 189 states and 254 transitions. Word has length 51 [2025-03-08 08:34:21,673 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 08:34:21,673 INFO L471 AbstractCegarLoop]: Abstraction has 189 states and 254 transitions. [2025-03-08 08:34:21,673 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 5.666666666666667) internal successors, (51), 9 states have internal predecessors, (51), 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) [2025-03-08 08:34:21,673 INFO L276 IsEmpty]: Start isEmpty. Operand 189 states and 254 transitions. [2025-03-08 08:34:21,673 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2025-03-08 08:34:21,674 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 08:34:21,674 INFO L218 NwaCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 08:34:21,674 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-03-08 08:34:21,674 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 08:34:21,674 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 08:34:21,674 INFO L85 PathProgramCache]: Analyzing trace with hash -1697205050, now seen corresponding path program 1 times [2025-03-08 08:34:21,674 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 08:34:21,674 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [50938384] [2025-03-08 08:34:21,674 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 08:34:21,674 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 08:34:21,691 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 52 statements into 1 equivalence classes. [2025-03-08 08:34:21,742 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 52 of 52 statements. [2025-03-08 08:34:21,743 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 08:34:21,743 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 08:34:22,092 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 4 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 08:34:22,093 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 08:34:22,093 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [50938384] [2025-03-08 08:34:22,093 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [50938384] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-08 08:34:22,093 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1185124695] [2025-03-08 08:34:22,093 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 08:34:22,093 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 08:34:22,093 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 08:34:22,095 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-08 08:34:22,097 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2025-03-08 08:34:22,180 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 52 statements into 1 equivalence classes. [2025-03-08 08:34:22,223 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 52 of 52 statements. [2025-03-08 08:34:22,223 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 08:34:22,224 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 08:34:22,225 INFO L256 TraceCheckSpWp]: Trace formula consists of 342 conjuncts, 24 conjuncts are in the unsatisfiable core [2025-03-08 08:34:22,229 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 08:34:22,315 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 5 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 08:34:22,315 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-08 08:34:22,485 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 5 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 08:34:22,486 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1185124695] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-08 08:34:22,486 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-08 08:34:22,486 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 6, 6] total 16 [2025-03-08 08:34:22,486 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1470235533] [2025-03-08 08:34:22,486 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-08 08:34:22,487 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2025-03-08 08:34:22,487 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 08:34:22,488 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2025-03-08 08:34:22,488 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=40, Invalid=200, Unknown=0, NotChecked=0, Total=240 [2025-03-08 08:34:22,488 INFO L87 Difference]: Start difference. First operand 189 states and 254 transitions. Second operand has 16 states, 16 states have (on average 8.875) internal successors, (142), 16 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) [2025-03-08 08:34:23,133 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 08:34:23,133 INFO L93 Difference]: Finished difference Result 500 states and 678 transitions. [2025-03-08 08:34:23,133 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2025-03-08 08:34:23,134 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 16 states have (on average 8.875) internal successors, (142), 16 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) Word has length 52 [2025-03-08 08:34:23,134 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 08:34:23,135 INFO L225 Difference]: With dead ends: 500 [2025-03-08 08:34:23,135 INFO L226 Difference]: Without dead ends: 412 [2025-03-08 08:34:23,135 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 125 GetRequests, 97 SyntacticMatches, 0 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 92 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=183, Invalid=687, Unknown=0, NotChecked=0, Total=870 [2025-03-08 08:34:23,136 INFO L435 NwaCegarLoop]: 201 mSDtfsCounter, 399 mSDsluCounter, 1534 mSDsCounter, 0 mSdLazyCounter, 981 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 399 SdHoareTripleChecker+Valid, 1735 SdHoareTripleChecker+Invalid, 982 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 981 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-03-08 08:34:23,136 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [399 Valid, 1735 Invalid, 982 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 981 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-03-08 08:34:23,136 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 412 states. [2025-03-08 08:34:23,143 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 412 to 150. [2025-03-08 08:34:23,144 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 150 states, 149 states have (on average 1.348993288590604) internal successors, (201), 149 states have internal predecessors, (201), 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) [2025-03-08 08:34:23,144 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 150 states to 150 states and 201 transitions. [2025-03-08 08:34:23,144 INFO L78 Accepts]: Start accepts. Automaton has 150 states and 201 transitions. Word has length 52 [2025-03-08 08:34:23,144 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 08:34:23,144 INFO L471 AbstractCegarLoop]: Abstraction has 150 states and 201 transitions. [2025-03-08 08:34:23,145 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 16 states have (on average 8.875) internal successors, (142), 16 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) [2025-03-08 08:34:23,145 INFO L276 IsEmpty]: Start isEmpty. Operand 150 states and 201 transitions. [2025-03-08 08:34:23,145 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2025-03-08 08:34:23,146 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 08:34:23,146 INFO L218 NwaCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 08:34:23,153 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2025-03-08 08:34:23,346 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 08:34:23,347 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 08:34:23,347 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 08:34:23,347 INFO L85 PathProgramCache]: Analyzing trace with hash -459767919, now seen corresponding path program 1 times [2025-03-08 08:34:23,348 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 08:34:23,348 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1853772238] [2025-03-08 08:34:23,348 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 08:34:23,348 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 08:34:23,360 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 52 statements into 1 equivalence classes. [2025-03-08 08:34:23,407 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 52 of 52 statements. [2025-03-08 08:34:23,408 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 08:34:23,408 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 08:34:23,793 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 08:34:23,793 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 08:34:23,793 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1853772238] [2025-03-08 08:34:23,793 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1853772238] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 08:34:23,793 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 08:34:23,793 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2025-03-08 08:34:23,793 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1093343884] [2025-03-08 08:34:23,793 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 08:34:23,793 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-03-08 08:34:23,794 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 08:34:23,794 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-03-08 08:34:23,794 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=49, Unknown=0, NotChecked=0, Total=72 [2025-03-08 08:34:23,794 INFO L87 Difference]: Start difference. First operand 150 states and 201 transitions. Second operand has 9 states, 9 states have (on average 5.777777777777778) internal successors, (52), 9 states have internal predecessors, (52), 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) [2025-03-08 08:34:24,027 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 08:34:24,028 INFO L93 Difference]: Finished difference Result 248 states and 334 transitions. [2025-03-08 08:34:24,028 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-03-08 08:34:24,028 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 5.777777777777778) internal successors, (52), 9 states have internal predecessors, (52), 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 52 [2025-03-08 08:34:24,028 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 08:34:24,029 INFO L225 Difference]: With dead ends: 248 [2025-03-08 08:34:24,029 INFO L226 Difference]: Without dead ends: 180 [2025-03-08 08:34:24,029 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=23, Invalid=49, Unknown=0, NotChecked=0, Total=72 [2025-03-08 08:34:24,030 INFO L435 NwaCegarLoop]: 55 mSDtfsCounter, 121 mSDsluCounter, 247 mSDsCounter, 0 mSdLazyCounter, 409 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 121 SdHoareTripleChecker+Valid, 302 SdHoareTripleChecker+Invalid, 412 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 409 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-08 08:34:24,030 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [121 Valid, 302 Invalid, 412 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 409 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-08 08:34:24,030 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 180 states. [2025-03-08 08:34:24,034 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 180 to 167. [2025-03-08 08:34:24,034 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 167 states, 166 states have (on average 1.355421686746988) internal successors, (225), 166 states have internal predecessors, (225), 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) [2025-03-08 08:34:24,035 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 167 states to 167 states and 225 transitions. [2025-03-08 08:34:24,035 INFO L78 Accepts]: Start accepts. Automaton has 167 states and 225 transitions. Word has length 52 [2025-03-08 08:34:24,035 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 08:34:24,035 INFO L471 AbstractCegarLoop]: Abstraction has 167 states and 225 transitions. [2025-03-08 08:34:24,035 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 5.777777777777778) internal successors, (52), 9 states have internal predecessors, (52), 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) [2025-03-08 08:34:24,036 INFO L276 IsEmpty]: Start isEmpty. Operand 167 states and 225 transitions. [2025-03-08 08:34:24,036 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2025-03-08 08:34:24,036 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 08:34:24,036 INFO L218 NwaCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 08:34:24,036 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2025-03-08 08:34:24,036 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 08:34:24,037 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 08:34:24,037 INFO L85 PathProgramCache]: Analyzing trace with hash 1977933667, now seen corresponding path program 1 times [2025-03-08 08:34:24,037 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 08:34:24,037 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [17337932] [2025-03-08 08:34:24,037 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 08:34:24,037 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 08:34:24,050 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 52 statements into 1 equivalence classes. [2025-03-08 08:34:24,078 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 52 of 52 statements. [2025-03-08 08:34:24,078 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 08:34:24,078 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 08:34:24,363 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 08:34:24,363 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 08:34:24,363 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [17337932] [2025-03-08 08:34:24,363 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [17337932] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 08:34:24,363 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 08:34:24,363 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-03-08 08:34:24,363 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [111060650] [2025-03-08 08:34:24,364 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 08:34:24,364 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-03-08 08:34:24,364 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 08:34:24,364 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-03-08 08:34:24,364 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2025-03-08 08:34:24,364 INFO L87 Difference]: Start difference. First operand 167 states and 225 transitions. Second operand has 8 states, 8 states have (on average 6.5) internal successors, (52), 8 states have internal predecessors, (52), 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) [2025-03-08 08:34:24,475 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 08:34:24,476 INFO L93 Difference]: Finished difference Result 247 states and 333 transitions. [2025-03-08 08:34:24,476 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-03-08 08:34:24,476 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 6.5) internal successors, (52), 8 states have internal predecessors, (52), 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 52 [2025-03-08 08:34:24,476 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 08:34:24,477 INFO L225 Difference]: With dead ends: 247 [2025-03-08 08:34:24,477 INFO L226 Difference]: Without dead ends: 178 [2025-03-08 08:34:24,477 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2025-03-08 08:34:24,478 INFO L435 NwaCegarLoop]: 71 mSDtfsCounter, 51 mSDsluCounter, 367 mSDsCounter, 0 mSdLazyCounter, 196 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 51 SdHoareTripleChecker+Valid, 438 SdHoareTripleChecker+Invalid, 196 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 196 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-08 08:34:24,478 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [51 Valid, 438 Invalid, 196 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 196 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-08 08:34:24,479 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 178 states. [2025-03-08 08:34:24,482 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 178 to 169. [2025-03-08 08:34:24,483 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 169 states, 168 states have (on average 1.3511904761904763) internal successors, (227), 168 states have internal predecessors, (227), 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) [2025-03-08 08:34:24,484 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 169 states to 169 states and 227 transitions. [2025-03-08 08:34:24,484 INFO L78 Accepts]: Start accepts. Automaton has 169 states and 227 transitions. Word has length 52 [2025-03-08 08:34:24,484 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 08:34:24,484 INFO L471 AbstractCegarLoop]: Abstraction has 169 states and 227 transitions. [2025-03-08 08:34:24,485 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 6.5) internal successors, (52), 8 states have internal predecessors, (52), 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) [2025-03-08 08:34:24,485 INFO L276 IsEmpty]: Start isEmpty. Operand 169 states and 227 transitions. [2025-03-08 08:34:24,486 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2025-03-08 08:34:24,486 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 08:34:24,486 INFO L218 NwaCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 08:34:24,486 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2025-03-08 08:34:24,486 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 08:34:24,486 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 08:34:24,486 INFO L85 PathProgramCache]: Analyzing trace with hash 1532240559, now seen corresponding path program 1 times [2025-03-08 08:34:24,486 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 08:34:24,486 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1204639021] [2025-03-08 08:34:24,486 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 08:34:24,487 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 08:34:24,503 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 52 statements into 1 equivalence classes. [2025-03-08 08:34:24,522 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 52 of 52 statements. [2025-03-08 08:34:24,522 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 08:34:24,522 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 08:34:24,606 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 08:34:24,606 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 08:34:24,606 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1204639021] [2025-03-08 08:34:24,606 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1204639021] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 08:34:24,606 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 08:34:24,606 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-08 08:34:24,606 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1949356745] [2025-03-08 08:34:24,606 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 08:34:24,607 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-08 08:34:24,607 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 08:34:24,607 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-08 08:34:24,607 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-03-08 08:34:24,607 INFO L87 Difference]: Start difference. First operand 169 states and 227 transitions. Second operand has 5 states, 5 states have (on average 10.4) internal successors, (52), 5 states have internal predecessors, (52), 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) [2025-03-08 08:34:24,671 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 08:34:24,671 INFO L93 Difference]: Finished difference Result 248 states and 334 transitions. [2025-03-08 08:34:24,672 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-08 08:34:24,672 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 10.4) internal successors, (52), 5 states have internal predecessors, (52), 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 52 [2025-03-08 08:34:24,672 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 08:34:24,673 INFO L225 Difference]: With dead ends: 248 [2025-03-08 08:34:24,673 INFO L226 Difference]: Without dead ends: 175 [2025-03-08 08:34:24,673 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-03-08 08:34:24,673 INFO L435 NwaCegarLoop]: 60 mSDtfsCounter, 90 mSDsluCounter, 113 mSDsCounter, 0 mSdLazyCounter, 117 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 90 SdHoareTripleChecker+Valid, 173 SdHoareTripleChecker+Invalid, 119 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 117 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-08 08:34:24,673 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [90 Valid, 173 Invalid, 119 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 117 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-08 08:34:24,674 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 175 states. [2025-03-08 08:34:24,676 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 175 to 175. [2025-03-08 08:34:24,676 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 175 states, 174 states have (on average 1.339080459770115) internal successors, (233), 174 states have internal predecessors, (233), 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) [2025-03-08 08:34:24,679 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 175 states to 175 states and 233 transitions. [2025-03-08 08:34:24,680 INFO L78 Accepts]: Start accepts. Automaton has 175 states and 233 transitions. Word has length 52 [2025-03-08 08:34:24,680 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 08:34:24,680 INFO L471 AbstractCegarLoop]: Abstraction has 175 states and 233 transitions. [2025-03-08 08:34:24,680 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 10.4) internal successors, (52), 5 states have internal predecessors, (52), 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) [2025-03-08 08:34:24,681 INFO L276 IsEmpty]: Start isEmpty. Operand 175 states and 233 transitions. [2025-03-08 08:34:24,681 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2025-03-08 08:34:24,681 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 08:34:24,681 INFO L218 NwaCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 08:34:24,681 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2025-03-08 08:34:24,681 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 08:34:24,682 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 08:34:24,682 INFO L85 PathProgramCache]: Analyzing trace with hash 586709948, now seen corresponding path program 1 times [2025-03-08 08:34:24,682 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 08:34:24,682 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [537198975] [2025-03-08 08:34:24,682 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 08:34:24,682 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 08:34:24,695 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 53 statements into 1 equivalence classes. [2025-03-08 08:34:24,722 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 53 of 53 statements. [2025-03-08 08:34:24,723 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 08:34:24,723 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 08:34:25,048 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 08:34:25,048 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 08:34:25,048 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [537198975] [2025-03-08 08:34:25,048 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [537198975] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 08:34:25,048 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 08:34:25,048 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-03-08 08:34:25,049 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [986590541] [2025-03-08 08:34:25,049 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 08:34:25,049 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-03-08 08:34:25,049 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 08:34:25,049 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-03-08 08:34:25,049 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2025-03-08 08:34:25,049 INFO L87 Difference]: Start difference. First operand 175 states and 233 transitions. Second operand has 7 states, 7 states have (on average 7.571428571428571) internal successors, (53), 7 states have internal predecessors, (53), 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) [2025-03-08 08:34:25,247 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 08:34:25,247 INFO L93 Difference]: Finished difference Result 251 states and 335 transitions. [2025-03-08 08:34:25,247 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-03-08 08:34:25,247 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 7.571428571428571) internal successors, (53), 7 states have internal predecessors, (53), 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 53 [2025-03-08 08:34:25,248 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 08:34:25,248 INFO L225 Difference]: With dead ends: 251 [2025-03-08 08:34:25,248 INFO L226 Difference]: Without dead ends: 178 [2025-03-08 08:34:25,249 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 3 SyntacticMatches, 1 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=23, Invalid=67, Unknown=0, NotChecked=0, Total=90 [2025-03-08 08:34:25,249 INFO L435 NwaCegarLoop]: 53 mSDtfsCounter, 47 mSDsluCounter, 229 mSDsCounter, 0 mSdLazyCounter, 287 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 47 SdHoareTripleChecker+Valid, 282 SdHoareTripleChecker+Invalid, 287 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 287 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-08 08:34:25,249 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [47 Valid, 282 Invalid, 287 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 287 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-08 08:34:25,250 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 178 states. [2025-03-08 08:34:25,252 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 178 to 157. [2025-03-08 08:34:25,252 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 157 states, 156 states have (on average 1.3333333333333333) internal successors, (208), 156 states have internal predecessors, (208), 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) [2025-03-08 08:34:25,253 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 157 states to 157 states and 208 transitions. [2025-03-08 08:34:25,257 INFO L78 Accepts]: Start accepts. Automaton has 157 states and 208 transitions. Word has length 53 [2025-03-08 08:34:25,257 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 08:34:25,257 INFO L471 AbstractCegarLoop]: Abstraction has 157 states and 208 transitions. [2025-03-08 08:34:25,257 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 7.571428571428571) internal successors, (53), 7 states have internal predecessors, (53), 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) [2025-03-08 08:34:25,257 INFO L276 IsEmpty]: Start isEmpty. Operand 157 states and 208 transitions. [2025-03-08 08:34:25,258 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2025-03-08 08:34:25,258 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 08:34:25,258 INFO L218 NwaCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 08:34:25,258 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2025-03-08 08:34:25,259 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 08:34:25,259 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 08:34:25,259 INFO L85 PathProgramCache]: Analyzing trace with hash -1864677737, now seen corresponding path program 1 times [2025-03-08 08:34:25,259 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 08:34:25,259 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1513519612] [2025-03-08 08:34:25,259 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 08:34:25,259 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 08:34:25,271 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 53 statements into 1 equivalence classes. [2025-03-08 08:34:25,305 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 53 of 53 statements. [2025-03-08 08:34:25,305 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 08:34:25,305 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 08:34:25,617 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 08:34:25,617 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 08:34:25,617 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1513519612] [2025-03-08 08:34:25,617 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1513519612] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 08:34:25,618 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 08:34:25,618 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-03-08 08:34:25,618 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [439500176] [2025-03-08 08:34:25,618 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 08:34:25,619 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-03-08 08:34:25,619 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 08:34:25,620 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-03-08 08:34:25,620 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2025-03-08 08:34:25,620 INFO L87 Difference]: Start difference. First operand 157 states and 208 transitions. Second operand has 7 states, 7 states have (on average 7.571428571428571) internal successors, (53), 7 states have internal predecessors, (53), 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) [2025-03-08 08:34:25,752 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 08:34:25,753 INFO L93 Difference]: Finished difference Result 235 states and 312 transitions. [2025-03-08 08:34:25,753 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-03-08 08:34:25,753 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 7.571428571428571) internal successors, (53), 7 states have internal predecessors, (53), 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 53 [2025-03-08 08:34:25,753 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 08:34:25,754 INFO L225 Difference]: With dead ends: 235 [2025-03-08 08:34:25,754 INFO L226 Difference]: Without dead ends: 165 [2025-03-08 08:34:25,754 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2025-03-08 08:34:25,754 INFO L435 NwaCegarLoop]: 56 mSDtfsCounter, 49 mSDsluCounter, 234 mSDsCounter, 0 mSdLazyCounter, 214 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 49 SdHoareTripleChecker+Valid, 290 SdHoareTripleChecker+Invalid, 215 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 214 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-08 08:34:25,754 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [49 Valid, 290 Invalid, 215 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 214 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-08 08:34:25,755 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 165 states. [2025-03-08 08:34:25,761 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 165 to 161. [2025-03-08 08:34:25,762 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 161 states, 160 states have (on average 1.33125) internal successors, (213), 160 states have internal predecessors, (213), 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) [2025-03-08 08:34:25,763 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 161 states to 161 states and 213 transitions. [2025-03-08 08:34:25,763 INFO L78 Accepts]: Start accepts. Automaton has 161 states and 213 transitions. Word has length 53 [2025-03-08 08:34:25,763 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 08:34:25,763 INFO L471 AbstractCegarLoop]: Abstraction has 161 states and 213 transitions. [2025-03-08 08:34:25,763 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 7.571428571428571) internal successors, (53), 7 states have internal predecessors, (53), 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) [2025-03-08 08:34:25,763 INFO L276 IsEmpty]: Start isEmpty. Operand 161 states and 213 transitions. [2025-03-08 08:34:25,763 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2025-03-08 08:34:25,764 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 08:34:25,764 INFO L218 NwaCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 08:34:25,764 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2025-03-08 08:34:25,764 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 08:34:25,765 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 08:34:25,765 INFO L85 PathProgramCache]: Analyzing trace with hash -15821450, now seen corresponding path program 1 times [2025-03-08 08:34:25,765 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 08:34:25,765 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [950866025] [2025-03-08 08:34:25,765 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 08:34:25,765 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 08:34:25,789 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 54 statements into 1 equivalence classes. [2025-03-08 08:34:25,835 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 54 of 54 statements. [2025-03-08 08:34:25,835 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 08:34:25,835 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 08:34:26,350 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 08:34:26,350 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 08:34:26,350 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [950866025] [2025-03-08 08:34:26,350 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [950866025] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 08:34:26,350 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 08:34:26,350 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2025-03-08 08:34:26,351 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [314574090] [2025-03-08 08:34:26,351 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 08:34:26,351 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2025-03-08 08:34:26,351 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 08:34:26,351 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2025-03-08 08:34:26,351 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=86, Unknown=0, NotChecked=0, Total=110 [2025-03-08 08:34:26,352 INFO L87 Difference]: Start difference. First operand 161 states and 213 transitions. Second operand has 11 states, 11 states have (on average 4.909090909090909) internal successors, (54), 11 states have internal predecessors, (54), 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) [2025-03-08 08:34:26,676 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 08:34:26,676 INFO L93 Difference]: Finished difference Result 316 states and 417 transitions. [2025-03-08 08:34:26,677 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2025-03-08 08:34:26,677 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 4.909090909090909) internal successors, (54), 11 states have internal predecessors, (54), 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 54 [2025-03-08 08:34:26,677 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 08:34:26,678 INFO L225 Difference]: With dead ends: 316 [2025-03-08 08:34:26,678 INFO L226 Difference]: Without dead ends: 164 [2025-03-08 08:34:26,678 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 26 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=53, Invalid=187, Unknown=0, NotChecked=0, Total=240 [2025-03-08 08:34:26,679 INFO L435 NwaCegarLoop]: 96 mSDtfsCounter, 173 mSDsluCounter, 608 mSDsCounter, 0 mSdLazyCounter, 491 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 173 SdHoareTripleChecker+Valid, 704 SdHoareTripleChecker+Invalid, 494 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 491 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-03-08 08:34:26,679 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [173 Valid, 704 Invalid, 494 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 491 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-08 08:34:26,679 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 164 states. [2025-03-08 08:34:26,683 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 164 to 161. [2025-03-08 08:34:26,684 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 161 states, 160 states have (on average 1.325) internal successors, (212), 160 states have internal predecessors, (212), 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) [2025-03-08 08:34:26,685 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 161 states to 161 states and 212 transitions. [2025-03-08 08:34:26,685 INFO L78 Accepts]: Start accepts. Automaton has 161 states and 212 transitions. Word has length 54 [2025-03-08 08:34:26,685 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 08:34:26,685 INFO L471 AbstractCegarLoop]: Abstraction has 161 states and 212 transitions. [2025-03-08 08:34:26,685 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 4.909090909090909) internal successors, (54), 11 states have internal predecessors, (54), 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) [2025-03-08 08:34:26,685 INFO L276 IsEmpty]: Start isEmpty. Operand 161 states and 212 transitions. [2025-03-08 08:34:26,685 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2025-03-08 08:34:26,685 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 08:34:26,685 INFO L218 NwaCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 08:34:26,686 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2025-03-08 08:34:26,686 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 08:34:26,686 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 08:34:26,686 INFO L85 PathProgramCache]: Analyzing trace with hash 116721325, now seen corresponding path program 1 times [2025-03-08 08:34:26,686 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 08:34:26,686 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1208392162] [2025-03-08 08:34:26,686 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 08:34:26,686 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 08:34:26,698 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 55 statements into 1 equivalence classes. [2025-03-08 08:34:26,759 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 55 of 55 statements. [2025-03-08 08:34:26,759 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 08:34:26,759 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 08:34:27,208 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 08:34:27,209 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 08:34:27,209 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1208392162] [2025-03-08 08:34:27,209 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1208392162] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 08:34:27,209 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 08:34:27,209 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-03-08 08:34:27,209 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1933734327] [2025-03-08 08:34:27,209 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 08:34:27,210 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-03-08 08:34:27,210 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 08:34:27,210 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-03-08 08:34:27,210 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2025-03-08 08:34:27,211 INFO L87 Difference]: Start difference. First operand 161 states and 212 transitions. Second operand has 8 states, 8 states have (on average 6.875) internal successors, (55), 8 states have internal predecessors, (55), 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) [2025-03-08 08:34:27,452 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 08:34:27,453 INFO L93 Difference]: Finished difference Result 267 states and 353 transitions. [2025-03-08 08:34:27,453 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-03-08 08:34:27,453 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 6.875) internal successors, (55), 8 states have internal predecessors, (55), 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 55 [2025-03-08 08:34:27,453 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 08:34:27,454 INFO L225 Difference]: With dead ends: 267 [2025-03-08 08:34:27,455 INFO L226 Difference]: Without dead ends: 163 [2025-03-08 08:34:27,455 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=32, Invalid=100, Unknown=0, NotChecked=0, Total=132 [2025-03-08 08:34:27,455 INFO L435 NwaCegarLoop]: 50 mSDtfsCounter, 62 mSDsluCounter, 262 mSDsCounter, 0 mSdLazyCounter, 354 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 62 SdHoareTripleChecker+Valid, 312 SdHoareTripleChecker+Invalid, 355 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 354 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-08 08:34:27,455 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [62 Valid, 312 Invalid, 355 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 354 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-08 08:34:27,456 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 163 states. [2025-03-08 08:34:27,460 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 163 to 163. [2025-03-08 08:34:27,460 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 163 states, 162 states have (on average 1.3209876543209877) internal successors, (214), 162 states have internal predecessors, (214), 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) [2025-03-08 08:34:27,461 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 163 states to 163 states and 214 transitions. [2025-03-08 08:34:27,461 INFO L78 Accepts]: Start accepts. Automaton has 163 states and 214 transitions. Word has length 55 [2025-03-08 08:34:27,461 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 08:34:27,461 INFO L471 AbstractCegarLoop]: Abstraction has 163 states and 214 transitions. [2025-03-08 08:34:27,461 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 6.875) internal successors, (55), 8 states have internal predecessors, (55), 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) [2025-03-08 08:34:27,461 INFO L276 IsEmpty]: Start isEmpty. Operand 163 states and 214 transitions. [2025-03-08 08:34:27,461 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2025-03-08 08:34:27,461 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 08:34:27,461 INFO L218 NwaCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 08:34:27,461 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2025-03-08 08:34:27,462 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 08:34:27,462 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 08:34:27,462 INFO L85 PathProgramCache]: Analyzing trace with hash -754607982, now seen corresponding path program 1 times [2025-03-08 08:34:27,462 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 08:34:27,462 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [606338830] [2025-03-08 08:34:27,462 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 08:34:27,462 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 08:34:27,475 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 55 statements into 1 equivalence classes. [2025-03-08 08:34:27,499 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 55 of 55 statements. [2025-03-08 08:34:27,500 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 08:34:27,500 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 08:34:27,713 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 08:34:27,713 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 08:34:27,713 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [606338830] [2025-03-08 08:34:27,713 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [606338830] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 08:34:27,713 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 08:34:27,713 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-03-08 08:34:27,713 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [753425190] [2025-03-08 08:34:27,713 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 08:34:27,714 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-03-08 08:34:27,714 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 08:34:27,714 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-03-08 08:34:27,715 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2025-03-08 08:34:27,715 INFO L87 Difference]: Start difference. First operand 163 states and 214 transitions. Second operand has 8 states, 8 states have (on average 6.875) internal successors, (55), 8 states have internal predecessors, (55), 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) [2025-03-08 08:34:27,881 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 08:34:27,882 INFO L93 Difference]: Finished difference Result 275 states and 359 transitions. [2025-03-08 08:34:27,882 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-03-08 08:34:27,882 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 6.875) internal successors, (55), 8 states have internal predecessors, (55), 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 55 [2025-03-08 08:34:27,882 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 08:34:27,883 INFO L225 Difference]: With dead ends: 275 [2025-03-08 08:34:27,883 INFO L226 Difference]: Without dead ends: 152 [2025-03-08 08:34:27,883 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=25, Invalid=85, Unknown=0, NotChecked=0, Total=110 [2025-03-08 08:34:27,883 INFO L435 NwaCegarLoop]: 66 mSDtfsCounter, 52 mSDsluCounter, 359 mSDsCounter, 0 mSdLazyCounter, 239 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 52 SdHoareTripleChecker+Valid, 425 SdHoareTripleChecker+Invalid, 242 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 239 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-08 08:34:27,883 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [52 Valid, 425 Invalid, 242 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 239 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-08 08:34:27,884 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 152 states. [2025-03-08 08:34:27,886 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 152 to 152. [2025-03-08 08:34:27,886 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 152 states, 151 states have (on average 1.2913907284768211) internal successors, (195), 151 states have internal predecessors, (195), 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) [2025-03-08 08:34:27,887 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 152 states to 152 states and 195 transitions. [2025-03-08 08:34:27,887 INFO L78 Accepts]: Start accepts. Automaton has 152 states and 195 transitions. Word has length 55 [2025-03-08 08:34:27,887 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 08:34:27,887 INFO L471 AbstractCegarLoop]: Abstraction has 152 states and 195 transitions. [2025-03-08 08:34:27,887 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 6.875) internal successors, (55), 8 states have internal predecessors, (55), 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) [2025-03-08 08:34:27,887 INFO L276 IsEmpty]: Start isEmpty. Operand 152 states and 195 transitions. [2025-03-08 08:34:27,887 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2025-03-08 08:34:27,887 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 08:34:27,887 INFO L218 NwaCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 08:34:27,887 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2025-03-08 08:34:27,887 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 08:34:27,888 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 08:34:27,888 INFO L85 PathProgramCache]: Analyzing trace with hash 1666129134, now seen corresponding path program 1 times [2025-03-08 08:34:27,888 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 08:34:27,888 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [690135975] [2025-03-08 08:34:27,888 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 08:34:27,888 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 08:34:27,900 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 55 statements into 1 equivalence classes. [2025-03-08 08:34:27,908 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 55 of 55 statements. [2025-03-08 08:34:27,908 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 08:34:27,908 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 08:34:27,984 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 08:34:27,984 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 08:34:27,984 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [690135975] [2025-03-08 08:34:27,984 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [690135975] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 08:34:27,984 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 08:34:27,984 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-08 08:34:27,984 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [8617128] [2025-03-08 08:34:27,984 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 08:34:27,985 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-08 08:34:27,985 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 08:34:27,985 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-08 08:34:27,985 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-03-08 08:34:27,985 INFO L87 Difference]: Start difference. First operand 152 states and 195 transitions. Second operand has 5 states, 5 states have (on average 11.0) internal successors, (55), 5 states have internal predecessors, (55), 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) [2025-03-08 08:34:28,026 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 08:34:28,026 INFO L93 Difference]: Finished difference Result 272 states and 352 transitions. [2025-03-08 08:34:28,026 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-08 08:34:28,026 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 11.0) internal successors, (55), 5 states have internal predecessors, (55), 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 55 [2025-03-08 08:34:28,026 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 08:34:28,027 INFO L225 Difference]: With dead ends: 272 [2025-03-08 08:34:28,027 INFO L226 Difference]: Without dead ends: 156 [2025-03-08 08:34:28,027 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-03-08 08:34:28,028 INFO L435 NwaCegarLoop]: 79 mSDtfsCounter, 0 mSDsluCounter, 148 mSDsCounter, 0 mSdLazyCounter, 64 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 227 SdHoareTripleChecker+Invalid, 65 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 64 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-08 08:34:28,028 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 227 Invalid, 65 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 64 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-08 08:34:28,028 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 156 states. [2025-03-08 08:34:28,030 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 156 to 156. [2025-03-08 08:34:28,031 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 156 states, 155 states have (on average 1.2838709677419355) internal successors, (199), 155 states have internal predecessors, (199), 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) [2025-03-08 08:34:28,031 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 156 states to 156 states and 199 transitions. [2025-03-08 08:34:28,031 INFO L78 Accepts]: Start accepts. Automaton has 156 states and 199 transitions. Word has length 55 [2025-03-08 08:34:28,031 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 08:34:28,031 INFO L471 AbstractCegarLoop]: Abstraction has 156 states and 199 transitions. [2025-03-08 08:34:28,031 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 11.0) internal successors, (55), 5 states have internal predecessors, (55), 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) [2025-03-08 08:34:28,031 INFO L276 IsEmpty]: Start isEmpty. Operand 156 states and 199 transitions. [2025-03-08 08:34:28,032 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2025-03-08 08:34:28,032 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 08:34:28,032 INFO L218 NwaCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 08:34:28,032 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2025-03-08 08:34:28,032 INFO L396 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 08:34:28,032 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 08:34:28,032 INFO L85 PathProgramCache]: Analyzing trace with hash 1169379995, now seen corresponding path program 1 times [2025-03-08 08:34:28,032 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 08:34:28,032 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1447608846] [2025-03-08 08:34:28,032 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 08:34:28,032 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 08:34:28,048 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 56 statements into 1 equivalence classes. [2025-03-08 08:34:28,068 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 56 of 56 statements. [2025-03-08 08:34:28,068 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 08:34:28,069 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 08:34:28,234 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 08:34:28,234 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 08:34:28,234 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1447608846] [2025-03-08 08:34:28,234 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1447608846] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 08:34:28,234 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 08:34:28,235 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-08 08:34:28,235 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1308075373] [2025-03-08 08:34:28,235 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 08:34:28,235 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-08 08:34:28,235 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 08:34:28,235 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-08 08:34:28,235 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-08 08:34:28,236 INFO L87 Difference]: Start difference. First operand 156 states and 199 transitions. Second operand has 5 states, 5 states have (on average 11.2) internal successors, (56), 5 states have internal predecessors, (56), 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) [2025-03-08 08:34:28,313 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 08:34:28,313 INFO L93 Difference]: Finished difference Result 272 states and 347 transitions. [2025-03-08 08:34:28,313 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-08 08:34:28,314 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 11.2) internal successors, (56), 5 states have internal predecessors, (56), 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 56 [2025-03-08 08:34:28,314 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 08:34:28,314 INFO L225 Difference]: With dead ends: 272 [2025-03-08 08:34:28,314 INFO L226 Difference]: Without dead ends: 136 [2025-03-08 08:34:28,315 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2025-03-08 08:34:28,316 INFO L435 NwaCegarLoop]: 71 mSDtfsCounter, 49 mSDsluCounter, 197 mSDsCounter, 0 mSdLazyCounter, 107 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 49 SdHoareTripleChecker+Valid, 268 SdHoareTripleChecker+Invalid, 107 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 107 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-08 08:34:28,316 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [49 Valid, 268 Invalid, 107 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 107 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-08 08:34:28,317 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 136 states. [2025-03-08 08:34:28,319 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 136 to 136. [2025-03-08 08:34:28,319 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 136 states, 135 states have (on average 1.2740740740740741) internal successors, (172), 135 states have internal predecessors, (172), 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) [2025-03-08 08:34:28,319 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 136 states to 136 states and 172 transitions. [2025-03-08 08:34:28,320 INFO L78 Accepts]: Start accepts. Automaton has 136 states and 172 transitions. Word has length 56 [2025-03-08 08:34:28,320 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 08:34:28,320 INFO L471 AbstractCegarLoop]: Abstraction has 136 states and 172 transitions. [2025-03-08 08:34:28,320 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 11.2) internal successors, (56), 5 states have internal predecessors, (56), 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) [2025-03-08 08:34:28,320 INFO L276 IsEmpty]: Start isEmpty. Operand 136 states and 172 transitions. [2025-03-08 08:34:28,320 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2025-03-08 08:34:28,320 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 08:34:28,320 INFO L218 NwaCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 08:34:28,320 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2025-03-08 08:34:28,321 INFO L396 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 08:34:28,321 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 08:34:28,321 INFO L85 PathProgramCache]: Analyzing trace with hash -1472107594, now seen corresponding path program 1 times [2025-03-08 08:34:28,321 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 08:34:28,321 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [501621242] [2025-03-08 08:34:28,321 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 08:34:28,321 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 08:34:28,334 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 56 statements into 1 equivalence classes. [2025-03-08 08:34:28,376 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 56 of 56 statements. [2025-03-08 08:34:28,377 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 08:34:28,377 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-08 08:34:28,377 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-08 08:34:28,381 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 56 statements into 1 equivalence classes. [2025-03-08 08:34:28,432 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 56 of 56 statements. [2025-03-08 08:34:28,432 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 08:34:28,433 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-08 08:34:28,457 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-08 08:34:28,458 INFO L340 BasicCegarLoop]: Counterexample is feasible [2025-03-08 08:34:28,458 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2025-03-08 08:34:28,459 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2025-03-08 08:34:28,462 INFO L422 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 08:34:28,488 WARN L310 BoogieBacktranslator]: Removing null node from list of ATEs: ATE program state null [2025-03-08 08:34:28,488 WARN L310 BoogieBacktranslator]: Removing null node from list of ATEs: ATE program state null [2025-03-08 08:34:28,498 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2025-03-08 08:34:28,500 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 08.03 08:34:28 BoogieIcfgContainer [2025-03-08 08:34:28,500 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2025-03-08 08:34:28,501 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2025-03-08 08:34:28,501 INFO L270 PluginConnector]: Initializing Witness Printer... [2025-03-08 08:34:28,501 INFO L274 PluginConnector]: Witness Printer initialized [2025-03-08 08:34:28,502 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.03 08:34:14" (3/4) ... [2025-03-08 08:34:28,503 INFO L149 WitnessPrinter]: No result that supports witness generation found [2025-03-08 08:34:28,504 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2025-03-08 08:34:28,504 INFO L158 Benchmark]: Toolchain (without parser) took 14720.64ms. Allocated memory was 201.3MB in the beginning and 427.8MB in the end (delta: 226.5MB). Free memory was 154.8MB in the beginning and 224.8MB in the end (delta: -70.0MB). Peak memory consumption was 155.4MB. Max. memory is 16.1GB. [2025-03-08 08:34:28,504 INFO L158 Benchmark]: CDTParser took 0.27ms. Allocated memory is still 201.3MB. Free memory is still 118.6MB. There was no memory consumed. Max. memory is 16.1GB. [2025-03-08 08:34:28,504 INFO L158 Benchmark]: CACSL2BoogieTranslator took 238.85ms. Allocated memory is still 201.3MB. Free memory was 154.4MB in the beginning and 140.1MB in the end (delta: 14.4MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2025-03-08 08:34:28,505 INFO L158 Benchmark]: Boogie Procedure Inliner took 45.92ms. Allocated memory is still 201.3MB. Free memory was 140.1MB in the beginning and 133.9MB in the end (delta: 6.1MB). There was no memory consumed. Max. memory is 16.1GB. [2025-03-08 08:34:28,505 INFO L158 Benchmark]: Boogie Preprocessor took 49.42ms. Allocated memory is still 201.3MB. Free memory was 133.9MB in the beginning and 130.0MB in the end (delta: 3.9MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-03-08 08:34:28,505 INFO L158 Benchmark]: IcfgBuilder took 551.64ms. Allocated memory is still 201.3MB. Free memory was 130.0MB in the beginning and 90.1MB in the end (delta: 39.9MB). Peak memory consumption was 41.9MB. Max. memory is 16.1GB. [2025-03-08 08:34:28,505 INFO L158 Benchmark]: TraceAbstraction took 13827.01ms. Allocated memory was 201.3MB in the beginning and 427.8MB in the end (delta: 226.5MB). Free memory was 89.7MB in the beginning and 225.0MB in the end (delta: -135.2MB). Peak memory consumption was 88.3MB. Max. memory is 16.1GB. [2025-03-08 08:34:28,505 INFO L158 Benchmark]: Witness Printer took 2.72ms. Allocated memory is still 427.8MB. Free memory was 225.0MB in the beginning and 224.8MB in the end (delta: 133.8kB). There was no memory consumed. Max. memory is 16.1GB. [2025-03-08 08:34:28,506 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.27ms. Allocated memory is still 201.3MB. Free memory is still 118.6MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 238.85ms. Allocated memory is still 201.3MB. Free memory was 154.4MB in the beginning and 140.1MB in the end (delta: 14.4MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 45.92ms. Allocated memory is still 201.3MB. Free memory was 140.1MB in the beginning and 133.9MB in the end (delta: 6.1MB). There was no memory consumed. Max. memory is 16.1GB. * Boogie Preprocessor took 49.42ms. Allocated memory is still 201.3MB. Free memory was 133.9MB in the beginning and 130.0MB in the end (delta: 3.9MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * IcfgBuilder took 551.64ms. Allocated memory is still 201.3MB. Free memory was 130.0MB in the beginning and 90.1MB in the end (delta: 39.9MB). Peak memory consumption was 41.9MB. Max. memory is 16.1GB. * TraceAbstraction took 13827.01ms. Allocated memory was 201.3MB in the beginning and 427.8MB in the end (delta: 226.5MB). Free memory was 89.7MB in the beginning and 225.0MB in the end (delta: -135.2MB). Peak memory consumption was 88.3MB. Max. memory is 16.1GB. * Witness Printer took 2.72ms. Allocated memory is still 427.8MB. Free memory was 225.0MB in the beginning and 224.8MB in the end (delta: 133.8kB). There was no memory consumed. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - UnprovableResult [Line: 21]: Unable to prove that a call to reach_error is unreachable Unable to prove that a call to reach_error is unreachable Reason: overapproximation of shiftRight at line 78, overapproximation of bitwiseOr at line 134, overapproximation of bitwiseAnd at line 147, overapproximation of bitwiseAnd at line 135, overapproximation of bitwiseAnd at line 113. Possible FailurePath: [L26] const SORT_1 mask_SORT_1 = (SORT_1)-1 >> (sizeof(SORT_1) * 8 - 1); [L27] const SORT_1 msb_SORT_1 = (SORT_1)1 << (1 - 1); [L29] const SORT_4 mask_SORT_4 = (SORT_4)-1 >> (sizeof(SORT_4) * 8 - 4); [L30] const SORT_4 msb_SORT_4 = (SORT_4)1 << (4 - 1); [L32] const SORT_4 var_5 = 0; [L33] const SORT_1 var_14 = 1; [L34] const SORT_4 var_19 = 1; [L35] const SORT_4 var_22 = 15; [L37] SORT_1 input_2; [L38] SORT_1 input_3; [L40] EXPR __VERIFIER_nondet_uchar() & mask_SORT_4 VAL [mask_SORT_1=1, mask_SORT_4=15, var_14=1, var_19=1, var_22=15, var_5=0] [L40] SORT_4 state_6 = __VERIFIER_nondet_uchar() & mask_SORT_4; [L41] EXPR __VERIFIER_nondet_uchar() & mask_SORT_4 VAL [mask_SORT_1=1, mask_SORT_4=15, var_14=1, var_19=1, var_22=15, var_5=0] [L41] SORT_4 state_8 = __VERIFIER_nondet_uchar() & mask_SORT_4; [L43] SORT_4 init_7_arg_1 = var_5; [L44] state_6 = init_7_arg_1 [L45] SORT_4 init_9_arg_1 = var_5; [L46] state_8 = init_9_arg_1 VAL [mask_SORT_1=1, mask_SORT_4=15, state_6=0, state_8=0, var_14=1, var_19=1, var_22=15] [L49] input_2 = __VERIFIER_nondet_uchar() [L50] input_3 = __VERIFIER_nondet_uchar() [L53] SORT_4 var_10_arg_0 = state_6; [L54] SORT_4 var_10_arg_1 = state_8; [L55] SORT_1 var_10 = var_10_arg_0 < var_10_arg_1; [L56] SORT_1 var_11_arg_0 = var_10; [L57] SORT_1 var_11 = ~var_11_arg_0; [L58] SORT_1 var_15_arg_0 = var_11; [L59] SORT_1 var_15 = ~var_15_arg_0; [L60] SORT_1 var_16_arg_0 = var_14; [L61] SORT_1 var_16_arg_1 = var_15; VAL [mask_SORT_1=1, mask_SORT_4=15, state_6=0, state_8=0, var_14=1, var_16_arg_0=1, var_16_arg_1=-256, var_19=1, var_22=15] [L62] EXPR var_16_arg_0 & var_16_arg_1 VAL [mask_SORT_1=1, mask_SORT_4=15, state_6=0, state_8=0, var_14=1, var_19=1, var_22=15] [L62] SORT_1 var_16 = var_16_arg_0 & var_16_arg_1; [L63] EXPR var_16 & mask_SORT_1 VAL [mask_SORT_1=1, mask_SORT_4=15, state_6=0, state_8=0, var_14=1, var_19=1, var_22=15] [L63] var_16 = var_16 & mask_SORT_1 [L64] SORT_1 bad_17_arg_0 = var_16; [L65] CALL __VERIFIER_assert(!(bad_17_arg_0)) [L21] COND FALSE !(!(cond)) [L65] RET __VERIFIER_assert(!(bad_17_arg_0)) [L67] SORT_1 var_31_arg_0 = input_3; [L68] SORT_1 var_31 = ~var_31_arg_0; [L69] SORT_4 var_32_arg_0 = state_6; [L70] SORT_4 var_32_arg_1 = state_8; [L71] SORT_1 var_32 = var_32_arg_0 > var_32_arg_1; [L72] SORT_1 var_33_arg_0 = var_31; [L73] SORT_1 var_33_arg_1 = var_32; VAL [input_3=255, mask_SORT_1=1, mask_SORT_4=15, state_6=0, state_8=0, var_14=1, var_19=1, var_22=15, var_33_arg_0=-256, var_33_arg_1=0] [L74] EXPR var_33_arg_0 & var_33_arg_1 VAL [input_3=255, mask_SORT_1=1, mask_SORT_4=15, state_6=0, state_8=0, var_14=1, var_19=1, var_22=15] [L74] SORT_1 var_33 = var_33_arg_0 & var_33_arg_1; [L75] EXPR var_33 & mask_SORT_1 VAL [input_3=255, mask_SORT_1=1, mask_SORT_4=15, state_6=0, state_8=0, var_14=1, var_19=1, var_22=15] [L75] var_33 = var_33 & mask_SORT_1 [L76] SORT_4 var_28_arg_0 = var_22; [L77] SORT_4 var_28_arg_1 = var_19; VAL [input_3=255, mask_SORT_1=1, mask_SORT_4=15, state_6=0, state_8=0, var_14=1, var_19=1, var_22=15, var_28_arg_0=15, var_28_arg_1=1, var_33=0] [L78] EXPR var_28_arg_0 >> var_28_arg_1 VAL [input_3=255, mask_SORT_1=1, mask_SORT_4=15, state_6=0, state_8=0, var_14=1, var_19=1, var_22=15, var_33=0] [L78] SORT_4 var_28 = var_28_arg_0 >> var_28_arg_1; [L79] SORT_4 var_29_arg_0 = state_6; [L80] SORT_4 var_29_arg_1 = var_19; VAL [input_3=255, mask_SORT_1=1, mask_SORT_4=15, state_6=0, state_8=0, var_14=1, var_19=1, var_22=15, var_28=-255, var_29_arg_0=0, var_29_arg_1=1, var_33=0] [L81] EXPR var_29_arg_0 >> var_29_arg_1 VAL [input_3=255, mask_SORT_1=1, mask_SORT_4=15, state_6=0, state_8=0, var_14=1, var_19=1, var_22=15, var_28=-255, var_33=0] [L81] SORT_4 var_29 = var_29_arg_0 >> var_29_arg_1; [L82] SORT_4 var_30_arg_0 = var_28; [L83] SORT_4 var_30_arg_1 = var_29; [L84] SORT_4 var_30 = var_30_arg_0 + var_30_arg_1; [L85] SORT_4 var_26_arg_0 = state_6; [L86] SORT_4 var_26_arg_1 = state_8; [L87] SORT_1 var_26 = var_26_arg_0 < var_26_arg_1; [L88] SORT_4 var_21_arg_0 = state_8; [L89] SORT_4 var_21_arg_1 = state_6; [L90] SORT_1 var_21 = var_21_arg_0 == var_21_arg_1; [L91] SORT_4 var_23_arg_0 = state_6; [L92] SORT_4 var_23_arg_1 = var_22; [L93] SORT_1 var_23 = var_23_arg_0 != var_23_arg_1; [L94] SORT_1 var_24_arg_0 = var_21; [L95] SORT_1 var_24_arg_1 = var_23; VAL [input_3=255, mask_SORT_1=1, mask_SORT_4=15, state_6=0, state_8=0, var_14=1, var_19=1, var_22=15, var_24_arg_0=1, var_24_arg_1=1, var_26=0, var_30=1, var_33=0] [L96] EXPR var_24_arg_0 | var_24_arg_1 VAL [input_3=255, mask_SORT_1=1, mask_SORT_4=15, state_6=0, state_8=0, var_14=1, var_19=1, var_22=15, var_26=0, var_30=1, var_33=0] [L96] SORT_1 var_24 = var_24_arg_0 | var_24_arg_1; [L97] EXPR var_24 & mask_SORT_1 VAL [input_3=255, mask_SORT_1=1, mask_SORT_4=15, state_6=0, state_8=0, var_14=1, var_19=1, var_22=15, var_26=0, var_30=1, var_33=0] [L97] var_24 = var_24 & mask_SORT_1 [L98] SORT_4 var_20_arg_0 = state_6; [L99] SORT_4 var_20_arg_1 = var_19; [L100] SORT_4 var_20 = var_20_arg_0 + var_20_arg_1; [L101] SORT_1 var_25_arg_0 = var_24; [L102] SORT_4 var_25_arg_1 = var_20; [L103] SORT_4 var_25_arg_2 = state_8; [L104] SORT_4 var_25 = var_25_arg_0 ? var_25_arg_1 : var_25_arg_2; [L105] SORT_1 var_27_arg_0 = var_26; [L106] SORT_4 var_27_arg_1 = state_6; [L107] SORT_4 var_27_arg_2 = var_25; [L108] SORT_4 var_27 = var_27_arg_0 ? var_27_arg_1 : var_27_arg_2; [L109] SORT_1 var_34_arg_0 = var_33; [L110] SORT_4 var_34_arg_1 = var_30; [L111] SORT_4 var_34_arg_2 = var_27; [L112] SORT_4 var_34 = var_34_arg_0 ? var_34_arg_1 : var_34_arg_2; VAL [input_3=255, mask_SORT_1=1, mask_SORT_4=15, state_6=0, state_8=0, var_14=1, var_19=1, var_22=15, var_34=1] [L113] EXPR var_34 & mask_SORT_4 VAL [input_3=255, mask_SORT_1=1, mask_SORT_4=15, state_6=0, state_8=0, var_14=1, var_19=1, var_22=15] [L113] var_34 = var_34 & mask_SORT_4 [L114] SORT_4 next_35_arg_1 = var_34; [L115] SORT_1 var_42_arg_0 = input_3; [L116] SORT_1 var_42 = ~var_42_arg_0; [L117] SORT_4 var_43_arg_0 = state_6; [L118] SORT_4 var_43_arg_1 = state_8; [L119] SORT_1 var_43 = var_43_arg_0 > var_43_arg_1; [L120] SORT_1 var_44_arg_0 = var_42; [L121] SORT_1 var_44_arg_1 = var_43; VAL [mask_SORT_1=1, mask_SORT_4=15, next_35_arg_1=0, state_6=0, state_8=0, var_14=1, var_19=1, var_22=15, var_44_arg_0=-256, var_44_arg_1=0] [L122] EXPR var_44_arg_0 & var_44_arg_1 VAL [mask_SORT_1=1, mask_SORT_4=15, next_35_arg_1=0, state_6=0, state_8=0, var_14=1, var_19=1, var_22=15] [L122] SORT_1 var_44 = var_44_arg_0 & var_44_arg_1; [L123] EXPR var_44 & mask_SORT_1 VAL [mask_SORT_1=1, mask_SORT_4=15, next_35_arg_1=0, state_6=0, state_8=0, var_14=1, var_19=1, var_22=15] [L123] var_44 = var_44 & mask_SORT_1 [L124] SORT_4 var_37_arg_0 = state_6; [L125] SORT_4 var_37_arg_1 = state_8; [L126] SORT_1 var_37 = var_37_arg_0 > var_37_arg_1; [L127] SORT_1 var_38_arg_0 = var_37; [L128] SORT_1 var_38 = ~var_38_arg_0; [L129] SORT_4 var_39_arg_0 = state_6; [L130] SORT_4 var_39_arg_1 = var_22; [L131] SORT_1 var_39 = var_39_arg_0 != var_39_arg_1; [L132] SORT_1 var_40_arg_0 = var_38; [L133] SORT_1 var_40_arg_1 = var_39; VAL [mask_SORT_1=1, mask_SORT_4=15, next_35_arg_1=0, state_6=0, state_8=0, var_14=1, var_19=1, var_22=15, var_40_arg_0=-1, var_40_arg_1=1, var_44=0] [L134] EXPR var_40_arg_0 | var_40_arg_1 VAL [mask_SORT_1=1, mask_SORT_4=15, next_35_arg_1=0, state_6=0, state_8=0, var_14=1, var_19=1, var_22=15, var_44=0] [L134] SORT_1 var_40 = var_40_arg_0 | var_40_arg_1; [L135] EXPR var_40 & mask_SORT_1 VAL [mask_SORT_1=1, mask_SORT_4=15, next_35_arg_1=0, state_6=0, state_8=0, var_14=1, var_19=1, var_22=15, var_44=0] [L135] var_40 = var_40 & mask_SORT_1 [L136] SORT_4 var_36_arg_0 = state_8; [L137] SORT_4 var_36_arg_1 = var_19; [L138] SORT_4 var_36 = var_36_arg_0 + var_36_arg_1; [L139] SORT_1 var_41_arg_0 = var_40; [L140] SORT_4 var_41_arg_1 = var_36; [L141] SORT_4 var_41_arg_2 = state_6; [L142] SORT_4 var_41 = var_41_arg_0 ? var_41_arg_1 : var_41_arg_2; [L143] SORT_1 var_45_arg_0 = var_44; [L144] SORT_4 var_45_arg_1 = state_8; [L145] SORT_4 var_45_arg_2 = var_41; [L146] SORT_4 var_45 = var_45_arg_0 ? var_45_arg_1 : var_45_arg_2; VAL [mask_SORT_1=1, mask_SORT_4=15, next_35_arg_1=0, var_14=1, var_19=1, var_22=15, var_45=1] [L147] EXPR var_45 & mask_SORT_4 VAL [mask_SORT_1=1, mask_SORT_4=15, next_35_arg_1=0, var_14=1, var_19=1, var_22=15] [L147] var_45 = var_45 & mask_SORT_4 [L148] SORT_4 next_46_arg_1 = var_45; [L150] state_6 = next_35_arg_1 [L151] state_8 = next_46_arg_1 [L49] input_2 = __VERIFIER_nondet_uchar() [L50] input_3 = __VERIFIER_nondet_uchar() [L53] SORT_4 var_10_arg_0 = state_6; [L54] SORT_4 var_10_arg_1 = state_8; [L55] SORT_1 var_10 = var_10_arg_0 < var_10_arg_1; [L56] SORT_1 var_11_arg_0 = var_10; [L57] SORT_1 var_11 = ~var_11_arg_0; [L58] SORT_1 var_15_arg_0 = var_11; [L59] SORT_1 var_15 = ~var_15_arg_0; [L60] SORT_1 var_16_arg_0 = var_14; [L61] SORT_1 var_16_arg_1 = var_15; VAL [mask_SORT_1=1, mask_SORT_4=15, state_6=0, state_8=1, var_14=1, var_16_arg_0=1, var_16_arg_1=-255, var_19=1, var_22=15] [L62] EXPR var_16_arg_0 & var_16_arg_1 VAL [mask_SORT_1=1, mask_SORT_4=15, state_6=0, state_8=1, var_14=1, var_19=1, var_22=15] [L62] SORT_1 var_16 = var_16_arg_0 & var_16_arg_1; [L63] EXPR var_16 & mask_SORT_1 VAL [mask_SORT_1=1, mask_SORT_4=15, state_6=0, state_8=1, var_14=1, var_19=1, var_22=15] [L63] var_16 = var_16 & mask_SORT_1 [L64] SORT_1 bad_17_arg_0 = var_16; [L65] CALL __VERIFIER_assert(!(bad_17_arg_0)) [L21] COND TRUE !(cond) [L21] reach_error() - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 72 locations, 103 edges, 1 error locations. Started 1 CEGAR loops. OverallTime: 13.7s, OverallIterations: 23, TraceHistogramMax: 2, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 4.1s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 1935 SdHoareTripleChecker+Valid, 3.2s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 1935 mSDsluCounter, 8921 SdHoareTripleChecker+Invalid, 2.6s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 7231 mSDsCounter, 31 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 5626 IncrementalHoareTripleChecker+Invalid, 5657 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 31 mSolverCounterUnsat, 1690 mSDtfsCounter, 5626 mSolverCounterSat, 0.1s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 422 GetRequests, 241 SyntacticMatches, 1 SemanticMatches, 180 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 213 ImplicationChecksByTransitivity, 1.4s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=189occurred in iteration=11, InterpolantAutomatonStates: 171, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.1s AutomataMinimizationTime, 22 MinimizatonAttempts, 556 StatesRemovedByMinimization, 14 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 1.1s SatisfiabilityAnalysisTime, 7.0s InterpolantComputationTime, 1224 NumberOfCodeBlocks, 1224 NumberOfCodeBlocksAsserted, 26 NumberOfCheckSat, 1194 ConstructedInterpolants, 0 QuantifiedInterpolants, 6152 SizeOfPredicates, 8 NumberOfNonLiveVariables, 1004 ConjunctsInSsa, 124 ConjunctsInUnsatCore, 26 InterpolantComputations, 21 PerfectInterpolantSequences, 126/138 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, ConComCheckerStatistics: No data available RESULT: Ultimate could not prove your program: unable to determine feasibility of some traces [2025-03-08 08:34:28,520 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Using bit-precise analysis Retrying with bit-precise analysis ### Bit-precise run ### Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/hardware-verification-bv/btor2c-lazyMod.diagonal.c -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-64bit-Automizer_Bitvector.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 64bit --witnessprinter.graph.data.programhash 16f8726a4add15d0bf2494bd44888be53eb7bc01110882b6fc03ef148c6d9055 --- Real Ultimate output --- This is Ultimate 0.3.0-?-e2fb8be-m [2025-03-08 08:34:30,345 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-08 08:34:30,420 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-64bit-Automizer_Bitvector.epf [2025-03-08 08:34:30,427 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-08 08:34:30,428 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-08 08:34:30,454 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-08 08:34:30,455 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-08 08:34:30,455 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-08 08:34:30,455 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-08 08:34:30,456 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-08 08:34:30,456 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-08 08:34:30,457 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-08 08:34:30,457 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-08 08:34:30,457 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-08 08:34:30,457 INFO L153 SettingsManager]: * Use SBE=true [2025-03-08 08:34:30,457 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-08 08:34:30,457 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-08 08:34:30,457 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-08 08:34:30,457 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-08 08:34:30,458 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-08 08:34:30,458 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-08 08:34:30,458 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2025-03-08 08:34:30,458 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2025-03-08 08:34:30,458 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2025-03-08 08:34:30,458 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-08 08:34:30,458 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-08 08:34:30,458 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-08 08:34:30,459 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-08 08:34:30,459 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-08 08:34:30,459 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-08 08:34:30,459 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-08 08:34:30,459 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-08 08:34:30,459 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-08 08:34:30,460 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-08 08:34:30,460 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-08 08:34:30,460 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-08 08:34:30,460 INFO L153 SettingsManager]: * Trace refinement strategy=FOX [2025-03-08 08:34:30,460 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2025-03-08 08:34:30,460 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-08 08:34:30,460 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-08 08:34:30,460 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-08 08:34:30,460 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-08 08:34:30,460 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(reach_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 64bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 16f8726a4add15d0bf2494bd44888be53eb7bc01110882b6fc03ef148c6d9055 [2025-03-08 08:34:30,707 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-08 08:34:30,715 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-08 08:34:30,717 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-08 08:34:30,718 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-08 08:34:30,718 INFO L274 PluginConnector]: CDTParser initialized [2025-03-08 08:34:30,719 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardware-verification-bv/btor2c-lazyMod.diagonal.c [2025-03-08 08:34:31,813 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/af707c573/2a6e6a6595754140b928c3e4580d0acc/FLAGf22ec7711 [2025-03-08 08:34:31,997 INFO L384 CDTParser]: Found 1 translation units. [2025-03-08 08:34:31,999 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardware-verification-bv/btor2c-lazyMod.diagonal.c [2025-03-08 08:34:32,007 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/af707c573/2a6e6a6595754140b928c3e4580d0acc/FLAGf22ec7711 [2025-03-08 08:34:32,021 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/af707c573/2a6e6a6595754140b928c3e4580d0acc [2025-03-08 08:34:32,023 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-08 08:34:32,024 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-08 08:34:32,026 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-08 08:34:32,026 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-08 08:34:32,029 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-08 08:34:32,030 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.03 08:34:32" (1/1) ... [2025-03-08 08:34:32,031 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@41c6d113 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 08:34:32, skipping insertion in model container [2025-03-08 08:34:32,032 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.03 08:34:32" (1/1) ... [2025-03-08 08:34:32,044 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-08 08:34:32,150 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardware-verification-bv/btor2c-lazyMod.diagonal.c[1248,1261] [2025-03-08 08:34:32,204 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-08 08:34:32,213 INFO L200 MainTranslator]: Completed pre-run [2025-03-08 08:34:32,220 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardware-verification-bv/btor2c-lazyMod.diagonal.c[1248,1261] [2025-03-08 08:34:32,252 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-08 08:34:32,266 INFO L204 MainTranslator]: Completed translation [2025-03-08 08:34:32,267 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 08:34:32 WrapperNode [2025-03-08 08:34:32,267 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-08 08:34:32,268 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-08 08:34:32,269 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-08 08:34:32,269 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-08 08:34:32,274 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 08:34:32" (1/1) ... [2025-03-08 08:34:32,280 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 08:34:32" (1/1) ... [2025-03-08 08:34:32,303 INFO L138 Inliner]: procedures = 17, calls = 8, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 141 [2025-03-08 08:34:32,305 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-08 08:34:32,306 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-08 08:34:32,306 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-08 08:34:32,306 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-08 08:34:32,313 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 08:34:32" (1/1) ... [2025-03-08 08:34:32,313 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 08:34:32" (1/1) ... [2025-03-08 08:34:32,318 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 08:34:32" (1/1) ... [2025-03-08 08:34:32,338 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]. [2025-03-08 08:34:32,338 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 08:34:32" (1/1) ... [2025-03-08 08:34:32,338 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 08:34:32" (1/1) ... [2025-03-08 08:34:32,344 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 08:34:32" (1/1) ... [2025-03-08 08:34:32,348 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 08:34:32" (1/1) ... [2025-03-08 08:34:32,349 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 08:34:32" (1/1) ... [2025-03-08 08:34:32,350 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 08:34:32" (1/1) ... [2025-03-08 08:34:32,351 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-08 08:34:32,355 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-08 08:34:32,355 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-08 08:34:32,355 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-08 08:34:32,356 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 08:34:32" (1/1) ... [2025-03-08 08:34:32,364 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-08 08:34:32,376 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 08:34:32,387 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) [2025-03-08 08:34:32,390 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 [2025-03-08 08:34:32,410 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-08 08:34:32,410 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2025-03-08 08:34:32,411 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-08 08:34:32,411 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-08 08:34:32,491 INFO L256 CfgBuilder]: Building ICFG [2025-03-08 08:34:32,492 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-08 08:34:32,696 INFO L? ?]: Removed 22 outVars from TransFormulas that were not future-live. [2025-03-08 08:34:32,696 INFO L307 CfgBuilder]: Performing block encoding [2025-03-08 08:34:32,703 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-08 08:34:32,704 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-08 08:34:32,704 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.03 08:34:32 BoogieIcfgContainer [2025-03-08 08:34:32,705 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-08 08:34:32,707 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-08 08:34:32,707 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-08 08:34:32,711 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-08 08:34:32,711 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 08.03 08:34:32" (1/3) ... [2025-03-08 08:34:32,712 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@19e721f4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.03 08:34:32, skipping insertion in model container [2025-03-08 08:34:32,712 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 08:34:32" (2/3) ... [2025-03-08 08:34:32,713 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@19e721f4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.03 08:34:32, skipping insertion in model container [2025-03-08 08:34:32,713 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.03 08:34:32" (3/3) ... [2025-03-08 08:34:32,714 INFO L128 eAbstractionObserver]: Analyzing ICFG btor2c-lazyMod.diagonal.c [2025-03-08 08:34:32,742 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-08 08:34:32,744 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG btor2c-lazyMod.diagonal.c that has 1 procedures, 10 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-03-08 08:34:32,776 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-08 08:34:32,788 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;@1fcba422, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-08 08:34:32,788 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-03-08 08:34:32,791 INFO L276 IsEmpty]: Start isEmpty. Operand has 10 states, 8 states have (on average 1.375) internal successors, (11), 9 states have internal predecessors, (11), 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) [2025-03-08 08:34:32,795 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2025-03-08 08:34:32,795 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 08:34:32,796 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2025-03-08 08:34:32,796 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 08:34:32,799 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 08:34:32,799 INFO L85 PathProgramCache]: Analyzing trace with hash 38140359, now seen corresponding path program 1 times [2025-03-08 08:34:32,806 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-08 08:34:32,806 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [556332154] [2025-03-08 08:34:32,806 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 08:34:32,807 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 08:34:32,807 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 08:34:32,809 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-08 08:34:32,812 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2025-03-08 08:34:32,868 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 5 statements into 1 equivalence classes. [2025-03-08 08:34:32,876 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 5 of 5 statements. [2025-03-08 08:34:32,876 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 08:34:32,876 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 08:34:32,878 INFO L256 TraceCheckSpWp]: Trace formula consists of 39 conjuncts, 16 conjuncts are in the unsatisfiable core [2025-03-08 08:34:32,883 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 08:34:33,051 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 08:34:33,053 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-08 08:34:33,053 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-08 08:34:33,053 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [556332154] [2025-03-08 08:34:33,054 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [556332154] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 08:34:33,054 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 08:34:33,054 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-08 08:34:33,056 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2104530313] [2025-03-08 08:34:33,056 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 08:34:33,058 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-08 08:34:33,058 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-08 08:34:33,072 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-08 08:34:33,073 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-08 08:34:33,075 INFO L87 Difference]: Start difference. First operand has 10 states, 8 states have (on average 1.375) internal successors, (11), 9 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 4 states, 4 states have (on average 1.25) internal successors, (5), 4 states have internal predecessors, (5), 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) [2025-03-08 08:34:33,106 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 08:34:33,106 INFO L93 Difference]: Finished difference Result 18 states and 23 transitions. [2025-03-08 08:34:33,107 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-08 08:34:33,108 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 1.25) internal successors, (5), 4 states have internal predecessors, (5), 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 5 [2025-03-08 08:34:33,108 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 08:34:33,112 INFO L225 Difference]: With dead ends: 18 [2025-03-08 08:34:33,112 INFO L226 Difference]: Without dead ends: 10 [2025-03-08 08:34:33,115 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-03-08 08:34:33,116 INFO L435 NwaCegarLoop]: 4 mSDtfsCounter, 2 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 9 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 11 SdHoareTripleChecker+Invalid, 9 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 9 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-08 08:34:33,117 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 11 Invalid, 9 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 9 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-08 08:34:33,126 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10 states. [2025-03-08 08:34:33,133 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10 to 9. [2025-03-08 08:34:33,134 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9 states, 8 states have (on average 1.125) internal successors, (9), 8 states have internal predecessors, (9), 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) [2025-03-08 08:34:33,136 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 9 transitions. [2025-03-08 08:34:33,138 INFO L78 Accepts]: Start accepts. Automaton has 9 states and 9 transitions. Word has length 5 [2025-03-08 08:34:33,138 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 08:34:33,138 INFO L471 AbstractCegarLoop]: Abstraction has 9 states and 9 transitions. [2025-03-08 08:34:33,138 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 1.25) internal successors, (5), 4 states have internal predecessors, (5), 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) [2025-03-08 08:34:33,138 INFO L276 IsEmpty]: Start isEmpty. Operand 9 states and 9 transitions. [2025-03-08 08:34:33,138 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2025-03-08 08:34:33,138 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 08:34:33,139 INFO L218 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1] [2025-03-08 08:34:33,145 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2025-03-08 08:34:33,339 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 08:34:33,339 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 08:34:33,340 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 08:34:33,340 INFO L85 PathProgramCache]: Analyzing trace with hash -1926026653, now seen corresponding path program 1 times [2025-03-08 08:34:33,340 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-08 08:34:33,340 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [805514798] [2025-03-08 08:34:33,341 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 08:34:33,341 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 08:34:33,341 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 08:34:33,343 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-08 08:34:33,344 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2025-03-08 08:34:33,406 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 8 statements into 1 equivalence classes. [2025-03-08 08:34:33,417 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 8 of 8 statements. [2025-03-08 08:34:33,417 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 08:34:33,417 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 08:34:33,419 INFO L256 TraceCheckSpWp]: Trace formula consists of 55 conjuncts, 26 conjuncts are in the unsatisfiable core [2025-03-08 08:34:33,422 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 08:34:33,725 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 08:34:33,725 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-08 08:34:35,946 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 08:34:35,946 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-08 08:34:35,946 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [805514798] [2025-03-08 08:34:35,948 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [805514798] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-08 08:34:35,948 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2025-03-08 08:34:35,948 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 10 [2025-03-08 08:34:35,948 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [573825256] [2025-03-08 08:34:35,948 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2025-03-08 08:34:35,949 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-03-08 08:34:35,949 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-08 08:34:35,949 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-03-08 08:34:35,949 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=61, Unknown=0, NotChecked=0, Total=90 [2025-03-08 08:34:35,949 INFO L87 Difference]: Start difference. First operand 9 states and 9 transitions. Second operand has 10 states, 10 states have (on average 1.4) internal successors, (14), 10 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 08:34:36,337 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 08:34:36,337 INFO L93 Difference]: Finished difference Result 21 states and 23 transitions. [2025-03-08 08:34:36,338 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-03-08 08:34:36,338 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 1.4) internal successors, (14), 10 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 8 [2025-03-08 08:34:36,338 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 08:34:36,338 INFO L225 Difference]: With dead ends: 21 [2025-03-08 08:34:36,338 INFO L226 Difference]: Without dead ends: 19 [2025-03-08 08:34:36,338 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 28 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=74, Invalid=136, Unknown=0, NotChecked=0, Total=210 [2025-03-08 08:34:36,339 INFO L435 NwaCegarLoop]: 4 mSDtfsCounter, 10 mSDsluCounter, 15 mSDsCounter, 0 mSdLazyCounter, 37 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 10 SdHoareTripleChecker+Valid, 19 SdHoareTripleChecker+Invalid, 41 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 37 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-08 08:34:36,339 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [10 Valid, 19 Invalid, 41 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 37 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-08 08:34:36,339 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19 states. [2025-03-08 08:34:36,343 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19 to 18. [2025-03-08 08:34:36,344 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 18 states, 17 states have (on average 1.0588235294117647) internal successors, (18), 17 states have internal predecessors, (18), 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) [2025-03-08 08:34:36,344 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 18 transitions. [2025-03-08 08:34:36,345 INFO L78 Accepts]: Start accepts. Automaton has 18 states and 18 transitions. Word has length 8 [2025-03-08 08:34:36,345 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 08:34:36,345 INFO L471 AbstractCegarLoop]: Abstraction has 18 states and 18 transitions. [2025-03-08 08:34:36,345 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 1.4) internal successors, (14), 10 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 08:34:36,345 INFO L276 IsEmpty]: Start isEmpty. Operand 18 states and 18 transitions. [2025-03-08 08:34:36,345 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2025-03-08 08:34:36,345 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 08:34:36,345 INFO L218 NwaCegarLoop]: trace histogram [5, 4, 4, 1, 1, 1, 1] [2025-03-08 08:34:36,351 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2025-03-08 08:34:36,545 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 08:34:36,546 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 08:34:36,546 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 08:34:36,546 INFO L85 PathProgramCache]: Analyzing trace with hash -209850681, now seen corresponding path program 2 times [2025-03-08 08:34:36,547 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-08 08:34:36,547 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [2113903965] [2025-03-08 08:34:36,547 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-08 08:34:36,547 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 08:34:36,547 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 08:34:36,549 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-08 08:34:36,551 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2025-03-08 08:34:36,616 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 17 statements into 2 equivalence classes. [2025-03-08 08:34:36,642 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 17 of 17 statements. [2025-03-08 08:34:36,643 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-08 08:34:36,643 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 08:34:36,645 INFO L256 TraceCheckSpWp]: Trace formula consists of 103 conjuncts, 29 conjuncts are in the unsatisfiable core [2025-03-08 08:34:36,650 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 08:34:37,097 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 0 proven. 26 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 08:34:37,098 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-08 08:35:01,593 WARN L286 SmtUtils]: Spent 5.41s on a formula simplification. DAG size of input: 1437 DAG size of output: 1271 (called from [L 388] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate)