./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/hardness-nfm22/hardness_operatoramount_amount500_file-85.i --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/hardness-nfm22/hardness_operatoramount_amount500_file-85.i -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 f3b875613fa5f97f08f3833527f8e0ee0d41bb6c604e635f1323b904ed09bfde --- Real Ultimate output --- This is Ultimate 0.3.0-?-798a7b3-m [2025-03-04 00:37:13,952 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-04 00:37:14,016 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2025-03-04 00:37:14,019 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-04 00:37:14,020 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-04 00:37:14,034 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-04 00:37:14,034 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-04 00:37:14,034 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-04 00:37:14,035 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-04 00:37:14,035 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-04 00:37:14,035 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-04 00:37:14,035 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-04 00:37:14,035 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-04 00:37:14,035 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-04 00:37:14,035 INFO L153 SettingsManager]: * Use SBE=true [2025-03-04 00:37:14,035 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-04 00:37:14,035 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-04 00:37:14,035 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-04 00:37:14,035 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-04 00:37:14,036 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-04 00:37:14,036 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-04 00:37:14,036 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-04 00:37:14,036 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-04 00:37:14,036 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-04 00:37:14,036 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-04 00:37:14,036 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-04 00:37:14,036 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-04 00:37:14,036 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-04 00:37:14,036 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-04 00:37:14,036 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-04 00:37:14,036 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-04 00:37:14,036 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-04 00:37:14,036 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-04 00:37:14,036 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-04 00:37:14,036 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-04 00:37:14,036 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-04 00:37:14,036 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-04 00:37:14,037 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-04 00:37:14,037 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-04 00:37:14,037 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-04 00:37:14,037 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-04 00:37:14,037 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-04 00:37:14,037 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-04 00:37:14,037 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 -> f3b875613fa5f97f08f3833527f8e0ee0d41bb6c604e635f1323b904ed09bfde [2025-03-04 00:37:14,252 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-04 00:37:14,259 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-04 00:37:14,260 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-04 00:37:14,261 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-04 00:37:14,261 INFO L274 PluginConnector]: CDTParser initialized [2025-03-04 00:37:14,262 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardness-nfm22/hardness_operatoramount_amount500_file-85.i [2025-03-04 00:37:15,388 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/94c237bd4/176397b9d0254227afd2277af9846812/FLAGae649a953 [2025-03-04 00:37:15,720 INFO L384 CDTParser]: Found 1 translation units. [2025-03-04 00:37:15,723 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_operatoramount_amount500_file-85.i [2025-03-04 00:37:15,740 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/94c237bd4/176397b9d0254227afd2277af9846812/FLAGae649a953 [2025-03-04 00:37:15,970 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/94c237bd4/176397b9d0254227afd2277af9846812 [2025-03-04 00:37:15,972 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-04 00:37:15,973 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-04 00:37:15,976 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-04 00:37:15,976 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-04 00:37:15,978 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-04 00:37:15,979 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 04.03 12:37:15" (1/1) ... [2025-03-04 00:37:15,980 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@e42eceb and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 12:37:15, skipping insertion in model container [2025-03-04 00:37:15,981 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 04.03 12:37:15" (1/1) ... [2025-03-04 00:37:16,012 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-04 00:37:16,133 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/hardness-nfm22/hardness_operatoramount_amount500_file-85.i[916,929] [2025-03-04 00:37:16,332 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-04 00:37:16,346 INFO L200 MainTranslator]: Completed pre-run [2025-03-04 00:37:16,355 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/hardness-nfm22/hardness_operatoramount_amount500_file-85.i[916,929] [2025-03-04 00:37:16,443 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-04 00:37:16,460 INFO L204 MainTranslator]: Completed translation [2025-03-04 00:37:16,460 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 12:37:16 WrapperNode [2025-03-04 00:37:16,460 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-04 00:37:16,461 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-04 00:37:16,461 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-04 00:37:16,461 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-04 00:37:16,465 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 12:37:16" (1/1) ... [2025-03-04 00:37:16,479 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 12:37:16" (1/1) ... [2025-03-04 00:37:16,553 INFO L138 Inliner]: procedures = 26, calls = 78, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 687 [2025-03-04 00:37:16,553 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-04 00:37:16,554 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-04 00:37:16,554 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-04 00:37:16,555 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-04 00:37:16,560 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 12:37:16" (1/1) ... [2025-03-04 00:37:16,560 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 12:37:16" (1/1) ... [2025-03-04 00:37:16,578 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 12:37:16" (1/1) ... [2025-03-04 00:37:16,650 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-04 00:37:16,651 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 12:37:16" (1/1) ... [2025-03-04 00:37:16,651 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 12:37:16" (1/1) ... [2025-03-04 00:37:16,672 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 12:37:16" (1/1) ... [2025-03-04 00:37:16,678 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 12:37:16" (1/1) ... [2025-03-04 00:37:16,685 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 12:37:16" (1/1) ... [2025-03-04 00:37:16,688 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 12:37:16" (1/1) ... [2025-03-04 00:37:16,698 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-04 00:37:16,699 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-04 00:37:16,700 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-04 00:37:16,700 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-04 00:37:16,701 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 12:37:16" (1/1) ... [2025-03-04 00:37:16,704 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-04 00:37:16,714 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 00:37:16,725 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-04 00:37:16,729 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-04 00:37:16,743 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-04 00:37:16,744 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2025-03-04 00:37:16,744 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2025-03-04 00:37:16,744 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-03-04 00:37:16,744 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-04 00:37:16,744 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-04 00:37:16,864 INFO L256 CfgBuilder]: Building ICFG [2025-03-04 00:37:16,866 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-04 00:37:17,854 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L645: havoc property_#t~bitwise45#1;havoc property_#t~short46#1;havoc property_#t~bitwise47#1;havoc property_#t~short48#1;havoc property_#t~ite51#1;havoc property_#t~ite50#1;havoc property_#t~bitwise49#1;havoc property_#t~short52#1;havoc property_#t~bitwise53#1;havoc property_#t~short54#1; [2025-03-04 00:37:17,970 INFO L? ?]: Removed 95 outVars from TransFormulas that were not future-live. [2025-03-04 00:37:17,970 INFO L307 CfgBuilder]: Performing block encoding [2025-03-04 00:37:17,994 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-04 00:37:17,995 INFO L336 CfgBuilder]: Removed 2 assume(true) statements. [2025-03-04 00:37:17,995 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 04.03 12:37:17 BoogieIcfgContainer [2025-03-04 00:37:17,995 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-04 00:37:17,997 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-04 00:37:17,997 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-04 00:37:18,001 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-04 00:37:18,001 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 04.03 12:37:15" (1/3) ... [2025-03-04 00:37:18,002 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@23751c3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 04.03 12:37:18, skipping insertion in model container [2025-03-04 00:37:18,002 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 12:37:16" (2/3) ... [2025-03-04 00:37:18,002 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@23751c3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 04.03 12:37:18, skipping insertion in model container [2025-03-04 00:37:18,002 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 04.03 12:37:17" (3/3) ... [2025-03-04 00:37:18,003 INFO L128 eAbstractionObserver]: Analyzing ICFG hardness_operatoramount_amount500_file-85.i [2025-03-04 00:37:18,013 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-04 00:37:18,015 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG hardness_operatoramount_amount500_file-85.i that has 2 procedures, 269 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-03-04 00:37:18,057 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-04 00:37:18,064 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;@10217d3d, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-04 00:37:18,064 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-03-04 00:37:18,069 INFO L276 IsEmpty]: Start isEmpty. Operand has 269 states, 201 states have (on average 1.5472636815920398) internal successors, (311), 202 states have internal predecessors, (311), 65 states have call successors, (65), 1 states have call predecessors, (65), 1 states have return successors, (65), 65 states have call predecessors, (65), 65 states have call successors, (65) [2025-03-04 00:37:18,087 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 456 [2025-03-04 00:37:18,087 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 00:37:18,088 INFO L218 NwaCegarLoop]: trace histogram [65, 65, 65, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-04 00:37:18,088 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 00:37:18,091 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 00:37:18,092 INFO L85 PathProgramCache]: Analyzing trace with hash 934896547, now seen corresponding path program 1 times [2025-03-04 00:37:18,097 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 00:37:18,097 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1354769874] [2025-03-04 00:37:18,098 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 00:37:18,098 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 00:37:18,211 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 455 statements into 1 equivalence classes. [2025-03-04 00:37:18,259 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 455 of 455 statements. [2025-03-04 00:37:18,260 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 00:37:18,260 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 00:37:18,656 INFO L134 CoverageAnalysis]: Checked inductivity of 8320 backedges. 0 proven. 128 refuted. 0 times theorem prover too weak. 8192 trivial. 0 not checked. [2025-03-04 00:37:18,657 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 00:37:18,657 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1354769874] [2025-03-04 00:37:18,657 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1354769874] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 00:37:18,657 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [466234265] [2025-03-04 00:37:18,657 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 00:37:18,658 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 00:37:18,658 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 00:37:18,661 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-04 00:37:18,662 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-04 00:37:18,799 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 455 statements into 1 equivalence classes. [2025-03-04 00:37:18,973 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 455 of 455 statements. [2025-03-04 00:37:18,973 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 00:37:18,973 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 00:37:18,978 INFO L256 TraceCheckSpWp]: Trace formula consists of 1203 conjuncts, 1 conjuncts are in the unsatisfiable core [2025-03-04 00:37:18,997 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 00:37:19,048 INFO L134 CoverageAnalysis]: Checked inductivity of 8320 backedges. 128 proven. 0 refuted. 0 times theorem prover too weak. 8192 trivial. 0 not checked. [2025-03-04 00:37:19,050 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-04 00:37:19,050 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [466234265] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 00:37:19,050 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-04 00:37:19,051 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [2] total 2 [2025-03-04 00:37:19,052 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [285764912] [2025-03-04 00:37:19,052 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 00:37:19,055 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-03-04 00:37:19,056 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 00:37:19,072 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-03-04 00:37:19,072 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-03-04 00:37:19,075 INFO L87 Difference]: Start difference. First operand has 269 states, 201 states have (on average 1.5472636815920398) internal successors, (311), 202 states have internal predecessors, (311), 65 states have call successors, (65), 1 states have call predecessors, (65), 1 states have return successors, (65), 65 states have call predecessors, (65), 65 states have call successors, (65) Second operand has 2 states, 2 states have (on average 67.5) internal successors, (135), 2 states have internal predecessors, (135), 2 states have call successors, (65), 2 states have call predecessors, (65), 1 states have return successors, (65), 1 states have call predecessors, (65), 2 states have call successors, (65) [2025-03-04 00:37:19,128 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 00:37:19,129 INFO L93 Difference]: Finished difference Result 532 states and 942 transitions. [2025-03-04 00:37:19,131 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-03-04 00:37:19,132 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 67.5) internal successors, (135), 2 states have internal predecessors, (135), 2 states have call successors, (65), 2 states have call predecessors, (65), 1 states have return successors, (65), 1 states have call predecessors, (65), 2 states have call successors, (65) Word has length 455 [2025-03-04 00:37:19,132 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 00:37:19,142 INFO L225 Difference]: With dead ends: 532 [2025-03-04 00:37:19,142 INFO L226 Difference]: Without dead ends: 266 [2025-03-04 00:37:19,149 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 456 GetRequests, 456 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-03-04 00:37:19,151 INFO L435 NwaCegarLoop]: 426 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 8 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 426 SdHoareTripleChecker+Invalid, 8 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 8 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-04 00:37:19,153 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 426 Invalid, 8 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 8 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-04 00:37:19,164 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 266 states. [2025-03-04 00:37:19,205 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 266 to 266. [2025-03-04 00:37:19,206 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 266 states, 199 states have (on average 1.5276381909547738) internal successors, (304), 199 states have internal predecessors, (304), 65 states have call successors, (65), 1 states have call predecessors, (65), 1 states have return successors, (65), 65 states have call predecessors, (65), 65 states have call successors, (65) [2025-03-04 00:37:19,214 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 266 states to 266 states and 434 transitions. [2025-03-04 00:37:19,218 INFO L78 Accepts]: Start accepts. Automaton has 266 states and 434 transitions. Word has length 455 [2025-03-04 00:37:19,218 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 00:37:19,218 INFO L471 AbstractCegarLoop]: Abstraction has 266 states and 434 transitions. [2025-03-04 00:37:19,219 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 67.5) internal successors, (135), 2 states have internal predecessors, (135), 2 states have call successors, (65), 2 states have call predecessors, (65), 1 states have return successors, (65), 1 states have call predecessors, (65), 2 states have call successors, (65) [2025-03-04 00:37:19,219 INFO L276 IsEmpty]: Start isEmpty. Operand 266 states and 434 transitions. [2025-03-04 00:37:19,231 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 456 [2025-03-04 00:37:19,231 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 00:37:19,231 INFO L218 NwaCegarLoop]: trace histogram [65, 65, 65, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-04 00:37:19,241 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-04 00:37:19,437 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,SelfDestructingSolverStorable0 [2025-03-04 00:37:19,437 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 00:37:19,438 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 00:37:19,438 INFO L85 PathProgramCache]: Analyzing trace with hash -473664540, now seen corresponding path program 1 times [2025-03-04 00:37:19,438 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 00:37:19,438 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [440623596] [2025-03-04 00:37:19,438 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 00:37:19,438 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 00:37:19,503 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 455 statements into 1 equivalence classes. [2025-03-04 00:37:19,610 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 455 of 455 statements. [2025-03-04 00:37:19,611 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 00:37:19,611 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 00:37:20,008 INFO L134 CoverageAnalysis]: Checked inductivity of 8320 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 8320 trivial. 0 not checked. [2025-03-04 00:37:20,009 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 00:37:20,009 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [440623596] [2025-03-04 00:37:20,009 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [440623596] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 00:37:20,009 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 00:37:20,009 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-04 00:37:20,009 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [852651218] [2025-03-04 00:37:20,009 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 00:37:20,010 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-04 00:37:20,011 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 00:37:20,011 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-04 00:37:20,011 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-04 00:37:20,012 INFO L87 Difference]: Start difference. First operand 266 states and 434 transitions. Second operand has 3 states, 3 states have (on average 44.333333333333336) internal successors, (133), 3 states have internal predecessors, (133), 1 states have call successors, (65), 1 states have call predecessors, (65), 1 states have return successors, (65), 1 states have call predecessors, (65), 1 states have call successors, (65) [2025-03-04 00:37:20,180 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 00:37:20,180 INFO L93 Difference]: Finished difference Result 787 states and 1286 transitions. [2025-03-04 00:37:20,181 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-04 00:37:20,181 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 44.333333333333336) internal successors, (133), 3 states have internal predecessors, (133), 1 states have call successors, (65), 1 states have call predecessors, (65), 1 states have return successors, (65), 1 states have call predecessors, (65), 1 states have call successors, (65) Word has length 455 [2025-03-04 00:37:20,182 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 00:37:20,185 INFO L225 Difference]: With dead ends: 787 [2025-03-04 00:37:20,186 INFO L226 Difference]: Without dead ends: 524 [2025-03-04 00:37:20,187 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-04 00:37:20,187 INFO L435 NwaCegarLoop]: 418 mSDtfsCounter, 414 mSDsluCounter, 399 mSDsCounter, 0 mSdLazyCounter, 45 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 414 SdHoareTripleChecker+Valid, 817 SdHoareTripleChecker+Invalid, 56 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 45 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-04 00:37:20,188 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [414 Valid, 817 Invalid, 56 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 45 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-04 00:37:20,189 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 524 states. [2025-03-04 00:37:20,239 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 524 to 522. [2025-03-04 00:37:20,240 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 522 states, 389 states have (on average 1.5115681233933163) internal successors, (588), 389 states have internal predecessors, (588), 130 states have call successors, (130), 2 states have call predecessors, (130), 2 states have return successors, (130), 130 states have call predecessors, (130), 130 states have call successors, (130) [2025-03-04 00:37:20,243 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 522 states to 522 states and 848 transitions. [2025-03-04 00:37:20,243 INFO L78 Accepts]: Start accepts. Automaton has 522 states and 848 transitions. Word has length 455 [2025-03-04 00:37:20,244 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 00:37:20,244 INFO L471 AbstractCegarLoop]: Abstraction has 522 states and 848 transitions. [2025-03-04 00:37:20,245 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 44.333333333333336) internal successors, (133), 3 states have internal predecessors, (133), 1 states have call successors, (65), 1 states have call predecessors, (65), 1 states have return successors, (65), 1 states have call predecessors, (65), 1 states have call successors, (65) [2025-03-04 00:37:20,245 INFO L276 IsEmpty]: Start isEmpty. Operand 522 states and 848 transitions. [2025-03-04 00:37:20,249 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 456 [2025-03-04 00:37:20,249 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 00:37:20,250 INFO L218 NwaCegarLoop]: trace histogram [65, 65, 65, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-04 00:37:20,250 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-03-04 00:37:20,251 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 00:37:20,253 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 00:37:20,254 INFO L85 PathProgramCache]: Analyzing trace with hash 219728165, now seen corresponding path program 1 times [2025-03-04 00:37:20,254 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 00:37:20,254 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1697290830] [2025-03-04 00:37:20,254 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 00:37:20,254 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 00:37:20,298 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 455 statements into 1 equivalence classes. [2025-03-04 00:37:20,361 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 455 of 455 statements. [2025-03-04 00:37:20,362 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 00:37:20,362 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 00:37:20,709 INFO L134 CoverageAnalysis]: Checked inductivity of 8320 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 8320 trivial. 0 not checked. [2025-03-04 00:37:20,709 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 00:37:20,709 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1697290830] [2025-03-04 00:37:20,709 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1697290830] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 00:37:20,709 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 00:37:20,709 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-04 00:37:20,710 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [819891050] [2025-03-04 00:37:20,710 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 00:37:20,711 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-04 00:37:20,711 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 00:37:20,712 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-04 00:37:20,712 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-04 00:37:20,713 INFO L87 Difference]: Start difference. First operand 522 states and 848 transitions. Second operand has 3 states, 3 states have (on average 44.333333333333336) internal successors, (133), 3 states have internal predecessors, (133), 1 states have call successors, (65), 1 states have call predecessors, (65), 1 states have return successors, (65), 1 states have call predecessors, (65), 1 states have call successors, (65) [2025-03-04 00:37:20,919 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 00:37:20,919 INFO L93 Difference]: Finished difference Result 1540 states and 2506 transitions. [2025-03-04 00:37:20,919 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-04 00:37:20,920 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 44.333333333333336) internal successors, (133), 3 states have internal predecessors, (133), 1 states have call successors, (65), 1 states have call predecessors, (65), 1 states have return successors, (65), 1 states have call predecessors, (65), 1 states have call successors, (65) Word has length 455 [2025-03-04 00:37:20,921 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 00:37:20,931 INFO L225 Difference]: With dead ends: 1540 [2025-03-04 00:37:20,932 INFO L226 Difference]: Without dead ends: 1021 [2025-03-04 00:37:20,934 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-04 00:37:20,937 INFO L435 NwaCegarLoop]: 648 mSDtfsCounter, 399 mSDsluCounter, 406 mSDsCounter, 0 mSdLazyCounter, 46 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 399 SdHoareTripleChecker+Valid, 1054 SdHoareTripleChecker+Invalid, 51 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 46 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-04 00:37:20,937 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [399 Valid, 1054 Invalid, 51 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 46 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-04 00:37:20,939 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1021 states. [2025-03-04 00:37:21,010 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1021 to 560. [2025-03-04 00:37:21,011 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 560 states, 427 states have (on average 1.515222482435597) internal successors, (647), 427 states have internal predecessors, (647), 130 states have call successors, (130), 2 states have call predecessors, (130), 2 states have return successors, (130), 130 states have call predecessors, (130), 130 states have call successors, (130) [2025-03-04 00:37:21,013 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 560 states to 560 states and 907 transitions. [2025-03-04 00:37:21,014 INFO L78 Accepts]: Start accepts. Automaton has 560 states and 907 transitions. Word has length 455 [2025-03-04 00:37:21,015 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 00:37:21,015 INFO L471 AbstractCegarLoop]: Abstraction has 560 states and 907 transitions. [2025-03-04 00:37:21,016 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 44.333333333333336) internal successors, (133), 3 states have internal predecessors, (133), 1 states have call successors, (65), 1 states have call predecessors, (65), 1 states have return successors, (65), 1 states have call predecessors, (65), 1 states have call successors, (65) [2025-03-04 00:37:21,016 INFO L276 IsEmpty]: Start isEmpty. Operand 560 states and 907 transitions. [2025-03-04 00:37:21,020 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 456 [2025-03-04 00:37:21,020 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 00:37:21,020 INFO L218 NwaCegarLoop]: trace histogram [65, 65, 65, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-04 00:37:21,020 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-03-04 00:37:21,020 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 00:37:21,021 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 00:37:21,021 INFO L85 PathProgramCache]: Analyzing trace with hash -236727833, now seen corresponding path program 1 times [2025-03-04 00:37:21,021 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 00:37:21,021 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1664514470] [2025-03-04 00:37:21,021 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 00:37:21,021 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 00:37:21,056 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 455 statements into 1 equivalence classes. [2025-03-04 00:37:21,101 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 455 of 455 statements. [2025-03-04 00:37:21,101 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 00:37:21,101 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 00:37:21,285 INFO L134 CoverageAnalysis]: Checked inductivity of 8320 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 8320 trivial. 0 not checked. [2025-03-04 00:37:21,285 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 00:37:21,285 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1664514470] [2025-03-04 00:37:21,286 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1664514470] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 00:37:21,286 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 00:37:21,286 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-04 00:37:21,286 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1207781084] [2025-03-04 00:37:21,286 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 00:37:21,286 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-04 00:37:21,286 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 00:37:21,287 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-04 00:37:21,287 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-04 00:37:21,287 INFO L87 Difference]: Start difference. First operand 560 states and 907 transitions. Second operand has 3 states, 3 states have (on average 44.333333333333336) internal successors, (133), 3 states have internal predecessors, (133), 1 states have call successors, (65), 1 states have call predecessors, (65), 1 states have return successors, (65), 1 states have call predecessors, (65), 1 states have call successors, (65) [2025-03-04 00:37:21,420 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 00:37:21,421 INFO L93 Difference]: Finished difference Result 1121 states and 1816 transitions. [2025-03-04 00:37:21,421 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-04 00:37:21,421 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 44.333333333333336) internal successors, (133), 3 states have internal predecessors, (133), 1 states have call successors, (65), 1 states have call predecessors, (65), 1 states have return successors, (65), 1 states have call predecessors, (65), 1 states have call successors, (65) Word has length 455 [2025-03-04 00:37:21,422 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 00:37:21,427 INFO L225 Difference]: With dead ends: 1121 [2025-03-04 00:37:21,427 INFO L226 Difference]: Without dead ends: 564 [2025-03-04 00:37:21,429 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-04 00:37:21,430 INFO L435 NwaCegarLoop]: 728 mSDtfsCounter, 411 mSDsluCounter, 397 mSDsCounter, 0 mSdLazyCounter, 53 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 411 SdHoareTripleChecker+Valid, 1125 SdHoareTripleChecker+Invalid, 58 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 53 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-04 00:37:21,430 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [411 Valid, 1125 Invalid, 58 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 53 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-04 00:37:21,432 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 564 states. [2025-03-04 00:37:21,466 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 564 to 562. [2025-03-04 00:37:21,468 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 562 states, 429 states have (on average 1.494172494172494) internal successors, (641), 429 states have internal predecessors, (641), 130 states have call successors, (130), 2 states have call predecessors, (130), 2 states have return successors, (130), 130 states have call predecessors, (130), 130 states have call successors, (130) [2025-03-04 00:37:21,471 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 562 states to 562 states and 901 transitions. [2025-03-04 00:37:21,473 INFO L78 Accepts]: Start accepts. Automaton has 562 states and 901 transitions. Word has length 455 [2025-03-04 00:37:21,475 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 00:37:21,475 INFO L471 AbstractCegarLoop]: Abstraction has 562 states and 901 transitions. [2025-03-04 00:37:21,475 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 44.333333333333336) internal successors, (133), 3 states have internal predecessors, (133), 1 states have call successors, (65), 1 states have call predecessors, (65), 1 states have return successors, (65), 1 states have call predecessors, (65), 1 states have call successors, (65) [2025-03-04 00:37:21,476 INFO L276 IsEmpty]: Start isEmpty. Operand 562 states and 901 transitions. [2025-03-04 00:37:21,480 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 457 [2025-03-04 00:37:21,481 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 00:37:21,481 INFO L218 NwaCegarLoop]: trace histogram [65, 65, 65, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-04 00:37:21,481 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-03-04 00:37:21,482 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 00:37:21,483 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 00:37:21,483 INFO L85 PathProgramCache]: Analyzing trace with hash -872692101, now seen corresponding path program 1 times [2025-03-04 00:37:21,483 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 00:37:21,483 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2145826618] [2025-03-04 00:37:21,483 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 00:37:21,484 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 00:37:21,523 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 456 statements into 1 equivalence classes. [2025-03-04 00:37:21,578 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 456 of 456 statements. [2025-03-04 00:37:21,578 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 00:37:21,578 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 00:37:21,838 INFO L134 CoverageAnalysis]: Checked inductivity of 8320 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 8320 trivial. 0 not checked. [2025-03-04 00:37:21,839 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 00:37:21,839 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2145826618] [2025-03-04 00:37:21,839 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2145826618] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 00:37:21,839 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 00:37:21,839 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-04 00:37:21,839 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [502910983] [2025-03-04 00:37:21,839 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 00:37:21,840 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-04 00:37:21,840 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 00:37:21,841 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-04 00:37:21,841 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-04 00:37:21,841 INFO L87 Difference]: Start difference. First operand 562 states and 901 transitions. Second operand has 3 states, 3 states have (on average 44.666666666666664) internal successors, (134), 3 states have internal predecessors, (134), 1 states have call successors, (65), 1 states have call predecessors, (65), 1 states have return successors, (65), 1 states have call predecessors, (65), 1 states have call successors, (65) [2025-03-04 00:37:21,956 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 00:37:21,956 INFO L93 Difference]: Finished difference Result 1498 states and 2401 transitions. [2025-03-04 00:37:21,957 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-04 00:37:21,957 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 44.666666666666664) internal successors, (134), 3 states have internal predecessors, (134), 1 states have call successors, (65), 1 states have call predecessors, (65), 1 states have return successors, (65), 1 states have call predecessors, (65), 1 states have call successors, (65) Word has length 456 [2025-03-04 00:37:21,958 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 00:37:21,962 INFO L225 Difference]: With dead ends: 1498 [2025-03-04 00:37:21,963 INFO L226 Difference]: Without dead ends: 939 [2025-03-04 00:37:21,965 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-04 00:37:21,965 INFO L435 NwaCegarLoop]: 462 mSDtfsCounter, 242 mSDsluCounter, 404 mSDsCounter, 0 mSdLazyCounter, 46 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 242 SdHoareTripleChecker+Valid, 866 SdHoareTripleChecker+Invalid, 49 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 46 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-04 00:37:21,966 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [242 Valid, 866 Invalid, 49 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 46 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-04 00:37:21,967 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 939 states. [2025-03-04 00:37:22,030 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 939 to 925. [2025-03-04 00:37:22,032 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 925 states, 754 states have (on average 1.526525198938992) internal successors, (1151), 756 states have internal predecessors, (1151), 166 states have call successors, (166), 4 states have call predecessors, (166), 4 states have return successors, (166), 164 states have call predecessors, (166), 166 states have call successors, (166) [2025-03-04 00:37:22,037 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 925 states to 925 states and 1483 transitions. [2025-03-04 00:37:22,038 INFO L78 Accepts]: Start accepts. Automaton has 925 states and 1483 transitions. Word has length 456 [2025-03-04 00:37:22,039 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 00:37:22,039 INFO L471 AbstractCegarLoop]: Abstraction has 925 states and 1483 transitions. [2025-03-04 00:37:22,039 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 44.666666666666664) internal successors, (134), 3 states have internal predecessors, (134), 1 states have call successors, (65), 1 states have call predecessors, (65), 1 states have return successors, (65), 1 states have call predecessors, (65), 1 states have call successors, (65) [2025-03-04 00:37:22,040 INFO L276 IsEmpty]: Start isEmpty. Operand 925 states and 1483 transitions. [2025-03-04 00:37:22,050 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 457 [2025-03-04 00:37:22,050 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 00:37:22,050 INFO L218 NwaCegarLoop]: trace histogram [65, 65, 65, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-04 00:37:22,050 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-03-04 00:37:22,053 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 00:37:22,055 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 00:37:22,055 INFO L85 PathProgramCache]: Analyzing trace with hash 1498091737, now seen corresponding path program 1 times [2025-03-04 00:37:22,056 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 00:37:22,056 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [488722495] [2025-03-04 00:37:22,056 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 00:37:22,056 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 00:37:22,103 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 456 statements into 1 equivalence classes. [2025-03-04 00:37:22,155 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 456 of 456 statements. [2025-03-04 00:37:22,155 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 00:37:22,156 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 00:37:22,342 INFO L134 CoverageAnalysis]: Checked inductivity of 8320 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 8320 trivial. 0 not checked. [2025-03-04 00:37:22,342 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 00:37:22,342 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [488722495] [2025-03-04 00:37:22,342 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [488722495] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 00:37:22,342 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 00:37:22,343 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-04 00:37:22,343 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [721161850] [2025-03-04 00:37:22,343 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 00:37:22,343 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-04 00:37:22,343 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 00:37:22,344 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-04 00:37:22,344 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-04 00:37:22,344 INFO L87 Difference]: Start difference. First operand 925 states and 1483 transitions. Second operand has 3 states, 3 states have (on average 44.666666666666664) internal successors, (134), 3 states have internal predecessors, (134), 1 states have call successors, (65), 1 states have call predecessors, (65), 1 states have return successors, (65), 1 states have call predecessors, (65), 1 states have call successors, (65) [2025-03-04 00:37:22,501 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 00:37:22,501 INFO L93 Difference]: Finished difference Result 2737 states and 4389 transitions. [2025-03-04 00:37:22,502 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-04 00:37:22,502 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 44.666666666666664) internal successors, (134), 3 states have internal predecessors, (134), 1 states have call successors, (65), 1 states have call predecessors, (65), 1 states have return successors, (65), 1 states have call predecessors, (65), 1 states have call successors, (65) Word has length 456 [2025-03-04 00:37:22,503 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 00:37:22,516 INFO L225 Difference]: With dead ends: 2737 [2025-03-04 00:37:22,517 INFO L226 Difference]: Without dead ends: 1815 [2025-03-04 00:37:22,520 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-04 00:37:22,520 INFO L435 NwaCegarLoop]: 808 mSDtfsCounter, 408 mSDsluCounter, 409 mSDsCounter, 0 mSdLazyCounter, 39 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 408 SdHoareTripleChecker+Valid, 1217 SdHoareTripleChecker+Invalid, 42 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 39 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-04 00:37:22,520 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [408 Valid, 1217 Invalid, 42 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 39 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-04 00:37:22,522 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1815 states. [2025-03-04 00:37:22,617 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1815 to 977. [2025-03-04 00:37:22,619 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 977 states, 806 states have (on average 1.5272952853598014) internal successors, (1231), 808 states have internal predecessors, (1231), 166 states have call successors, (166), 4 states have call predecessors, (166), 4 states have return successors, (166), 164 states have call predecessors, (166), 166 states have call successors, (166) [2025-03-04 00:37:22,624 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 977 states to 977 states and 1563 transitions. [2025-03-04 00:37:22,627 INFO L78 Accepts]: Start accepts. Automaton has 977 states and 1563 transitions. Word has length 456 [2025-03-04 00:37:22,627 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 00:37:22,627 INFO L471 AbstractCegarLoop]: Abstraction has 977 states and 1563 transitions. [2025-03-04 00:37:22,628 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 44.666666666666664) internal successors, (134), 3 states have internal predecessors, (134), 1 states have call successors, (65), 1 states have call predecessors, (65), 1 states have return successors, (65), 1 states have call predecessors, (65), 1 states have call successors, (65) [2025-03-04 00:37:22,628 INFO L276 IsEmpty]: Start isEmpty. Operand 977 states and 1563 transitions. [2025-03-04 00:37:22,634 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 457 [2025-03-04 00:37:22,634 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 00:37:22,634 INFO L218 NwaCegarLoop]: trace histogram [65, 65, 65, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-04 00:37:22,634 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-03-04 00:37:22,634 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 00:37:22,635 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 00:37:22,635 INFO L85 PathProgramCache]: Analyzing trace with hash 1622164984, now seen corresponding path program 1 times [2025-03-04 00:37:22,635 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 00:37:22,635 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [608471364] [2025-03-04 00:37:22,635 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 00:37:22,635 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 00:37:22,676 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 456 statements into 1 equivalence classes. [2025-03-04 00:37:22,780 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 456 of 456 statements. [2025-03-04 00:37:22,780 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 00:37:22,780 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 00:37:23,565 INFO L134 CoverageAnalysis]: Checked inductivity of 8320 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 8320 trivial. 0 not checked. [2025-03-04 00:37:23,565 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 00:37:23,565 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [608471364] [2025-03-04 00:37:23,565 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [608471364] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 00:37:23,565 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 00:37:23,565 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-04 00:37:23,565 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [674133997] [2025-03-04 00:37:23,565 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 00:37:23,566 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-04 00:37:23,566 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 00:37:23,566 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-04 00:37:23,566 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2025-03-04 00:37:23,567 INFO L87 Difference]: Start difference. First operand 977 states and 1563 transitions. Second operand has 6 states, 6 states have (on average 22.333333333333332) internal successors, (134), 6 states have internal predecessors, (134), 1 states have call successors, (65), 1 states have call predecessors, (65), 1 states have return successors, (65), 1 states have call predecessors, (65), 1 states have call successors, (65) [2025-03-04 00:37:24,342 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 00:37:24,342 INFO L93 Difference]: Finished difference Result 3218 states and 5135 transitions. [2025-03-04 00:37:24,343 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-03-04 00:37:24,344 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 22.333333333333332) internal successors, (134), 6 states have internal predecessors, (134), 1 states have call successors, (65), 1 states have call predecessors, (65), 1 states have return successors, (65), 1 states have call predecessors, (65), 1 states have call successors, (65) Word has length 456 [2025-03-04 00:37:24,345 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 00:37:24,356 INFO L225 Difference]: With dead ends: 3218 [2025-03-04 00:37:24,356 INFO L226 Difference]: Without dead ends: 2244 [2025-03-04 00:37:24,359 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=28, Invalid=44, Unknown=0, NotChecked=0, Total=72 [2025-03-04 00:37:24,360 INFO L435 NwaCegarLoop]: 412 mSDtfsCounter, 796 mSDsluCounter, 1365 mSDsCounter, 0 mSdLazyCounter, 381 mSolverCounterSat, 198 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 796 SdHoareTripleChecker+Valid, 1777 SdHoareTripleChecker+Invalid, 579 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 198 IncrementalHoareTripleChecker+Valid, 381 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-03-04 00:37:24,360 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [796 Valid, 1777 Invalid, 579 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [198 Valid, 381 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-03-04 00:37:24,363 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2244 states. [2025-03-04 00:37:24,486 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2244 to 1140. [2025-03-04 00:37:24,489 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1140 states, 903 states have (on average 1.5105204872646734) internal successors, (1364), 905 states have internal predecessors, (1364), 231 states have call successors, (231), 5 states have call predecessors, (231), 5 states have return successors, (231), 229 states have call predecessors, (231), 231 states have call successors, (231) [2025-03-04 00:37:24,495 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1140 states to 1140 states and 1826 transitions. [2025-03-04 00:37:24,497 INFO L78 Accepts]: Start accepts. Automaton has 1140 states and 1826 transitions. Word has length 456 [2025-03-04 00:37:24,498 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 00:37:24,498 INFO L471 AbstractCegarLoop]: Abstraction has 1140 states and 1826 transitions. [2025-03-04 00:37:24,498 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 22.333333333333332) internal successors, (134), 6 states have internal predecessors, (134), 1 states have call successors, (65), 1 states have call predecessors, (65), 1 states have return successors, (65), 1 states have call predecessors, (65), 1 states have call successors, (65) [2025-03-04 00:37:24,498 INFO L276 IsEmpty]: Start isEmpty. Operand 1140 states and 1826 transitions. [2025-03-04 00:37:24,502 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 457 [2025-03-04 00:37:24,502 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 00:37:24,503 INFO L218 NwaCegarLoop]: trace histogram [65, 65, 65, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-04 00:37:24,503 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-03-04 00:37:24,503 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 00:37:24,503 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 00:37:24,503 INFO L85 PathProgramCache]: Analyzing trace with hash 1375851897, now seen corresponding path program 1 times [2025-03-04 00:37:24,504 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 00:37:24,504 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1392613392] [2025-03-04 00:37:24,504 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 00:37:24,504 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 00:37:24,547 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 456 statements into 1 equivalence classes. [2025-03-04 00:37:24,632 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 456 of 456 statements. [2025-03-04 00:37:24,632 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 00:37:24,632 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 00:37:25,059 INFO L134 CoverageAnalysis]: Checked inductivity of 8320 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 8320 trivial. 0 not checked. [2025-03-04 00:37:25,059 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 00:37:25,059 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1392613392] [2025-03-04 00:37:25,060 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1392613392] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 00:37:25,060 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 00:37:25,060 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-04 00:37:25,060 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [600229901] [2025-03-04 00:37:25,060 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 00:37:25,060 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-04 00:37:25,060 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 00:37:25,064 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-04 00:37:25,064 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-04 00:37:25,065 INFO L87 Difference]: Start difference. First operand 1140 states and 1826 transitions. Second operand has 4 states, 4 states have (on average 33.5) internal successors, (134), 4 states have internal predecessors, (134), 1 states have call successors, (65), 1 states have call predecessors, (65), 1 states have return successors, (65), 1 states have call predecessors, (65), 1 states have call successors, (65) [2025-03-04 00:37:25,467 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 00:37:25,469 INFO L93 Difference]: Finished difference Result 2680 states and 4282 transitions. [2025-03-04 00:37:25,469 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-04 00:37:25,470 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 33.5) internal successors, (134), 4 states have internal predecessors, (134), 1 states have call successors, (65), 1 states have call predecessors, (65), 1 states have return successors, (65), 1 states have call predecessors, (65), 1 states have call successors, (65) Word has length 456 [2025-03-04 00:37:25,470 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 00:37:25,481 INFO L225 Difference]: With dead ends: 2680 [2025-03-04 00:37:25,481 INFO L226 Difference]: Without dead ends: 1684 [2025-03-04 00:37:25,489 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-03-04 00:37:25,489 INFO L435 NwaCegarLoop]: 413 mSDtfsCounter, 444 mSDsluCounter, 821 mSDsCounter, 0 mSdLazyCounter, 59 mSolverCounterSat, 197 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 444 SdHoareTripleChecker+Valid, 1234 SdHoareTripleChecker+Invalid, 256 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 197 IncrementalHoareTripleChecker+Valid, 59 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-03-04 00:37:25,490 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [444 Valid, 1234 Invalid, 256 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [197 Valid, 59 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-04 00:37:25,493 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1684 states. [2025-03-04 00:37:25,605 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1684 to 1646. [2025-03-04 00:37:25,609 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1646 states, 1409 states have (on average 1.5408090844570617) internal successors, (2171), 1411 states have internal predecessors, (2171), 231 states have call successors, (231), 5 states have call predecessors, (231), 5 states have return successors, (231), 229 states have call predecessors, (231), 231 states have call successors, (231) [2025-03-04 00:37:25,618 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1646 states to 1646 states and 2633 transitions. [2025-03-04 00:37:25,619 INFO L78 Accepts]: Start accepts. Automaton has 1646 states and 2633 transitions. Word has length 456 [2025-03-04 00:37:25,620 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 00:37:25,620 INFO L471 AbstractCegarLoop]: Abstraction has 1646 states and 2633 transitions. [2025-03-04 00:37:25,620 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 33.5) internal successors, (134), 4 states have internal predecessors, (134), 1 states have call successors, (65), 1 states have call predecessors, (65), 1 states have return successors, (65), 1 states have call predecessors, (65), 1 states have call successors, (65) [2025-03-04 00:37:25,621 INFO L276 IsEmpty]: Start isEmpty. Operand 1646 states and 2633 transitions. [2025-03-04 00:37:25,623 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 458 [2025-03-04 00:37:25,624 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 00:37:25,624 INFO L218 NwaCegarLoop]: trace histogram [65, 65, 65, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-04 00:37:25,624 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-03-04 00:37:25,625 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 00:37:25,625 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 00:37:25,626 INFO L85 PathProgramCache]: Analyzing trace with hash 295430842, now seen corresponding path program 1 times [2025-03-04 00:37:25,626 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 00:37:25,626 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1263609931] [2025-03-04 00:37:25,626 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 00:37:25,626 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 00:37:25,663 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 457 statements into 1 equivalence classes. [2025-03-04 00:37:25,753 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 457 of 457 statements. [2025-03-04 00:37:25,753 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 00:37:25,753 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 00:37:26,267 INFO L134 CoverageAnalysis]: Checked inductivity of 8320 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 8320 trivial. 0 not checked. [2025-03-04 00:37:26,267 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 00:37:26,267 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1263609931] [2025-03-04 00:37:26,267 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1263609931] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 00:37:26,267 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 00:37:26,267 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-04 00:37:26,267 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [295352089] [2025-03-04 00:37:26,268 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 00:37:26,268 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-04 00:37:26,268 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 00:37:26,269 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-04 00:37:26,269 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-04 00:37:26,269 INFO L87 Difference]: Start difference. First operand 1646 states and 2633 transitions. Second operand has 4 states, 4 states have (on average 33.75) internal successors, (135), 4 states have internal predecessors, (135), 1 states have call successors, (65), 1 states have call predecessors, (65), 1 states have return successors, (65), 1 states have call predecessors, (65), 1 states have call successors, (65) [2025-03-04 00:37:26,747 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 00:37:26,747 INFO L93 Difference]: Finished difference Result 6037 states and 9658 transitions. [2025-03-04 00:37:26,748 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-04 00:37:26,748 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 33.75) internal successors, (135), 4 states have internal predecessors, (135), 1 states have call successors, (65), 1 states have call predecessors, (65), 1 states have return successors, (65), 1 states have call predecessors, (65), 1 states have call successors, (65) Word has length 457 [2025-03-04 00:37:26,749 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 00:37:26,776 INFO L225 Difference]: With dead ends: 6037 [2025-03-04 00:37:26,776 INFO L226 Difference]: Without dead ends: 4541 [2025-03-04 00:37:26,784 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-03-04 00:37:26,784 INFO L435 NwaCegarLoop]: 407 mSDtfsCounter, 1022 mSDsluCounter, 802 mSDsCounter, 0 mSdLazyCounter, 83 mSolverCounterSat, 200 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1022 SdHoareTripleChecker+Valid, 1209 SdHoareTripleChecker+Invalid, 283 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 200 IncrementalHoareTripleChecker+Valid, 83 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-03-04 00:37:26,785 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1022 Valid, 1209 Invalid, 283 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [200 Valid, 83 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-04 00:37:26,790 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4541 states. [2025-03-04 00:37:26,988 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4541 to 4471. [2025-03-04 00:37:26,994 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4471 states, 4064 states have (on average 1.5669291338582678) internal successors, (6368), 4068 states have internal predecessors, (6368), 397 states have call successors, (397), 9 states have call predecessors, (397), 9 states have return successors, (397), 393 states have call predecessors, (397), 397 states have call successors, (397) [2025-03-04 00:37:27,010 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4471 states to 4471 states and 7162 transitions. [2025-03-04 00:37:27,013 INFO L78 Accepts]: Start accepts. Automaton has 4471 states and 7162 transitions. Word has length 457 [2025-03-04 00:37:27,014 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 00:37:27,014 INFO L471 AbstractCegarLoop]: Abstraction has 4471 states and 7162 transitions. [2025-03-04 00:37:27,014 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 33.75) internal successors, (135), 4 states have internal predecessors, (135), 1 states have call successors, (65), 1 states have call predecessors, (65), 1 states have return successors, (65), 1 states have call predecessors, (65), 1 states have call successors, (65) [2025-03-04 00:37:27,015 INFO L276 IsEmpty]: Start isEmpty. Operand 4471 states and 7162 transitions. [2025-03-04 00:37:27,020 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 459 [2025-03-04 00:37:27,020 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 00:37:27,020 INFO L218 NwaCegarLoop]: trace histogram [65, 65, 65, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-04 00:37:27,021 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-03-04 00:37:27,021 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 00:37:27,021 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 00:37:27,022 INFO L85 PathProgramCache]: Analyzing trace with hash -915999557, now seen corresponding path program 1 times [2025-03-04 00:37:27,022 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 00:37:27,022 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [913629585] [2025-03-04 00:37:27,022 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 00:37:27,022 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 00:37:27,064 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 458 statements into 1 equivalence classes. [2025-03-04 00:37:27,603 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 458 of 458 statements. [2025-03-04 00:37:27,603 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 00:37:27,603 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 00:37:31,741 INFO L134 CoverageAnalysis]: Checked inductivity of 8320 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 8320 trivial. 0 not checked. [2025-03-04 00:37:31,741 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 00:37:31,741 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [913629585] [2025-03-04 00:37:31,741 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [913629585] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 00:37:31,741 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 00:37:31,741 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2025-03-04 00:37:31,741 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [446432692] [2025-03-04 00:37:31,741 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 00:37:31,743 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-03-04 00:37:31,743 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 00:37:31,744 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-03-04 00:37:31,744 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2025-03-04 00:37:31,744 INFO L87 Difference]: Start difference. First operand 4471 states and 7162 transitions. Second operand has 9 states, 9 states have (on average 15.11111111111111) internal successors, (136), 9 states have internal predecessors, (136), 1 states have call successors, (65), 1 states have call predecessors, (65), 1 states have return successors, (65), 1 states have call predecessors, (65), 1 states have call successors, (65) [2025-03-04 00:37:33,323 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 00:37:33,323 INFO L93 Difference]: Finished difference Result 9777 states and 15575 transitions. [2025-03-04 00:37:33,324 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2025-03-04 00:37:33,324 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 15.11111111111111) internal successors, (136), 9 states have internal predecessors, (136), 1 states have call successors, (65), 1 states have call predecessors, (65), 1 states have return successors, (65), 1 states have call predecessors, (65), 1 states have call successors, (65) Word has length 458 [2025-03-04 00:37:33,325 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 00:37:33,350 INFO L225 Difference]: With dead ends: 9777 [2025-03-04 00:37:33,350 INFO L226 Difference]: Without dead ends: 6157 [2025-03-04 00:37:33,360 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 21 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=59, Invalid=151, Unknown=0, NotChecked=0, Total=210 [2025-03-04 00:37:33,361 INFO L435 NwaCegarLoop]: 409 mSDtfsCounter, 1838 mSDsluCounter, 1891 mSDsCounter, 0 mSdLazyCounter, 1025 mSolverCounterSat, 235 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1838 SdHoareTripleChecker+Valid, 2300 SdHoareTripleChecker+Invalid, 1260 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 235 IncrementalHoareTripleChecker+Valid, 1025 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.3s IncrementalHoareTripleChecker+Time [2025-03-04 00:37:33,361 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1838 Valid, 2300 Invalid, 1260 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [235 Valid, 1025 Invalid, 0 Unknown, 0 Unchecked, 1.3s Time] [2025-03-04 00:37:33,367 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6157 states. [2025-03-04 00:37:33,579 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6157 to 5551. [2025-03-04 00:37:33,588 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5551 states, 5108 states have (on average 1.5685199686765858) internal successors, (8012), 5116 states have internal predecessors, (8012), 429 states have call successors, (429), 13 states have call predecessors, (429), 13 states have return successors, (429), 421 states have call predecessors, (429), 429 states have call successors, (429) [2025-03-04 00:37:33,604 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5551 states to 5551 states and 8870 transitions. [2025-03-04 00:37:33,607 INFO L78 Accepts]: Start accepts. Automaton has 5551 states and 8870 transitions. Word has length 458 [2025-03-04 00:37:33,608 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 00:37:33,608 INFO L471 AbstractCegarLoop]: Abstraction has 5551 states and 8870 transitions. [2025-03-04 00:37:33,608 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 15.11111111111111) internal successors, (136), 9 states have internal predecessors, (136), 1 states have call successors, (65), 1 states have call predecessors, (65), 1 states have return successors, (65), 1 states have call predecessors, (65), 1 states have call successors, (65) [2025-03-04 00:37:33,608 INFO L276 IsEmpty]: Start isEmpty. Operand 5551 states and 8870 transitions. [2025-03-04 00:37:33,613 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 459 [2025-03-04 00:37:33,613 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 00:37:33,613 INFO L218 NwaCegarLoop]: trace histogram [65, 65, 65, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-04 00:37:33,613 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-03-04 00:37:33,614 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 00:37:33,614 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 00:37:33,615 INFO L85 PathProgramCache]: Analyzing trace with hash 53581466, now seen corresponding path program 1 times [2025-03-04 00:37:33,615 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 00:37:33,615 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1843408823] [2025-03-04 00:37:33,615 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 00:37:33,615 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 00:37:33,644 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 458 statements into 1 equivalence classes. [2025-03-04 00:37:34,079 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 458 of 458 statements. [2025-03-04 00:37:34,080 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 00:37:34,080 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 00:37:34,502 INFO L134 CoverageAnalysis]: Checked inductivity of 8320 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 8320 trivial. 0 not checked. [2025-03-04 00:37:34,502 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 00:37:34,502 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1843408823] [2025-03-04 00:37:34,502 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1843408823] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 00:37:34,502 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 00:37:34,502 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-04 00:37:34,502 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1079799233] [2025-03-04 00:37:34,502 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 00:37:34,503 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-04 00:37:34,503 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 00:37:34,503 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-04 00:37:34,504 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-04 00:37:34,504 INFO L87 Difference]: Start difference. First operand 5551 states and 8870 transitions. Second operand has 4 states, 4 states have (on average 34.0) internal successors, (136), 4 states have internal predecessors, (136), 1 states have call successors, (65), 1 states have call predecessors, (65), 1 states have return successors, (65), 1 states have call predecessors, (65), 1 states have call successors, (65) [2025-03-04 00:37:34,945 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 00:37:34,945 INFO L93 Difference]: Finished difference Result 10969 states and 17500 transitions. [2025-03-04 00:37:34,945 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-04 00:37:34,946 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 34.0) internal successors, (136), 4 states have internal predecessors, (136), 1 states have call successors, (65), 1 states have call predecessors, (65), 1 states have return successors, (65), 1 states have call predecessors, (65), 1 states have call successors, (65) Word has length 458 [2025-03-04 00:37:34,946 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 00:37:34,967 INFO L225 Difference]: With dead ends: 10969 [2025-03-04 00:37:34,967 INFO L226 Difference]: Without dead ends: 5625 [2025-03-04 00:37:34,976 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-03-04 00:37:34,977 INFO L435 NwaCegarLoop]: 408 mSDtfsCounter, 563 mSDsluCounter, 801 mSDsCounter, 0 mSdLazyCounter, 84 mSolverCounterSat, 198 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 563 SdHoareTripleChecker+Valid, 1209 SdHoareTripleChecker+Invalid, 282 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 198 IncrementalHoareTripleChecker+Valid, 84 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-03-04 00:37:34,977 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [563 Valid, 1209 Invalid, 282 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [198 Valid, 84 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-04 00:37:34,981 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5625 states. [2025-03-04 00:37:35,162 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5625 to 5567. [2025-03-04 00:37:35,171 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5567 states, 5124 states have (on average 1.564793130366901) internal successors, (8018), 5132 states have internal predecessors, (8018), 429 states have call successors, (429), 13 states have call predecessors, (429), 13 states have return successors, (429), 421 states have call predecessors, (429), 429 states have call successors, (429) [2025-03-04 00:37:35,185 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5567 states to 5567 states and 8876 transitions. [2025-03-04 00:37:35,188 INFO L78 Accepts]: Start accepts. Automaton has 5567 states and 8876 transitions. Word has length 458 [2025-03-04 00:37:35,189 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 00:37:35,189 INFO L471 AbstractCegarLoop]: Abstraction has 5567 states and 8876 transitions. [2025-03-04 00:37:35,189 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 34.0) internal successors, (136), 4 states have internal predecessors, (136), 1 states have call successors, (65), 1 states have call predecessors, (65), 1 states have return successors, (65), 1 states have call predecessors, (65), 1 states have call successors, (65) [2025-03-04 00:37:35,190 INFO L276 IsEmpty]: Start isEmpty. Operand 5567 states and 8876 transitions. [2025-03-04 00:37:35,194 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 460 [2025-03-04 00:37:35,194 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 00:37:35,194 INFO L218 NwaCegarLoop]: trace histogram [65, 65, 65, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-04 00:37:35,195 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-03-04 00:37:35,195 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 00:37:35,196 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 00:37:35,196 INFO L85 PathProgramCache]: Analyzing trace with hash -1763735013, now seen corresponding path program 1 times [2025-03-04 00:37:35,196 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 00:37:35,196 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [642613048] [2025-03-04 00:37:35,197 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 00:37:35,197 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 00:37:35,223 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 459 statements into 1 equivalence classes. [2025-03-04 00:37:35,408 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 459 of 459 statements. [2025-03-04 00:37:35,408 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 00:37:35,408 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 00:37:36,007 INFO L134 CoverageAnalysis]: Checked inductivity of 8320 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 8320 trivial. 0 not checked. [2025-03-04 00:37:36,007 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 00:37:36,007 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [642613048] [2025-03-04 00:37:36,007 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [642613048] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 00:37:36,007 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 00:37:36,007 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-04 00:37:36,007 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1253906167] [2025-03-04 00:37:36,007 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 00:37:36,008 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-04 00:37:36,008 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 00:37:36,008 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-04 00:37:36,008 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-04 00:37:36,009 INFO L87 Difference]: Start difference. First operand 5567 states and 8876 transitions. Second operand has 5 states, 5 states have (on average 27.4) internal successors, (137), 5 states have internal predecessors, (137), 1 states have call successors, (65), 1 states have call predecessors, (65), 1 states have return successors, (65), 1 states have call predecessors, (65), 1 states have call successors, (65) [2025-03-04 00:37:36,526 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 00:37:36,527 INFO L93 Difference]: Finished difference Result 10911 states and 17372 transitions. [2025-03-04 00:37:36,527 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-04 00:37:36,528 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 27.4) internal successors, (137), 5 states have internal predecessors, (137), 1 states have call successors, (65), 1 states have call predecessors, (65), 1 states have return successors, (65), 1 states have call predecessors, (65), 1 states have call successors, (65) Word has length 459 [2025-03-04 00:37:36,528 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 00:37:36,551 INFO L225 Difference]: With dead ends: 10911 [2025-03-04 00:37:36,551 INFO L226 Difference]: Without dead ends: 5625 [2025-03-04 00:37:36,561 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2025-03-04 00:37:36,563 INFO L435 NwaCegarLoop]: 413 mSDtfsCounter, 341 mSDsluCounter, 1082 mSDsCounter, 0 mSdLazyCounter, 231 mSolverCounterSat, 196 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 341 SdHoareTripleChecker+Valid, 1495 SdHoareTripleChecker+Invalid, 427 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 196 IncrementalHoareTripleChecker+Valid, 231 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-03-04 00:37:36,563 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [341 Valid, 1495 Invalid, 427 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [196 Valid, 231 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-03-04 00:37:36,568 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5625 states. [2025-03-04 00:37:36,740 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5625 to 5567. [2025-03-04 00:37:36,747 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5567 states, 5124 states have (on average 1.563231850117096) internal successors, (8010), 5132 states have internal predecessors, (8010), 429 states have call successors, (429), 13 states have call predecessors, (429), 13 states have return successors, (429), 421 states have call predecessors, (429), 429 states have call successors, (429) [2025-03-04 00:37:36,759 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5567 states to 5567 states and 8868 transitions. [2025-03-04 00:37:36,762 INFO L78 Accepts]: Start accepts. Automaton has 5567 states and 8868 transitions. Word has length 459 [2025-03-04 00:37:36,763 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 00:37:36,763 INFO L471 AbstractCegarLoop]: Abstraction has 5567 states and 8868 transitions. [2025-03-04 00:37:36,763 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 27.4) internal successors, (137), 5 states have internal predecessors, (137), 1 states have call successors, (65), 1 states have call predecessors, (65), 1 states have return successors, (65), 1 states have call predecessors, (65), 1 states have call successors, (65) [2025-03-04 00:37:36,763 INFO L276 IsEmpty]: Start isEmpty. Operand 5567 states and 8868 transitions. [2025-03-04 00:37:36,768 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 460 [2025-03-04 00:37:36,768 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 00:37:36,768 INFO L218 NwaCegarLoop]: trace histogram [65, 65, 65, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-04 00:37:36,769 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2025-03-04 00:37:36,769 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 00:37:36,769 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 00:37:36,769 INFO L85 PathProgramCache]: Analyzing trace with hash -2010048100, now seen corresponding path program 1 times [2025-03-04 00:37:36,769 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 00:37:36,769 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1400342842] [2025-03-04 00:37:36,772 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 00:37:36,772 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 00:37:36,803 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 459 statements into 1 equivalence classes. [2025-03-04 00:37:37,419 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 459 of 459 statements. [2025-03-04 00:37:37,419 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 00:37:37,419 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 00:37:37,846 INFO L134 CoverageAnalysis]: Checked inductivity of 8320 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 8320 trivial. 0 not checked. [2025-03-04 00:37:37,847 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 00:37:37,847 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1400342842] [2025-03-04 00:37:37,847 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1400342842] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 00:37:37,847 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 00:37:37,847 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-04 00:37:37,847 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1094097553] [2025-03-04 00:37:37,847 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 00:37:37,848 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-04 00:37:37,848 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 00:37:37,848 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-04 00:37:37,848 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-03-04 00:37:37,848 INFO L87 Difference]: Start difference. First operand 5567 states and 8868 transitions. Second operand has 4 states, 4 states have (on average 34.25) internal successors, (137), 4 states have internal predecessors, (137), 1 states have call successors, (65), 1 states have call predecessors, (65), 1 states have return successors, (65), 1 states have call predecessors, (65), 1 states have call successors, (65) [2025-03-04 00:37:38,280 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 00:37:38,281 INFO L93 Difference]: Finished difference Result 13677 states and 21866 transitions. [2025-03-04 00:37:38,281 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-04 00:37:38,282 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 34.25) internal successors, (137), 4 states have internal predecessors, (137), 1 states have call successors, (65), 1 states have call predecessors, (65), 1 states have return successors, (65), 1 states have call predecessors, (65), 1 states have call successors, (65) Word has length 459 [2025-03-04 00:37:38,282 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 00:37:38,309 INFO L225 Difference]: With dead ends: 13677 [2025-03-04 00:37:38,309 INFO L226 Difference]: Without dead ends: 9677 [2025-03-04 00:37:38,319 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-03-04 00:37:38,320 INFO L435 NwaCegarLoop]: 643 mSDtfsCounter, 394 mSDsluCounter, 905 mSDsCounter, 0 mSdLazyCounter, 211 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 394 SdHoareTripleChecker+Valid, 1548 SdHoareTripleChecker+Invalid, 213 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 211 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-03-04 00:37:38,320 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [394 Valid, 1548 Invalid, 213 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 211 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-04 00:37:38,328 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9677 states. [2025-03-04 00:37:38,506 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9677 to 5595. [2025-03-04 00:37:38,513 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5595 states, 5152 states have (on average 1.56055900621118) internal successors, (8040), 5160 states have internal predecessors, (8040), 429 states have call successors, (429), 13 states have call predecessors, (429), 13 states have return successors, (429), 421 states have call predecessors, (429), 429 states have call successors, (429) [2025-03-04 00:37:38,523 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5595 states to 5595 states and 8898 transitions. [2025-03-04 00:37:38,530 INFO L78 Accepts]: Start accepts. Automaton has 5595 states and 8898 transitions. Word has length 459 [2025-03-04 00:37:38,530 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 00:37:38,530 INFO L471 AbstractCegarLoop]: Abstraction has 5595 states and 8898 transitions. [2025-03-04 00:37:38,531 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 34.25) internal successors, (137), 4 states have internal predecessors, (137), 1 states have call successors, (65), 1 states have call predecessors, (65), 1 states have return successors, (65), 1 states have call predecessors, (65), 1 states have call successors, (65) [2025-03-04 00:37:38,531 INFO L276 IsEmpty]: Start isEmpty. Operand 5595 states and 8898 transitions. [2025-03-04 00:37:38,535 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 460 [2025-03-04 00:37:38,535 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 00:37:38,535 INFO L218 NwaCegarLoop]: trace histogram [65, 65, 65, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-04 00:37:38,536 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2025-03-04 00:37:38,536 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 00:37:38,536 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 00:37:38,536 INFO L85 PathProgramCache]: Analyzing trace with hash 1101571899, now seen corresponding path program 1 times [2025-03-04 00:37:38,536 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 00:37:38,536 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [850921179] [2025-03-04 00:37:38,537 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 00:37:38,537 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 00:37:38,568 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 459 statements into 1 equivalence classes. [2025-03-04 00:37:40,550 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 459 of 459 statements. [2025-03-04 00:37:40,550 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 00:37:40,550 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 00:37:42,151 INFO L134 CoverageAnalysis]: Checked inductivity of 8320 backedges. 18 proven. 174 refuted. 0 times theorem prover too weak. 8128 trivial. 0 not checked. [2025-03-04 00:37:42,152 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 00:37:42,153 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [850921179] [2025-03-04 00:37:42,153 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [850921179] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 00:37:42,153 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1080397859] [2025-03-04 00:37:42,153 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 00:37:42,153 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 00:37:42,154 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 00:37:42,155 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-04 00:37:42,157 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-04 00:37:42,317 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 459 statements into 1 equivalence classes. [2025-03-04 00:37:42,426 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 459 of 459 statements. [2025-03-04 00:37:42,426 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 00:37:42,426 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 00:37:42,434 INFO L256 TraceCheckSpWp]: Trace formula consists of 1193 conjuncts, 7 conjuncts are in the unsatisfiable core [2025-03-04 00:37:42,444 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 00:37:42,837 INFO L134 CoverageAnalysis]: Checked inductivity of 8320 backedges. 2584 proven. 156 refuted. 0 times theorem prover too weak. 5580 trivial. 0 not checked. [2025-03-04 00:37:42,838 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 00:37:43,207 INFO L134 CoverageAnalysis]: Checked inductivity of 8320 backedges. 36 proven. 156 refuted. 0 times theorem prover too weak. 8128 trivial. 0 not checked. [2025-03-04 00:37:43,207 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1080397859] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-04 00:37:43,207 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-04 00:37:43,208 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 6, 6] total 14 [2025-03-04 00:37:43,208 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [950755777] [2025-03-04 00:37:43,208 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-04 00:37:43,209 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2025-03-04 00:37:43,210 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 00:37:43,211 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2025-03-04 00:37:43,211 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=146, Unknown=0, NotChecked=0, Total=182 [2025-03-04 00:37:43,212 INFO L87 Difference]: Start difference. First operand 5595 states and 8898 transitions. Second operand has 14 states, 14 states have (on average 22.857142857142858) internal successors, (320), 14 states have internal predecessors, (320), 5 states have call successors, (182), 2 states have call predecessors, (182), 4 states have return successors, (183), 5 states have call predecessors, (183), 5 states have call successors, (183) [2025-03-04 00:37:45,212 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 00:37:45,212 INFO L93 Difference]: Finished difference Result 19519 states and 31093 transitions. [2025-03-04 00:37:45,213 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2025-03-04 00:37:45,213 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 22.857142857142858) internal successors, (320), 14 states have internal predecessors, (320), 5 states have call successors, (182), 2 states have call predecessors, (182), 4 states have return successors, (183), 5 states have call predecessors, (183), 5 states have call successors, (183) Word has length 459 [2025-03-04 00:37:45,213 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 00:37:45,246 INFO L225 Difference]: With dead ends: 19519 [2025-03-04 00:37:45,246 INFO L226 Difference]: Without dead ends: 14189 [2025-03-04 00:37:45,258 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 944 GetRequests, 915 SyntacticMatches, 0 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 152 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=240, Invalid=690, Unknown=0, NotChecked=0, Total=930 [2025-03-04 00:37:45,258 INFO L435 NwaCegarLoop]: 577 mSDtfsCounter, 2857 mSDsluCounter, 2623 mSDsCounter, 0 mSdLazyCounter, 1308 mSolverCounterSat, 591 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2869 SdHoareTripleChecker+Valid, 3200 SdHoareTripleChecker+Invalid, 1899 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 591 IncrementalHoareTripleChecker+Valid, 1308 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.4s IncrementalHoareTripleChecker+Time [2025-03-04 00:37:45,259 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2869 Valid, 3200 Invalid, 1899 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [591 Valid, 1308 Invalid, 0 Unknown, 0 Unchecked, 1.4s Time] [2025-03-04 00:37:45,270 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14189 states. [2025-03-04 00:37:45,662 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14189 to 10371. [2025-03-04 00:37:45,675 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10371 states, 9522 states have (on average 1.54820415879017) internal successors, (14742), 9538 states have internal predecessors, (14742), 793 states have call successors, (793), 55 states have call predecessors, (793), 55 states have return successors, (793), 777 states have call predecessors, (793), 793 states have call successors, (793) [2025-03-04 00:37:45,691 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10371 states to 10371 states and 16328 transitions. [2025-03-04 00:37:45,695 INFO L78 Accepts]: Start accepts. Automaton has 10371 states and 16328 transitions. Word has length 459 [2025-03-04 00:37:45,695 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 00:37:45,695 INFO L471 AbstractCegarLoop]: Abstraction has 10371 states and 16328 transitions. [2025-03-04 00:37:45,696 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 22.857142857142858) internal successors, (320), 14 states have internal predecessors, (320), 5 states have call successors, (182), 2 states have call predecessors, (182), 4 states have return successors, (183), 5 states have call predecessors, (183), 5 states have call successors, (183) [2025-03-04 00:37:45,696 INFO L276 IsEmpty]: Start isEmpty. Operand 10371 states and 16328 transitions. [2025-03-04 00:37:45,703 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 461 [2025-03-04 00:37:45,704 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 00:37:45,704 INFO L218 NwaCegarLoop]: trace histogram [65, 65, 65, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-04 00:37:45,715 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2025-03-04 00:37:45,908 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-04 00:37:45,908 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 00:37:45,909 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 00:37:45,909 INFO L85 PathProgramCache]: Analyzing trace with hash 1088324255, now seen corresponding path program 1 times [2025-03-04 00:37:45,909 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 00:37:45,910 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [38893728] [2025-03-04 00:37:45,910 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 00:37:45,910 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 00:37:45,939 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 460 statements into 1 equivalence classes. [2025-03-04 00:37:53,442 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 460 of 460 statements. [2025-03-04 00:37:53,443 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 00:37:53,443 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 00:37:53,976 INFO L134 CoverageAnalysis]: Checked inductivity of 8320 backedges. 99 proven. 93 refuted. 0 times theorem prover too weak. 8128 trivial. 0 not checked. [2025-03-04 00:37:53,976 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 00:37:53,976 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [38893728] [2025-03-04 00:37:53,977 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [38893728] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 00:37:53,977 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [941847656] [2025-03-04 00:37:53,977 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 00:37:53,977 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 00:37:53,977 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 00:37:53,980 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-04 00:37:53,981 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2025-03-04 00:37:54,142 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 460 statements into 1 equivalence classes. [2025-03-04 00:37:54,245 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 460 of 460 statements. [2025-03-04 00:37:54,246 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 00:37:54,246 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 00:37:54,252 INFO L256 TraceCheckSpWp]: Trace formula consists of 1193 conjuncts, 6 conjuncts are in the unsatisfiable core [2025-03-04 00:37:54,260 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 00:37:54,596 INFO L134 CoverageAnalysis]: Checked inductivity of 8320 backedges. 4092 proven. 78 refuted. 0 times theorem prover too weak. 4150 trivial. 0 not checked. [2025-03-04 00:37:54,596 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 00:37:54,984 INFO L134 CoverageAnalysis]: Checked inductivity of 8320 backedges. 114 proven. 78 refuted. 0 times theorem prover too weak. 8128 trivial. 0 not checked. [2025-03-04 00:37:54,984 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [941847656] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-04 00:37:54,984 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-04 00:37:54,984 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 5, 5] total 9 [2025-03-04 00:37:54,984 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [245612388] [2025-03-04 00:37:54,984 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-04 00:37:54,985 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-03-04 00:37:54,985 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 00:37:54,986 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-03-04 00:37:54,986 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=50, Unknown=0, NotChecked=0, Total=72 [2025-03-04 00:37:54,987 INFO L87 Difference]: Start difference. First operand 10371 states and 16328 transitions. Second operand has 9 states, 9 states have (on average 28.666666666666668) internal successors, (258), 9 states have internal predecessors, (258), 4 states have call successors, (156), 2 states have call predecessors, (156), 4 states have return successors, (157), 4 states have call predecessors, (157), 4 states have call successors, (157) [2025-03-04 00:37:56,103 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 00:37:56,103 INFO L93 Difference]: Finished difference Result 29083 states and 45660 transitions. [2025-03-04 00:37:56,103 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2025-03-04 00:37:56,104 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 28.666666666666668) internal successors, (258), 9 states have internal predecessors, (258), 4 states have call successors, (156), 2 states have call predecessors, (156), 4 states have return successors, (157), 4 states have call predecessors, (157), 4 states have call successors, (157) Word has length 460 [2025-03-04 00:37:56,104 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 00:37:56,150 INFO L225 Difference]: With dead ends: 29083 [2025-03-04 00:37:56,150 INFO L226 Difference]: Without dead ends: 18897 [2025-03-04 00:37:56,171 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 939 GetRequests, 917 SyntacticMatches, 1 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 98 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=154, Invalid=352, Unknown=0, NotChecked=0, Total=506 [2025-03-04 00:37:56,172 INFO L435 NwaCegarLoop]: 417 mSDtfsCounter, 1111 mSDsluCounter, 1037 mSDsCounter, 0 mSdLazyCounter, 539 mSolverCounterSat, 402 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1148 SdHoareTripleChecker+Valid, 1454 SdHoareTripleChecker+Invalid, 941 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 402 IncrementalHoareTripleChecker+Valid, 539 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-03-04 00:37:56,172 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1148 Valid, 1454 Invalid, 941 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [402 Valid, 539 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-03-04 00:37:56,185 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18897 states. [2025-03-04 00:37:56,804 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18897 to 18795. [2025-03-04 00:37:56,829 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 18795 states, 17140 states have (on average 1.5263710618436406) internal successors, (26162), 17172 states have internal predecessors, (26162), 1521 states have call successors, (1521), 133 states have call predecessors, (1521), 133 states have return successors, (1521), 1489 states have call predecessors, (1521), 1521 states have call successors, (1521) [2025-03-04 00:37:56,859 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18795 states to 18795 states and 29204 transitions. [2025-03-04 00:37:56,867 INFO L78 Accepts]: Start accepts. Automaton has 18795 states and 29204 transitions. Word has length 460 [2025-03-04 00:37:56,867 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 00:37:56,867 INFO L471 AbstractCegarLoop]: Abstraction has 18795 states and 29204 transitions. [2025-03-04 00:37:56,868 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 28.666666666666668) internal successors, (258), 9 states have internal predecessors, (258), 4 states have call successors, (156), 2 states have call predecessors, (156), 4 states have return successors, (157), 4 states have call predecessors, (157), 4 states have call successors, (157) [2025-03-04 00:37:56,868 INFO L276 IsEmpty]: Start isEmpty. Operand 18795 states and 29204 transitions. [2025-03-04 00:37:56,878 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 463 [2025-03-04 00:37:56,878 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 00:37:56,878 INFO L218 NwaCegarLoop]: trace histogram [65, 65, 65, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-04 00:37:56,886 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2025-03-04 00:37:57,079 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 00:37:57,079 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 00:37:57,080 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 00:37:57,080 INFO L85 PathProgramCache]: Analyzing trace with hash 401088378, now seen corresponding path program 1 times [2025-03-04 00:37:57,080 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 00:37:57,081 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [611357409] [2025-03-04 00:37:57,081 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 00:37:57,081 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 00:37:57,111 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 462 statements into 1 equivalence classes. [2025-03-04 00:37:57,963 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 462 of 462 statements. [2025-03-04 00:37:57,963 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 00:37:57,963 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 00:38:01,033 INFO L134 CoverageAnalysis]: Checked inductivity of 8320 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 8320 trivial. 0 not checked. [2025-03-04 00:38:01,033 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 00:38:01,033 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [611357409] [2025-03-04 00:38:01,033 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [611357409] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 00:38:01,033 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 00:38:01,033 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2025-03-04 00:38:01,033 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1187157814] [2025-03-04 00:38:01,033 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 00:38:01,034 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2025-03-04 00:38:01,034 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 00:38:01,041 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2025-03-04 00:38:01,041 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=88, Unknown=0, NotChecked=0, Total=110 [2025-03-04 00:38:01,041 INFO L87 Difference]: Start difference. First operand 18795 states and 29204 transitions. Second operand has 11 states, 11 states have (on average 12.727272727272727) internal successors, (140), 11 states have internal predecessors, (140), 1 states have call successors, (65), 1 states have call predecessors, (65), 1 states have return successors, (65), 1 states have call predecessors, (65), 1 states have call successors, (65) [2025-03-04 00:38:04,140 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 00:38:04,141 INFO L93 Difference]: Finished difference Result 44923 states and 69392 transitions. [2025-03-04 00:38:04,141 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-03-04 00:38:04,141 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 12.727272727272727) internal successors, (140), 11 states have internal predecessors, (140), 1 states have call successors, (65), 1 states have call predecessors, (65), 1 states have return successors, (65), 1 states have call predecessors, (65), 1 states have call successors, (65) Word has length 462 [2025-03-04 00:38:04,142 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 00:38:04,219 INFO L225 Difference]: With dead ends: 44923 [2025-03-04 00:38:04,219 INFO L226 Difference]: Without dead ends: 28633 [2025-03-04 00:38:04,247 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 19 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=73, Invalid=233, Unknown=0, NotChecked=0, Total=306 [2025-03-04 00:38:04,247 INFO L435 NwaCegarLoop]: 433 mSDtfsCounter, 1214 mSDsluCounter, 2642 mSDsCounter, 0 mSdLazyCounter, 1687 mSolverCounterSat, 197 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1214 SdHoareTripleChecker+Valid, 3075 SdHoareTripleChecker+Invalid, 1884 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 197 IncrementalHoareTripleChecker+Valid, 1687 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.1s IncrementalHoareTripleChecker+Time [2025-03-04 00:38:04,248 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1214 Valid, 3075 Invalid, 1884 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [197 Valid, 1687 Invalid, 0 Unknown, 0 Unchecked, 2.1s Time] [2025-03-04 00:38:04,265 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28633 states. [2025-03-04 00:38:05,083 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28633 to 20915. [2025-03-04 00:38:05,105 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 20915 states, 19260 states have (on average 1.526583592938733) internal successors, (29402), 19292 states have internal predecessors, (29402), 1521 states have call successors, (1521), 133 states have call predecessors, (1521), 133 states have return successors, (1521), 1489 states have call predecessors, (1521), 1521 states have call successors, (1521) [2025-03-04 00:38:05,137 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20915 states to 20915 states and 32444 transitions. [2025-03-04 00:38:05,145 INFO L78 Accepts]: Start accepts. Automaton has 20915 states and 32444 transitions. Word has length 462 [2025-03-04 00:38:05,146 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 00:38:05,146 INFO L471 AbstractCegarLoop]: Abstraction has 20915 states and 32444 transitions. [2025-03-04 00:38:05,146 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 12.727272727272727) internal successors, (140), 11 states have internal predecessors, (140), 1 states have call successors, (65), 1 states have call predecessors, (65), 1 states have return successors, (65), 1 states have call predecessors, (65), 1 states have call successors, (65) [2025-03-04 00:38:05,146 INFO L276 IsEmpty]: Start isEmpty. Operand 20915 states and 32444 transitions. [2025-03-04 00:38:05,158 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 463 [2025-03-04 00:38:05,158 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 00:38:05,158 INFO L218 NwaCegarLoop]: trace histogram [65, 65, 65, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-04 00:38:05,158 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2025-03-04 00:38:05,159 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 00:38:05,159 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 00:38:05,159 INFO L85 PathProgramCache]: Analyzing trace with hash 730854139, now seen corresponding path program 1 times [2025-03-04 00:38:05,159 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 00:38:05,159 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [903838838] [2025-03-04 00:38:05,159 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 00:38:05,159 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 00:38:05,183 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 462 statements into 1 equivalence classes. [2025-03-04 00:38:05,233 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 462 of 462 statements. [2025-03-04 00:38:05,233 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 00:38:05,233 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 00:38:05,745 INFO L134 CoverageAnalysis]: Checked inductivity of 8320 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 8320 trivial. 0 not checked. [2025-03-04 00:38:05,745 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 00:38:05,745 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [903838838] [2025-03-04 00:38:05,745 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [903838838] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 00:38:05,745 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 00:38:05,746 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-04 00:38:05,746 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1421904461] [2025-03-04 00:38:05,746 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 00:38:05,746 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-04 00:38:05,746 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 00:38:05,747 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-04 00:38:05,747 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-03-04 00:38:05,747 INFO L87 Difference]: Start difference. First operand 20915 states and 32444 transitions. Second operand has 5 states, 5 states have (on average 28.0) internal successors, (140), 5 states have internal predecessors, (140), 1 states have call successors, (65), 1 states have call predecessors, (65), 1 states have return successors, (65), 1 states have call predecessors, (65), 1 states have call successors, (65) [2025-03-04 00:38:06,720 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 00:38:06,720 INFO L93 Difference]: Finished difference Result 54231 states and 84222 transitions. [2025-03-04 00:38:06,721 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-04 00:38:06,721 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 28.0) internal successors, (140), 5 states have internal predecessors, (140), 1 states have call successors, (65), 1 states have call predecessors, (65), 1 states have return successors, (65), 1 states have call predecessors, (65), 1 states have call successors, (65) Word has length 462 [2025-03-04 00:38:06,721 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 00:38:06,805 INFO L225 Difference]: With dead ends: 54231 [2025-03-04 00:38:06,806 INFO L226 Difference]: Without dead ends: 37941 [2025-03-04 00:38:06,841 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 3 SyntacticMatches, 1 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2025-03-04 00:38:06,842 INFO L435 NwaCegarLoop]: 536 mSDtfsCounter, 471 mSDsluCounter, 766 mSDsCounter, 0 mSdLazyCounter, 229 mSolverCounterSat, 65 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 471 SdHoareTripleChecker+Valid, 1302 SdHoareTripleChecker+Invalid, 294 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 65 IncrementalHoareTripleChecker+Valid, 229 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-03-04 00:38:06,842 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [471 Valid, 1302 Invalid, 294 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [65 Valid, 229 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-04 00:38:06,868 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 37941 states. [2025-03-04 00:38:08,064 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 37941 to 37939. [2025-03-04 00:38:08,099 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 37939 states, 34700 states have (on average 1.5228242074927953) internal successors, (52842), 34764 states have internal predecessors, (52842), 2977 states have call successors, (2977), 261 states have call predecessors, (2977), 261 states have return successors, (2977), 2913 states have call predecessors, (2977), 2977 states have call successors, (2977) [2025-03-04 00:38:08,159 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37939 states to 37939 states and 58796 transitions. [2025-03-04 00:38:08,172 INFO L78 Accepts]: Start accepts. Automaton has 37939 states and 58796 transitions. Word has length 462 [2025-03-04 00:38:08,172 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 00:38:08,172 INFO L471 AbstractCegarLoop]: Abstraction has 37939 states and 58796 transitions. [2025-03-04 00:38:08,172 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 28.0) internal successors, (140), 5 states have internal predecessors, (140), 1 states have call successors, (65), 1 states have call predecessors, (65), 1 states have return successors, (65), 1 states have call predecessors, (65), 1 states have call successors, (65) [2025-03-04 00:38:08,172 INFO L276 IsEmpty]: Start isEmpty. Operand 37939 states and 58796 transitions. [2025-03-04 00:38:08,188 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 464 [2025-03-04 00:38:08,188 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 00:38:08,188 INFO L218 NwaCegarLoop]: trace histogram [65, 65, 65, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-04 00:38:08,189 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2025-03-04 00:38:08,189 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 00:38:08,189 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 00:38:08,189 INFO L85 PathProgramCache]: Analyzing trace with hash -2031413894, now seen corresponding path program 1 times [2025-03-04 00:38:08,189 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 00:38:08,189 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [508164522] [2025-03-04 00:38:08,190 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 00:38:08,190 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 00:38:08,213 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 463 statements into 1 equivalence classes. [2025-03-04 00:38:10,126 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 463 of 463 statements. [2025-03-04 00:38:10,127 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 00:38:10,127 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 00:38:10,782 INFO L134 CoverageAnalysis]: Checked inductivity of 8320 backedges. 114 proven. 78 refuted. 0 times theorem prover too weak. 8128 trivial. 0 not checked. [2025-03-04 00:38:10,783 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 00:38:10,783 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [508164522] [2025-03-04 00:38:10,783 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [508164522] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 00:38:10,783 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1097716058] [2025-03-04 00:38:10,783 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 00:38:10,783 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 00:38:10,783 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 00:38:10,785 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-04 00:38:10,786 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2025-03-04 00:38:10,945 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 463 statements into 1 equivalence classes. [2025-03-04 00:38:11,050 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 463 of 463 statements. [2025-03-04 00:38:11,050 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 00:38:11,050 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 00:38:11,056 INFO L256 TraceCheckSpWp]: Trace formula consists of 1197 conjuncts, 8 conjuncts are in the unsatisfiable core [2025-03-04 00:38:11,063 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 00:38:12,154 INFO L134 CoverageAnalysis]: Checked inductivity of 8320 backedges. 2584 proven. 156 refuted. 0 times theorem prover too weak. 5580 trivial. 0 not checked. [2025-03-04 00:38:12,155 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 00:38:14,517 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1097716058] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 00:38:14,517 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2025-03-04 00:38:14,517 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 7] total 9 [2025-03-04 00:38:14,517 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [163632016] [2025-03-04 00:38:14,517 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2025-03-04 00:38:14,518 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-03-04 00:38:14,518 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 00:38:14,518 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-03-04 00:38:14,518 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=105, Unknown=0, NotChecked=0, Total=132 [2025-03-04 00:38:14,519 INFO L87 Difference]: Start difference. First operand 37939 states and 58796 transitions. Second operand has 9 states, 9 states have (on average 27.77777777777778) internal successors, (250), 9 states have internal predecessors, (250), 3 states have call successors, (117), 2 states have call predecessors, (117), 3 states have return successors, (118), 3 states have call predecessors, (118), 3 states have call successors, (118) [2025-03-04 00:38:17,771 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 00:38:17,771 INFO L93 Difference]: Finished difference Result 76821 states and 118869 transitions. [2025-03-04 00:38:17,771 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2025-03-04 00:38:17,772 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 27.77777777777778) internal successors, (250), 9 states have internal predecessors, (250), 3 states have call successors, (117), 2 states have call predecessors, (117), 3 states have return successors, (118), 3 states have call predecessors, (118), 3 states have call successors, (118) Word has length 463 [2025-03-04 00:38:17,772 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 00:38:17,860 INFO L225 Difference]: With dead ends: 76821 [2025-03-04 00:38:17,860 INFO L226 Difference]: Without dead ends: 43523 [2025-03-04 00:38:17,906 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 596 GetRequests, 561 SyntacticMatches, 0 SemanticMatches, 35 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 278 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=320, Invalid=1012, Unknown=0, NotChecked=0, Total=1332 [2025-03-04 00:38:17,907 INFO L435 NwaCegarLoop]: 427 mSDtfsCounter, 1444 mSDsluCounter, 1607 mSDsCounter, 0 mSdLazyCounter, 1310 mSolverCounterSat, 302 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1446 SdHoareTripleChecker+Valid, 2034 SdHoareTripleChecker+Invalid, 1612 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 302 IncrementalHoareTripleChecker+Valid, 1310 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.8s IncrementalHoareTripleChecker+Time [2025-03-04 00:38:17,907 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1446 Valid, 2034 Invalid, 1612 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [302 Valid, 1310 Invalid, 0 Unknown, 0 Unchecked, 1.8s Time] [2025-03-04 00:38:17,934 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 43523 states. [2025-03-04 00:38:19,339 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 43523 to 40943. [2025-03-04 00:38:19,368 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 40943 states, 37255 states have (on average 1.51660179841632) internal successors, (56501), 37351 states have internal predecessors, (56501), 3361 states have call successors, (3361), 326 states have call predecessors, (3361), 326 states have return successors, (3361), 3265 states have call predecessors, (3361), 3361 states have call successors, (3361) [2025-03-04 00:38:19,435 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40943 states to 40943 states and 63223 transitions. [2025-03-04 00:38:19,447 INFO L78 Accepts]: Start accepts. Automaton has 40943 states and 63223 transitions. Word has length 463 [2025-03-04 00:38:19,447 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 00:38:19,447 INFO L471 AbstractCegarLoop]: Abstraction has 40943 states and 63223 transitions. [2025-03-04 00:38:19,447 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 27.77777777777778) internal successors, (250), 9 states have internal predecessors, (250), 3 states have call successors, (117), 2 states have call predecessors, (117), 3 states have return successors, (118), 3 states have call predecessors, (118), 3 states have call successors, (118) [2025-03-04 00:38:19,447 INFO L276 IsEmpty]: Start isEmpty. Operand 40943 states and 63223 transitions. [2025-03-04 00:38:19,460 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 464 [2025-03-04 00:38:19,460 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 00:38:19,460 INFO L218 NwaCegarLoop]: trace histogram [65, 65, 65, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-04 00:38:19,469 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2025-03-04 00:38:19,661 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable17 [2025-03-04 00:38:19,661 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 00:38:19,661 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 00:38:19,662 INFO L85 PathProgramCache]: Analyzing trace with hash 1782055413, now seen corresponding path program 1 times [2025-03-04 00:38:19,662 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 00:38:19,662 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [448745003] [2025-03-04 00:38:19,662 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 00:38:19,662 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 00:38:19,691 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 463 statements into 1 equivalence classes. [2025-03-04 00:38:19,719 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 463 of 463 statements. [2025-03-04 00:38:19,720 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 00:38:19,720 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 00:38:19,828 INFO L134 CoverageAnalysis]: Checked inductivity of 8320 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 8320 trivial. 0 not checked. [2025-03-04 00:38:19,829 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 00:38:19,829 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [448745003] [2025-03-04 00:38:19,829 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [448745003] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 00:38:19,829 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 00:38:19,829 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-04 00:38:19,829 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [883698522] [2025-03-04 00:38:19,829 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 00:38:19,829 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-04 00:38:19,830 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 00:38:19,830 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-04 00:38:19,830 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-04 00:38:19,830 INFO L87 Difference]: Start difference. First operand 40943 states and 63223 transitions. Second operand has 3 states, 3 states have (on average 47.0) internal successors, (141), 3 states have internal predecessors, (141), 1 states have call successors, (65), 1 states have call predecessors, (65), 1 states have return successors, (65), 1 states have call predecessors, (65), 1 states have call successors, (65) [2025-03-04 00:38:21,703 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 00:38:21,704 INFO L93 Difference]: Finished difference Result 111483 states and 172273 transitions. [2025-03-04 00:38:21,704 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-04 00:38:21,704 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 47.0) internal successors, (141), 3 states have internal predecessors, (141), 1 states have call successors, (65), 1 states have call predecessors, (65), 1 states have return successors, (65), 1 states have call predecessors, (65), 1 states have call successors, (65) Word has length 463 [2025-03-04 00:38:21,705 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 00:38:21,853 INFO L225 Difference]: With dead ends: 111483 [2025-03-04 00:38:21,853 INFO L226 Difference]: Without dead ends: 71577 [2025-03-04 00:38:21,915 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-04 00:38:21,915 INFO L435 NwaCegarLoop]: 465 mSDtfsCounter, 406 mSDsluCounter, 407 mSDsCounter, 0 mSdLazyCounter, 35 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 406 SdHoareTripleChecker+Valid, 872 SdHoareTripleChecker+Invalid, 40 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 35 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-04 00:38:21,915 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [406 Valid, 872 Invalid, 40 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 35 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-04 00:38:21,960 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 71577 states.