./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/eca-rers2012/Problem15_label57.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 798a7b37 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/eca-rers2012/Problem15_label57.c -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-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 32bit --witnessprinter.graph.data.programhash 44d07c49543a420b190637df21c7e31435249a3781140dab3c41eadeeaf7c396 --- Real Ultimate output --- This is Ultimate 0.3.0-?-798a7b3-m [2025-03-03 10:52:50,634 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-03 10:52:50,689 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2025-03-03 10:52:50,695 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-03 10:52:50,695 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-03 10:52:50,716 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-03 10:52:50,716 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-03 10:52:50,716 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-03 10:52:50,716 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-03 10:52:50,716 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-03 10:52:50,717 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-03 10:52:50,717 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-03 10:52:50,717 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-03 10:52:50,717 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-03 10:52:50,717 INFO L153 SettingsManager]: * Use SBE=true [2025-03-03 10:52:50,717 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-03 10:52:50,717 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-03 10:52:50,717 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-03 10:52:50,717 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-03 10:52:50,717 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-03 10:52:50,717 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-03 10:52:50,717 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-03 10:52:50,717 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-03 10:52:50,717 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-03 10:52:50,717 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-03 10:52:50,717 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-03 10:52:50,718 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-03 10:52:50,718 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-03 10:52:50,718 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-03 10:52:50,718 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-03 10:52:50,718 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-03 10:52:50,718 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-03 10:52:50,718 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-03 10:52:50,718 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-03 10:52:50,718 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-03 10:52:50,718 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-03 10:52:50,718 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-03 10:52:50,718 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-03 10:52:50,718 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-03 10:52:50,718 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-03 10:52:50,718 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-03 10:52:50,718 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-03 10:52:50,718 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-03 10:52:50,718 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 -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 44d07c49543a420b190637df21c7e31435249a3781140dab3c41eadeeaf7c396 [2025-03-03 10:52:50,934 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-03 10:52:50,944 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-03 10:52:50,946 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-03 10:52:50,947 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-03 10:52:50,947 INFO L274 PluginConnector]: CDTParser initialized [2025-03-03 10:52:50,949 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/eca-rers2012/Problem15_label57.c [2025-03-03 10:52:52,082 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/29e0bce2f/a5840c4b0add4ac19d2d57ac41d9096e/FLAGabc0c101e [2025-03-03 10:52:52,519 INFO L384 CDTParser]: Found 1 translation units. [2025-03-03 10:52:52,520 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/eca-rers2012/Problem15_label57.c [2025-03-03 10:52:52,538 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/29e0bce2f/a5840c4b0add4ac19d2d57ac41d9096e/FLAGabc0c101e [2025-03-03 10:52:52,673 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/29e0bce2f/a5840c4b0add4ac19d2d57ac41d9096e [2025-03-03 10:52:52,675 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-03 10:52:52,677 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-03 10:52:52,678 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-03 10:52:52,678 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-03 10:52:52,681 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-03 10:52:52,681 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 03.03 10:52:52" (1/1) ... [2025-03-03 10:52:52,682 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3870975 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 10:52:52, skipping insertion in model container [2025-03-03 10:52:52,682 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 03.03 10:52:52" (1/1) ... [2025-03-03 10:52:52,724 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-03 10:52:52,878 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/eca-rers2012/Problem15_label57.c[5113,5126] [2025-03-03 10:52:53,186 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-03 10:52:53,194 INFO L200 MainTranslator]: Completed pre-run [2025-03-03 10:52:53,206 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/eca-rers2012/Problem15_label57.c[5113,5126] [2025-03-03 10:52:53,337 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-03 10:52:53,348 INFO L204 MainTranslator]: Completed translation [2025-03-03 10:52:53,349 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 10:52:53 WrapperNode [2025-03-03 10:52:53,349 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-03 10:52:53,350 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-03 10:52:53,350 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-03 10:52:53,350 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-03 10:52:53,354 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 10:52:53" (1/1) ... [2025-03-03 10:52:53,374 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 10:52:53" (1/1) ... [2025-03-03 10:52:53,511 INFO L138 Inliner]: procedures = 15, calls = 9, calls flagged for inlining = 4, calls inlined = 4, statements flattened = 1757 [2025-03-03 10:52:53,511 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-03 10:52:53,512 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-03 10:52:53,512 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-03 10:52:53,512 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-03 10:52:53,518 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 10:52:53" (1/1) ... [2025-03-03 10:52:53,518 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 10:52:53" (1/1) ... [2025-03-03 10:52:53,541 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 10:52:53" (1/1) ... [2025-03-03 10:52:53,591 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-03 10:52:53,591 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 10:52:53" (1/1) ... [2025-03-03 10:52:53,591 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 10:52:53" (1/1) ... [2025-03-03 10:52:53,648 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 10:52:53" (1/1) ... [2025-03-03 10:52:53,657 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 10:52:53" (1/1) ... [2025-03-03 10:52:53,666 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 10:52:53" (1/1) ... [2025-03-03 10:52:53,676 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 10:52:53" (1/1) ... [2025-03-03 10:52:53,692 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-03 10:52:53,694 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-03 10:52:53,694 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-03 10:52:53,694 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-03 10:52:53,695 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 10:52:53" (1/1) ... [2025-03-03 10:52:53,699 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-03 10:52:53,709 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 10:52:53,722 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-03 10:52:53,725 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-03 10:52:53,745 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-03 10:52:53,745 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-03-03 10:52:53,745 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-03 10:52:53,745 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-03 10:52:53,794 INFO L256 CfgBuilder]: Building ICFG [2025-03-03 10:52:53,796 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-03 10:52:55,673 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L1665: havoc calculate_output_#t~ret7#1; [2025-03-03 10:52:55,755 INFO L? ?]: Removed 246 outVars from TransFormulas that were not future-live. [2025-03-03 10:52:55,756 INFO L307 CfgBuilder]: Performing block encoding [2025-03-03 10:52:55,779 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-03 10:52:55,779 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-03 10:52:55,779 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 03.03 10:52:55 BoogieIcfgContainer [2025-03-03 10:52:55,780 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-03 10:52:55,782 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-03 10:52:55,782 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-03 10:52:55,786 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-03 10:52:55,786 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 03.03 10:52:52" (1/3) ... [2025-03-03 10:52:55,786 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@64c16053 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 03.03 10:52:55, skipping insertion in model container [2025-03-03 10:52:55,787 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 10:52:53" (2/3) ... [2025-03-03 10:52:55,787 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@64c16053 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 03.03 10:52:55, skipping insertion in model container [2025-03-03 10:52:55,787 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 03.03 10:52:55" (3/3) ... [2025-03-03 10:52:55,789 INFO L128 eAbstractionObserver]: Analyzing ICFG Problem15_label57.c [2025-03-03 10:52:55,802 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-03 10:52:55,803 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG Problem15_label57.c that has 1 procedures, 424 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-03-03 10:52:55,860 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-03 10:52:55,870 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;@2c777c4a, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-03 10:52:55,870 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-03-03 10:52:55,876 INFO L276 IsEmpty]: Start isEmpty. Operand has 424 states, 422 states have (on average 1.7748815165876777) internal successors, (749), 423 states have internal predecessors, (749), 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-03 10:52:55,880 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2025-03-03 10:52:55,880 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 10:52:55,881 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 10:52:55,881 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 10:52:55,886 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 10:52:55,887 INFO L85 PathProgramCache]: Analyzing trace with hash -2027115645, now seen corresponding path program 1 times [2025-03-03 10:52:55,892 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 10:52:55,894 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1081138689] [2025-03-03 10:52:55,894 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 10:52:55,895 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 10:52:55,951 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 41 statements into 1 equivalence classes. [2025-03-03 10:52:55,986 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 41 of 41 statements. [2025-03-03 10:52:55,986 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 10:52:55,986 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 10:52:56,139 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-03 10:52:56,140 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 10:52:56,140 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1081138689] [2025-03-03 10:52:56,141 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1081138689] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 10:52:56,141 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 10:52:56,141 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-03 10:52:56,142 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1150998234] [2025-03-03 10:52:56,142 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 10:52:56,144 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-03 10:52:56,144 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 10:52:56,159 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-03 10:52:56,159 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 10:52:56,163 INFO L87 Difference]: Start difference. First operand has 424 states, 422 states have (on average 1.7748815165876777) internal successors, (749), 423 states have internal predecessors, (749), 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 3 states, 3 states have (on average 13.666666666666666) internal successors, (41), 2 states have internal predecessors, (41), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 10:52:57,547 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 10:52:57,547 INFO L93 Difference]: Finished difference Result 1154 states and 2103 transitions. [2025-03-03 10:52:57,548 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-03 10:52:57,549 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 13.666666666666666) internal successors, (41), 2 states have internal predecessors, (41), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 41 [2025-03-03 10:52:57,549 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 10:52:57,561 INFO L225 Difference]: With dead ends: 1154 [2025-03-03 10:52:57,562 INFO L226 Difference]: Without dead ends: 665 [2025-03-03 10:52:57,564 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 10:52:57,566 INFO L435 NwaCegarLoop]: 336 mSDtfsCounter, 280 mSDsluCounter, 49 mSDsCounter, 0 mSdLazyCounter, 976 mSolverCounterSat, 254 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 280 SdHoareTripleChecker+Valid, 385 SdHoareTripleChecker+Invalid, 1230 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 254 IncrementalHoareTripleChecker+Valid, 976 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.3s IncrementalHoareTripleChecker+Time [2025-03-03 10:52:57,566 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [280 Valid, 385 Invalid, 1230 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [254 Valid, 976 Invalid, 0 Unknown, 0 Unchecked, 1.3s Time] [2025-03-03 10:52:57,580 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 665 states. [2025-03-03 10:52:57,619 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 665 to 663. [2025-03-03 10:52:57,623 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 663 states, 662 states have (on average 1.4818731117824773) internal successors, (981), 662 states have internal predecessors, (981), 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-03 10:52:57,628 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 663 states to 663 states and 981 transitions. [2025-03-03 10:52:57,630 INFO L78 Accepts]: Start accepts. Automaton has 663 states and 981 transitions. Word has length 41 [2025-03-03 10:52:57,630 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 10:52:57,630 INFO L471 AbstractCegarLoop]: Abstraction has 663 states and 981 transitions. [2025-03-03 10:52:57,630 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 13.666666666666666) internal successors, (41), 2 states have internal predecessors, (41), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 10:52:57,630 INFO L276 IsEmpty]: Start isEmpty. Operand 663 states and 981 transitions. [2025-03-03 10:52:57,632 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 107 [2025-03-03 10:52:57,632 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 10:52:57,632 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 10:52:57,633 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-03-03 10:52:57,633 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 10:52:57,633 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 10:52:57,633 INFO L85 PathProgramCache]: Analyzing trace with hash 739835200, now seen corresponding path program 1 times [2025-03-03 10:52:57,633 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 10:52:57,633 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [924939762] [2025-03-03 10:52:57,634 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 10:52:57,634 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 10:52:57,654 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 106 statements into 1 equivalence classes. [2025-03-03 10:52:57,681 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 106 of 106 statements. [2025-03-03 10:52:57,681 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 10:52:57,681 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 10:52:57,983 INFO L134 CoverageAnalysis]: Checked inductivity of 38 backedges. 38 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 10:52:57,984 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 10:52:57,985 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [924939762] [2025-03-03 10:52:57,985 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [924939762] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 10:52:57,985 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 10:52:57,985 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-03 10:52:57,985 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [441083848] [2025-03-03 10:52:57,985 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 10:52:57,986 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-03 10:52:57,986 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 10:52:57,987 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-03 10:52:57,987 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 10:52:57,989 INFO L87 Difference]: Start difference. First operand 663 states and 981 transitions. Second operand has 3 states, 3 states have (on average 35.333333333333336) internal successors, (106), 2 states have internal predecessors, (106), 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-03 10:52:59,656 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 10:52:59,658 INFO L93 Difference]: Finished difference Result 1624 states and 2315 transitions. [2025-03-03 10:52:59,658 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-03 10:52:59,658 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 35.333333333333336) internal successors, (106), 2 states have internal predecessors, (106), 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 106 [2025-03-03 10:52:59,659 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 10:52:59,662 INFO L225 Difference]: With dead ends: 1624 [2025-03-03 10:52:59,663 INFO L226 Difference]: Without dead ends: 963 [2025-03-03 10:52:59,664 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 10:52:59,665 INFO L435 NwaCegarLoop]: 299 mSDtfsCounter, 237 mSDsluCounter, 38 mSDsCounter, 0 mSdLazyCounter, 910 mSolverCounterSat, 24 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 237 SdHoareTripleChecker+Valid, 337 SdHoareTripleChecker+Invalid, 934 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 24 IncrementalHoareTripleChecker+Valid, 910 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.6s IncrementalHoareTripleChecker+Time [2025-03-03 10:52:59,666 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [237 Valid, 337 Invalid, 934 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [24 Valid, 910 Invalid, 0 Unknown, 0 Unchecked, 1.6s Time] [2025-03-03 10:52:59,669 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 963 states. [2025-03-03 10:52:59,693 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 963 to 963. [2025-03-03 10:52:59,695 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 963 states, 962 states have (on average 1.362785862785863) internal successors, (1311), 962 states have internal predecessors, (1311), 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-03 10:52:59,698 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 963 states to 963 states and 1311 transitions. [2025-03-03 10:52:59,698 INFO L78 Accepts]: Start accepts. Automaton has 963 states and 1311 transitions. Word has length 106 [2025-03-03 10:52:59,698 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 10:52:59,698 INFO L471 AbstractCegarLoop]: Abstraction has 963 states and 1311 transitions. [2025-03-03 10:52:59,699 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 35.333333333333336) internal successors, (106), 2 states have internal predecessors, (106), 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-03 10:52:59,699 INFO L276 IsEmpty]: Start isEmpty. Operand 963 states and 1311 transitions. [2025-03-03 10:52:59,699 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 112 [2025-03-03 10:52:59,701 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 10:52:59,701 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 10:52:59,701 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-03-03 10:52:59,702 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 10:52:59,702 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 10:52:59,702 INFO L85 PathProgramCache]: Analyzing trace with hash 1707900073, now seen corresponding path program 1 times [2025-03-03 10:52:59,705 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 10:52:59,705 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1707469596] [2025-03-03 10:52:59,705 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 10:52:59,705 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 10:52:59,720 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 111 statements into 1 equivalence classes. [2025-03-03 10:52:59,737 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 111 of 111 statements. [2025-03-03 10:52:59,737 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 10:52:59,737 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 10:52:59,986 INFO L134 CoverageAnalysis]: Checked inductivity of 38 backedges. 38 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 10:52:59,986 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 10:52:59,986 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1707469596] [2025-03-03 10:52:59,987 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1707469596] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 10:52:59,987 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 10:52:59,987 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-03 10:52:59,987 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [493606655] [2025-03-03 10:52:59,987 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 10:52:59,987 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-03 10:52:59,987 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 10:52:59,988 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-03 10:52:59,988 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-03-03 10:52:59,988 INFO L87 Difference]: Start difference. First operand 963 states and 1311 transitions. Second operand has 5 states, 5 states have (on average 22.2) internal successors, (111), 4 states have internal predecessors, (111), 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-03 10:53:01,420 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 10:53:01,420 INFO L93 Difference]: Finished difference Result 2240 states and 3197 transitions. [2025-03-03 10:53:01,420 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-03 10:53:01,421 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 22.2) internal successors, (111), 4 states have internal predecessors, (111), 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 111 [2025-03-03 10:53:01,421 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 10:53:01,425 INFO L225 Difference]: With dead ends: 2240 [2025-03-03 10:53:01,425 INFO L226 Difference]: Without dead ends: 1578 [2025-03-03 10:53:01,426 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-03-03 10:53:01,427 INFO L435 NwaCegarLoop]: 273 mSDtfsCounter, 934 mSDsluCounter, 53 mSDsCounter, 0 mSdLazyCounter, 1204 mSolverCounterSat, 652 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 934 SdHoareTripleChecker+Valid, 326 SdHoareTripleChecker+Invalid, 1856 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 652 IncrementalHoareTripleChecker+Valid, 1204 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.4s IncrementalHoareTripleChecker+Time [2025-03-03 10:53:01,427 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [934 Valid, 326 Invalid, 1856 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [652 Valid, 1204 Invalid, 0 Unknown, 0 Unchecked, 1.4s Time] [2025-03-03 10:53:01,428 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1578 states. [2025-03-03 10:53:01,442 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1578 to 1266. [2025-03-03 10:53:01,444 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1266 states, 1265 states have (on average 1.3043478260869565) internal successors, (1650), 1265 states have internal predecessors, (1650), 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-03 10:53:01,447 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1266 states to 1266 states and 1650 transitions. [2025-03-03 10:53:01,447 INFO L78 Accepts]: Start accepts. Automaton has 1266 states and 1650 transitions. Word has length 111 [2025-03-03 10:53:01,447 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 10:53:01,447 INFO L471 AbstractCegarLoop]: Abstraction has 1266 states and 1650 transitions. [2025-03-03 10:53:01,448 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 22.2) internal successors, (111), 4 states have internal predecessors, (111), 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-03 10:53:01,448 INFO L276 IsEmpty]: Start isEmpty. Operand 1266 states and 1650 transitions. [2025-03-03 10:53:01,450 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 208 [2025-03-03 10:53:01,450 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 10:53:01,450 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 10:53:01,450 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-03-03 10:53:01,450 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 10:53:01,450 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 10:53:01,451 INFO L85 PathProgramCache]: Analyzing trace with hash -1218777258, now seen corresponding path program 1 times [2025-03-03 10:53:01,451 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 10:53:01,451 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1668545427] [2025-03-03 10:53:01,451 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 10:53:01,451 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 10:53:01,469 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 207 statements into 1 equivalence classes. [2025-03-03 10:53:01,486 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 207 of 207 statements. [2025-03-03 10:53:01,486 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 10:53:01,486 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 10:53:01,627 INFO L134 CoverageAnalysis]: Checked inductivity of 151 backedges. 151 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 10:53:01,629 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 10:53:01,629 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1668545427] [2025-03-03 10:53:01,629 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1668545427] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 10:53:01,629 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 10:53:01,629 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-03 10:53:01,629 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1977686888] [2025-03-03 10:53:01,629 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 10:53:01,630 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-03 10:53:01,630 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 10:53:01,630 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-03 10:53:01,630 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-03-03 10:53:01,630 INFO L87 Difference]: Start difference. First operand 1266 states and 1650 transitions. Second operand has 4 states, 4 states have (on average 51.75) internal successors, (207), 3 states have internal predecessors, (207), 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-03 10:53:03,785 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 10:53:03,786 INFO L93 Difference]: Finished difference Result 4668 states and 6169 transitions. [2025-03-03 10:53:03,786 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-03 10:53:03,786 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 51.75) internal successors, (207), 3 states have internal predecessors, (207), 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 207 [2025-03-03 10:53:03,787 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 10:53:03,795 INFO L225 Difference]: With dead ends: 4668 [2025-03-03 10:53:03,795 INFO L226 Difference]: Without dead ends: 3404 [2025-03-03 10:53:03,796 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-03-03 10:53:03,796 INFO L435 NwaCegarLoop]: 290 mSDtfsCounter, 484 mSDsluCounter, 85 mSDsCounter, 0 mSdLazyCounter, 2277 mSolverCounterSat, 269 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 484 SdHoareTripleChecker+Valid, 375 SdHoareTripleChecker+Invalid, 2546 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 269 IncrementalHoareTripleChecker+Valid, 2277 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.1s IncrementalHoareTripleChecker+Time [2025-03-03 10:53:03,797 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [484 Valid, 375 Invalid, 2546 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [269 Valid, 2277 Invalid, 0 Unknown, 0 Unchecked, 2.1s Time] [2025-03-03 10:53:03,799 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3404 states. [2025-03-03 10:53:03,827 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3404 to 3381. [2025-03-03 10:53:03,831 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3381 states, 3380 states have (on average 1.2363905325443787) internal successors, (4179), 3380 states have internal predecessors, (4179), 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-03 10:53:03,837 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3381 states to 3381 states and 4179 transitions. [2025-03-03 10:53:03,837 INFO L78 Accepts]: Start accepts. Automaton has 3381 states and 4179 transitions. Word has length 207 [2025-03-03 10:53:03,837 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 10:53:03,837 INFO L471 AbstractCegarLoop]: Abstraction has 3381 states and 4179 transitions. [2025-03-03 10:53:03,838 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 51.75) internal successors, (207), 3 states have internal predecessors, (207), 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-03 10:53:03,838 INFO L276 IsEmpty]: Start isEmpty. Operand 3381 states and 4179 transitions. [2025-03-03 10:53:03,839 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 212 [2025-03-03 10:53:03,839 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 10:53:03,840 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 10:53:03,840 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-03-03 10:53:03,840 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 10:53:03,840 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 10:53:03,840 INFO L85 PathProgramCache]: Analyzing trace with hash 1131027104, now seen corresponding path program 1 times [2025-03-03 10:53:03,840 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 10:53:03,840 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1696748959] [2025-03-03 10:53:03,840 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 10:53:03,841 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 10:53:03,855 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 211 statements into 1 equivalence classes. [2025-03-03 10:53:03,866 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 211 of 211 statements. [2025-03-03 10:53:03,867 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 10:53:03,867 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 10:53:03,968 INFO L134 CoverageAnalysis]: Checked inductivity of 155 backedges. 77 proven. 0 refuted. 0 times theorem prover too weak. 78 trivial. 0 not checked. [2025-03-03 10:53:03,969 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 10:53:03,969 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1696748959] [2025-03-03 10:53:03,969 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1696748959] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 10:53:03,969 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 10:53:03,969 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-03 10:53:03,969 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [536067450] [2025-03-03 10:53:03,969 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 10:53:03,969 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-03 10:53:03,970 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 10:53:03,970 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-03 10:53:03,970 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 10:53:03,970 INFO L87 Difference]: Start difference. First operand 3381 states and 4179 transitions. Second operand has 3 states, 3 states have (on average 44.666666666666664) internal successors, (134), 2 states have internal predecessors, (134), 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-03 10:53:04,950 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 10:53:04,950 INFO L93 Difference]: Finished difference Result 8563 states and 10751 transitions. [2025-03-03 10:53:04,951 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-03 10:53:04,951 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 44.666666666666664) internal successors, (134), 2 states have internal predecessors, (134), 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 211 [2025-03-03 10:53:04,951 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 10:53:04,966 INFO L225 Difference]: With dead ends: 8563 [2025-03-03 10:53:04,966 INFO L226 Difference]: Without dead ends: 5483 [2025-03-03 10:53:04,970 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 10:53:04,971 INFO L435 NwaCegarLoop]: 273 mSDtfsCounter, 257 mSDsluCounter, 67 mSDsCounter, 0 mSdLazyCounter, 791 mSolverCounterSat, 298 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 257 SdHoareTripleChecker+Valid, 340 SdHoareTripleChecker+Invalid, 1089 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 298 IncrementalHoareTripleChecker+Valid, 791 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2025-03-03 10:53:04,971 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [257 Valid, 340 Invalid, 1089 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [298 Valid, 791 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2025-03-03 10:53:04,974 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5483 states. [2025-03-03 10:53:05,042 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5483 to 5478. [2025-03-03 10:53:05,048 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5478 states, 5477 states have (on average 1.1683403322987036) internal successors, (6399), 5477 states have internal predecessors, (6399), 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-03 10:53:05,059 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5478 states to 5478 states and 6399 transitions. [2025-03-03 10:53:05,060 INFO L78 Accepts]: Start accepts. Automaton has 5478 states and 6399 transitions. Word has length 211 [2025-03-03 10:53:05,060 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 10:53:05,060 INFO L471 AbstractCegarLoop]: Abstraction has 5478 states and 6399 transitions. [2025-03-03 10:53:05,060 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 44.666666666666664) internal successors, (134), 2 states have internal predecessors, (134), 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-03 10:53:05,061 INFO L276 IsEmpty]: Start isEmpty. Operand 5478 states and 6399 transitions. [2025-03-03 10:53:05,064 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 314 [2025-03-03 10:53:05,064 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 10:53:05,065 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-03 10:53:05,065 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-03-03 10:53:05,065 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 10:53:05,065 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 10:53:05,065 INFO L85 PathProgramCache]: Analyzing trace with hash 1689191778, now seen corresponding path program 1 times [2025-03-03 10:53:05,065 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 10:53:05,066 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [816379724] [2025-03-03 10:53:05,066 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 10:53:05,066 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 10:53:05,104 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 313 statements into 1 equivalence classes. [2025-03-03 10:53:05,126 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 313 of 313 statements. [2025-03-03 10:53:05,128 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 10:53:05,129 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 10:53:05,520 INFO L134 CoverageAnalysis]: Checked inductivity of 152 backedges. 113 proven. 0 refuted. 0 times theorem prover too weak. 39 trivial. 0 not checked. [2025-03-03 10:53:05,522 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 10:53:05,522 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [816379724] [2025-03-03 10:53:05,522 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [816379724] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 10:53:05,522 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 10:53:05,522 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-03 10:53:05,522 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [501719102] [2025-03-03 10:53:05,522 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 10:53:05,522 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-03 10:53:05,523 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 10:53:05,523 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-03 10:53:05,525 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 10:53:05,525 INFO L87 Difference]: Start difference. First operand 5478 states and 6399 transitions. Second operand has 3 states, 3 states have (on average 91.66666666666667) internal successors, (275), 2 states have internal predecessors, (275), 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-03 10:53:06,388 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 10:53:06,388 INFO L93 Difference]: Finished difference Result 10655 states and 12485 transitions. [2025-03-03 10:53:06,388 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-03 10:53:06,389 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 91.66666666666667) internal successors, (275), 2 states have internal predecessors, (275), 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 313 [2025-03-03 10:53:06,389 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 10:53:06,401 INFO L225 Difference]: With dead ends: 10655 [2025-03-03 10:53:06,401 INFO L226 Difference]: Without dead ends: 5478 [2025-03-03 10:53:06,406 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 10:53:06,407 INFO L435 NwaCegarLoop]: 324 mSDtfsCounter, 105 mSDsluCounter, 35 mSDsCounter, 0 mSdLazyCounter, 888 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 105 SdHoareTripleChecker+Valid, 359 SdHoareTripleChecker+Invalid, 893 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 888 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2025-03-03 10:53:06,407 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [105 Valid, 359 Invalid, 893 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 888 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2025-03-03 10:53:06,411 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5478 states. [2025-03-03 10:53:06,461 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5478 to 5478. [2025-03-03 10:53:06,467 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5478 states, 5477 states have (on average 1.1672448420668249) internal successors, (6393), 5477 states have internal predecessors, (6393), 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-03 10:53:06,477 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5478 states to 5478 states and 6393 transitions. [2025-03-03 10:53:06,477 INFO L78 Accepts]: Start accepts. Automaton has 5478 states and 6393 transitions. Word has length 313 [2025-03-03 10:53:06,478 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 10:53:06,478 INFO L471 AbstractCegarLoop]: Abstraction has 5478 states and 6393 transitions. [2025-03-03 10:53:06,478 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 91.66666666666667) internal successors, (275), 2 states have internal predecessors, (275), 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-03 10:53:06,478 INFO L276 IsEmpty]: Start isEmpty. Operand 5478 states and 6393 transitions. [2025-03-03 10:53:06,481 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 329 [2025-03-03 10:53:06,481 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 10:53:06,481 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-03 10:53:06,481 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-03-03 10:53:06,482 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 10:53:06,482 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 10:53:06,482 INFO L85 PathProgramCache]: Analyzing trace with hash 1673613043, now seen corresponding path program 1 times [2025-03-03 10:53:06,482 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 10:53:06,482 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1448892648] [2025-03-03 10:53:06,482 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 10:53:06,482 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 10:53:06,509 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 328 statements into 1 equivalence classes. [2025-03-03 10:53:06,525 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 328 of 328 statements. [2025-03-03 10:53:06,525 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 10:53:06,525 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 10:53:06,637 INFO L134 CoverageAnalysis]: Checked inductivity of 167 backedges. 77 proven. 0 refuted. 0 times theorem prover too weak. 90 trivial. 0 not checked. [2025-03-03 10:53:06,637 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 10:53:06,637 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1448892648] [2025-03-03 10:53:06,637 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1448892648] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 10:53:06,637 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 10:53:06,637 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-03 10:53:06,637 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1563720750] [2025-03-03 10:53:06,637 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 10:53:06,637 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-03 10:53:06,637 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 10:53:06,638 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-03 10:53:06,638 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 10:53:06,638 INFO L87 Difference]: Start difference. First operand 5478 states and 6393 transitions. Second operand has 3 states, 3 states have (on average 79.66666666666667) internal successors, (239), 3 states have internal predecessors, (239), 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-03 10:53:07,759 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 10:53:07,759 INFO L93 Difference]: Finished difference Result 11851 states and 14145 transitions. [2025-03-03 10:53:07,760 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-03 10:53:07,760 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 79.66666666666667) internal successors, (239), 3 states have internal predecessors, (239), 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 328 [2025-03-03 10:53:07,760 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 10:53:07,774 INFO L225 Difference]: With dead ends: 11851 [2025-03-03 10:53:07,774 INFO L226 Difference]: Without dead ends: 6674 [2025-03-03 10:53:07,778 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 10:53:07,778 INFO L435 NwaCegarLoop]: 279 mSDtfsCounter, 274 mSDsluCounter, 45 mSDsCounter, 0 mSdLazyCounter, 908 mSolverCounterSat, 206 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 274 SdHoareTripleChecker+Valid, 324 SdHoareTripleChecker+Invalid, 1114 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 206 IncrementalHoareTripleChecker+Valid, 908 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2025-03-03 10:53:07,779 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [274 Valid, 324 Invalid, 1114 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [206 Valid, 908 Invalid, 0 Unknown, 0 Unchecked, 1.1s Time] [2025-03-03 10:53:07,783 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6674 states. [2025-03-03 10:53:07,840 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6674 to 4577. [2025-03-03 10:53:07,844 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4577 states, 4576 states have (on average 1.1840034965034965) internal successors, (5418), 4576 states have internal predecessors, (5418), 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-03 10:53:07,852 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4577 states to 4577 states and 5418 transitions. [2025-03-03 10:53:07,853 INFO L78 Accepts]: Start accepts. Automaton has 4577 states and 5418 transitions. Word has length 328 [2025-03-03 10:53:07,854 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 10:53:07,854 INFO L471 AbstractCegarLoop]: Abstraction has 4577 states and 5418 transitions. [2025-03-03 10:53:07,854 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 79.66666666666667) internal successors, (239), 3 states have internal predecessors, (239), 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-03 10:53:07,854 INFO L276 IsEmpty]: Start isEmpty. Operand 4577 states and 5418 transitions. [2025-03-03 10:53:07,857 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 388 [2025-03-03 10:53:07,857 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 10:53:07,858 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-03 10:53:07,858 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-03-03 10:53:07,858 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 10:53:07,858 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 10:53:07,859 INFO L85 PathProgramCache]: Analyzing trace with hash 164862286, now seen corresponding path program 1 times [2025-03-03 10:53:07,859 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 10:53:07,859 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1902220844] [2025-03-03 10:53:07,859 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 10:53:07,859 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 10:53:07,885 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 387 statements into 1 equivalence classes. [2025-03-03 10:53:07,900 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 387 of 387 statements. [2025-03-03 10:53:07,900 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 10:53:07,900 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 10:53:08,094 INFO L134 CoverageAnalysis]: Checked inductivity of 152 backedges. 77 proven. 0 refuted. 0 times theorem prover too weak. 75 trivial. 0 not checked. [2025-03-03 10:53:08,095 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 10:53:08,095 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1902220844] [2025-03-03 10:53:08,095 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1902220844] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 10:53:08,095 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 10:53:08,095 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-03 10:53:08,095 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2134410617] [2025-03-03 10:53:08,095 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 10:53:08,095 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-03 10:53:08,095 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 10:53:08,096 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-03 10:53:08,096 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 10:53:08,096 INFO L87 Difference]: Start difference. First operand 4577 states and 5418 transitions. Second operand has 3 states, 3 states have (on average 104.33333333333333) internal successors, (313), 3 states have internal predecessors, (313), 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-03 10:53:09,420 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 10:53:09,421 INFO L93 Difference]: Finished difference Result 10955 states and 13233 transitions. [2025-03-03 10:53:09,421 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-03 10:53:09,422 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 104.33333333333333) internal successors, (313), 3 states have internal predecessors, (313), 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 387 [2025-03-03 10:53:09,422 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 10:53:09,438 INFO L225 Difference]: With dead ends: 10955 [2025-03-03 10:53:09,439 INFO L226 Difference]: Without dead ends: 6679 [2025-03-03 10:53:09,443 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 10:53:09,443 INFO L435 NwaCegarLoop]: 599 mSDtfsCounter, 287 mSDsluCounter, 37 mSDsCounter, 0 mSdLazyCounter, 896 mSolverCounterSat, 227 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 287 SdHoareTripleChecker+Valid, 636 SdHoareTripleChecker+Invalid, 1123 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 227 IncrementalHoareTripleChecker+Valid, 896 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.3s IncrementalHoareTripleChecker+Time [2025-03-03 10:53:09,444 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [287 Valid, 636 Invalid, 1123 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [227 Valid, 896 Invalid, 0 Unknown, 0 Unchecked, 1.3s Time] [2025-03-03 10:53:09,447 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6679 states. [2025-03-03 10:53:09,488 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6679 to 6081. [2025-03-03 10:53:09,497 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6081 states, 6080 states have (on average 1.1572368421052632) internal successors, (7036), 6080 states have internal predecessors, (7036), 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-03 10:53:09,504 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6081 states to 6081 states and 7036 transitions. [2025-03-03 10:53:09,505 INFO L78 Accepts]: Start accepts. Automaton has 6081 states and 7036 transitions. Word has length 387 [2025-03-03 10:53:09,505 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 10:53:09,505 INFO L471 AbstractCegarLoop]: Abstraction has 6081 states and 7036 transitions. [2025-03-03 10:53:09,505 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 104.33333333333333) internal successors, (313), 3 states have internal predecessors, (313), 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-03 10:53:09,506 INFO L276 IsEmpty]: Start isEmpty. Operand 6081 states and 7036 transitions. [2025-03-03 10:53:09,509 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 394 [2025-03-03 10:53:09,509 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 10:53:09,509 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-03 10:53:09,509 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-03-03 10:53:09,509 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 10:53:09,510 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 10:53:09,510 INFO L85 PathProgramCache]: Analyzing trace with hash 732145160, now seen corresponding path program 1 times [2025-03-03 10:53:09,510 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 10:53:09,510 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [672944245] [2025-03-03 10:53:09,510 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 10:53:09,510 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 10:53:09,537 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 393 statements into 1 equivalence classes. [2025-03-03 10:53:09,555 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 393 of 393 statements. [2025-03-03 10:53:09,556 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 10:53:09,556 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 10:53:09,722 INFO L134 CoverageAnalysis]: Checked inductivity of 156 backedges. 156 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 10:53:09,722 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 10:53:09,722 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [672944245] [2025-03-03 10:53:09,722 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [672944245] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 10:53:09,722 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 10:53:09,722 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-03 10:53:09,722 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2136840190] [2025-03-03 10:53:09,722 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 10:53:09,723 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-03 10:53:09,723 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 10:53:09,723 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-03 10:53:09,723 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 10:53:09,723 INFO L87 Difference]: Start difference. First operand 6081 states and 7036 transitions. Second operand has 3 states, 3 states have (on average 131.0) internal successors, (393), 3 states have internal predecessors, (393), 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-03 10:53:10,693 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 10:53:10,694 INFO L93 Difference]: Finished difference Result 13965 states and 16476 transitions. [2025-03-03 10:53:10,694 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-03 10:53:10,694 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 131.0) internal successors, (393), 3 states have internal predecessors, (393), 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 393 [2025-03-03 10:53:10,695 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 10:53:10,707 INFO L225 Difference]: With dead ends: 13965 [2025-03-03 10:53:10,707 INFO L226 Difference]: Without dead ends: 8185 [2025-03-03 10:53:10,713 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 10:53:10,714 INFO L435 NwaCegarLoop]: 565 mSDtfsCounter, 248 mSDsluCounter, 39 mSDsCounter, 0 mSdLazyCounter, 904 mSolverCounterSat, 223 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 248 SdHoareTripleChecker+Valid, 604 SdHoareTripleChecker+Invalid, 1127 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 223 IncrementalHoareTripleChecker+Valid, 904 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2025-03-03 10:53:10,714 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [248 Valid, 604 Invalid, 1127 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [223 Valid, 904 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2025-03-03 10:53:10,718 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8185 states. [2025-03-03 10:53:10,782 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8185 to 7584. [2025-03-03 10:53:10,791 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7584 states, 7583 states have (on average 1.1422919688777529) internal successors, (8662), 7583 states have internal predecessors, (8662), 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-03 10:53:10,799 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7584 states to 7584 states and 8662 transitions. [2025-03-03 10:53:10,799 INFO L78 Accepts]: Start accepts. Automaton has 7584 states and 8662 transitions. Word has length 393 [2025-03-03 10:53:10,800 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 10:53:10,800 INFO L471 AbstractCegarLoop]: Abstraction has 7584 states and 8662 transitions. [2025-03-03 10:53:10,800 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 131.0) internal successors, (393), 3 states have internal predecessors, (393), 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-03 10:53:10,800 INFO L276 IsEmpty]: Start isEmpty. Operand 7584 states and 8662 transitions. [2025-03-03 10:53:10,804 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 411 [2025-03-03 10:53:10,804 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 10:53:10,804 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-03 10:53:10,804 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-03-03 10:53:10,804 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 10:53:10,805 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 10:53:10,805 INFO L85 PathProgramCache]: Analyzing trace with hash 686825634, now seen corresponding path program 1 times [2025-03-03 10:53:10,805 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 10:53:10,805 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [161142807] [2025-03-03 10:53:10,805 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 10:53:10,805 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 10:53:10,840 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 410 statements into 1 equivalence classes. [2025-03-03 10:53:10,857 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 410 of 410 statements. [2025-03-03 10:53:10,857 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 10:53:10,857 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 10:53:11,001 INFO L134 CoverageAnalysis]: Checked inductivity of 365 backedges. 275 proven. 0 refuted. 0 times theorem prover too weak. 90 trivial. 0 not checked. [2025-03-03 10:53:11,002 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 10:53:11,002 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [161142807] [2025-03-03 10:53:11,002 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [161142807] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 10:53:11,002 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 10:53:11,002 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-03 10:53:11,002 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1981297437] [2025-03-03 10:53:11,003 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 10:53:11,003 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-03 10:53:11,003 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 10:53:11,003 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-03 10:53:11,004 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 10:53:11,004 INFO L87 Difference]: Start difference. First operand 7584 states and 8662 transitions. Second operand has 3 states, 3 states have (on average 107.0) internal successors, (321), 3 states have internal predecessors, (321), 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-03 10:53:12,006 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 10:53:12,007 INFO L93 Difference]: Finished difference Result 16661 states and 19392 transitions. [2025-03-03 10:53:12,007 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-03 10:53:12,007 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 107.0) internal successors, (321), 3 states have internal predecessors, (321), 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 410 [2025-03-03 10:53:12,007 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 10:53:12,019 INFO L225 Difference]: With dead ends: 16661 [2025-03-03 10:53:12,019 INFO L226 Difference]: Without dead ends: 9378 [2025-03-03 10:53:12,024 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 10:53:12,025 INFO L435 NwaCegarLoop]: 580 mSDtfsCounter, 246 mSDsluCounter, 39 mSDsCounter, 0 mSdLazyCounter, 880 mSolverCounterSat, 242 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 246 SdHoareTripleChecker+Valid, 619 SdHoareTripleChecker+Invalid, 1122 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 242 IncrementalHoareTripleChecker+Valid, 880 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2025-03-03 10:53:12,025 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [246 Valid, 619 Invalid, 1122 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [242 Valid, 880 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2025-03-03 10:53:12,030 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9378 states. [2025-03-03 10:53:12,071 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9378 to 9075. [2025-03-03 10:53:12,076 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9075 states, 9074 states have (on average 1.1318051575931232) internal successors, (10270), 9074 states have internal predecessors, (10270), 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-03 10:53:12,083 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9075 states to 9075 states and 10270 transitions. [2025-03-03 10:53:12,083 INFO L78 Accepts]: Start accepts. Automaton has 9075 states and 10270 transitions. Word has length 410 [2025-03-03 10:53:12,083 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 10:53:12,083 INFO L471 AbstractCegarLoop]: Abstraction has 9075 states and 10270 transitions. [2025-03-03 10:53:12,083 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 107.0) internal successors, (321), 3 states have internal predecessors, (321), 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-03 10:53:12,084 INFO L276 IsEmpty]: Start isEmpty. Operand 9075 states and 10270 transitions. [2025-03-03 10:53:12,087 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 526 [2025-03-03 10:53:12,087 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 10:53:12,087 INFO L218 NwaCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-03 10:53:12,088 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-03-03 10:53:12,088 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 10:53:12,088 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 10:53:12,088 INFO L85 PathProgramCache]: Analyzing trace with hash 1584700373, now seen corresponding path program 1 times [2025-03-03 10:53:12,088 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 10:53:12,088 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [456906795] [2025-03-03 10:53:12,088 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 10:53:12,088 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 10:53:12,118 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 525 statements into 1 equivalence classes. [2025-03-03 10:53:12,137 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 525 of 525 statements. [2025-03-03 10:53:12,137 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 10:53:12,137 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 10:53:12,462 INFO L134 CoverageAnalysis]: Checked inductivity of 679 backedges. 487 proven. 39 refuted. 0 times theorem prover too weak. 153 trivial. 0 not checked. [2025-03-03 10:53:12,462 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 10:53:12,462 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [456906795] [2025-03-03 10:53:12,463 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [456906795] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-03 10:53:12,463 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1653590248] [2025-03-03 10:53:12,463 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 10:53:12,463 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 10:53:12,463 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 10:53:12,466 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-03 10:53:12,467 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-03 10:53:12,552 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 525 statements into 1 equivalence classes. [2025-03-03 10:53:12,647 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 525 of 525 statements. [2025-03-03 10:53:12,647 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 10:53:12,647 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 10:53:12,651 INFO L256 TraceCheckSpWp]: Trace formula consists of 658 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-03-03 10:53:12,664 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 10:53:12,766 INFO L134 CoverageAnalysis]: Checked inductivity of 679 backedges. 155 proven. 0 refuted. 0 times theorem prover too weak. 524 trivial. 0 not checked. [2025-03-03 10:53:12,766 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-03 10:53:12,766 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1653590248] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 10:53:12,766 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-03 10:53:12,767 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [4] total 6 [2025-03-03 10:53:12,767 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [115865644] [2025-03-03 10:53:12,767 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 10:53:12,767 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-03 10:53:12,767 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 10:53:12,768 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-03 10:53:12,768 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2025-03-03 10:53:12,768 INFO L87 Difference]: Start difference. First operand 9075 states and 10270 transitions. Second operand has 3 states, 3 states have (on average 81.0) internal successors, (243), 3 states have internal predecessors, (243), 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-03 10:53:13,807 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 10:53:13,807 INFO L93 Difference]: Finished difference Result 20240 states and 23189 transitions. [2025-03-03 10:53:13,807 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-03 10:53:13,807 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 81.0) internal successors, (243), 3 states have internal predecessors, (243), 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 525 [2025-03-03 10:53:13,808 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 10:53:13,824 INFO L225 Difference]: With dead ends: 20240 [2025-03-03 10:53:13,824 INFO L226 Difference]: Without dead ends: 11466 [2025-03-03 10:53:13,832 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 528 GetRequests, 524 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2025-03-03 10:53:13,833 INFO L435 NwaCegarLoop]: 426 mSDtfsCounter, 376 mSDsluCounter, 20 mSDsCounter, 0 mSdLazyCounter, 969 mSolverCounterSat, 127 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 376 SdHoareTripleChecker+Valid, 446 SdHoareTripleChecker+Invalid, 1096 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 127 IncrementalHoareTripleChecker+Valid, 969 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2025-03-03 10:53:13,833 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [376 Valid, 446 Invalid, 1096 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [127 Valid, 969 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2025-03-03 10:53:13,844 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11466 states. [2025-03-03 10:53:13,914 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11466 to 11466. [2025-03-03 10:53:13,923 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 11466 states, 11465 states have (on average 1.1365896205843873) internal successors, (13031), 11465 states have internal predecessors, (13031), 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-03 10:53:13,934 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11466 states to 11466 states and 13031 transitions. [2025-03-03 10:53:13,934 INFO L78 Accepts]: Start accepts. Automaton has 11466 states and 13031 transitions. Word has length 525 [2025-03-03 10:53:13,935 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 10:53:13,935 INFO L471 AbstractCegarLoop]: Abstraction has 11466 states and 13031 transitions. [2025-03-03 10:53:13,935 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 81.0) internal successors, (243), 3 states have internal predecessors, (243), 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-03 10:53:13,935 INFO L276 IsEmpty]: Start isEmpty. Operand 11466 states and 13031 transitions. [2025-03-03 10:53:13,939 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 530 [2025-03-03 10:53:13,939 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 10:53:13,939 INFO L218 NwaCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-03 10:53:13,946 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-03 10:53:14,143 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,SelfDestructingSolverStorable10 [2025-03-03 10:53:14,143 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 10:53:14,144 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 10:53:14,144 INFO L85 PathProgramCache]: Analyzing trace with hash 885747615, now seen corresponding path program 1 times [2025-03-03 10:53:14,144 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 10:53:14,144 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [801836617] [2025-03-03 10:53:14,144 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 10:53:14,144 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 10:53:14,178 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 529 statements into 1 equivalence classes. [2025-03-03 10:53:14,221 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 529 of 529 statements. [2025-03-03 10:53:14,222 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 10:53:14,222 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 10:53:14,427 INFO L134 CoverageAnalysis]: Checked inductivity of 691 backedges. 391 proven. 0 refuted. 0 times theorem prover too weak. 300 trivial. 0 not checked. [2025-03-03 10:53:14,427 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 10:53:14,427 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [801836617] [2025-03-03 10:53:14,427 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [801836617] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 10:53:14,427 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 10:53:14,427 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-03 10:53:14,427 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1115677028] [2025-03-03 10:53:14,427 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 10:53:14,427 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-03 10:53:14,427 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 10:53:14,428 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-03 10:53:14,428 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 10:53:14,428 INFO L87 Difference]: Start difference. First operand 11466 states and 13031 transitions. Second operand has 3 states, 3 states have (on average 107.0) internal successors, (321), 3 states have internal predecessors, (321), 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-03 10:53:15,641 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 10:53:15,641 INFO L93 Difference]: Finished difference Result 27130 states and 31138 transitions. [2025-03-03 10:53:15,641 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-03 10:53:15,642 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 107.0) internal successors, (321), 3 states have internal predecessors, (321), 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 529 [2025-03-03 10:53:15,642 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 10:53:15,668 INFO L225 Difference]: With dead ends: 27130 [2025-03-03 10:53:15,668 INFO L226 Difference]: Without dead ends: 15965 [2025-03-03 10:53:15,678 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 10:53:15,678 INFO L435 NwaCegarLoop]: 590 mSDtfsCounter, 246 mSDsluCounter, 33 mSDsCounter, 0 mSdLazyCounter, 1040 mSolverCounterSat, 170 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 246 SdHoareTripleChecker+Valid, 623 SdHoareTripleChecker+Invalid, 1210 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 170 IncrementalHoareTripleChecker+Valid, 1040 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2025-03-03 10:53:15,679 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [246 Valid, 623 Invalid, 1210 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [170 Valid, 1040 Invalid, 0 Unknown, 0 Unchecked, 1.1s Time] [2025-03-03 10:53:15,688 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15965 states. [2025-03-03 10:53:15,792 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15965 to 15356. [2025-03-03 10:53:15,804 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 15356 states, 15355 states have (on average 1.1285574731357864) internal successors, (17329), 15355 states have internal predecessors, (17329), 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-03 10:53:15,818 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15356 states to 15356 states and 17329 transitions. [2025-03-03 10:53:15,819 INFO L78 Accepts]: Start accepts. Automaton has 15356 states and 17329 transitions. Word has length 529 [2025-03-03 10:53:15,819 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 10:53:15,819 INFO L471 AbstractCegarLoop]: Abstraction has 15356 states and 17329 transitions. [2025-03-03 10:53:15,819 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 107.0) internal successors, (321), 3 states have internal predecessors, (321), 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-03 10:53:15,820 INFO L276 IsEmpty]: Start isEmpty. Operand 15356 states and 17329 transitions. [2025-03-03 10:53:15,825 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 605 [2025-03-03 10:53:15,826 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 10:53:15,826 INFO L218 NwaCegarLoop]: trace histogram [6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-03 10:53:15,826 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2025-03-03 10:53:15,826 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 10:53:15,827 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 10:53:15,827 INFO L85 PathProgramCache]: Analyzing trace with hash 1422016212, now seen corresponding path program 1 times [2025-03-03 10:53:15,827 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 10:53:15,827 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [588370473] [2025-03-03 10:53:15,827 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 10:53:15,827 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 10:53:15,862 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 604 statements into 1 equivalence classes. [2025-03-03 10:53:15,880 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 604 of 604 statements. [2025-03-03 10:53:15,880 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 10:53:15,880 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 10:53:16,233 INFO L134 CoverageAnalysis]: Checked inductivity of 1029 backedges. 644 proven. 39 refuted. 0 times theorem prover too weak. 346 trivial. 0 not checked. [2025-03-03 10:53:16,234 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 10:53:16,234 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [588370473] [2025-03-03 10:53:16,234 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [588370473] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-03 10:53:16,234 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [610949291] [2025-03-03 10:53:16,234 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 10:53:16,234 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 10:53:16,234 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 10:53:16,236 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-03 10:53:16,238 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-03 10:53:16,348 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 604 statements into 1 equivalence classes. [2025-03-03 10:53:16,440 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 604 of 604 statements. [2025-03-03 10:53:16,441 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 10:53:16,441 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 10:53:16,443 INFO L256 TraceCheckSpWp]: Trace formula consists of 763 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-03-03 10:53:16,453 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 10:53:16,582 INFO L134 CoverageAnalysis]: Checked inductivity of 1029 backedges. 505 proven. 0 refuted. 0 times theorem prover too weak. 524 trivial. 0 not checked. [2025-03-03 10:53:16,583 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-03 10:53:16,583 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [610949291] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 10:53:16,583 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-03 10:53:16,583 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [4] total 6 [2025-03-03 10:53:16,583 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [817938681] [2025-03-03 10:53:16,583 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 10:53:16,583 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-03 10:53:16,584 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 10:53:16,584 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-03 10:53:16,584 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2025-03-03 10:53:16,584 INFO L87 Difference]: Start difference. First operand 15356 states and 17329 transitions. Second operand has 3 states, 3 states have (on average 107.33333333333333) internal successors, (322), 3 states have internal predecessors, (322), 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-03 10:53:17,597 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 10:53:17,598 INFO L93 Difference]: Finished difference Result 30108 states and 34016 transitions. [2025-03-03 10:53:17,598 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-03 10:53:17,598 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 107.33333333333333) internal successors, (322), 3 states have internal predecessors, (322), 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 604 [2025-03-03 10:53:17,599 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 10:53:17,616 INFO L225 Difference]: With dead ends: 30108 [2025-03-03 10:53:17,617 INFO L226 Difference]: Without dead ends: 15053 [2025-03-03 10:53:17,630 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 607 GetRequests, 603 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2025-03-03 10:53:17,631 INFO L435 NwaCegarLoop]: 567 mSDtfsCounter, 252 mSDsluCounter, 37 mSDsCounter, 0 mSdLazyCounter, 878 mSolverCounterSat, 208 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 252 SdHoareTripleChecker+Valid, 604 SdHoareTripleChecker+Invalid, 1086 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 208 IncrementalHoareTripleChecker+Valid, 878 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2025-03-03 10:53:17,631 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [252 Valid, 604 Invalid, 1086 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [208 Valid, 878 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2025-03-03 10:53:17,641 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15053 states. [2025-03-03 10:53:17,732 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15053 to 15052. [2025-03-03 10:53:17,741 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 15052 states, 15051 states have (on average 1.0794631585941135) internal successors, (16247), 15051 states have internal predecessors, (16247), 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-03 10:53:17,754 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15052 states to 15052 states and 16247 transitions. [2025-03-03 10:53:17,755 INFO L78 Accepts]: Start accepts. Automaton has 15052 states and 16247 transitions. Word has length 604 [2025-03-03 10:53:17,755 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 10:53:17,755 INFO L471 AbstractCegarLoop]: Abstraction has 15052 states and 16247 transitions. [2025-03-03 10:53:17,755 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 107.33333333333333) internal successors, (322), 3 states have internal predecessors, (322), 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-03 10:53:17,755 INFO L276 IsEmpty]: Start isEmpty. Operand 15052 states and 16247 transitions. [2025-03-03 10:53:17,761 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 606 [2025-03-03 10:53:17,761 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 10:53:17,761 INFO L218 NwaCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 10:53:17,768 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-03 10:53:17,961 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,SelfDestructingSolverStorable12 [2025-03-03 10:53:17,962 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 10:53:17,962 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 10:53:17,962 INFO L85 PathProgramCache]: Analyzing trace with hash 621916199, now seen corresponding path program 1 times [2025-03-03 10:53:17,962 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 10:53:17,962 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [269968866] [2025-03-03 10:53:17,962 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 10:53:17,963 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 10:53:17,998 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 605 statements into 1 equivalence classes. [2025-03-03 10:53:18,048 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 605 of 605 statements. [2025-03-03 10:53:18,048 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 10:53:18,048 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 10:53:18,362 INFO L134 CoverageAnalysis]: Checked inductivity of 767 backedges. 571 proven. 39 refuted. 0 times theorem prover too weak. 157 trivial. 0 not checked. [2025-03-03 10:53:18,362 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 10:53:18,362 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [269968866] [2025-03-03 10:53:18,362 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [269968866] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-03 10:53:18,362 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2137917741] [2025-03-03 10:53:18,362 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 10:53:18,362 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 10:53:18,362 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 10:53:18,365 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-03 10:53:18,366 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-03 10:53:18,437 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 605 statements into 1 equivalence classes. [2025-03-03 10:53:18,508 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 605 of 605 statements. [2025-03-03 10:53:18,508 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 10:53:18,508 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 10:53:18,510 INFO L256 TraceCheckSpWp]: Trace formula consists of 745 conjuncts, 7 conjuncts are in the unsatisfiable core [2025-03-03 10:53:18,514 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 10:53:19,112 INFO L134 CoverageAnalysis]: Checked inductivity of 767 backedges. 571 proven. 39 refuted. 0 times theorem prover too weak. 157 trivial. 0 not checked. [2025-03-03 10:53:19,113 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-03 10:53:19,655 INFO L134 CoverageAnalysis]: Checked inductivity of 767 backedges. 571 proven. 39 refuted. 0 times theorem prover too weak. 157 trivial. 0 not checked. [2025-03-03 10:53:19,655 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2137917741] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-03 10:53:19,655 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-03 10:53:19,655 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 8 [2025-03-03 10:53:19,655 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1881520060] [2025-03-03 10:53:19,655 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-03 10:53:19,656 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-03-03 10:53:19,656 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 10:53:19,656 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-03-03 10:53:19,657 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=44, Unknown=0, NotChecked=0, Total=72 [2025-03-03 10:53:19,657 INFO L87 Difference]: Start difference. First operand 15052 states and 16247 transitions. Second operand has 9 states, 9 states have (on average 86.33333333333333) internal successors, (777), 8 states have internal predecessors, (777), 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-03 10:53:23,832 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 10:53:23,833 INFO L93 Difference]: Finished difference Result 38434 states and 41452 transitions. [2025-03-03 10:53:23,833 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2025-03-03 10:53:23,833 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 86.33333333333333) internal successors, (777), 8 states have internal predecessors, (777), 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 605 [2025-03-03 10:53:23,833 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 10:53:23,853 INFO L225 Difference]: With dead ends: 38434 [2025-03-03 10:53:23,854 INFO L226 Difference]: Without dead ends: 16247 [2025-03-03 10:53:23,861 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 1219 GetRequests, 1205 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 40 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=89, Invalid=151, Unknown=0, NotChecked=0, Total=240 [2025-03-03 10:53:23,862 INFO L435 NwaCegarLoop]: 100 mSDtfsCounter, 2852 mSDsluCounter, 203 mSDsCounter, 0 mSdLazyCounter, 6716 mSolverCounterSat, 666 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2852 SdHoareTripleChecker+Valid, 303 SdHoareTripleChecker+Invalid, 7382 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 666 IncrementalHoareTripleChecker+Valid, 6716 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.9s IncrementalHoareTripleChecker+Time [2025-03-03 10:53:23,862 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2852 Valid, 303 Invalid, 7382 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [666 Valid, 6716 Invalid, 0 Unknown, 0 Unchecked, 3.9s Time] [2025-03-03 10:53:23,871 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16247 states. [2025-03-03 10:53:23,955 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16247 to 12357. [2025-03-03 10:53:23,963 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 12357 states, 12356 states have (on average 1.0382000647458725) internal successors, (12828), 12356 states have internal predecessors, (12828), 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-03 10:53:23,974 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12357 states to 12357 states and 12828 transitions. [2025-03-03 10:53:23,975 INFO L78 Accepts]: Start accepts. Automaton has 12357 states and 12828 transitions. Word has length 605 [2025-03-03 10:53:23,975 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 10:53:23,975 INFO L471 AbstractCegarLoop]: Abstraction has 12357 states and 12828 transitions. [2025-03-03 10:53:23,975 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 86.33333333333333) internal successors, (777), 8 states have internal predecessors, (777), 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-03 10:53:23,975 INFO L276 IsEmpty]: Start isEmpty. Operand 12357 states and 12828 transitions. [2025-03-03 10:53:23,980 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 643 [2025-03-03 10:53:23,981 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 10:53:23,981 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 10:53:23,988 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2025-03-03 10:53:24,182 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 10:53:24,182 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 10:53:24,182 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 10:53:24,182 INFO L85 PathProgramCache]: Analyzing trace with hash 1982065587, now seen corresponding path program 1 times [2025-03-03 10:53:24,183 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 10:53:24,183 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [592100671] [2025-03-03 10:53:24,183 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 10:53:24,183 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 10:53:24,225 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 642 statements into 1 equivalence classes. [2025-03-03 10:53:24,247 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 642 of 642 statements. [2025-03-03 10:53:24,248 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 10:53:24,248 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 10:53:24,422 INFO L134 CoverageAnalysis]: Checked inductivity of 552 backedges. 116 proven. 0 refuted. 0 times theorem prover too weak. 436 trivial. 0 not checked. [2025-03-03 10:53:24,423 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 10:53:24,423 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [592100671] [2025-03-03 10:53:24,423 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [592100671] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 10:53:24,423 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 10:53:24,423 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-03 10:53:24,423 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [337297624] [2025-03-03 10:53:24,423 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 10:53:24,423 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-03 10:53:24,423 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 10:53:24,424 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-03 10:53:24,424 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 10:53:24,424 INFO L87 Difference]: Start difference. First operand 12357 states and 12828 transitions. Second operand has 3 states, 3 states have (on average 104.66666666666667) internal successors, (314), 3 states have internal predecessors, (314), 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-03 10:53:25,071 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 10:53:25,071 INFO L93 Difference]: Finished difference Result 28295 states and 29423 transitions. [2025-03-03 10:53:25,072 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-03 10:53:25,072 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 104.66666666666667) internal successors, (314), 3 states have internal predecessors, (314), 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 642 [2025-03-03 10:53:25,072 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 10:53:25,088 INFO L225 Difference]: With dead ends: 28295 [2025-03-03 10:53:25,088 INFO L226 Difference]: Without dead ends: 15940 [2025-03-03 10:53:25,095 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 10:53:25,096 INFO L435 NwaCegarLoop]: 495 mSDtfsCounter, 273 mSDsluCounter, 39 mSDsCounter, 0 mSdLazyCounter, 740 mSolverCounterSat, 111 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 273 SdHoareTripleChecker+Valid, 534 SdHoareTripleChecker+Invalid, 851 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 111 IncrementalHoareTripleChecker+Valid, 740 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-03-03 10:53:25,096 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [273 Valid, 534 Invalid, 851 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [111 Valid, 740 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-03-03 10:53:25,106 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15940 states. [2025-03-03 10:53:25,195 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15940 to 15043. [2025-03-03 10:53:25,205 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 15043 states, 15042 states have (on average 1.032974338518814) internal successors, (15538), 15042 states have internal predecessors, (15538), 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-03 10:53:25,216 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15043 states to 15043 states and 15538 transitions. [2025-03-03 10:53:25,217 INFO L78 Accepts]: Start accepts. Automaton has 15043 states and 15538 transitions. Word has length 642 [2025-03-03 10:53:25,217 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 10:53:25,217 INFO L471 AbstractCegarLoop]: Abstraction has 15043 states and 15538 transitions. [2025-03-03 10:53:25,217 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 104.66666666666667) internal successors, (314), 3 states have internal predecessors, (314), 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-03 10:53:25,217 INFO L276 IsEmpty]: Start isEmpty. Operand 15043 states and 15538 transitions. [2025-03-03 10:53:25,222 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 667 [2025-03-03 10:53:25,222 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 10:53:25,223 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 10:53:25,223 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2025-03-03 10:53:25,223 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 10:53:25,223 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 10:53:25,223 INFO L85 PathProgramCache]: Analyzing trace with hash 1669514480, now seen corresponding path program 1 times [2025-03-03 10:53:25,223 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 10:53:25,223 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [127745408] [2025-03-03 10:53:25,224 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 10:53:25,224 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 10:53:25,262 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 666 statements into 1 equivalence classes. [2025-03-03 10:53:25,318 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 666 of 666 statements. [2025-03-03 10:53:25,319 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 10:53:25,319 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 10:53:25,623 INFO L134 CoverageAnalysis]: Checked inductivity of 574 backedges. 116 proven. 0 refuted. 0 times theorem prover too weak. 458 trivial. 0 not checked. [2025-03-03 10:53:25,624 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 10:53:25,624 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [127745408] [2025-03-03 10:53:25,624 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [127745408] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 10:53:25,624 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 10:53:25,624 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-03 10:53:25,624 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1981469244] [2025-03-03 10:53:25,624 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 10:53:25,625 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-03 10:53:25,625 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 10:53:25,626 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-03 10:53:25,626 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-03-03 10:53:25,626 INFO L87 Difference]: Start difference. First operand 15043 states and 15538 transitions. Second operand has 4 states, 4 states have (on average 79.0) internal successors, (316), 4 states have internal predecessors, (316), 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-03 10:53:26,735 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 10:53:26,736 INFO L93 Difference]: Finished difference Result 33973 states and 35169 transitions. [2025-03-03 10:53:26,736 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-03 10:53:26,736 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 79.0) internal successors, (316), 4 states have internal predecessors, (316), 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 666 [2025-03-03 10:53:26,736 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 10:53:26,753 INFO L225 Difference]: With dead ends: 33973 [2025-03-03 10:53:26,753 INFO L226 Difference]: Without dead ends: 18932 [2025-03-03 10:53:26,763 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-03-03 10:53:26,764 INFO L435 NwaCegarLoop]: 388 mSDtfsCounter, 652 mSDsluCounter, 46 mSDsCounter, 0 mSdLazyCounter, 1776 mSolverCounterSat, 167 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 652 SdHoareTripleChecker+Valid, 434 SdHoareTripleChecker+Invalid, 1943 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 167 IncrementalHoareTripleChecker+Valid, 1776 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2025-03-03 10:53:26,764 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [652 Valid, 434 Invalid, 1943 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [167 Valid, 1776 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2025-03-03 10:53:26,776 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18932 states. [2025-03-03 10:53:26,879 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18932 to 18035. [2025-03-03 10:53:26,891 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 18035 states, 18034 states have (on average 1.0311633581013642) internal successors, (18596), 18034 states have internal predecessors, (18596), 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-03 10:53:26,906 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18035 states to 18035 states and 18596 transitions. [2025-03-03 10:53:26,907 INFO L78 Accepts]: Start accepts. Automaton has 18035 states and 18596 transitions. Word has length 666 [2025-03-03 10:53:26,907 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 10:53:26,907 INFO L471 AbstractCegarLoop]: Abstraction has 18035 states and 18596 transitions. [2025-03-03 10:53:26,907 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 79.0) internal successors, (316), 4 states have internal predecessors, (316), 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-03 10:53:26,907 INFO L276 IsEmpty]: Start isEmpty. Operand 18035 states and 18596 transitions. [2025-03-03 10:53:26,914 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 698 [2025-03-03 10:53:26,914 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 10:53:26,914 INFO L218 NwaCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-03 10:53:26,914 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2025-03-03 10:53:26,914 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 10:53:26,915 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 10:53:26,915 INFO L85 PathProgramCache]: Analyzing trace with hash 2084039631, now seen corresponding path program 1 times [2025-03-03 10:53:26,915 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 10:53:26,915 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [588238376] [2025-03-03 10:53:26,915 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 10:53:26,915 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 10:53:26,977 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 697 statements into 1 equivalence classes. [2025-03-03 10:53:26,995 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 697 of 697 statements. [2025-03-03 10:53:26,995 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 10:53:26,995 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 10:53:27,146 INFO L134 CoverageAnalysis]: Checked inductivity of 872 backedges. 499 proven. 0 refuted. 0 times theorem prover too weak. 373 trivial. 0 not checked. [2025-03-03 10:53:27,146 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 10:53:27,146 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [588238376] [2025-03-03 10:53:27,146 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [588238376] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 10:53:27,147 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 10:53:27,147 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-03 10:53:27,147 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [817589041] [2025-03-03 10:53:27,147 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 10:53:27,147 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-03 10:53:27,147 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 10:53:27,147 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-03 10:53:27,148 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 10:53:27,148 INFO L87 Difference]: Start difference. First operand 18035 states and 18596 transitions. Second operand has 3 states, 3 states have (on average 144.33333333333334) internal successors, (433), 3 states have internal predecessors, (433), 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-03 10:53:27,742 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 10:53:27,742 INFO L93 Difference]: Finished difference Result 36065 states and 37196 transitions. [2025-03-03 10:53:27,742 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-03 10:53:27,742 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 144.33333333333334) internal successors, (433), 3 states have internal predecessors, (433), 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 697 [2025-03-03 10:53:27,743 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 10:53:27,759 INFO L225 Difference]: With dead ends: 36065 [2025-03-03 10:53:27,759 INFO L226 Difference]: Without dead ends: 18331 [2025-03-03 10:53:27,769 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 10:53:27,770 INFO L435 NwaCegarLoop]: 62 mSDtfsCounter, 435 mSDsluCounter, 5 mSDsCounter, 0 mSdLazyCounter, 723 mSolverCounterSat, 63 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 435 SdHoareTripleChecker+Valid, 67 SdHoareTripleChecker+Invalid, 786 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 63 IncrementalHoareTripleChecker+Valid, 723 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-03-03 10:53:27,770 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [435 Valid, 67 Invalid, 786 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [63 Valid, 723 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-03-03 10:53:27,781 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18331 states. [2025-03-03 10:53:27,887 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18331 to 18031. [2025-03-03 10:53:27,899 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 18031 states, 18030 states have (on average 1.031003882418192) internal successors, (18589), 18030 states have internal predecessors, (18589), 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-03 10:53:27,914 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18031 states to 18031 states and 18589 transitions. [2025-03-03 10:53:27,914 INFO L78 Accepts]: Start accepts. Automaton has 18031 states and 18589 transitions. Word has length 697 [2025-03-03 10:53:27,914 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 10:53:27,914 INFO L471 AbstractCegarLoop]: Abstraction has 18031 states and 18589 transitions. [2025-03-03 10:53:27,915 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 144.33333333333334) internal successors, (433), 3 states have internal predecessors, (433), 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-03 10:53:27,915 INFO L276 IsEmpty]: Start isEmpty. Operand 18031 states and 18589 transitions. [2025-03-03 10:53:27,924 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 769 [2025-03-03 10:53:27,924 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 10:53:27,924 INFO L218 NwaCegarLoop]: trace histogram [6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-03 10:53:27,924 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2025-03-03 10:53:27,924 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 10:53:27,925 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 10:53:27,925 INFO L85 PathProgramCache]: Analyzing trace with hash 1061165021, now seen corresponding path program 1 times [2025-03-03 10:53:27,925 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 10:53:27,925 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [461997708] [2025-03-03 10:53:27,925 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 10:53:27,925 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 10:53:27,996 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 768 statements into 1 equivalence classes. [2025-03-03 10:53:28,028 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 768 of 768 statements. [2025-03-03 10:53:28,028 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 10:53:28,028 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 10:53:28,233 INFO L134 CoverageAnalysis]: Checked inductivity of 1222 backedges. 648 proven. 0 refuted. 0 times theorem prover too weak. 574 trivial. 0 not checked. [2025-03-03 10:53:28,234 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 10:53:28,234 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [461997708] [2025-03-03 10:53:28,234 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [461997708] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 10:53:28,234 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 10:53:28,234 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-03 10:53:28,234 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [405895084] [2025-03-03 10:53:28,234 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 10:53:28,235 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-03 10:53:28,235 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 10:53:28,235 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-03 10:53:28,235 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 10:53:28,235 INFO L87 Difference]: Start difference. First operand 18031 states and 18589 transitions. Second operand has 3 states, 3 states have (on average 157.33333333333334) internal successors, (472), 3 states have internal predecessors, (472), 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-03 10:53:28,915 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 10:53:28,915 INFO L93 Difference]: Finished difference Result 38449 states and 39675 transitions. [2025-03-03 10:53:28,915 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-03 10:53:28,915 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 157.33333333333334) internal successors, (472), 3 states have internal predecessors, (472), 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 768 [2025-03-03 10:53:28,915 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 10:53:28,933 INFO L225 Difference]: With dead ends: 38449 [2025-03-03 10:53:28,934 INFO L226 Difference]: Without dead ends: 20719 [2025-03-03 10:53:28,944 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 10:53:28,944 INFO L435 NwaCegarLoop]: 132 mSDtfsCounter, 184 mSDsluCounter, 30 mSDsCounter, 0 mSdLazyCounter, 774 mSolverCounterSat, 98 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 184 SdHoareTripleChecker+Valid, 162 SdHoareTripleChecker+Invalid, 872 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 98 IncrementalHoareTripleChecker+Valid, 774 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-03-03 10:53:28,944 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [184 Valid, 162 Invalid, 872 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [98 Valid, 774 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-03-03 10:53:28,956 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20719 states. [2025-03-03 10:53:29,064 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20719 to 19523. [2025-03-03 10:53:29,076 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 19523 states, 19522 states have (on average 1.0284806884540518) internal successors, (20078), 19522 states have internal predecessors, (20078), 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-03 10:53:29,091 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19523 states to 19523 states and 20078 transitions. [2025-03-03 10:53:29,092 INFO L78 Accepts]: Start accepts. Automaton has 19523 states and 20078 transitions. Word has length 768 [2025-03-03 10:53:29,092 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 10:53:29,092 INFO L471 AbstractCegarLoop]: Abstraction has 19523 states and 20078 transitions. [2025-03-03 10:53:29,092 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 157.33333333333334) internal successors, (472), 3 states have internal predecessors, (472), 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-03 10:53:29,093 INFO L276 IsEmpty]: Start isEmpty. Operand 19523 states and 20078 transitions. [2025-03-03 10:53:29,102 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 790 [2025-03-03 10:53:29,102 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 10:53:29,103 INFO L218 NwaCegarLoop]: trace histogram [6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-03 10:53:29,103 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2025-03-03 10:53:29,103 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 10:53:29,103 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 10:53:29,104 INFO L85 PathProgramCache]: Analyzing trace with hash 420668122, now seen corresponding path program 1 times [2025-03-03 10:53:29,104 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 10:53:29,104 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [235687611] [2025-03-03 10:53:29,104 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 10:53:29,104 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 10:53:29,173 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 789 statements into 1 equivalence classes. [2025-03-03 10:53:29,199 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 789 of 789 statements. [2025-03-03 10:53:29,199 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 10:53:29,199 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 10:53:29,350 INFO L134 CoverageAnalysis]: Checked inductivity of 1245 backedges. 669 proven. 0 refuted. 0 times theorem prover too weak. 576 trivial. 0 not checked. [2025-03-03 10:53:29,351 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 10:53:29,351 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [235687611] [2025-03-03 10:53:29,351 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [235687611] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 10:53:29,351 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 10:53:29,351 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-03 10:53:29,351 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1991932257] [2025-03-03 10:53:29,351 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 10:53:29,352 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-03 10:53:29,352 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 10:53:29,352 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-03 10:53:29,352 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 10:53:29,353 INFO L87 Difference]: Start difference. First operand 19523 states and 20078 transitions. Second operand has 3 states, 3 states have (on average 163.66666666666666) internal successors, (491), 3 states have internal predecessors, (491), 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-03 10:53:30,008 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 10:53:30,008 INFO L93 Difference]: Finished difference Result 41433 states and 42655 transitions. [2025-03-03 10:53:30,009 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-03 10:53:30,009 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 163.66666666666666) internal successors, (491), 3 states have internal predecessors, (491), 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 789 [2025-03-03 10:53:30,009 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 10:53:30,028 INFO L225 Difference]: With dead ends: 41433 [2025-03-03 10:53:30,028 INFO L226 Difference]: Without dead ends: 21912 [2025-03-03 10:53:30,039 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 10:53:30,040 INFO L435 NwaCegarLoop]: 433 mSDtfsCounter, 163 mSDsluCounter, 27 mSDsCounter, 0 mSdLazyCounter, 721 mSolverCounterSat, 109 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 163 SdHoareTripleChecker+Valid, 460 SdHoareTripleChecker+Invalid, 830 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 109 IncrementalHoareTripleChecker+Valid, 721 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-03-03 10:53:30,040 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [163 Valid, 460 Invalid, 830 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [109 Valid, 721 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-03-03 10:53:30,050 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21912 states. [2025-03-03 10:53:30,164 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21912 to 17124. [2025-03-03 10:53:30,174 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 17124 states, 17123 states have (on average 1.0263972434736903) internal successors, (17575), 17123 states have internal predecessors, (17575), 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-03 10:53:30,188 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17124 states to 17124 states and 17575 transitions. [2025-03-03 10:53:30,189 INFO L78 Accepts]: Start accepts. Automaton has 17124 states and 17575 transitions. Word has length 789 [2025-03-03 10:53:30,189 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 10:53:30,189 INFO L471 AbstractCegarLoop]: Abstraction has 17124 states and 17575 transitions. [2025-03-03 10:53:30,189 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 163.66666666666666) internal successors, (491), 3 states have internal predecessors, (491), 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-03 10:53:30,189 INFO L276 IsEmpty]: Start isEmpty. Operand 17124 states and 17575 transitions. [2025-03-03 10:53:30,198 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 827 [2025-03-03 10:53:30,199 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 10:53:30,199 INFO L218 NwaCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 10:53:30,199 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2025-03-03 10:53:30,199 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 10:53:30,199 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 10:53:30,200 INFO L85 PathProgramCache]: Analyzing trace with hash -1291597336, now seen corresponding path program 1 times [2025-03-03 10:53:30,200 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 10:53:30,200 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1564607225] [2025-03-03 10:53:30,200 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 10:53:30,200 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 10:53:30,301 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 826 statements into 1 equivalence classes. [2025-03-03 10:53:30,346 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 826 of 826 statements. [2025-03-03 10:53:30,347 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 10:53:30,347 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 10:53:30,618 INFO L134 CoverageAnalysis]: Checked inductivity of 1034 backedges. 532 proven. 0 refuted. 0 times theorem prover too weak. 502 trivial. 0 not checked. [2025-03-03 10:53:30,618 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 10:53:30,618 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1564607225] [2025-03-03 10:53:30,618 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1564607225] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 10:53:30,618 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 10:53:30,618 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-03 10:53:30,618 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [716153323] [2025-03-03 10:53:30,618 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 10:53:30,619 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-03 10:53:30,619 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 10:53:30,619 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-03 10:53:30,619 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 10:53:30,619 INFO L87 Difference]: Start difference. First operand 17124 states and 17575 transitions. Second operand has 3 states, 3 states have (on average 144.33333333333334) internal successors, (433), 3 states have internal predecessors, (433), 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-03 10:53:31,271 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 10:53:31,271 INFO L93 Difference]: Finished difference Result 36039 states and 37016 transitions. [2025-03-03 10:53:31,271 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-03 10:53:31,271 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 144.33333333333334) internal successors, (433), 3 states have internal predecessors, (433), 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 826 [2025-03-03 10:53:31,272 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 10:53:31,286 INFO L225 Difference]: With dead ends: 36039 [2025-03-03 10:53:31,286 INFO L226 Difference]: Without dead ends: 19216 [2025-03-03 10:53:31,294 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 10:53:31,298 INFO L435 NwaCegarLoop]: 464 mSDtfsCounter, 310 mSDsluCounter, 40 mSDsCounter, 0 mSdLazyCounter, 736 mSolverCounterSat, 38 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 310 SdHoareTripleChecker+Valid, 504 SdHoareTripleChecker+Invalid, 774 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 38 IncrementalHoareTripleChecker+Valid, 736 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-03-03 10:53:31,298 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [310 Valid, 504 Invalid, 774 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [38 Valid, 736 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-03-03 10:53:31,307 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19216 states. [2025-03-03 10:53:31,398 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19216 to 18020. [2025-03-03 10:53:31,409 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 18020 states, 18019 states have (on average 1.0254176147399967) internal successors, (18477), 18019 states have internal predecessors, (18477), 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-03 10:53:31,422 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18020 states to 18020 states and 18477 transitions. [2025-03-03 10:53:31,423 INFO L78 Accepts]: Start accepts. Automaton has 18020 states and 18477 transitions. Word has length 826 [2025-03-03 10:53:31,423 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 10:53:31,423 INFO L471 AbstractCegarLoop]: Abstraction has 18020 states and 18477 transitions. [2025-03-03 10:53:31,423 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 144.33333333333334) internal successors, (433), 3 states have internal predecessors, (433), 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-03 10:53:31,423 INFO L276 IsEmpty]: Start isEmpty. Operand 18020 states and 18477 transitions. [2025-03-03 10:53:31,432 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 848 [2025-03-03 10:53:31,432 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 10:53:31,432 INFO L218 NwaCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 10:53:31,432 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2025-03-03 10:53:31,433 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 10:53:31,433 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 10:53:31,433 INFO L85 PathProgramCache]: Analyzing trace with hash -1496607353, now seen corresponding path program 1 times [2025-03-03 10:53:31,433 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 10:53:31,433 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2051780447] [2025-03-03 10:53:31,433 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 10:53:31,433 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 10:53:31,482 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 847 statements into 1 equivalence classes. [2025-03-03 10:53:31,517 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 847 of 847 statements. [2025-03-03 10:53:31,518 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 10:53:31,518 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 10:53:32,403 INFO L134 CoverageAnalysis]: Checked inductivity of 1050 backedges. 597 proven. 269 refuted. 0 times theorem prover too weak. 184 trivial. 0 not checked. [2025-03-03 10:53:32,403 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 10:53:32,403 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2051780447] [2025-03-03 10:53:32,403 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2051780447] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-03 10:53:32,403 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [489644396] [2025-03-03 10:53:32,403 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 10:53:32,404 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 10:53:32,404 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 10:53:32,406 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-03 10:53:32,408 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2025-03-03 10:53:32,480 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 847 statements into 1 equivalence classes. [2025-03-03 10:53:32,578 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 847 of 847 statements. [2025-03-03 10:53:32,578 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 10:53:32,578 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 10:53:32,583 INFO L256 TraceCheckSpWp]: Trace formula consists of 982 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-03-03 10:53:32,589 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 10:53:32,830 INFO L134 CoverageAnalysis]: Checked inductivity of 1050 backedges. 570 proven. 0 refuted. 0 times theorem prover too weak. 480 trivial. 0 not checked. [2025-03-03 10:53:32,830 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-03 10:53:32,830 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [489644396] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 10:53:32,830 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-03 10:53:32,830 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [4] total 7 [2025-03-03 10:53:32,830 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1364367327] [2025-03-03 10:53:32,831 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 10:53:32,831 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-03 10:53:32,831 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 10:53:32,831 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-03 10:53:32,832 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2025-03-03 10:53:32,832 INFO L87 Difference]: Start difference. First operand 18020 states and 18477 transitions. Second operand has 4 states, 4 states have (on average 118.5) internal successors, (474), 4 states have internal predecessors, (474), 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-03 10:53:33,893 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 10:53:33,893 INFO L93 Difference]: Finished difference Result 42334 states and 43384 transitions. [2025-03-03 10:53:33,893 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-03 10:53:33,894 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 118.5) internal successors, (474), 4 states have internal predecessors, (474), 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 847 [2025-03-03 10:53:33,894 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 10:53:33,917 INFO L225 Difference]: With dead ends: 42334 [2025-03-03 10:53:33,917 INFO L226 Difference]: Without dead ends: 24615 [2025-03-03 10:53:33,930 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 850 GetRequests, 845 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2025-03-03 10:53:33,931 INFO L435 NwaCegarLoop]: 64 mSDtfsCounter, 505 mSDsluCounter, 57 mSDsCounter, 0 mSdLazyCounter, 1513 mSolverCounterSat, 154 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 505 SdHoareTripleChecker+Valid, 121 SdHoareTripleChecker+Invalid, 1667 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 154 IncrementalHoareTripleChecker+Valid, 1513 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2025-03-03 10:53:33,931 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [505 Valid, 121 Invalid, 1667 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [154 Valid, 1513 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2025-03-03 10:53:33,943 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24615 states. [2025-03-03 10:53:34,094 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24615 to 18622. [2025-03-03 10:53:34,106 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 18622 states, 18621 states have (on average 1.0251866172600828) internal successors, (19090), 18621 states have internal predecessors, (19090), 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-03 10:53:34,121 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18622 states to 18622 states and 19090 transitions. [2025-03-03 10:53:34,122 INFO L78 Accepts]: Start accepts. Automaton has 18622 states and 19090 transitions. Word has length 847 [2025-03-03 10:53:34,122 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 10:53:34,122 INFO L471 AbstractCegarLoop]: Abstraction has 18622 states and 19090 transitions. [2025-03-03 10:53:34,122 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 118.5) internal successors, (474), 4 states have internal predecessors, (474), 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-03 10:53:34,122 INFO L276 IsEmpty]: Start isEmpty. Operand 18622 states and 19090 transitions. [2025-03-03 10:53:34,131 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 910 [2025-03-03 10:53:34,131 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 10:53:34,131 INFO L218 NwaCegarLoop]: trace histogram [6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-03 10:53:34,138 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2025-03-03 10:53:34,332 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 10:53:34,332 INFO L396 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 10:53:34,332 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 10:53:34,333 INFO L85 PathProgramCache]: Analyzing trace with hash -1174850710, now seen corresponding path program 1 times [2025-03-03 10:53:34,333 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 10:53:34,333 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [113479213] [2025-03-03 10:53:34,333 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 10:53:34,333 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 10:53:34,387 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 909 statements into 1 equivalence classes. [2025-03-03 10:53:34,418 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 909 of 909 statements. [2025-03-03 10:53:34,419 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 10:53:34,419 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 10:53:34,779 INFO L134 CoverageAnalysis]: Checked inductivity of 1500 backedges. 924 proven. 0 refuted. 0 times theorem prover too weak. 576 trivial. 0 not checked. [2025-03-03 10:53:34,779 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 10:53:34,779 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [113479213] [2025-03-03 10:53:34,779 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [113479213] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 10:53:34,779 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 10:53:34,780 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-03 10:53:34,780 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [149565519] [2025-03-03 10:53:34,780 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 10:53:34,780 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-03 10:53:34,780 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 10:53:34,780 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-03 10:53:34,780 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 10:53:34,781 INFO L87 Difference]: Start difference. First operand 18622 states and 19090 transitions. Second operand has 3 states, 3 states have (on average 151.66666666666666) internal successors, (455), 3 states have internal predecessors, (455), 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-03 10:53:35,441 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 10:53:35,441 INFO L93 Difference]: Finished difference Result 30323 states and 31022 transitions. [2025-03-03 10:53:35,442 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-03 10:53:35,442 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 151.66666666666666) internal successors, (455), 3 states have internal predecessors, (455), 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 909 [2025-03-03 10:53:35,442 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 10:53:35,443 INFO L225 Difference]: With dead ends: 30323 [2025-03-03 10:53:35,443 INFO L226 Difference]: Without dead ends: 0 [2025-03-03 10:53:35,454 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 10:53:35,455 INFO L435 NwaCegarLoop]: 58 mSDtfsCounter, 321 mSDsluCounter, 10 mSDsCounter, 0 mSdLazyCounter, 702 mSolverCounterSat, 61 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 321 SdHoareTripleChecker+Valid, 68 SdHoareTripleChecker+Invalid, 763 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 61 IncrementalHoareTripleChecker+Valid, 702 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-03-03 10:53:35,456 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [321 Valid, 68 Invalid, 763 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [61 Valid, 702 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-03-03 10:53:35,456 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2025-03-03 10:53:35,456 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2025-03-03 10:53:35,456 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 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-03 10:53:35,456 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2025-03-03 10:53:35,457 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 909 [2025-03-03 10:53:35,457 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 10:53:35,457 INFO L471 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2025-03-03 10:53:35,457 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 151.66666666666666) internal successors, (455), 3 states have internal predecessors, (455), 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-03 10:53:35,457 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2025-03-03 10:53:35,457 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2025-03-03 10:53:35,460 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2025-03-03 10:53:35,461 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2025-03-03 10:53:35,463 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] [2025-03-03 10:53:35,464 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2025-03-03 10:53:37,702 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2025-03-03 10:53:37,726 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 03.03 10:53:37 BoogieIcfgContainer [2025-03-03 10:53:37,726 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2025-03-03 10:53:37,727 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2025-03-03 10:53:37,727 INFO L270 PluginConnector]: Initializing Witness Printer... [2025-03-03 10:53:37,727 INFO L274 PluginConnector]: Witness Printer initialized [2025-03-03 10:53:37,732 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 03.03 10:52:55" (3/4) ... [2025-03-03 10:53:37,733 INFO L146 WitnessPrinter]: Generating witness for correct program [2025-03-03 10:53:37,758 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 12 nodes and edges [2025-03-03 10:53:37,759 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 4 nodes and edges [2025-03-03 10:53:37,760 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 3 nodes and edges [2025-03-03 10:53:37,762 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2025-03-03 10:53:37,905 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2025-03-03 10:53:37,906 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.yml [2025-03-03 10:53:37,906 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2025-03-03 10:53:37,906 INFO L158 Benchmark]: Toolchain (without parser) took 45229.83ms. Allocated memory was 201.3MB in the beginning and 394.3MB in the end (delta: 192.9MB). Free memory was 154.2MB in the beginning and 154.4MB in the end (delta: -203.6kB). Peak memory consumption was 192.5MB. Max. memory is 16.1GB. [2025-03-03 10:53:37,907 INFO L158 Benchmark]: CDTParser took 0.22ms. Allocated memory is still 201.3MB. Free memory is still 117.0MB. There was no memory consumed. Max. memory is 16.1GB. [2025-03-03 10:53:37,907 INFO L158 Benchmark]: CACSL2BoogieTranslator took 671.74ms. Allocated memory is still 201.3MB. Free memory was 154.2MB in the beginning and 80.9MB in the end (delta: 73.3MB). Peak memory consumption was 75.5MB. Max. memory is 16.1GB. [2025-03-03 10:53:37,907 INFO L158 Benchmark]: Boogie Procedure Inliner took 161.71ms. Allocated memory is still 201.3MB. Free memory was 80.9MB in the beginning and 129.8MB in the end (delta: -48.9MB). Peak memory consumption was 56.7MB. Max. memory is 16.1GB. [2025-03-03 10:53:37,907 INFO L158 Benchmark]: Boogie Preprocessor took 180.61ms. Allocated memory is still 201.3MB. Free memory was 129.8MB in the beginning and 74.0MB in the end (delta: 55.8MB). Peak memory consumption was 50.3MB. Max. memory is 16.1GB. [2025-03-03 10:53:37,907 INFO L158 Benchmark]: IcfgBuilder took 2086.29ms. Allocated memory was 201.3MB in the beginning and 268.4MB in the end (delta: 67.1MB). Free memory was 74.0MB in the beginning and 153.0MB in the end (delta: -79.0MB). Peak memory consumption was 53.8MB. Max. memory is 16.1GB. [2025-03-03 10:53:37,907 INFO L158 Benchmark]: TraceAbstraction took 41944.40ms. Allocated memory was 268.4MB in the beginning and 394.3MB in the end (delta: 125.8MB). Free memory was 151.4MB in the beginning and 179.6MB in the end (delta: -28.2MB). Peak memory consumption was 816.4MB. Max. memory is 16.1GB. [2025-03-03 10:53:37,908 INFO L158 Benchmark]: Witness Printer took 178.92ms. Allocated memory is still 394.3MB. Free memory was 179.6MB in the beginning and 154.4MB in the end (delta: 25.2MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB. [2025-03-03 10:53:37,909 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.22ms. Allocated memory is still 201.3MB. Free memory is still 117.0MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 671.74ms. Allocated memory is still 201.3MB. Free memory was 154.2MB in the beginning and 80.9MB in the end (delta: 73.3MB). Peak memory consumption was 75.5MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 161.71ms. Allocated memory is still 201.3MB. Free memory was 80.9MB in the beginning and 129.8MB in the end (delta: -48.9MB). Peak memory consumption was 56.7MB. Max. memory is 16.1GB. * Boogie Preprocessor took 180.61ms. Allocated memory is still 201.3MB. Free memory was 129.8MB in the beginning and 74.0MB in the end (delta: 55.8MB). Peak memory consumption was 50.3MB. Max. memory is 16.1GB. * IcfgBuilder took 2086.29ms. Allocated memory was 201.3MB in the beginning and 268.4MB in the end (delta: 67.1MB). Free memory was 74.0MB in the beginning and 153.0MB in the end (delta: -79.0MB). Peak memory consumption was 53.8MB. Max. memory is 16.1GB. * TraceAbstraction took 41944.40ms. Allocated memory was 268.4MB in the beginning and 394.3MB in the end (delta: 125.8MB). Free memory was 151.4MB in the beginning and 179.6MB in the end (delta: -28.2MB). Peak memory consumption was 816.4MB. Max. memory is 16.1GB. * Witness Printer took 178.92ms. Allocated memory is still 394.3MB. Free memory was 179.6MB in the beginning and 154.4MB in the end (delta: 25.2MB). Peak memory consumption was 25.2MB. 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 - PositiveResult [Line: 140]: a call to reach_error is unreachable For all program executions holds that a call to reach_error is unreachable at this location - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 424 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 39.6s, OverallIterations: 22, TraceHistogramMax: 6, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.1s, AutomataDifference: 27.0s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 9921 SdHoareTripleChecker+Valid, 24.7s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 9921 mSDsluCounter, 8631 SdHoareTripleChecker+Invalid, 20.9s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 1034 mSDsCounter, 4372 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 27922 IncrementalHoareTripleChecker+Invalid, 32294 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 4372 mSolverCounterUnsat, 7597 mSDtfsCounter, 27922 mSolverCounterSat, 0.1s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 3256 GetRequests, 3207 SyntacticMatches, 0 SemanticMatches, 49 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 45 ImplicationChecksByTransitivity, 0.2s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=19523occurred in iteration=18, InterpolantAutomatonStates: 81, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 2.1s AutomataMinimizationTime, 22 MinimizatonAttempts, 23708 StatesRemovedByMinimization, 18 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.3s SsaConstructionTime, 1.0s SatisfiabilityAnalysisTime, 7.3s InterpolantComputationTime, 13495 NumberOfCodeBlocks, 13495 NumberOfCodeBlocksAsserted, 26 NumberOfCheckSat, 14073 ConstructedInterpolants, 0 QuantifiedInterpolants, 40984 SizeOfPredicates, 5 NumberOfNonLiveVariables, 3148 ConjunctsInSsa, 14 ConjunctsInUnsatCore, 27 InterpolantComputations, 21 PerfectInterpolantSequences, 16417/16881 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 - AllSpecificationsHoldResult: All specifications hold 1 specifications checked. All of them hold - InvariantResult [Line: 1776]: Location Invariant Derived location invariant: ((((((((((((((((((((((((((((((long long) 89 + a4) <= 0) && (a2 == 1)) && (((long long) a0 + 61) <= 0)) || (((((long long) 89 + a4) <= 0) && (0 <= ((long long) a0 + 60))) && (5 <= a2))) || (((((long long) 89 + a4) <= 0) && (((long long) 98 + a0) <= 0)) && (5 <= a2))) || (((((((long long) a0 + 105) <= 0) && (((long long) 42 + a4) <= 0)) && (0 <= ((long long) a4 + 85))) && (44 <= a29)) && (a2 == 4))) || (((((((long long) 42 + a4) <= 0) && (44 <= a29)) && (((long long) 98 + a0) <= 0)) && (0 <= ((long long) 146 + a0))) && (5 <= a2))) || ((((((long long) a0 + 105) <= 0) && (((long long) 42 + a4) <= 0)) && (3 == a2)) && (a29 <= 43))) || (((((long long) 89 + a4) <= 0) && (a2 == 4)) && (a29 <= 43))) || ((((((long long) 42 + a4) <= 0) && (0 <= ((long long) a4 + 85))) && (((long long) a0 + 147) <= 0)) && (3 == a2))) || (((((long long) 98 + a0) <= 0) && (0 <= ((long long) 146 + a0))) && ((((((long long) a0 + 105) <= 0) && (((long long) 42 + a4) <= 0)) && (5 <= a2)) || (((((long long) 42 + a4) <= 0) && (0 <= ((long long) a4 + 85))) && (5 <= a2))))) || ((2 == a2) && (((long long) 89 + a4) <= 0))) || ((((((a2 == 1) && (((long long) a0 + 61) <= 0)) || ((0 <= ((long long) a4 + 85)) && (a2 == 1))) && (0 <= ((long long) 599999 + a0))) && (((long long) 42 + a4) <= 0)) && (a29 <= 43))) || ((((((long long) 42 + a4) <= 0) && (44 <= a29)) && (((long long) a0 + 147) <= 0)) && (a2 == 1))) || (((((0 <= ((long long) 599999 + a0)) && (((long long) 42 + a4) <= 0)) && (0 <= ((long long) a4 + 85))) && (((long long) a0 + 147) <= 0)) && (5 <= a2))) || (((((long long) 89 + a4) <= 0) && (5 <= a2)) && (((long long) a29 + 127) <= 0))) || ((((((long long) 42 + a4) <= 0) && (2 == a2)) && (44 <= a29)) && (((long long) 98 + a0) <= 0))) || ((((((long long) 42 + a4) <= 0) && (((long long) 98 + a0) <= 0)) && (0 <= ((long long) 146 + a0))) && (3 == a2))) || (((44 <= a29) && (((long long) 89 + a4) <= 0)) && (5 <= a2))) || (((((long long) 89 + a4) <= 0) && (a2 == 4)) && (((long long) a0 + 61) <= 0))) || (((a2 == 1) && (((long long) a4 + 86) <= 0)) && (((long long) a29 + 144) <= 0))) || (((((0 <= ((long long) 599999 + a0)) && (((long long) 42 + a4) <= 0)) && (44 <= a29)) && (((long long) a0 + 147) <= 0)) && (5 <= a2))) || ((((long long) 89 + a4) <= 0) && (3 == a2))) || (((((long long) 42 + a4) <= 0) && (((long long) a0 + 147) <= 0)) && (a2 == 4))) || ((((((long long) 89 + a4) <= 0) && (a2 == 1)) && (0 <= ((long long) 44 + a0))) && (((long long) a29 + 127) == 0))) || ((((((long long) 42 + a4) <= 0) && (((long long) 98 + a0) <= 0)) && (0 <= ((long long) 146 + a0))) && (a2 == 1))) || (((((long long) a0 + 105) <= 0) && (2 == a2)) && (44 <= a29))) || ((((((long long) 42 + a4) <= 0) && (2 == a2)) && (0 <= ((long long) a4 + 85))) && (((long long) 98 + a0) <= 0))) RESULT: Ultimate proved your program to be correct! [2025-03-03 10:53:37,924 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 Writing output log to file Ultimate.log Result: TRUE