./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/eca-rers2012/Problem13_label46.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/Problem13_label46.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 829096e7f479f5346a6eede2bd426bfcc729b36401312306aa48ba670b26d42a --- Real Ultimate output --- This is Ultimate 0.3.0-?-798a7b3-m [2025-03-03 10:44:43,543 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-03 10:44:43,591 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2025-03-03 10:44:43,595 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-03 10:44:43,595 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-03 10:44:43,613 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-03 10:44:43,613 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-03 10:44:43,614 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-03 10:44:43,614 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-03 10:44:43,614 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-03 10:44:43,614 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-03 10:44:43,614 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-03 10:44:43,614 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-03 10:44:43,614 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-03 10:44:43,615 INFO L153 SettingsManager]: * Use SBE=true [2025-03-03 10:44:43,615 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-03 10:44:43,615 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-03 10:44:43,615 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-03 10:44:43,615 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-03 10:44:43,615 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-03 10:44:43,616 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-03 10:44:43,616 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-03 10:44:43,616 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-03 10:44:43,616 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-03 10:44:43,616 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-03 10:44:43,616 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-03 10:44:43,616 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-03 10:44:43,616 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-03 10:44:43,616 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-03 10:44:43,617 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-03 10:44:43,617 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-03 10:44:43,617 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-03 10:44:43,617 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-03 10:44:43,617 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-03 10:44:43,617 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-03 10:44:43,617 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-03 10:44:43,617 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-03 10:44:43,617 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-03 10:44:43,617 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-03 10:44:43,617 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-03 10:44:43,617 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-03 10:44:43,617 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-03 10:44:43,617 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-03 10:44:43,617 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 -> 829096e7f479f5346a6eede2bd426bfcc729b36401312306aa48ba670b26d42a [2025-03-03 10:44:43,842 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-03 10:44:43,850 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-03 10:44:43,852 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-03 10:44:43,854 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-03 10:44:43,854 INFO L274 PluginConnector]: CDTParser initialized [2025-03-03 10:44:43,855 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/eca-rers2012/Problem13_label46.c [2025-03-03 10:44:45,014 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/79075c9cf/20719e5e244b40899ac3e64e1e739278/FLAG239ccb690 [2025-03-03 10:44:45,427 INFO L384 CDTParser]: Found 1 translation units. [2025-03-03 10:44:45,428 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/eca-rers2012/Problem13_label46.c [2025-03-03 10:44:45,455 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/79075c9cf/20719e5e244b40899ac3e64e1e739278/FLAG239ccb690 [2025-03-03 10:44:45,588 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/79075c9cf/20719e5e244b40899ac3e64e1e739278 [2025-03-03 10:44:45,590 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-03 10:44:45,591 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-03 10:44:45,592 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-03 10:44:45,592 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-03 10:44:45,595 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-03 10:44:45,595 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 03.03 10:44:45" (1/1) ... [2025-03-03 10:44:45,596 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@360e961e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 10:44:45, skipping insertion in model container [2025-03-03 10:44:45,596 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 03.03 10:44:45" (1/1) ... [2025-03-03 10:44:45,679 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-03 10:44:45,881 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/Problem13_label46.c[9366,9379] [2025-03-03 10:44:46,330 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-03 10:44:46,338 INFO L200 MainTranslator]: Completed pre-run [2025-03-03 10:44:46,362 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/Problem13_label46.c[9366,9379] [2025-03-03 10:44:46,655 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-03 10:44:46,672 INFO L204 MainTranslator]: Completed translation [2025-03-03 10:44:46,672 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 10:44:46 WrapperNode [2025-03-03 10:44:46,673 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-03 10:44:46,674 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-03 10:44:46,674 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-03 10:44:46,674 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-03 10:44:46,678 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:44:46" (1/1) ... [2025-03-03 10:44:46,723 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:44:46" (1/1) ... [2025-03-03 10:44:47,051 INFO L138 Inliner]: procedures = 17, calls = 11, calls flagged for inlining = 6, calls inlined = 6, statements flattened = 5584 [2025-03-03 10:44:47,052 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-03 10:44:47,052 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-03 10:44:47,052 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-03 10:44:47,053 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-03 10:44:47,059 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 10:44:46" (1/1) ... [2025-03-03 10:44:47,060 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 10:44:46" (1/1) ... [2025-03-03 10:44:47,130 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 10:44:46" (1/1) ... [2025-03-03 10:44:47,339 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:44:47,342 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 10:44:46" (1/1) ... [2025-03-03 10:44:47,342 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 10:44:46" (1/1) ... [2025-03-03 10:44:47,493 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 10:44:46" (1/1) ... [2025-03-03 10:44:47,520 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 10:44:46" (1/1) ... [2025-03-03 10:44:47,550 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 10:44:46" (1/1) ... [2025-03-03 10:44:47,589 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 10:44:46" (1/1) ... [2025-03-03 10:44:47,711 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-03 10:44:47,716 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-03 10:44:47,716 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-03 10:44:47,716 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-03 10:44:47,717 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 10:44:46" (1/1) ... [2025-03-03 10:44:47,727 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-03 10:44:47,737 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 10:44:47,749 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:44:47,752 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:44:47,769 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-03 10:44:47,770 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-03-03 10:44:47,770 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-03 10:44:47,770 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-03 10:44:47,823 INFO L256 CfgBuilder]: Building ICFG [2025-03-03 10:44:47,825 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-03 10:44:51,707 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L1894: havoc calculate_output_#t~ret9#1; [2025-03-03 10:44:51,707 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L3629: havoc calculate_output2_#t~ret10#1; [2025-03-03 10:44:51,707 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L5351: havoc calculate_output3_#t~ret11#1; [2025-03-03 10:44:51,850 INFO L? ?]: Removed 738 outVars from TransFormulas that were not future-live. [2025-03-03 10:44:51,851 INFO L307 CfgBuilder]: Performing block encoding [2025-03-03 10:44:51,886 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-03 10:44:51,889 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-03 10:44:51,889 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 03.03 10:44:51 BoogieIcfgContainer [2025-03-03 10:44:51,890 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-03 10:44:51,891 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-03 10:44:51,891 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-03 10:44:51,894 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-03 10:44:51,895 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 03.03 10:44:45" (1/3) ... [2025-03-03 10:44:51,895 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6512c9fe and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 03.03 10:44:51, skipping insertion in model container [2025-03-03 10:44:51,896 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 10:44:46" (2/3) ... [2025-03-03 10:44:51,896 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6512c9fe and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 03.03 10:44:51, skipping insertion in model container [2025-03-03 10:44:51,896 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 03.03 10:44:51" (3/3) ... [2025-03-03 10:44:51,897 INFO L128 eAbstractionObserver]: Analyzing ICFG Problem13_label46.c [2025-03-03 10:44:51,909 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-03 10:44:51,910 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG Problem13_label46.c that has 1 procedures, 1098 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-03-03 10:44:51,980 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-03 10:44:51,989 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;@139e90c, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-03 10:44:51,989 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-03-03 10:44:51,994 INFO L276 IsEmpty]: Start isEmpty. Operand has 1098 states, 1096 states have (on average 1.8266423357664234) internal successors, (2002), 1097 states have internal predecessors, (2002), 0 states have call successors, (0), 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:44:51,999 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2025-03-03 10:44:51,999 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 10:44:51,999 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, 1, 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:44:52,000 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 10:44:52,003 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 10:44:52,003 INFO L85 PathProgramCache]: Analyzing trace with hash 850615812, now seen corresponding path program 1 times [2025-03-03 10:44:52,008 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 10:44:52,008 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1122007758] [2025-03-03 10:44:52,008 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 10:44:52,009 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 10:44:52,058 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 66 statements into 1 equivalence classes. [2025-03-03 10:44:52,104 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 66 of 66 statements. [2025-03-03 10:44:52,104 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 10:44:52,104 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 10:44:52,528 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:44:52,530 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 10:44:52,531 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1122007758] [2025-03-03 10:44:52,532 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1122007758] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 10:44:52,532 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 10:44:52,532 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-03 10:44:52,533 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1696164675] [2025-03-03 10:44:52,533 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 10:44:52,537 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-03 10:44:52,538 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 10:44:52,549 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-03 10:44:52,550 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-03 10:44:52,554 INFO L87 Difference]: Start difference. First operand has 1098 states, 1096 states have (on average 1.8266423357664234) internal successors, (2002), 1097 states have internal predecessors, (2002), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 4 states, 4 states have (on average 16.5) internal successors, (66), 3 states have internal predecessors, (66), 0 states have call successors, (0), 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:44:57,499 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 10:44:57,500 INFO L93 Difference]: Finished difference Result 3829 states and 7202 transitions. [2025-03-03 10:44:57,501 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-03 10:44:57,502 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 16.5) internal successors, (66), 3 states have internal predecessors, (66), 0 states have call successors, (0), 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 66 [2025-03-03 10:44:57,503 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 10:44:57,520 INFO L225 Difference]: With dead ends: 3829 [2025-03-03 10:44:57,520 INFO L226 Difference]: Without dead ends: 2664 [2025-03-03 10:44:57,525 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:44:57,527 INFO L435 NwaCegarLoop]: 753 mSDtfsCounter, 2661 mSDsluCounter, 298 mSDsCounter, 0 mSdLazyCounter, 4246 mSolverCounterSat, 1607 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2661 SdHoareTripleChecker+Valid, 1051 SdHoareTripleChecker+Invalid, 5853 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1607 IncrementalHoareTripleChecker+Valid, 4246 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.8s IncrementalHoareTripleChecker+Time [2025-03-03 10:44:57,528 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2661 Valid, 1051 Invalid, 5853 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1607 Valid, 4246 Invalid, 0 Unknown, 0 Unchecked, 4.8s Time] [2025-03-03 10:44:57,542 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2664 states. [2025-03-03 10:44:57,622 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2664 to 2663. [2025-03-03 10:44:57,626 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2663 states, 2662 states have (on average 1.460931630353118) internal successors, (3889), 2662 states have internal predecessors, (3889), 0 states have call successors, (0), 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:44:57,635 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2663 states to 2663 states and 3889 transitions. [2025-03-03 10:44:57,636 INFO L78 Accepts]: Start accepts. Automaton has 2663 states and 3889 transitions. Word has length 66 [2025-03-03 10:44:57,637 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 10:44:57,637 INFO L471 AbstractCegarLoop]: Abstraction has 2663 states and 3889 transitions. [2025-03-03 10:44:57,637 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 16.5) internal successors, (66), 3 states have internal predecessors, (66), 0 states have call successors, (0), 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:44:57,637 INFO L276 IsEmpty]: Start isEmpty. Operand 2663 states and 3889 transitions. [2025-03-03 10:44:57,645 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 192 [2025-03-03 10:44:57,645 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 10:44:57,645 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, 2, 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] [2025-03-03 10:44:57,646 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-03-03 10:44:57,646 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 10:44:57,646 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 10:44:57,646 INFO L85 PathProgramCache]: Analyzing trace with hash -907482408, now seen corresponding path program 1 times [2025-03-03 10:44:57,646 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 10:44:57,647 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [804470727] [2025-03-03 10:44:57,647 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 10:44:57,647 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 10:44:57,668 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 191 statements into 1 equivalence classes. [2025-03-03 10:44:57,695 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 191 of 191 statements. [2025-03-03 10:44:57,695 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 10:44:57,695 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 10:44:57,915 INFO L134 CoverageAnalysis]: Checked inductivity of 63 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 63 trivial. 0 not checked. [2025-03-03 10:44:57,915 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 10:44:57,915 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [804470727] [2025-03-03 10:44:57,915 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [804470727] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 10:44:57,915 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 10:44:57,915 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-03 10:44:57,915 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1214276358] [2025-03-03 10:44:57,915 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 10:44:57,916 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-03 10:44:57,916 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 10:44:57,916 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-03 10:44:57,916 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 10:44:57,917 INFO L87 Difference]: Start difference. First operand 2663 states and 3889 transitions. Second operand has 3 states, 3 states have (on average 43.0) internal successors, (129), 2 states have internal predecessors, (129), 0 states have call successors, (0), 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:45:00,737 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 10:45:00,737 INFO L93 Difference]: Finished difference Result 6142 states and 9712 transitions. [2025-03-03 10:45:00,738 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-03 10:45:00,738 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 43.0) internal successors, (129), 2 states have internal predecessors, (129), 0 states have call successors, (0), 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 191 [2025-03-03 10:45:00,738 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 10:45:00,750 INFO L225 Difference]: With dead ends: 6142 [2025-03-03 10:45:00,750 INFO L226 Difference]: Without dead ends: 4268 [2025-03-03 10:45:00,752 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:45:00,753 INFO L435 NwaCegarLoop]: 1038 mSDtfsCounter, 743 mSDsluCounter, 149 mSDsCounter, 0 mSdLazyCounter, 2508 mSolverCounterSat, 778 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 743 SdHoareTripleChecker+Valid, 1187 SdHoareTripleChecker+Invalid, 3286 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 778 IncrementalHoareTripleChecker+Valid, 2508 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.7s IncrementalHoareTripleChecker+Time [2025-03-03 10:45:00,753 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [743 Valid, 1187 Invalid, 3286 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [778 Valid, 2508 Invalid, 0 Unknown, 0 Unchecked, 2.7s Time] [2025-03-03 10:45:00,756 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4268 states. [2025-03-03 10:45:00,796 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4268 to 4254. [2025-03-03 10:45:00,801 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4254 states, 4253 states have (on average 1.3515165765342112) internal successors, (5748), 4253 states have internal predecessors, (5748), 0 states have call successors, (0), 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:45:00,806 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4254 states to 4254 states and 5748 transitions. [2025-03-03 10:45:00,806 INFO L78 Accepts]: Start accepts. Automaton has 4254 states and 5748 transitions. Word has length 191 [2025-03-03 10:45:00,807 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 10:45:00,807 INFO L471 AbstractCegarLoop]: Abstraction has 4254 states and 5748 transitions. [2025-03-03 10:45:00,807 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 43.0) internal successors, (129), 2 states have internal predecessors, (129), 0 states have call successors, (0), 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:45:00,807 INFO L276 IsEmpty]: Start isEmpty. Operand 4254 states and 5748 transitions. [2025-03-03 10:45:00,809 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 234 [2025-03-03 10:45:00,809 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 10:45:00,809 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, 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, 1, 1, 1, 1, 1, 1, 1, 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:45:00,809 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-03-03 10:45:00,809 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 10:45:00,810 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 10:45:00,810 INFO L85 PathProgramCache]: Analyzing trace with hash -1948528967, now seen corresponding path program 1 times [2025-03-03 10:45:00,810 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 10:45:00,810 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1239518510] [2025-03-03 10:45:00,810 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 10:45:00,810 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 10:45:00,826 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 233 statements into 1 equivalence classes. [2025-03-03 10:45:00,845 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 233 of 233 statements. [2025-03-03 10:45:00,846 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 10:45:00,846 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 10:45:00,988 INFO L134 CoverageAnalysis]: Checked inductivity of 197 backedges. 127 proven. 0 refuted. 0 times theorem prover too weak. 70 trivial. 0 not checked. [2025-03-03 10:45:00,990 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 10:45:00,990 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1239518510] [2025-03-03 10:45:00,990 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1239518510] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 10:45:00,990 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 10:45:00,990 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-03 10:45:00,990 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1432773364] [2025-03-03 10:45:00,991 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 10:45:00,991 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-03 10:45:00,991 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 10:45:00,992 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-03 10:45:00,992 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 10:45:00,993 INFO L87 Difference]: Start difference. First operand 4254 states and 5748 transitions. Second operand has 3 states, 3 states have (on average 54.666666666666664) internal successors, (164), 2 states have internal predecessors, (164), 0 states have call successors, (0), 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:45:03,696 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 10:45:03,697 INFO L93 Difference]: Finished difference Result 10899 states and 15275 transitions. [2025-03-03 10:45:03,697 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-03 10:45:03,698 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 54.666666666666664) internal successors, (164), 2 states have internal predecessors, (164), 0 states have call successors, (0), 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 233 [2025-03-03 10:45:03,698 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 10:45:03,717 INFO L225 Difference]: With dead ends: 10899 [2025-03-03 10:45:03,718 INFO L226 Difference]: Without dead ends: 7434 [2025-03-03 10:45:03,723 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:45:03,724 INFO L435 NwaCegarLoop]: 825 mSDtfsCounter, 906 mSDsluCounter, 132 mSDsCounter, 0 mSdLazyCounter, 2568 mSolverCounterSat, 754 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 906 SdHoareTripleChecker+Valid, 957 SdHoareTripleChecker+Invalid, 3322 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 754 IncrementalHoareTripleChecker+Valid, 2568 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.6s IncrementalHoareTripleChecker+Time [2025-03-03 10:45:03,724 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [906 Valid, 957 Invalid, 3322 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [754 Valid, 2568 Invalid, 0 Unknown, 0 Unchecked, 2.6s Time] [2025-03-03 10:45:03,730 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7434 states. [2025-03-03 10:45:03,807 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7434 to 7426. [2025-03-03 10:45:03,816 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7426 states, 7425 states have (on average 1.288888888888889) internal successors, (9570), 7425 states have internal predecessors, (9570), 0 states have call successors, (0), 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:45:03,825 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7426 states to 7426 states and 9570 transitions. [2025-03-03 10:45:03,826 INFO L78 Accepts]: Start accepts. Automaton has 7426 states and 9570 transitions. Word has length 233 [2025-03-03 10:45:03,827 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 10:45:03,827 INFO L471 AbstractCegarLoop]: Abstraction has 7426 states and 9570 transitions. [2025-03-03 10:45:03,827 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 54.666666666666664) internal successors, (164), 2 states have internal predecessors, (164), 0 states have call successors, (0), 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:45:03,827 INFO L276 IsEmpty]: Start isEmpty. Operand 7426 states and 9570 transitions. [2025-03-03 10:45:03,830 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 248 [2025-03-03 10:45:03,830 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 10:45:03,830 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, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 10:45:03,830 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-03-03 10:45:03,831 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 10:45:03,832 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 10:45:03,833 INFO L85 PathProgramCache]: Analyzing trace with hash 1206450738, now seen corresponding path program 1 times [2025-03-03 10:45:03,833 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 10:45:03,833 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1216937443] [2025-03-03 10:45:03,833 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 10:45:03,833 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 10:45:03,915 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 247 statements into 1 equivalence classes. [2025-03-03 10:45:03,933 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 247 of 247 statements. [2025-03-03 10:45:03,934 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 10:45:03,934 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 10:45:04,065 INFO L134 CoverageAnalysis]: Checked inductivity of 211 backedges. 127 proven. 0 refuted. 0 times theorem prover too weak. 84 trivial. 0 not checked. [2025-03-03 10:45:04,066 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 10:45:04,066 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1216937443] [2025-03-03 10:45:04,066 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1216937443] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 10:45:04,066 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 10:45:04,067 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-03 10:45:04,067 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [65580125] [2025-03-03 10:45:04,067 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 10:45:04,067 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-03 10:45:04,067 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 10:45:04,068 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-03 10:45:04,068 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 10:45:04,068 INFO L87 Difference]: Start difference. First operand 7426 states and 9570 transitions. Second operand has 3 states, 3 states have (on average 54.666666666666664) internal successors, (164), 2 states have internal predecessors, (164), 0 states have call successors, (0), 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:45:06,596 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 10:45:06,596 INFO L93 Difference]: Finished difference Result 19621 states and 25905 transitions. [2025-03-03 10:45:06,597 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-03 10:45:06,597 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 54.666666666666664) internal successors, (164), 2 states have internal predecessors, (164), 0 states have call successors, (0), 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 247 [2025-03-03 10:45:06,597 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 10:45:06,629 INFO L225 Difference]: With dead ends: 19621 [2025-03-03 10:45:06,629 INFO L226 Difference]: Without dead ends: 12984 [2025-03-03 10:45:06,635 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:45:06,635 INFO L435 NwaCegarLoop]: 476 mSDtfsCounter, 909 mSDsluCounter, 164 mSDsCounter, 0 mSdLazyCounter, 2890 mSolverCounterSat, 539 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 909 SdHoareTripleChecker+Valid, 640 SdHoareTripleChecker+Invalid, 3429 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 539 IncrementalHoareTripleChecker+Valid, 2890 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.4s IncrementalHoareTripleChecker+Time [2025-03-03 10:45:06,636 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [909 Valid, 640 Invalid, 3429 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [539 Valid, 2890 Invalid, 0 Unknown, 0 Unchecked, 2.4s Time] [2025-03-03 10:45:06,644 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12984 states. [2025-03-03 10:45:06,805 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12984 to 12975. [2025-03-03 10:45:06,827 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 12975 states, 12974 states have (on average 1.2720826267920455) internal successors, (16504), 12974 states have internal predecessors, (16504), 0 states have call successors, (0), 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:45:06,854 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12975 states to 12975 states and 16504 transitions. [2025-03-03 10:45:06,854 INFO L78 Accepts]: Start accepts. Automaton has 12975 states and 16504 transitions. Word has length 247 [2025-03-03 10:45:06,855 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 10:45:06,855 INFO L471 AbstractCegarLoop]: Abstraction has 12975 states and 16504 transitions. [2025-03-03 10:45:06,855 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 54.666666666666664) internal successors, (164), 2 states have internal predecessors, (164), 0 states have call successors, (0), 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:45:06,855 INFO L276 IsEmpty]: Start isEmpty. Operand 12975 states and 16504 transitions. [2025-03-03 10:45:06,858 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 264 [2025-03-03 10:45:06,859 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 10:45:06,859 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, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:45:06,859 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-03-03 10:45:06,859 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 10:45:06,860 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 10:45:06,860 INFO L85 PathProgramCache]: Analyzing trace with hash 948607885, now seen corresponding path program 1 times [2025-03-03 10:45:06,860 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 10:45:06,860 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1354513220] [2025-03-03 10:45:06,860 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 10:45:06,860 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 10:45:06,888 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 263 statements into 1 equivalence classes. [2025-03-03 10:45:06,909 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 263 of 263 statements. [2025-03-03 10:45:06,909 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 10:45:06,909 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 10:45:07,111 INFO L134 CoverageAnalysis]: Checked inductivity of 198 backedges. 127 proven. 0 refuted. 0 times theorem prover too weak. 71 trivial. 0 not checked. [2025-03-03 10:45:07,112 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 10:45:07,112 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1354513220] [2025-03-03 10:45:07,112 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1354513220] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 10:45:07,112 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 10:45:07,112 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-03 10:45:07,112 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1955278669] [2025-03-03 10:45:07,112 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 10:45:07,113 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-03 10:45:07,113 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 10:45:07,113 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-03 10:45:07,114 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 10:45:07,114 INFO L87 Difference]: Start difference. First operand 12975 states and 16504 transitions. Second operand has 3 states, 3 states have (on average 64.33333333333333) internal successors, (193), 2 states have internal predecessors, (193), 0 states have call successors, (0), 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:45:09,812 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 10:45:09,812 INFO L93 Difference]: Finished difference Result 36180 states and 46598 transitions. [2025-03-03 10:45:09,814 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-03 10:45:09,814 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 64.33333333333333) internal successors, (193), 2 states have internal predecessors, (193), 0 states have call successors, (0), 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 263 [2025-03-03 10:45:09,814 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 10:45:09,852 INFO L225 Difference]: With dead ends: 36180 [2025-03-03 10:45:09,853 INFO L226 Difference]: Without dead ends: 23994 [2025-03-03 10:45:09,863 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:45:09,864 INFO L435 NwaCegarLoop]: 837 mSDtfsCounter, 857 mSDsluCounter, 147 mSDsCounter, 0 mSdLazyCounter, 2308 mSolverCounterSat, 869 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 857 SdHoareTripleChecker+Valid, 984 SdHoareTripleChecker+Invalid, 3177 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 869 IncrementalHoareTripleChecker+Valid, 2308 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.5s IncrementalHoareTripleChecker+Time [2025-03-03 10:45:09,864 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [857 Valid, 984 Invalid, 3177 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [869 Valid, 2308 Invalid, 0 Unknown, 0 Unchecked, 2.5s Time] [2025-03-03 10:45:09,881 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23994 states. [2025-03-03 10:45:10,066 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23994 to 23203. [2025-03-03 10:45:10,099 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 23203 states, 23202 states have (on average 1.2067494181536074) internal successors, (27999), 23202 states have internal predecessors, (27999), 0 states have call successors, (0), 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:45:10,124 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23203 states to 23203 states and 27999 transitions. [2025-03-03 10:45:10,124 INFO L78 Accepts]: Start accepts. Automaton has 23203 states and 27999 transitions. Word has length 263 [2025-03-03 10:45:10,125 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 10:45:10,125 INFO L471 AbstractCegarLoop]: Abstraction has 23203 states and 27999 transitions. [2025-03-03 10:45:10,125 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 64.33333333333333) internal successors, (193), 2 states have internal predecessors, (193), 0 states have call successors, (0), 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:45:10,125 INFO L276 IsEmpty]: Start isEmpty. Operand 23203 states and 27999 transitions. [2025-03-03 10:45:10,128 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 266 [2025-03-03 10:45:10,129 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 10:45:10,129 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, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 10:45:10,129 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-03-03 10:45:10,129 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 10:45:10,129 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 10:45:10,130 INFO L85 PathProgramCache]: Analyzing trace with hash -1541422555, now seen corresponding path program 1 times [2025-03-03 10:45:10,130 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 10:45:10,130 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1095064304] [2025-03-03 10:45:10,130 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 10:45:10,131 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 10:45:10,190 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 265 statements into 1 equivalence classes. [2025-03-03 10:45:10,202 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 265 of 265 statements. [2025-03-03 10:45:10,203 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 10:45:10,203 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 10:45:10,323 INFO L134 CoverageAnalysis]: Checked inductivity of 222 backedges. 222 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 10:45:10,324 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 10:45:10,324 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1095064304] [2025-03-03 10:45:10,324 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1095064304] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 10:45:10,324 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 10:45:10,324 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-03 10:45:10,324 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1925947820] [2025-03-03 10:45:10,324 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 10:45:10,325 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-03 10:45:10,325 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 10:45:10,325 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-03 10:45:10,325 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 10:45:10,325 INFO L87 Difference]: Start difference. First operand 23203 states and 27999 transitions. Second operand has 3 states, 3 states have (on average 88.33333333333333) internal successors, (265), 3 states have internal predecessors, (265), 0 states have call successors, (0), 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:45:13,087 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 10:45:13,087 INFO L93 Difference]: Finished difference Result 57432 states and 70773 transitions. [2025-03-03 10:45:13,087 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-03 10:45:13,088 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 88.33333333333333) internal successors, (265), 3 states have internal predecessors, (265), 0 states have call successors, (0), 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 265 [2025-03-03 10:45:13,088 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 10:45:13,126 INFO L225 Difference]: With dead ends: 57432 [2025-03-03 10:45:13,126 INFO L226 Difference]: Without dead ends: 35018 [2025-03-03 10:45:13,140 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:45:13,142 INFO L435 NwaCegarLoop]: 805 mSDtfsCounter, 860 mSDsluCounter, 116 mSDsCounter, 0 mSdLazyCounter, 2381 mSolverCounterSat, 914 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 860 SdHoareTripleChecker+Valid, 921 SdHoareTripleChecker+Invalid, 3295 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 914 IncrementalHoareTripleChecker+Valid, 2381 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.6s IncrementalHoareTripleChecker+Time [2025-03-03 10:45:13,142 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [860 Valid, 921 Invalid, 3295 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [914 Valid, 2381 Invalid, 0 Unknown, 0 Unchecked, 2.6s Time] [2025-03-03 10:45:13,169 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35018 states. [2025-03-03 10:45:13,413 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35018 to 35009. [2025-03-03 10:45:13,444 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 35009 states, 35008 states have (on average 1.183786563071298) internal successors, (41442), 35008 states have internal predecessors, (41442), 0 states have call successors, (0), 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:45:13,478 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35009 states to 35009 states and 41442 transitions. [2025-03-03 10:45:13,479 INFO L78 Accepts]: Start accepts. Automaton has 35009 states and 41442 transitions. Word has length 265 [2025-03-03 10:45:13,479 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 10:45:13,480 INFO L471 AbstractCegarLoop]: Abstraction has 35009 states and 41442 transitions. [2025-03-03 10:45:13,480 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 88.33333333333333) internal successors, (265), 3 states have internal predecessors, (265), 0 states have call successors, (0), 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:45:13,480 INFO L276 IsEmpty]: Start isEmpty. Operand 35009 states and 41442 transitions. [2025-03-03 10:45:13,485 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 350 [2025-03-03 10:45:13,485 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 10:45:13,485 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, 4, 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, 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] [2025-03-03 10:45:13,485 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-03-03 10:45:13,485 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 10:45:13,486 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 10:45:13,486 INFO L85 PathProgramCache]: Analyzing trace with hash 2059168072, now seen corresponding path program 1 times [2025-03-03 10:45:13,486 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 10:45:13,486 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1700528881] [2025-03-03 10:45:13,486 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 10:45:13,486 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 10:45:13,508 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 349 statements into 1 equivalence classes. [2025-03-03 10:45:13,593 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 349 of 349 statements. [2025-03-03 10:45:13,593 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 10:45:13,593 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 10:45:14,007 INFO L134 CoverageAnalysis]: Checked inductivity of 453 backedges. 389 proven. 0 refuted. 0 times theorem prover too weak. 64 trivial. 0 not checked. [2025-03-03 10:45:14,009 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 10:45:14,010 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1700528881] [2025-03-03 10:45:14,010 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1700528881] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 10:45:14,010 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 10:45:14,010 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-03 10:45:14,010 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [852325030] [2025-03-03 10:45:14,010 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 10:45:14,010 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-03 10:45:14,011 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 10:45:14,011 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-03 10:45:14,011 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-03-03 10:45:14,011 INFO L87 Difference]: Start difference. First operand 35009 states and 41442 transitions. Second operand has 4 states, 4 states have (on average 71.5) internal successors, (286), 3 states have internal predecessors, (286), 0 states have call successors, (0), 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:45:18,815 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 10:45:18,815 INFO L93 Difference]: Finished difference Result 122186 states and 145951 transitions. [2025-03-03 10:45:18,816 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-03 10:45:18,816 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 71.5) internal successors, (286), 3 states have internal predecessors, (286), 0 states have call successors, (0), 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 349 [2025-03-03 10:45:18,816 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 10:45:18,910 INFO L225 Difference]: With dead ends: 122186 [2025-03-03 10:45:18,910 INFO L226 Difference]: Without dead ends: 87966 [2025-03-03 10:45:18,934 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:45:18,934 INFO L435 NwaCegarLoop]: 498 mSDtfsCounter, 1739 mSDsluCounter, 201 mSDsCounter, 0 mSdLazyCounter, 6066 mSolverCounterSat, 1187 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1739 SdHoareTripleChecker+Valid, 699 SdHoareTripleChecker+Invalid, 7253 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1187 IncrementalHoareTripleChecker+Valid, 6066 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.4s IncrementalHoareTripleChecker+Time [2025-03-03 10:45:18,935 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1739 Valid, 699 Invalid, 7253 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1187 Valid, 6066 Invalid, 0 Unknown, 0 Unchecked, 4.4s Time] [2025-03-03 10:45:18,993 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 87966 states. [2025-03-03 10:45:19,716 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 87966 to 87836. [2025-03-03 10:45:19,789 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 87836 states, 87835 states have (on average 1.1674844879603803) internal successors, (102546), 87835 states have internal predecessors, (102546), 0 states have call successors, (0), 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:45:19,933 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 87836 states to 87836 states and 102546 transitions. [2025-03-03 10:45:19,934 INFO L78 Accepts]: Start accepts. Automaton has 87836 states and 102546 transitions. Word has length 349 [2025-03-03 10:45:19,935 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 10:45:19,935 INFO L471 AbstractCegarLoop]: Abstraction has 87836 states and 102546 transitions. [2025-03-03 10:45:19,935 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 71.5) internal successors, (286), 3 states have internal predecessors, (286), 0 states have call successors, (0), 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:45:19,935 INFO L276 IsEmpty]: Start isEmpty. Operand 87836 states and 102546 transitions. [2025-03-03 10:45:19,940 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 364 [2025-03-03 10:45:19,940 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 10:45:19,941 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, 4, 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, 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] [2025-03-03 10:45:19,941 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-03-03 10:45:19,942 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 10:45:19,942 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 10:45:19,942 INFO L85 PathProgramCache]: Analyzing trace with hash -1274989116, now seen corresponding path program 1 times [2025-03-03 10:45:19,942 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 10:45:19,942 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1475708297] [2025-03-03 10:45:19,943 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 10:45:19,943 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 10:45:19,964 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 363 statements into 1 equivalence classes. [2025-03-03 10:45:19,976 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 363 of 363 statements. [2025-03-03 10:45:19,976 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 10:45:19,976 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 10:45:20,361 INFO L134 CoverageAnalysis]: Checked inductivity of 455 backedges. 391 proven. 0 refuted. 0 times theorem prover too weak. 64 trivial. 0 not checked. [2025-03-03 10:45:20,361 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 10:45:20,361 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1475708297] [2025-03-03 10:45:20,361 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1475708297] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 10:45:20,361 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 10:45:20,361 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-03 10:45:20,361 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [54611051] [2025-03-03 10:45:20,361 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 10:45:20,361 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-03 10:45:20,362 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 10:45:20,362 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-03 10:45:20,362 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 10:45:20,362 INFO L87 Difference]: Start difference. First operand 87836 states and 102546 transitions. Second operand has 3 states, 3 states have (on average 100.0) internal successors, (300), 3 states have internal predecessors, (300), 0 states have call successors, (0), 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:45:23,302 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 10:45:23,303 INFO L93 Difference]: Finished difference Result 174918 states and 204355 transitions. [2025-03-03 10:45:23,304 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-03 10:45:23,304 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 100.0) internal successors, (300), 3 states have internal predecessors, (300), 0 states have call successors, (0), 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 363 [2025-03-03 10:45:23,304 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 10:45:23,406 INFO L225 Difference]: With dead ends: 174918 [2025-03-03 10:45:23,407 INFO L226 Difference]: Without dead ends: 87871 [2025-03-03 10:45:23,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:45:23,458 INFO L435 NwaCegarLoop]: 1851 mSDtfsCounter, 754 mSDsluCounter, 141 mSDsCounter, 0 mSdLazyCounter, 2597 mSolverCounterSat, 311 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 754 SdHoareTripleChecker+Valid, 1992 SdHoareTripleChecker+Invalid, 2908 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 311 IncrementalHoareTripleChecker+Valid, 2597 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.5s IncrementalHoareTripleChecker+Time [2025-03-03 10:45:23,458 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [754 Valid, 1992 Invalid, 2908 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [311 Valid, 2597 Invalid, 0 Unknown, 0 Unchecked, 2.5s Time] [2025-03-03 10:45:23,574 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 87871 states. [2025-03-03 10:45:24,228 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 87871 to 87837. [2025-03-03 10:45:24,283 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 87837 states, 87836 states have (on average 1.151657634682818) internal successors, (101157), 87836 states have internal predecessors, (101157), 0 states have call successors, (0), 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:45:24,391 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 87837 states to 87837 states and 101157 transitions. [2025-03-03 10:45:24,392 INFO L78 Accepts]: Start accepts. Automaton has 87837 states and 101157 transitions. Word has length 363 [2025-03-03 10:45:24,392 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 10:45:24,392 INFO L471 AbstractCegarLoop]: Abstraction has 87837 states and 101157 transitions. [2025-03-03 10:45:24,392 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 100.0) internal successors, (300), 3 states have internal predecessors, (300), 0 states have call successors, (0), 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:45:24,393 INFO L276 IsEmpty]: Start isEmpty. Operand 87837 states and 101157 transitions. [2025-03-03 10:45:24,398 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 384 [2025-03-03 10:45:24,398 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 10:45:24,399 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, 4, 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, 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:45:24,399 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-03-03 10:45:24,399 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 10:45:24,400 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 10:45:24,400 INFO L85 PathProgramCache]: Analyzing trace with hash -1928848523, now seen corresponding path program 1 times [2025-03-03 10:45:24,400 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 10:45:24,400 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [339988895] [2025-03-03 10:45:24,400 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 10:45:24,400 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 10:45:24,439 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 383 statements into 1 equivalence classes. [2025-03-03 10:45:24,455 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 383 of 383 statements. [2025-03-03 10:45:24,455 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 10:45:24,455 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 10:45:24,568 INFO L134 CoverageAnalysis]: Checked inductivity of 470 backedges. 406 proven. 0 refuted. 0 times theorem prover too weak. 64 trivial. 0 not checked. [2025-03-03 10:45:24,569 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 10:45:24,569 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [339988895] [2025-03-03 10:45:24,569 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [339988895] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 10:45:24,569 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 10:45:24,569 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-03 10:45:24,569 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1994973146] [2025-03-03 10:45:24,569 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 10:45:24,569 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-03 10:45:24,570 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 10:45:24,570 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-03 10:45:24,570 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 10:45:24,570 INFO L87 Difference]: Start difference. First operand 87837 states and 101157 transitions. Second operand has 3 states, 3 states have (on average 106.66666666666667) internal successors, (320), 3 states have internal predecessors, (320), 0 states have call successors, (0), 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:45:27,242 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 10:45:27,243 INFO L93 Difference]: Finished difference Result 175646 states and 202091 transitions. [2025-03-03 10:45:27,243 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-03 10:45:27,244 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 106.66666666666667) internal successors, (320), 3 states have internal predecessors, (320), 0 states have call successors, (0), 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 383 [2025-03-03 10:45:27,244 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 10:45:27,336 INFO L225 Difference]: With dead ends: 175646 [2025-03-03 10:45:27,336 INFO L226 Difference]: Without dead ends: 88598 [2025-03-03 10:45:27,372 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:45:27,372 INFO L435 NwaCegarLoop]: 1512 mSDtfsCounter, 1037 mSDsluCounter, 136 mSDsCounter, 0 mSdLazyCounter, 2348 mSolverCounterSat, 595 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1037 SdHoareTripleChecker+Valid, 1648 SdHoareTripleChecker+Invalid, 2943 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 595 IncrementalHoareTripleChecker+Valid, 2348 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.3s IncrementalHoareTripleChecker+Time [2025-03-03 10:45:27,373 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1037 Valid, 1648 Invalid, 2943 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [595 Valid, 2348 Invalid, 0 Unknown, 0 Unchecked, 2.3s Time] [2025-03-03 10:45:27,422 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 88598 states. [2025-03-03 10:45:27,985 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 88598 to 81500. [2025-03-03 10:45:28,040 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 81500 states, 81499 states have (on average 1.104283488140959) internal successors, (89998), 81499 states have internal predecessors, (89998), 0 states have call successors, (0), 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:45:28,111 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 81500 states to 81500 states and 89998 transitions. [2025-03-03 10:45:28,111 INFO L78 Accepts]: Start accepts. Automaton has 81500 states and 89998 transitions. Word has length 383 [2025-03-03 10:45:28,112 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 10:45:28,112 INFO L471 AbstractCegarLoop]: Abstraction has 81500 states and 89998 transitions. [2025-03-03 10:45:28,112 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 106.66666666666667) internal successors, (320), 3 states have internal predecessors, (320), 0 states have call successors, (0), 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:45:28,112 INFO L276 IsEmpty]: Start isEmpty. Operand 81500 states and 89998 transitions. [2025-03-03 10:45:28,115 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 393 [2025-03-03 10:45:28,115 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 10:45:28,115 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, 4, 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, 2, 2, 2, 2, 2, 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] [2025-03-03 10:45:28,115 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-03-03 10:45:28,115 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 10:45:28,116 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 10:45:28,116 INFO L85 PathProgramCache]: Analyzing trace with hash -1386809789, now seen corresponding path program 1 times [2025-03-03 10:45:28,116 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 10:45:28,116 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [755039018] [2025-03-03 10:45:28,116 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 10:45:28,116 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 10:45:28,137 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 392 statements into 1 equivalence classes. [2025-03-03 10:45:28,147 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 392 of 392 statements. [2025-03-03 10:45:28,147 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 10:45:28,147 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 10:45:29,030 INFO L134 CoverageAnalysis]: Checked inductivity of 473 backedges. 299 proven. 110 refuted. 0 times theorem prover too weak. 64 trivial. 0 not checked. [2025-03-03 10:45:29,030 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 10:45:29,031 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [755039018] [2025-03-03 10:45:29,031 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [755039018] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-03 10:45:29,031 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [52477815] [2025-03-03 10:45:29,031 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 10:45:29,031 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 10:45:29,031 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 10:45:29,033 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:45:29,035 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:45:29,101 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 392 statements into 1 equivalence classes. [2025-03-03 10:45:29,174 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 392 of 392 statements. [2025-03-03 10:45:29,174 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 10:45:29,174 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 10:45:29,176 INFO L256 TraceCheckSpWp]: Trace formula consists of 529 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-03-03 10:45:29,185 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 10:45:29,363 INFO L134 CoverageAnalysis]: Checked inductivity of 473 backedges. 296 proven. 0 refuted. 0 times theorem prover too weak. 177 trivial. 0 not checked. [2025-03-03 10:45:29,363 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-03 10:45:29,363 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [52477815] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 10:45:29,363 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-03 10:45:29,364 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [5] total 7 [2025-03-03 10:45:29,364 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [669817762] [2025-03-03 10:45:29,364 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 10:45:29,364 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-03 10:45:29,364 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 10:45:29,365 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-03 10:45:29,365 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2025-03-03 10:45:29,365 INFO L87 Difference]: Start difference. First operand 81500 states and 89998 transitions. Second operand has 3 states, 3 states have (on average 72.33333333333333) internal successors, (217), 3 states have internal predecessors, (217), 0 states have call successors, (0), 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:45:31,898 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 10:45:31,898 INFO L93 Difference]: Finished difference Result 162209 states and 179201 transitions. [2025-03-03 10:45:31,898 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-03 10:45:31,898 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 72.33333333333333) internal successors, (217), 3 states have internal predecessors, (217), 0 states have call successors, (0), 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 392 [2025-03-03 10:45:31,899 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 10:45:31,988 INFO L225 Difference]: With dead ends: 162209 [2025-03-03 10:45:31,988 INFO L226 Difference]: Without dead ends: 81498 [2025-03-03 10:45:32,033 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 396 GetRequests, 391 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2025-03-03 10:45:32,034 INFO L435 NwaCegarLoop]: 1346 mSDtfsCounter, 1113 mSDsluCounter, 80 mSDsCounter, 0 mSdLazyCounter, 2463 mSolverCounterSat, 444 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1113 SdHoareTripleChecker+Valid, 1426 SdHoareTripleChecker+Invalid, 2907 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 444 IncrementalHoareTripleChecker+Valid, 2463 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.1s IncrementalHoareTripleChecker+Time [2025-03-03 10:45:32,034 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1113 Valid, 1426 Invalid, 2907 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [444 Valid, 2463 Invalid, 0 Unknown, 0 Unchecked, 2.1s Time] [2025-03-03 10:45:32,089 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 81498 states. [2025-03-03 10:45:32,721 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 81498 to 81497. [2025-03-03 10:45:32,775 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 81497 states, 81496 states have (on average 1.0792308824973005) internal successors, (87953), 81496 states have internal predecessors, (87953), 0 states have call successors, (0), 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:45:32,845 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 81497 states to 81497 states and 87953 transitions. [2025-03-03 10:45:32,845 INFO L78 Accepts]: Start accepts. Automaton has 81497 states and 87953 transitions. Word has length 392 [2025-03-03 10:45:32,846 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 10:45:32,846 INFO L471 AbstractCegarLoop]: Abstraction has 81497 states and 87953 transitions. [2025-03-03 10:45:32,846 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 72.33333333333333) internal successors, (217), 3 states have internal predecessors, (217), 0 states have call successors, (0), 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:45:32,846 INFO L276 IsEmpty]: Start isEmpty. Operand 81497 states and 87953 transitions. [2025-03-03 10:45:32,849 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 396 [2025-03-03 10:45:32,849 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 10:45:32,849 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, 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, 3, 3, 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] [2025-03-03 10:45:32,855 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:45:33,049 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,SelfDestructingSolverStorable9 [2025-03-03 10:45:33,050 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 10:45:33,050 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 10:45:33,050 INFO L85 PathProgramCache]: Analyzing trace with hash 2076101741, now seen corresponding path program 1 times [2025-03-03 10:45:33,050 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 10:45:33,050 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1180152488] [2025-03-03 10:45:33,050 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 10:45:33,050 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 10:45:33,069 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 395 statements into 1 equivalence classes. [2025-03-03 10:45:33,091 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 395 of 395 statements. [2025-03-03 10:45:33,091 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 10:45:33,091 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 10:45:33,365 INFO L134 CoverageAnalysis]: Checked inductivity of 700 backedges. 255 proven. 0 refuted. 0 times theorem prover too weak. 445 trivial. 0 not checked. [2025-03-03 10:45:33,366 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 10:45:33,366 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1180152488] [2025-03-03 10:45:33,366 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1180152488] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 10:45:33,366 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 10:45:33,366 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-03 10:45:33,366 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2064318618] [2025-03-03 10:45:33,366 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 10:45:33,367 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-03 10:45:33,367 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 10:45:33,367 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-03 10:45:33,367 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 10:45:33,367 INFO L87 Difference]: Start difference. First operand 81497 states and 87953 transitions. Second operand has 3 states, 3 states have (on average 55.333333333333336) internal successors, (166), 3 states have internal predecessors, (166), 0 states have call successors, (0), 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:45:36,533 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 10:45:36,533 INFO L93 Difference]: Finished difference Result 213501 states and 231429 transitions. [2025-03-03 10:45:36,533 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-03 10:45:36,533 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 55.333333333333336) internal successors, (166), 3 states have internal predecessors, (166), 0 states have call successors, (0), 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 395 [2025-03-03 10:45:36,534 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 10:45:36,661 INFO L225 Difference]: With dead ends: 213501 [2025-03-03 10:45:36,661 INFO L226 Difference]: Without dead ends: 132004 [2025-03-03 10:45:36,707 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:45:36,707 INFO L435 NwaCegarLoop]: 581 mSDtfsCounter, 931 mSDsluCounter, 102 mSDsCounter, 0 mSdLazyCounter, 3139 mSolverCounterSat, 591 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 931 SdHoareTripleChecker+Valid, 683 SdHoareTripleChecker+Invalid, 3730 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 591 IncrementalHoareTripleChecker+Valid, 3139 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.7s IncrementalHoareTripleChecker+Time [2025-03-03 10:45:36,708 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [931 Valid, 683 Invalid, 3730 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [591 Valid, 3139 Invalid, 0 Unknown, 0 Unchecked, 2.7s Time] [2025-03-03 10:45:36,783 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 132004 states. [2025-03-03 10:45:37,722 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 132004 to 125595. [2025-03-03 10:45:37,811 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 125595 states, 125594 states have (on average 1.0872653152220648) internal successors, (136554), 125594 states have internal predecessors, (136554), 0 states have call successors, (0), 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:45:37,973 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 125595 states to 125595 states and 136554 transitions. [2025-03-03 10:45:37,974 INFO L78 Accepts]: Start accepts. Automaton has 125595 states and 136554 transitions. Word has length 395 [2025-03-03 10:45:37,974 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 10:45:37,974 INFO L471 AbstractCegarLoop]: Abstraction has 125595 states and 136554 transitions. [2025-03-03 10:45:37,974 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 55.333333333333336) internal successors, (166), 3 states have internal predecessors, (166), 0 states have call successors, (0), 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:45:37,974 INFO L276 IsEmpty]: Start isEmpty. Operand 125595 states and 136554 transitions. [2025-03-03 10:45:37,985 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 470 [2025-03-03 10:45:37,985 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 10:45:37,985 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, 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, 4, 4, 4, 4, 4, 4, 3, 3, 3, 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:45:37,985 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-03-03 10:45:37,986 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 10:45:37,986 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 10:45:37,986 INFO L85 PathProgramCache]: Analyzing trace with hash -1274899469, now seen corresponding path program 1 times [2025-03-03 10:45:37,986 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 10:45:37,986 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1688500973] [2025-03-03 10:45:37,986 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 10:45:37,986 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 10:45:38,027 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 469 statements into 1 equivalence classes. [2025-03-03 10:45:38,056 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 469 of 469 statements. [2025-03-03 10:45:38,057 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 10:45:38,057 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 10:45:38,226 INFO L134 CoverageAnalysis]: Checked inductivity of 1043 backedges. 610 proven. 0 refuted. 0 times theorem prover too weak. 433 trivial. 0 not checked. [2025-03-03 10:45:38,226 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 10:45:38,226 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1688500973] [2025-03-03 10:45:38,226 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1688500973] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 10:45:38,226 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 10:45:38,226 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-03 10:45:38,226 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [432071322] [2025-03-03 10:45:38,226 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 10:45:38,227 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-03 10:45:38,227 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 10:45:38,228 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-03 10:45:38,228 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 10:45:38,228 INFO L87 Difference]: Start difference. First operand 125595 states and 136554 transitions. Second operand has 3 states, 3 states have (on average 81.33333333333333) internal successors, (244), 3 states have internal predecessors, (244), 0 states have call successors, (0), 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:45:41,693 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 10:45:41,693 INFO L93 Difference]: Finished difference Result 289758 states and 317792 transitions. [2025-03-03 10:45:41,694 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-03 10:45:41,694 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 81.33333333333333) internal successors, (244), 3 states have internal predecessors, (244), 0 states have call successors, (0), 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 469 [2025-03-03 10:45:41,694 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 10:45:41,885 INFO L225 Difference]: With dead ends: 289758 [2025-03-03 10:45:41,885 INFO L226 Difference]: Without dead ends: 164952 [2025-03-03 10:45:41,963 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:45:41,964 INFO L435 NwaCegarLoop]: 775 mSDtfsCounter, 912 mSDsluCounter, 80 mSDsCounter, 0 mSdLazyCounter, 2411 mSolverCounterSat, 950 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 912 SdHoareTripleChecker+Valid, 855 SdHoareTripleChecker+Invalid, 3361 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 950 IncrementalHoareTripleChecker+Valid, 2411 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.7s IncrementalHoareTripleChecker+Time [2025-03-03 10:45:41,964 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [912 Valid, 855 Invalid, 3361 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [950 Valid, 2411 Invalid, 0 Unknown, 0 Unchecked, 2.7s Time] [2025-03-03 10:45:42,083 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 164952 states. [2025-03-03 10:45:43,655 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 164952 to 162572. [2025-03-03 10:45:43,774 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 162572 states, 162571 states have (on average 1.0918552509365138) internal successors, (177504), 162571 states have internal predecessors, (177504), 0 states have call successors, (0), 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:45:43,979 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 162572 states to 162572 states and 177504 transitions. [2025-03-03 10:45:43,980 INFO L78 Accepts]: Start accepts. Automaton has 162572 states and 177504 transitions. Word has length 469 [2025-03-03 10:45:43,981 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 10:45:43,981 INFO L471 AbstractCegarLoop]: Abstraction has 162572 states and 177504 transitions. [2025-03-03 10:45:43,981 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 81.33333333333333) internal successors, (244), 3 states have internal predecessors, (244), 0 states have call successors, (0), 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:45:43,981 INFO L276 IsEmpty]: Start isEmpty. Operand 162572 states and 177504 transitions. [2025-03-03 10:45:43,990 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 471 [2025-03-03 10:45:43,990 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 10:45:43,991 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, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:45:43,991 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2025-03-03 10:45:43,991 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 10:45:43,991 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 10:45:43,991 INFO L85 PathProgramCache]: Analyzing trace with hash 649056142, now seen corresponding path program 1 times [2025-03-03 10:45:43,991 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 10:45:43,991 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [192553688] [2025-03-03 10:45:43,992 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 10:45:43,992 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 10:45:44,033 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 470 statements into 1 equivalence classes. [2025-03-03 10:45:44,062 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 470 of 470 statements. [2025-03-03 10:45:44,062 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 10:45:44,062 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 10:45:44,254 INFO L134 CoverageAnalysis]: Checked inductivity of 222 backedges. 127 proven. 0 refuted. 0 times theorem prover too weak. 95 trivial. 0 not checked. [2025-03-03 10:45:44,254 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 10:45:44,254 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [192553688] [2025-03-03 10:45:44,254 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [192553688] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 10:45:44,254 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 10:45:44,254 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-03 10:45:44,254 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [272212425] [2025-03-03 10:45:44,255 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 10:45:44,255 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-03 10:45:44,255 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 10:45:44,256 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-03 10:45:44,256 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 10:45:44,256 INFO L87 Difference]: Start difference. First operand 162572 states and 177504 transitions. Second operand has 3 states, 3 states have (on average 125.33333333333333) internal successors, (376), 3 states have internal predecessors, (376), 0 states have call successors, (0), 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:45:47,135 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 10:45:47,135 INFO L93 Difference]: Finished difference Result 325930 states and 355801 transitions. [2025-03-03 10:45:47,136 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-03 10:45:47,136 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 125.33333333333333) internal successors, (376), 3 states have internal predecessors, (376), 0 states have call successors, (0), 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 470 [2025-03-03 10:45:47,136 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 10:45:47,315 INFO L225 Difference]: With dead ends: 325930 [2025-03-03 10:45:47,315 INFO L226 Difference]: Without dead ends: 164147 [2025-03-03 10:45:47,395 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:45:47,396 INFO L435 NwaCegarLoop]: 1383 mSDtfsCounter, 971 mSDsluCounter, 85 mSDsCounter, 0 mSdLazyCounter, 2482 mSolverCounterSat, 606 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 971 SdHoareTripleChecker+Valid, 1468 SdHoareTripleChecker+Invalid, 3088 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 606 IncrementalHoareTripleChecker+Valid, 2482 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.3s IncrementalHoareTripleChecker+Time [2025-03-03 10:45:47,396 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [971 Valid, 1468 Invalid, 3088 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [606 Valid, 2482 Invalid, 0 Unknown, 0 Unchecked, 2.3s Time] [2025-03-03 10:45:47,512 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 164147 states. [2025-03-03 10:45:49,017 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 164147 to 160985. [2025-03-03 10:45:49,123 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 160985 states, 160984 states have (on average 1.0663668439099538) internal successors, (171668), 160984 states have internal predecessors, (171668), 0 states have call successors, (0), 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:45:49,265 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 160985 states to 160985 states and 171668 transitions. [2025-03-03 10:45:49,266 INFO L78 Accepts]: Start accepts. Automaton has 160985 states and 171668 transitions. Word has length 470 [2025-03-03 10:45:49,267 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 10:45:49,267 INFO L471 AbstractCegarLoop]: Abstraction has 160985 states and 171668 transitions. [2025-03-03 10:45:49,267 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 125.33333333333333) internal successors, (376), 3 states have internal predecessors, (376), 0 states have call successors, (0), 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:45:49,267 INFO L276 IsEmpty]: Start isEmpty. Operand 160985 states and 171668 transitions. [2025-03-03 10:45:49,281 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 558 [2025-03-03 10:45:49,281 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 10:45:49,281 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, 4, 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, 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] [2025-03-03 10:45:49,281 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2025-03-03 10:45:49,281 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 10:45:49,282 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 10:45:49,282 INFO L85 PathProgramCache]: Analyzing trace with hash -1325145145, now seen corresponding path program 1 times [2025-03-03 10:45:49,282 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 10:45:49,282 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2104005290] [2025-03-03 10:45:49,282 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 10:45:49,282 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 10:45:49,311 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 557 statements into 1 equivalence classes. [2025-03-03 10:45:49,604 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 557 of 557 statements. [2025-03-03 10:45:49,604 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 10:45:49,604 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 10:45:50,656 INFO L134 CoverageAnalysis]: Checked inductivity of 542 backedges. 368 proven. 110 refuted. 0 times theorem prover too weak. 64 trivial. 0 not checked. [2025-03-03 10:45:50,656 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 10:45:50,656 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2104005290] [2025-03-03 10:45:50,656 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2104005290] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-03 10:45:50,656 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [382031546] [2025-03-03 10:45:50,656 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 10:45:50,658 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 10:45:50,658 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 10:45:50,660 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:45:50,661 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:45:50,741 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 557 statements into 1 equivalence classes. [2025-03-03 10:45:50,815 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 557 of 557 statements. [2025-03-03 10:45:50,815 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 10:45:50,815 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 10:45:50,817 INFO L256 TraceCheckSpWp]: Trace formula consists of 693 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-03-03 10:45:50,825 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 10:45:51,372 INFO L134 CoverageAnalysis]: Checked inductivity of 542 backedges. 365 proven. 0 refuted. 0 times theorem prover too weak. 177 trivial. 0 not checked. [2025-03-03 10:45:51,372 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-03 10:45:51,373 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [382031546] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 10:45:51,373 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-03 10:45:51,373 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [5] total 6 [2025-03-03 10:45:51,373 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1464354723] [2025-03-03 10:45:51,373 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 10:45:51,373 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-03 10:45:51,373 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 10:45:51,374 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-03 10:45:51,374 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2025-03-03 10:45:51,374 INFO L87 Difference]: Start difference. First operand 160985 states and 171668 transitions. Second operand has 3 states, 3 states have (on average 127.33333333333333) internal successors, (382), 2 states have internal predecessors, (382), 0 states have call successors, (0), 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:45:53,779 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 10:45:53,780 INFO L93 Difference]: Finished difference Result 309382 states and 330359 transitions. [2025-03-03 10:45:53,780 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-03 10:45:53,781 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 127.33333333333333) internal successors, (382), 2 states have internal predecessors, (382), 0 states have call successors, (0), 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 557 [2025-03-03 10:45:53,781 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 10:45:53,948 INFO L225 Difference]: With dead ends: 309382 [2025-03-03 10:45:53,948 INFO L226 Difference]: Without dead ends: 163355 [2025-03-03 10:45:54,029 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 561 GetRequests, 556 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2025-03-03 10:45:54,029 INFO L435 NwaCegarLoop]: 996 mSDtfsCounter, 683 mSDsluCounter, 134 mSDsCounter, 0 mSdLazyCounter, 2431 mSolverCounterSat, 113 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 683 SdHoareTripleChecker+Valid, 1130 SdHoareTripleChecker+Invalid, 2544 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 113 IncrementalHoareTripleChecker+Valid, 2431 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.9s IncrementalHoareTripleChecker+Time [2025-03-03 10:45:54,029 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [683 Valid, 1130 Invalid, 2544 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [113 Valid, 2431 Invalid, 0 Unknown, 0 Unchecked, 1.9s Time] [2025-03-03 10:45:54,142 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 163355 states. [2025-03-03 10:45:55,600 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 163355 to 160982. [2025-03-03 10:45:55,703 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 160982 states, 160981 states have (on average 1.0610693187394786) internal successors, (170812), 160981 states have internal predecessors, (170812), 0 states have call successors, (0), 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:45:55,844 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 160982 states to 160982 states and 170812 transitions. [2025-03-03 10:45:55,845 INFO L78 Accepts]: Start accepts. Automaton has 160982 states and 170812 transitions. Word has length 557 [2025-03-03 10:45:55,846 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 10:45:55,846 INFO L471 AbstractCegarLoop]: Abstraction has 160982 states and 170812 transitions. [2025-03-03 10:45:55,846 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 127.33333333333333) internal successors, (382), 2 states have internal predecessors, (382), 0 states have call successors, (0), 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:45:55,846 INFO L276 IsEmpty]: Start isEmpty. Operand 160982 states and 170812 transitions. [2025-03-03 10:45:55,861 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 609 [2025-03-03 10:45:55,861 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 10:45:55,861 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, 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, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 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] [2025-03-03 10:45:55,867 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2025-03-03 10:45:56,061 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,SelfDestructingSolverStorable13 [2025-03-03 10:45:56,061 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 10:45:56,062 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 10:45:56,062 INFO L85 PathProgramCache]: Analyzing trace with hash -310820560, now seen corresponding path program 1 times [2025-03-03 10:45:56,062 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 10:45:56,062 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [430803377] [2025-03-03 10:45:56,062 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 10:45:56,062 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 10:45:56,090 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 608 statements into 1 equivalence classes. [2025-03-03 10:45:56,109 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 608 of 608 statements. [2025-03-03 10:45:56,109 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 10:45:56,109 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 10:45:56,533 INFO L134 CoverageAnalysis]: Checked inductivity of 1195 backedges. 705 proven. 0 refuted. 0 times theorem prover too weak. 490 trivial. 0 not checked. [2025-03-03 10:45:56,534 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 10:45:56,534 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [430803377] [2025-03-03 10:45:56,534 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [430803377] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 10:45:56,534 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 10:45:56,534 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-03 10:45:56,534 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [124347712] [2025-03-03 10:45:56,534 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 10:45:56,535 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-03 10:45:56,535 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 10:45:56,535 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-03 10:45:56,536 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 10:45:56,536 INFO L87 Difference]: Start difference. First operand 160982 states and 170812 transitions. Second operand has 3 states, 3 states have (on average 118.0) internal successors, (354), 3 states have internal predecessors, (354), 0 states have call successors, (0), 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:45:59,753 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 10:45:59,754 INFO L93 Difference]: Finished difference Result 357393 states and 380797 transitions. [2025-03-03 10:45:59,754 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-03 10:45:59,754 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 118.0) internal successors, (354), 3 states have internal predecessors, (354), 0 states have call successors, (0), 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 608 [2025-03-03 10:45:59,754 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 10:45:59,991 INFO L225 Difference]: With dead ends: 357393 [2025-03-03 10:45:59,991 INFO L226 Difference]: Without dead ends: 197202 [2025-03-03 10:46:00,067 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:46:00,068 INFO L435 NwaCegarLoop]: 1687 mSDtfsCounter, 707 mSDsluCounter, 143 mSDsCounter, 0 mSdLazyCounter, 2456 mSolverCounterSat, 440 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 707 SdHoareTripleChecker+Valid, 1830 SdHoareTripleChecker+Invalid, 2896 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 440 IncrementalHoareTripleChecker+Valid, 2456 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.5s IncrementalHoareTripleChecker+Time [2025-03-03 10:46:00,068 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [707 Valid, 1830 Invalid, 2896 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [440 Valid, 2456 Invalid, 0 Unknown, 0 Unchecked, 2.5s Time] [2025-03-03 10:46:00,195 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 197202 states. [2025-03-03 10:46:01,625 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 197202 to 192462. [2025-03-03 10:46:01,752 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 192462 states, 192461 states have (on average 1.0552059897849435) internal successors, (203086), 192461 states have internal predecessors, (203086), 0 states have call successors, (0), 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:46:02,201 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 192462 states to 192462 states and 203086 transitions. [2025-03-03 10:46:02,202 INFO L78 Accepts]: Start accepts. Automaton has 192462 states and 203086 transitions. Word has length 608 [2025-03-03 10:46:02,202 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 10:46:02,202 INFO L471 AbstractCegarLoop]: Abstraction has 192462 states and 203086 transitions. [2025-03-03 10:46:02,202 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 118.0) internal successors, (354), 3 states have internal predecessors, (354), 0 states have call successors, (0), 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:46:02,202 INFO L276 IsEmpty]: Start isEmpty. Operand 192462 states and 203086 transitions. [2025-03-03 10:46:02,216 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 609 [2025-03-03 10:46:02,216 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 10:46:02,217 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, 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, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 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] [2025-03-03 10:46:02,217 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2025-03-03 10:46:02,217 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 10:46:02,217 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 10:46:02,217 INFO L85 PathProgramCache]: Analyzing trace with hash -918897423, now seen corresponding path program 1 times [2025-03-03 10:46:02,217 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 10:46:02,218 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [250864046] [2025-03-03 10:46:02,218 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 10:46:02,218 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 10:46:02,250 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 608 statements into 1 equivalence classes. [2025-03-03 10:46:02,274 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 608 of 608 statements. [2025-03-03 10:46:02,274 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 10:46:02,274 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 10:46:02,502 INFO L134 CoverageAnalysis]: Checked inductivity of 1195 backedges. 705 proven. 0 refuted. 0 times theorem prover too weak. 490 trivial. 0 not checked. [2025-03-03 10:46:02,502 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 10:46:02,502 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [250864046] [2025-03-03 10:46:02,502 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [250864046] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 10:46:02,502 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 10:46:02,502 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-03 10:46:02,502 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [402501618] [2025-03-03 10:46:02,502 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 10:46:02,503 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-03 10:46:02,503 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 10:46:02,503 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-03 10:46:02,503 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 10:46:02,503 INFO L87 Difference]: Start difference. First operand 192462 states and 203086 transitions. Second operand has 3 states, 3 states have (on average 118.0) internal successors, (354), 3 states have internal predecessors, (354), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)