./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-pe-ci_file-86.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_fillercode_fillercodestructure_filler-pe-ci_file-86.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 6abe9611945b9347dad66f4454ebe10d21d58cf2fa4c1fd6e8973cdda78a961e --- Real Ultimate output --- This is Ultimate 0.3.0-?-798a7b3-m [2025-03-03 20:34:41,370 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-03 20:34:41,425 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2025-03-03 20:34:41,431 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-03 20:34:41,432 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-03 20:34:41,448 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-03 20:34:41,449 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-03 20:34:41,449 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-03 20:34:41,449 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-03 20:34:41,450 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-03 20:34:41,450 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-03 20:34:41,450 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-03 20:34:41,450 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-03 20:34:41,450 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-03 20:34:41,450 INFO L153 SettingsManager]: * Use SBE=true [2025-03-03 20:34:41,451 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-03 20:34:41,451 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-03 20:34:41,451 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-03 20:34:41,452 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-03 20:34:41,452 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-03 20:34:41,452 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-03 20:34:41,452 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-03 20:34:41,452 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-03 20:34:41,452 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-03 20:34:41,452 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-03 20:34:41,452 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-03 20:34:41,452 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-03 20:34:41,452 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-03 20:34:41,453 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-03 20:34:41,453 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-03 20:34:41,453 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-03 20:34:41,453 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-03 20:34:41,453 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-03 20:34:41,453 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-03 20:34:41,454 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-03 20:34:41,454 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-03 20:34:41,454 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-03 20:34:41,454 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-03 20:34:41,454 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-03 20:34:41,454 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-03 20:34:41,454 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-03 20:34:41,454 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-03 20:34:41,454 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-03 20:34:41,454 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 -> 6abe9611945b9347dad66f4454ebe10d21d58cf2fa4c1fd6e8973cdda78a961e [2025-03-03 20:34:41,699 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-03 20:34:41,707 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-03 20:34:41,710 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-03 20:34:41,711 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-03 20:34:41,711 INFO L274 PluginConnector]: CDTParser initialized [2025-03-03 20:34:41,712 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-pe-ci_file-86.i [2025-03-03 20:34:42,825 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/2359fcb4c/50c1bcee88574300a6be34d8dfaac9c2/FLAG78c7a33a4 [2025-03-03 20:34:43,040 INFO L384 CDTParser]: Found 1 translation units. [2025-03-03 20:34:43,041 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-pe-ci_file-86.i [2025-03-03 20:34:43,047 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/2359fcb4c/50c1bcee88574300a6be34d8dfaac9c2/FLAG78c7a33a4 [2025-03-03 20:34:43,395 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/2359fcb4c/50c1bcee88574300a6be34d8dfaac9c2 [2025-03-03 20:34:43,396 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-03 20:34:43,397 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-03 20:34:43,398 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-03 20:34:43,398 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-03 20:34:43,401 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-03 20:34:43,402 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 03.03 08:34:43" (1/1) ... [2025-03-03 20:34:43,403 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@161d3f45 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 08:34:43, skipping insertion in model container [2025-03-03 20:34:43,403 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 03.03 08:34:43" (1/1) ... [2025-03-03 20:34:43,417 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-03 20:34:43,510 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_fillercode_fillercodestructure_filler-pe-ci_file-86.i[919,932] [2025-03-03 20:34:43,565 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-03 20:34:43,576 INFO L200 MainTranslator]: Completed pre-run [2025-03-03 20:34:43,584 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_fillercode_fillercodestructure_filler-pe-ci_file-86.i[919,932] [2025-03-03 20:34:43,617 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-03 20:34:43,631 INFO L204 MainTranslator]: Completed translation [2025-03-03 20:34:43,632 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 08:34:43 WrapperNode [2025-03-03 20:34:43,632 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-03 20:34:43,633 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-03 20:34:43,633 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-03 20:34:43,633 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-03 20:34:43,637 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 08:34:43" (1/1) ... [2025-03-03 20:34:43,649 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 08:34:43" (1/1) ... [2025-03-03 20:34:43,687 INFO L138 Inliner]: procedures = 26, calls = 40, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 233 [2025-03-03 20:34:43,688 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-03 20:34:43,688 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-03 20:34:43,688 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-03 20:34:43,688 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-03 20:34:43,697 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 08:34:43" (1/1) ... [2025-03-03 20:34:43,698 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 08:34:43" (1/1) ... [2025-03-03 20:34:43,700 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 08:34:43" (1/1) ... [2025-03-03 20:34:43,712 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2025-03-03 20:34:43,713 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 08:34:43" (1/1) ... [2025-03-03 20:34:43,713 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 08:34:43" (1/1) ... [2025-03-03 20:34:43,720 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 08:34:43" (1/1) ... [2025-03-03 20:34:43,722 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 08:34:43" (1/1) ... [2025-03-03 20:34:43,729 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 08:34:43" (1/1) ... [2025-03-03 20:34:43,735 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 08:34:43" (1/1) ... [2025-03-03 20:34:43,742 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-03 20:34:43,743 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-03 20:34:43,744 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-03 20:34:43,744 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-03 20:34:43,745 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 08:34:43" (1/1) ... [2025-03-03 20:34:43,749 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-03 20:34:43,759 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 20:34:43,772 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-03-03 20:34:43,777 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-03-03 20:34:43,792 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-03 20:34:43,792 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2025-03-03 20:34:43,793 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2025-03-03 20:34:43,793 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-03-03 20:34:43,793 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-03 20:34:43,793 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-03 20:34:43,864 INFO L256 CfgBuilder]: Building ICFG [2025-03-03 20:34:43,866 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-03 20:34:44,206 INFO L? ?]: Removed 23 outVars from TransFormulas that were not future-live. [2025-03-03 20:34:44,207 INFO L307 CfgBuilder]: Performing block encoding [2025-03-03 20:34:44,222 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-03 20:34:44,223 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-03 20:34:44,223 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 03.03 08:34:44 BoogieIcfgContainer [2025-03-03 20:34:44,223 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-03 20:34:44,225 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-03 20:34:44,225 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-03 20:34:44,229 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-03 20:34:44,229 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 03.03 08:34:43" (1/3) ... [2025-03-03 20:34:44,230 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3395d86b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 03.03 08:34:44, skipping insertion in model container [2025-03-03 20:34:44,230 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 08:34:43" (2/3) ... [2025-03-03 20:34:44,230 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3395d86b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 03.03 08:34:44, skipping insertion in model container [2025-03-03 20:34:44,230 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 03.03 08:34:44" (3/3) ... [2025-03-03 20:34:44,231 INFO L128 eAbstractionObserver]: Analyzing ICFG hardness_fillercode_fillercodestructure_filler-pe-ci_file-86.i [2025-03-03 20:34:44,241 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-03 20:34:44,244 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG hardness_fillercode_fillercodestructure_filler-pe-ci_file-86.i that has 2 procedures, 96 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-03-03 20:34:44,284 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-03 20:34:44,293 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;@1b9c6f5e, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-03 20:34:44,295 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-03-03 20:34:44,298 INFO L276 IsEmpty]: Start isEmpty. Operand has 96 states, 66 states have (on average 1.4848484848484849) internal successors, (98), 67 states have internal predecessors, (98), 27 states have call successors, (27), 1 states have call predecessors, (27), 1 states have return successors, (27), 27 states have call predecessors, (27), 27 states have call successors, (27) [2025-03-03 20:34:44,309 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 175 [2025-03-03 20:34:44,310 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 20:34:44,311 INFO L218 NwaCegarLoop]: trace histogram [27, 27, 27, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 20:34:44,311 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 20:34:44,315 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 20:34:44,316 INFO L85 PathProgramCache]: Analyzing trace with hash -548486849, now seen corresponding path program 1 times [2025-03-03 20:34:44,321 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 20:34:44,321 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [391058328] [2025-03-03 20:34:44,322 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 20:34:44,322 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 20:34:44,400 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 174 statements into 1 equivalence classes. [2025-03-03 20:34:44,427 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 174 of 174 statements. [2025-03-03 20:34:44,428 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 20:34:44,428 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 20:34:44,600 INFO L134 CoverageAnalysis]: Checked inductivity of 1404 backedges. 0 proven. 52 refuted. 0 times theorem prover too weak. 1352 trivial. 0 not checked. [2025-03-03 20:34:44,600 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 20:34:44,601 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [391058328] [2025-03-03 20:34:44,602 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [391058328] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-03 20:34:44,602 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1794814906] [2025-03-03 20:34:44,602 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 20:34:44,602 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 20:34:44,602 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 20:34:44,605 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-03 20:34:44,607 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2025-03-03 20:34:44,682 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 174 statements into 1 equivalence classes. [2025-03-03 20:34:44,743 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 174 of 174 statements. [2025-03-03 20:34:44,743 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 20:34:44,743 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 20:34:44,746 INFO L256 TraceCheckSpWp]: Trace formula consists of 429 conjuncts, 1 conjuncts are in the unsatisfiable core [2025-03-03 20:34:44,751 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 20:34:44,774 INFO L134 CoverageAnalysis]: Checked inductivity of 1404 backedges. 52 proven. 0 refuted. 0 times theorem prover too weak. 1352 trivial. 0 not checked. [2025-03-03 20:34:44,775 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-03 20:34:44,775 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1794814906] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 20:34:44,775 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-03 20:34:44,775 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [2] total 2 [2025-03-03 20:34:44,781 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1463220257] [2025-03-03 20:34:44,781 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 20:34:44,784 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-03-03 20:34:44,785 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 20:34:44,798 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-03-03 20:34:44,799 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-03-03 20:34:44,800 INFO L87 Difference]: Start difference. First operand has 96 states, 66 states have (on average 1.4848484848484849) internal successors, (98), 67 states have internal predecessors, (98), 27 states have call successors, (27), 1 states have call predecessors, (27), 1 states have return successors, (27), 27 states have call predecessors, (27), 27 states have call successors, (27) Second operand has 2 states, 2 states have (on average 22.0) internal successors, (44), 2 states have internal predecessors, (44), 2 states have call successors, (27), 2 states have call predecessors, (27), 1 states have return successors, (27), 1 states have call predecessors, (27), 2 states have call successors, (27) [2025-03-03 20:34:44,832 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 20:34:44,833 INFO L93 Difference]: Finished difference Result 186 states and 326 transitions. [2025-03-03 20:34:44,835 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-03-03 20:34:44,836 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 22.0) internal successors, (44), 2 states have internal predecessors, (44), 2 states have call successors, (27), 2 states have call predecessors, (27), 1 states have return successors, (27), 1 states have call predecessors, (27), 2 states have call successors, (27) Word has length 174 [2025-03-03 20:34:44,836 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 20:34:44,841 INFO L225 Difference]: With dead ends: 186 [2025-03-03 20:34:44,842 INFO L226 Difference]: Without dead ends: 93 [2025-03-03 20:34:44,846 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 175 GetRequests, 175 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-03 20:34:44,848 INFO L435 NwaCegarLoop]: 142 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 142 SdHoareTripleChecker+Invalid, 4 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 4 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-03 20:34:44,849 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 142 Invalid, 4 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-03 20:34:44,858 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 93 states. [2025-03-03 20:34:44,878 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 93 to 93. [2025-03-03 20:34:44,879 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 93 states, 64 states have (on average 1.4375) internal successors, (92), 64 states have internal predecessors, (92), 27 states have call successors, (27), 1 states have call predecessors, (27), 1 states have return successors, (27), 27 states have call predecessors, (27), 27 states have call successors, (27) [2025-03-03 20:34:44,884 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 93 states to 93 states and 146 transitions. [2025-03-03 20:34:44,885 INFO L78 Accepts]: Start accepts. Automaton has 93 states and 146 transitions. Word has length 174 [2025-03-03 20:34:44,886 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 20:34:44,886 INFO L471 AbstractCegarLoop]: Abstraction has 93 states and 146 transitions. [2025-03-03 20:34:44,886 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 22.0) internal successors, (44), 2 states have internal predecessors, (44), 2 states have call successors, (27), 2 states have call predecessors, (27), 1 states have return successors, (27), 1 states have call predecessors, (27), 2 states have call successors, (27) [2025-03-03 20:34:44,886 INFO L276 IsEmpty]: Start isEmpty. Operand 93 states and 146 transitions. [2025-03-03 20:34:44,888 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 175 [2025-03-03 20:34:44,888 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 20:34:44,888 INFO L218 NwaCegarLoop]: trace histogram [27, 27, 27, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 20:34:44,894 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2025-03-03 20:34:45,089 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-03 20:34:45,089 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 20:34:45,089 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 20:34:45,089 INFO L85 PathProgramCache]: Analyzing trace with hash -231186818, now seen corresponding path program 1 times [2025-03-03 20:34:45,089 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 20:34:45,090 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1750842007] [2025-03-03 20:34:45,090 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 20:34:45,090 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 20:34:45,104 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 174 statements into 1 equivalence classes. [2025-03-03 20:34:45,167 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 174 of 174 statements. [2025-03-03 20:34:45,167 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 20:34:45,167 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 20:34:45,377 INFO L134 CoverageAnalysis]: Checked inductivity of 1404 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1404 trivial. 0 not checked. [2025-03-03 20:34:45,377 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 20:34:45,377 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1750842007] [2025-03-03 20:34:45,377 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1750842007] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 20:34:45,377 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 20:34:45,377 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-03 20:34:45,377 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2059696189] [2025-03-03 20:34:45,377 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 20:34:45,378 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-03 20:34:45,378 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 20:34:45,378 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-03 20:34:45,379 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 20:34:45,379 INFO L87 Difference]: Start difference. First operand 93 states and 146 transitions. Second operand has 3 states, 3 states have (on average 14.0) internal successors, (42), 3 states have internal predecessors, (42), 1 states have call successors, (27), 1 states have call predecessors, (27), 1 states have return successors, (27), 1 states have call predecessors, (27), 1 states have call successors, (27) [2025-03-03 20:34:45,420 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 20:34:45,423 INFO L93 Difference]: Finished difference Result 184 states and 291 transitions. [2025-03-03 20:34:45,424 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-03 20:34:45,424 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 14.0) internal successors, (42), 3 states have internal predecessors, (42), 1 states have call successors, (27), 1 states have call predecessors, (27), 1 states have return successors, (27), 1 states have call predecessors, (27), 1 states have call successors, (27) Word has length 174 [2025-03-03 20:34:45,425 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 20:34:45,427 INFO L225 Difference]: With dead ends: 184 [2025-03-03 20:34:45,427 INFO L226 Difference]: Without dead ends: 94 [2025-03-03 20:34:45,428 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 20:34:45,430 INFO L435 NwaCegarLoop]: 141 mSDtfsCounter, 0 mSDsluCounter, 136 mSDsCounter, 0 mSdLazyCounter, 14 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 277 SdHoareTripleChecker+Invalid, 14 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 14 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-03 20:34:45,430 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 277 Invalid, 14 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 14 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-03 20:34:45,430 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 94 states. [2025-03-03 20:34:45,439 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 94 to 94. [2025-03-03 20:34:45,441 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 94 states, 65 states have (on average 1.4307692307692308) internal successors, (93), 65 states have internal predecessors, (93), 27 states have call successors, (27), 1 states have call predecessors, (27), 1 states have return successors, (27), 27 states have call predecessors, (27), 27 states have call successors, (27) [2025-03-03 20:34:45,443 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 94 states to 94 states and 147 transitions. [2025-03-03 20:34:45,445 INFO L78 Accepts]: Start accepts. Automaton has 94 states and 147 transitions. Word has length 174 [2025-03-03 20:34:45,447 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 20:34:45,448 INFO L471 AbstractCegarLoop]: Abstraction has 94 states and 147 transitions. [2025-03-03 20:34:45,448 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 14.0) internal successors, (42), 3 states have internal predecessors, (42), 1 states have call successors, (27), 1 states have call predecessors, (27), 1 states have return successors, (27), 1 states have call predecessors, (27), 1 states have call successors, (27) [2025-03-03 20:34:45,448 INFO L276 IsEmpty]: Start isEmpty. Operand 94 states and 147 transitions. [2025-03-03 20:34:45,449 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 175 [2025-03-03 20:34:45,451 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 20:34:45,452 INFO L218 NwaCegarLoop]: trace histogram [27, 27, 27, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 20:34:45,452 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-03-03 20:34:45,452 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 20:34:45,452 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 20:34:45,452 INFO L85 PathProgramCache]: Analyzing trace with hash 656316863, now seen corresponding path program 1 times [2025-03-03 20:34:45,452 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 20:34:45,452 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1930385989] [2025-03-03 20:34:45,452 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 20:34:45,452 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 20:34:45,467 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 174 statements into 1 equivalence classes. [2025-03-03 20:34:45,508 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 174 of 174 statements. [2025-03-03 20:34:45,509 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 20:34:45,509 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 20:34:45,745 INFO L134 CoverageAnalysis]: Checked inductivity of 1404 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1404 trivial. 0 not checked. [2025-03-03 20:34:45,747 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 20:34:45,747 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1930385989] [2025-03-03 20:34:45,747 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1930385989] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 20:34:45,747 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 20:34:45,747 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-03 20:34:45,747 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2080228424] [2025-03-03 20:34:45,747 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 20:34:45,748 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-03 20:34:45,748 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 20:34:45,750 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-03 20:34:45,750 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-03 20:34:45,750 INFO L87 Difference]: Start difference. First operand 94 states and 147 transitions. Second operand has 5 states, 5 states have (on average 8.4) internal successors, (42), 5 states have internal predecessors, (42), 1 states have call successors, (27), 1 states have call predecessors, (27), 1 states have return successors, (27), 1 states have call predecessors, (27), 1 states have call successors, (27) [2025-03-03 20:34:45,984 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 20:34:45,984 INFO L93 Difference]: Finished difference Result 277 states and 436 transitions. [2025-03-03 20:34:45,984 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-03 20:34:45,984 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 8.4) internal successors, (42), 5 states have internal predecessors, (42), 1 states have call successors, (27), 1 states have call predecessors, (27), 1 states have return successors, (27), 1 states have call predecessors, (27), 1 states have call successors, (27) Word has length 174 [2025-03-03 20:34:45,985 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 20:34:45,987 INFO L225 Difference]: With dead ends: 277 [2025-03-03 20:34:45,988 INFO L226 Difference]: Without dead ends: 186 [2025-03-03 20:34:45,989 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 3 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-03 20:34:45,990 INFO L435 NwaCegarLoop]: 137 mSDtfsCounter, 114 mSDsluCounter, 347 mSDsCounter, 0 mSdLazyCounter, 94 mSolverCounterSat, 82 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 114 SdHoareTripleChecker+Valid, 484 SdHoareTripleChecker+Invalid, 176 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 82 IncrementalHoareTripleChecker+Valid, 94 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-03 20:34:45,991 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [114 Valid, 484 Invalid, 176 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [82 Valid, 94 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-03 20:34:45,992 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 186 states. [2025-03-03 20:34:46,013 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 186 to 141. [2025-03-03 20:34:46,015 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 141 states, 84 states have (on average 1.3333333333333333) internal successors, (112), 84 states have internal predecessors, (112), 54 states have call successors, (54), 2 states have call predecessors, (54), 2 states have return successors, (54), 54 states have call predecessors, (54), 54 states have call successors, (54) [2025-03-03 20:34:46,017 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 141 states to 141 states and 220 transitions. [2025-03-03 20:34:46,018 INFO L78 Accepts]: Start accepts. Automaton has 141 states and 220 transitions. Word has length 174 [2025-03-03 20:34:46,018 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 20:34:46,019 INFO L471 AbstractCegarLoop]: Abstraction has 141 states and 220 transitions. [2025-03-03 20:34:46,019 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 8.4) internal successors, (42), 5 states have internal predecessors, (42), 1 states have call successors, (27), 1 states have call predecessors, (27), 1 states have return successors, (27), 1 states have call predecessors, (27), 1 states have call successors, (27) [2025-03-03 20:34:46,019 INFO L276 IsEmpty]: Start isEmpty. Operand 141 states and 220 transitions. [2025-03-03 20:34:46,020 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 175 [2025-03-03 20:34:46,022 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 20:34:46,022 INFO L218 NwaCegarLoop]: trace histogram [27, 27, 27, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 20:34:46,022 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-03-03 20:34:46,022 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 20:34:46,023 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 20:34:46,023 INFO L85 PathProgramCache]: Analyzing trace with hash 867667776, now seen corresponding path program 1 times [2025-03-03 20:34:46,023 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 20:34:46,023 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2015525304] [2025-03-03 20:34:46,023 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 20:34:46,023 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 20:34:46,047 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 174 statements into 1 equivalence classes. [2025-03-03 20:34:46,200 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 174 of 174 statements. [2025-03-03 20:34:46,200 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 20:34:46,200 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 20:34:52,807 INFO L134 CoverageAnalysis]: Checked inductivity of 1404 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1404 trivial. 0 not checked. [2025-03-03 20:34:52,808 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 20:34:52,808 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2015525304] [2025-03-03 20:34:52,808 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2015525304] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 20:34:52,808 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 20:34:52,808 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [15] imperfect sequences [] total 15 [2025-03-03 20:34:52,808 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [45237226] [2025-03-03 20:34:52,809 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 20:34:52,809 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2025-03-03 20:34:52,809 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 20:34:52,810 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2025-03-03 20:34:52,810 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=44, Invalid=166, Unknown=0, NotChecked=0, Total=210 [2025-03-03 20:34:52,810 INFO L87 Difference]: Start difference. First operand 141 states and 220 transitions. Second operand has 15 states, 15 states have (on average 2.8) internal successors, (42), 15 states have internal predecessors, (42), 1 states have call successors, (27), 1 states have call predecessors, (27), 1 states have return successors, (27), 1 states have call predecessors, (27), 1 states have call successors, (27) [2025-03-03 20:34:54,836 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 20:34:54,836 INFO L93 Difference]: Finished difference Result 464 states and 727 transitions. [2025-03-03 20:34:54,837 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2025-03-03 20:34:54,837 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 15 states have (on average 2.8) internal successors, (42), 15 states have internal predecessors, (42), 1 states have call successors, (27), 1 states have call predecessors, (27), 1 states have return successors, (27), 1 states have call predecessors, (27), 1 states have call successors, (27) Word has length 174 [2025-03-03 20:34:54,837 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 20:34:54,839 INFO L225 Difference]: With dead ends: 464 [2025-03-03 20:34:54,839 INFO L226 Difference]: Without dead ends: 373 [2025-03-03 20:34:54,840 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 34 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 120 ImplicationChecksByTransitivity, 1.7s TimeCoverageRelationStatistics Valid=186, Invalid=570, Unknown=0, NotChecked=0, Total=756 [2025-03-03 20:34:54,841 INFO L435 NwaCegarLoop]: 112 mSDtfsCounter, 1023 mSDsluCounter, 850 mSDsCounter, 0 mSdLazyCounter, 755 mSolverCounterSat, 114 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1023 SdHoareTripleChecker+Valid, 962 SdHoareTripleChecker+Invalid, 869 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 114 IncrementalHoareTripleChecker+Valid, 755 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.3s IncrementalHoareTripleChecker+Time [2025-03-03 20:34:54,841 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1023 Valid, 962 Invalid, 869 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [114 Valid, 755 Invalid, 0 Unknown, 0 Unchecked, 1.3s Time] [2025-03-03 20:34:54,842 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 373 states. [2025-03-03 20:34:54,857 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 373 to 183. [2025-03-03 20:34:54,858 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 183 states, 126 states have (on average 1.4047619047619047) internal successors, (177), 126 states have internal predecessors, (177), 54 states have call successors, (54), 2 states have call predecessors, (54), 2 states have return successors, (54), 54 states have call predecessors, (54), 54 states have call successors, (54) [2025-03-03 20:34:54,859 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 183 states to 183 states and 285 transitions. [2025-03-03 20:34:54,859 INFO L78 Accepts]: Start accepts. Automaton has 183 states and 285 transitions. Word has length 174 [2025-03-03 20:34:54,860 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 20:34:54,860 INFO L471 AbstractCegarLoop]: Abstraction has 183 states and 285 transitions. [2025-03-03 20:34:54,860 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 15 states have (on average 2.8) internal successors, (42), 15 states have internal predecessors, (42), 1 states have call successors, (27), 1 states have call predecessors, (27), 1 states have return successors, (27), 1 states have call predecessors, (27), 1 states have call successors, (27) [2025-03-03 20:34:54,860 INFO L276 IsEmpty]: Start isEmpty. Operand 183 states and 285 transitions. [2025-03-03 20:34:54,861 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 175 [2025-03-03 20:34:54,861 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 20:34:54,861 INFO L218 NwaCegarLoop]: trace histogram [27, 27, 27, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 20:34:54,862 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-03-03 20:34:54,862 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 20:34:54,862 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 20:34:54,862 INFO L85 PathProgramCache]: Analyzing trace with hash -929283583, now seen corresponding path program 1 times [2025-03-03 20:34:54,862 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 20:34:54,862 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [861189273] [2025-03-03 20:34:54,863 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 20:34:54,863 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 20:34:54,871 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 174 statements into 1 equivalence classes. [2025-03-03 20:34:54,902 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 174 of 174 statements. [2025-03-03 20:34:54,902 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 20:34:54,902 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 20:34:55,033 INFO L134 CoverageAnalysis]: Checked inductivity of 1404 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1404 trivial. 0 not checked. [2025-03-03 20:34:55,033 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 20:34:55,033 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [861189273] [2025-03-03 20:34:55,034 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [861189273] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 20:34:55,034 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 20:34:55,034 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-03 20:34:55,034 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [32120942] [2025-03-03 20:34:55,034 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 20:34:55,034 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-03 20:34:55,034 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 20:34:55,035 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-03 20:34:55,035 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-03-03 20:34:55,035 INFO L87 Difference]: Start difference. First operand 183 states and 285 transitions. Second operand has 4 states, 4 states have (on average 10.5) internal successors, (42), 4 states have internal predecessors, (42), 1 states have call successors, (27), 1 states have call predecessors, (27), 1 states have return successors, (27), 1 states have call predecessors, (27), 1 states have call successors, (27) [2025-03-03 20:34:55,096 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 20:34:55,097 INFO L93 Difference]: Finished difference Result 357 states and 557 transitions. [2025-03-03 20:34:55,097 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-03 20:34:55,097 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 10.5) internal successors, (42), 4 states have internal predecessors, (42), 1 states have call successors, (27), 1 states have call predecessors, (27), 1 states have return successors, (27), 1 states have call predecessors, (27), 1 states have call successors, (27) Word has length 174 [2025-03-03 20:34:55,098 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 20:34:55,099 INFO L225 Difference]: With dead ends: 357 [2025-03-03 20:34:55,099 INFO L226 Difference]: Without dead ends: 266 [2025-03-03 20:34:55,099 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-03-03 20:34:55,100 INFO L435 NwaCegarLoop]: 135 mSDtfsCounter, 116 mSDsluCounter, 250 mSDsCounter, 0 mSdLazyCounter, 48 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 116 SdHoareTripleChecker+Valid, 385 SdHoareTripleChecker+Invalid, 56 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 48 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-03 20:34:55,100 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [116 Valid, 385 Invalid, 56 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 48 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-03 20:34:55,101 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 266 states. [2025-03-03 20:34:55,118 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 266 to 197. [2025-03-03 20:34:55,121 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 197 states, 140 states have (on average 1.4071428571428573) internal successors, (197), 140 states have internal predecessors, (197), 54 states have call successors, (54), 2 states have call predecessors, (54), 2 states have return successors, (54), 54 states have call predecessors, (54), 54 states have call successors, (54) [2025-03-03 20:34:55,122 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 197 states to 197 states and 305 transitions. [2025-03-03 20:34:55,122 INFO L78 Accepts]: Start accepts. Automaton has 197 states and 305 transitions. Word has length 174 [2025-03-03 20:34:55,123 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 20:34:55,123 INFO L471 AbstractCegarLoop]: Abstraction has 197 states and 305 transitions. [2025-03-03 20:34:55,123 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 10.5) internal successors, (42), 4 states have internal predecessors, (42), 1 states have call successors, (27), 1 states have call predecessors, (27), 1 states have return successors, (27), 1 states have call predecessors, (27), 1 states have call successors, (27) [2025-03-03 20:34:55,123 INFO L276 IsEmpty]: Start isEmpty. Operand 197 states and 305 transitions. [2025-03-03 20:34:55,127 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 175 [2025-03-03 20:34:55,128 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 20:34:55,128 INFO L218 NwaCegarLoop]: trace histogram [27, 27, 27, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 20:34:55,128 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-03-03 20:34:55,128 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 20:34:55,128 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 20:34:55,128 INFO L85 PathProgramCache]: Analyzing trace with hash -129404577, now seen corresponding path program 1 times [2025-03-03 20:34:55,128 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 20:34:55,128 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [580387388] [2025-03-03 20:34:55,128 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 20:34:55,129 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 20:34:55,137 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 174 statements into 1 equivalence classes. [2025-03-03 20:34:55,146 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 174 of 174 statements. [2025-03-03 20:34:55,146 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 20:34:55,147 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 20:34:55,183 INFO L134 CoverageAnalysis]: Checked inductivity of 1404 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1404 trivial. 0 not checked. [2025-03-03 20:34:55,183 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 20:34:55,183 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [580387388] [2025-03-03 20:34:55,183 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [580387388] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 20:34:55,183 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 20:34:55,183 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-03 20:34:55,183 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [401827424] [2025-03-03 20:34:55,183 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 20:34:55,184 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-03 20:34:55,184 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 20:34:55,184 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-03 20:34:55,184 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 20:34:55,185 INFO L87 Difference]: Start difference. First operand 197 states and 305 transitions. Second operand has 3 states, 3 states have (on average 14.0) internal successors, (42), 3 states have internal predecessors, (42), 1 states have call successors, (27), 1 states have call predecessors, (27), 1 states have return successors, (27), 1 states have call predecessors, (27), 1 states have call successors, (27) [2025-03-03 20:34:55,226 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 20:34:55,226 INFO L93 Difference]: Finished difference Result 388 states and 605 transitions. [2025-03-03 20:34:55,226 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-03 20:34:55,226 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 14.0) internal successors, (42), 3 states have internal predecessors, (42), 1 states have call successors, (27), 1 states have call predecessors, (27), 1 states have return successors, (27), 1 states have call predecessors, (27), 1 states have call successors, (27) Word has length 174 [2025-03-03 20:34:55,227 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 20:34:55,228 INFO L225 Difference]: With dead ends: 388 [2025-03-03 20:34:55,230 INFO L226 Difference]: Without dead ends: 279 [2025-03-03 20:34:55,230 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 20:34:55,231 INFO L435 NwaCegarLoop]: 192 mSDtfsCounter, 138 mSDsluCounter, 128 mSDsCounter, 0 mSdLazyCounter, 23 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 138 SdHoareTripleChecker+Valid, 320 SdHoareTripleChecker+Invalid, 28 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 23 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-03 20:34:55,232 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [138 Valid, 320 Invalid, 28 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 23 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-03 20:34:55,233 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 279 states. [2025-03-03 20:34:55,253 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 279 to 277. [2025-03-03 20:34:55,253 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 277 states, 192 states have (on average 1.3958333333333333) internal successors, (268), 192 states have internal predecessors, (268), 81 states have call successors, (81), 3 states have call predecessors, (81), 3 states have return successors, (81), 81 states have call predecessors, (81), 81 states have call successors, (81) [2025-03-03 20:34:55,255 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 277 states to 277 states and 430 transitions. [2025-03-03 20:34:55,255 INFO L78 Accepts]: Start accepts. Automaton has 277 states and 430 transitions. Word has length 174 [2025-03-03 20:34:55,256 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 20:34:55,256 INFO L471 AbstractCegarLoop]: Abstraction has 277 states and 430 transitions. [2025-03-03 20:34:55,256 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 14.0) internal successors, (42), 3 states have internal predecessors, (42), 1 states have call successors, (27), 1 states have call predecessors, (27), 1 states have return successors, (27), 1 states have call predecessors, (27), 1 states have call successors, (27) [2025-03-03 20:34:55,256 INFO L276 IsEmpty]: Start isEmpty. Operand 277 states and 430 transitions. [2025-03-03 20:34:55,257 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 176 [2025-03-03 20:34:55,257 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 20:34:55,257 INFO L218 NwaCegarLoop]: trace histogram [27, 27, 27, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 20:34:55,257 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-03-03 20:34:55,258 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 20:34:55,258 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 20:34:55,258 INFO L85 PathProgramCache]: Analyzing trace with hash -113271249, now seen corresponding path program 1 times [2025-03-03 20:34:55,258 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 20:34:55,258 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [381482726] [2025-03-03 20:34:55,258 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 20:34:55,258 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 20:34:55,265 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 175 statements into 1 equivalence classes. [2025-03-03 20:34:55,302 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 175 of 175 statements. [2025-03-03 20:34:55,302 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 20:34:55,302 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 20:34:55,501 INFO L134 CoverageAnalysis]: Checked inductivity of 1404 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1404 trivial. 0 not checked. [2025-03-03 20:34:55,501 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 20:34:55,501 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [381482726] [2025-03-03 20:34:55,502 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [381482726] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 20:34:55,502 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 20:34:55,502 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-03 20:34:55,502 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1214752907] [2025-03-03 20:34:55,502 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 20:34:55,502 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-03 20:34:55,502 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 20:34:55,503 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-03 20:34:55,503 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-03-03 20:34:55,503 INFO L87 Difference]: Start difference. First operand 277 states and 430 transitions. Second operand has 4 states, 4 states have (on average 10.75) internal successors, (43), 4 states have internal predecessors, (43), 1 states have call successors, (27), 1 states have call predecessors, (27), 1 states have return successors, (27), 1 states have call predecessors, (27), 1 states have call successors, (27) [2025-03-03 20:34:55,545 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 20:34:55,545 INFO L93 Difference]: Finished difference Result 528 states and 826 transitions. [2025-03-03 20:34:55,546 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-03 20:34:55,546 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 10.75) internal successors, (43), 4 states have internal predecessors, (43), 1 states have call successors, (27), 1 states have call predecessors, (27), 1 states have return successors, (27), 1 states have call predecessors, (27), 1 states have call successors, (27) Word has length 175 [2025-03-03 20:34:55,546 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 20:34:55,548 INFO L225 Difference]: With dead ends: 528 [2025-03-03 20:34:55,548 INFO L226 Difference]: Without dead ends: 339 [2025-03-03 20:34:55,549 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-03-03 20:34:55,549 INFO L435 NwaCegarLoop]: 133 mSDtfsCounter, 47 mSDsluCounter, 167 mSDsCounter, 0 mSdLazyCounter, 35 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 47 SdHoareTripleChecker+Valid, 300 SdHoareTripleChecker+Invalid, 35 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 35 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-03 20:34:55,549 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [47 Valid, 300 Invalid, 35 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 35 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-03 20:34:55,550 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 339 states. [2025-03-03 20:34:55,560 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 339 to 277. [2025-03-03 20:34:55,560 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 277 states, 192 states have (on average 1.3802083333333333) internal successors, (265), 192 states have internal predecessors, (265), 81 states have call successors, (81), 3 states have call predecessors, (81), 3 states have return successors, (81), 81 states have call predecessors, (81), 81 states have call successors, (81) [2025-03-03 20:34:55,562 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 277 states to 277 states and 427 transitions. [2025-03-03 20:34:55,562 INFO L78 Accepts]: Start accepts. Automaton has 277 states and 427 transitions. Word has length 175 [2025-03-03 20:34:55,562 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 20:34:55,563 INFO L471 AbstractCegarLoop]: Abstraction has 277 states and 427 transitions. [2025-03-03 20:34:55,563 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 10.75) internal successors, (43), 4 states have internal predecessors, (43), 1 states have call successors, (27), 1 states have call predecessors, (27), 1 states have return successors, (27), 1 states have call predecessors, (27), 1 states have call successors, (27) [2025-03-03 20:34:55,563 INFO L276 IsEmpty]: Start isEmpty. Operand 277 states and 427 transitions. [2025-03-03 20:34:55,564 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 176 [2025-03-03 20:34:55,564 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 20:34:55,564 INFO L218 NwaCegarLoop]: trace histogram [27, 27, 27, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 20:34:55,564 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-03-03 20:34:55,564 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 20:34:55,564 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 20:34:55,565 INFO L85 PathProgramCache]: Analyzing trace with hash -618829874, now seen corresponding path program 1 times [2025-03-03 20:34:55,565 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 20:34:55,565 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1463717686] [2025-03-03 20:34:55,565 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 20:34:55,565 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 20:34:55,573 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 175 statements into 1 equivalence classes. [2025-03-03 20:34:55,635 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 175 of 175 statements. [2025-03-03 20:34:55,635 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 20:34:55,635 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 20:34:58,327 INFO L134 CoverageAnalysis]: Checked inductivity of 1404 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1404 trivial. 0 not checked. [2025-03-03 20:34:58,328 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 20:34:58,328 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1463717686] [2025-03-03 20:34:58,328 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1463717686] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 20:34:58,328 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 20:34:58,328 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [16] imperfect sequences [] total 16 [2025-03-03 20:34:58,328 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [458985987] [2025-03-03 20:34:58,328 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 20:34:58,329 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2025-03-03 20:34:58,329 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 20:34:58,329 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2025-03-03 20:34:58,329 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=42, Invalid=198, Unknown=0, NotChecked=0, Total=240 [2025-03-03 20:34:58,329 INFO L87 Difference]: Start difference. First operand 277 states and 427 transitions. Second operand has 16 states, 16 states have (on average 2.6875) internal successors, (43), 16 states have internal predecessors, (43), 2 states have call successors, (27), 1 states have call predecessors, (27), 1 states have return successors, (27), 2 states have call predecessors, (27), 2 states have call successors, (27) [2025-03-03 20:34:59,939 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 20:34:59,939 INFO L93 Difference]: Finished difference Result 463 states and 702 transitions. [2025-03-03 20:34:59,939 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2025-03-03 20:34:59,940 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 16 states have (on average 2.6875) internal successors, (43), 16 states have internal predecessors, (43), 2 states have call successors, (27), 1 states have call predecessors, (27), 1 states have return successors, (27), 2 states have call predecessors, (27), 2 states have call successors, (27) Word has length 175 [2025-03-03 20:34:59,940 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 20:34:59,943 INFO L225 Difference]: With dead ends: 463 [2025-03-03 20:34:59,943 INFO L226 Difference]: Without dead ends: 461 [2025-03-03 20:34:59,944 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 202 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=282, Invalid=840, Unknown=0, NotChecked=0, Total=1122 [2025-03-03 20:34:59,945 INFO L435 NwaCegarLoop]: 128 mSDtfsCounter, 1066 mSDsluCounter, 1009 mSDsCounter, 0 mSdLazyCounter, 951 mSolverCounterSat, 121 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1066 SdHoareTripleChecker+Valid, 1137 SdHoareTripleChecker+Invalid, 1072 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 121 IncrementalHoareTripleChecker+Valid, 951 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2025-03-03 20:34:59,945 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1066 Valid, 1137 Invalid, 1072 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [121 Valid, 951 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2025-03-03 20:34:59,946 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 461 states. [2025-03-03 20:34:59,967 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 461 to 278. [2025-03-03 20:34:59,968 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 278 states, 193 states have (on average 1.378238341968912) internal successors, (266), 193 states have internal predecessors, (266), 81 states have call successors, (81), 3 states have call predecessors, (81), 3 states have return successors, (81), 81 states have call predecessors, (81), 81 states have call successors, (81) [2025-03-03 20:34:59,970 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 278 states to 278 states and 428 transitions. [2025-03-03 20:34:59,971 INFO L78 Accepts]: Start accepts. Automaton has 278 states and 428 transitions. Word has length 175 [2025-03-03 20:34:59,971 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 20:34:59,971 INFO L471 AbstractCegarLoop]: Abstraction has 278 states and 428 transitions. [2025-03-03 20:34:59,971 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 16 states have (on average 2.6875) internal successors, (43), 16 states have internal predecessors, (43), 2 states have call successors, (27), 1 states have call predecessors, (27), 1 states have return successors, (27), 2 states have call predecessors, (27), 2 states have call successors, (27) [2025-03-03 20:34:59,972 INFO L276 IsEmpty]: Start isEmpty. Operand 278 states and 428 transitions. [2025-03-03 20:34:59,973 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 176 [2025-03-03 20:34:59,973 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 20:34:59,973 INFO L218 NwaCegarLoop]: trace histogram [27, 27, 27, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 20:34:59,973 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-03-03 20:34:59,973 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 20:34:59,973 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 20:34:59,973 INFO L85 PathProgramCache]: Analyzing trace with hash 1092643596, now seen corresponding path program 1 times [2025-03-03 20:34:59,973 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 20:34:59,973 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [64323856] [2025-03-03 20:34:59,973 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 20:34:59,974 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 20:34:59,982 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 175 statements into 1 equivalence classes. [2025-03-03 20:35:00,046 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 175 of 175 statements. [2025-03-03 20:35:00,046 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 20:35:00,046 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 20:35:05,476 INFO L134 CoverageAnalysis]: Checked inductivity of 1404 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1404 trivial. 0 not checked. [2025-03-03 20:35:05,476 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 20:35:05,476 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [64323856] [2025-03-03 20:35:05,476 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [64323856] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 20:35:05,476 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 20:35:05,476 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [15] imperfect sequences [] total 15 [2025-03-03 20:35:05,476 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [73807896] [2025-03-03 20:35:05,476 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 20:35:05,476 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2025-03-03 20:35:05,476 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 20:35:05,477 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2025-03-03 20:35:05,477 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=49, Invalid=161, Unknown=0, NotChecked=0, Total=210 [2025-03-03 20:35:05,477 INFO L87 Difference]: Start difference. First operand 278 states and 428 transitions. Second operand has 15 states, 15 states have (on average 2.8666666666666667) internal successors, (43), 15 states have internal predecessors, (43), 1 states have call successors, (27), 1 states have call predecessors, (27), 1 states have return successors, (27), 1 states have call predecessors, (27), 1 states have call successors, (27) [2025-03-03 20:35:09,186 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 20:35:09,186 INFO L93 Difference]: Finished difference Result 459 states and 698 transitions. [2025-03-03 20:35:09,186 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2025-03-03 20:35:09,186 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 15 states have (on average 2.8666666666666667) internal successors, (43), 15 states have internal predecessors, (43), 1 states have call successors, (27), 1 states have call predecessors, (27), 1 states have return successors, (27), 1 states have call predecessors, (27), 1 states have call successors, (27) Word has length 175 [2025-03-03 20:35:09,187 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 20:35:09,189 INFO L225 Difference]: With dead ends: 459 [2025-03-03 20:35:09,189 INFO L226 Difference]: Without dead ends: 457 [2025-03-03 20:35:09,189 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 128 ImplicationChecksByTransitivity, 3.7s TimeCoverageRelationStatistics Valid=191, Invalid=565, Unknown=0, NotChecked=0, Total=756 [2025-03-03 20:35:09,192 INFO L435 NwaCegarLoop]: 130 mSDtfsCounter, 858 mSDsluCounter, 910 mSDsCounter, 0 mSdLazyCounter, 997 mSolverCounterSat, 110 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 858 SdHoareTripleChecker+Valid, 1040 SdHoareTripleChecker+Invalid, 1107 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 110 IncrementalHoareTripleChecker+Valid, 997 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.7s IncrementalHoareTripleChecker+Time [2025-03-03 20:35:09,193 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [858 Valid, 1040 Invalid, 1107 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [110 Valid, 997 Invalid, 0 Unknown, 0 Unchecked, 1.7s Time] [2025-03-03 20:35:09,193 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 457 states. [2025-03-03 20:35:09,206 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 457 to 281. [2025-03-03 20:35:09,207 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 281 states, 196 states have (on average 1.3775510204081634) internal successors, (270), 196 states have internal predecessors, (270), 81 states have call successors, (81), 3 states have call predecessors, (81), 3 states have return successors, (81), 81 states have call predecessors, (81), 81 states have call successors, (81) [2025-03-03 20:35:09,209 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 281 states to 281 states and 432 transitions. [2025-03-03 20:35:09,209 INFO L78 Accepts]: Start accepts. Automaton has 281 states and 432 transitions. Word has length 175 [2025-03-03 20:35:09,210 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 20:35:09,210 INFO L471 AbstractCegarLoop]: Abstraction has 281 states and 432 transitions. [2025-03-03 20:35:09,210 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 15 states have (on average 2.8666666666666667) internal successors, (43), 15 states have internal predecessors, (43), 1 states have call successors, (27), 1 states have call predecessors, (27), 1 states have return successors, (27), 1 states have call predecessors, (27), 1 states have call successors, (27) [2025-03-03 20:35:09,210 INFO L276 IsEmpty]: Start isEmpty. Operand 281 states and 432 transitions. [2025-03-03 20:35:09,211 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 176 [2025-03-03 20:35:09,212 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 20:35:09,212 INFO L218 NwaCegarLoop]: trace histogram [27, 27, 27, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 20:35:09,212 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-03-03 20:35:09,213 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 20:35:09,213 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 20:35:09,213 INFO L85 PathProgramCache]: Analyzing trace with hash -808476560, now seen corresponding path program 1 times [2025-03-03 20:35:09,213 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 20:35:09,213 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1282819155] [2025-03-03 20:35:09,213 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 20:35:09,213 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 20:35:09,222 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 175 statements into 1 equivalence classes. [2025-03-03 20:35:09,247 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 175 of 175 statements. [2025-03-03 20:35:09,248 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 20:35:09,248 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 20:35:09,380 INFO L134 CoverageAnalysis]: Checked inductivity of 1404 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1404 trivial. 0 not checked. [2025-03-03 20:35:09,381 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 20:35:09,381 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1282819155] [2025-03-03 20:35:09,381 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1282819155] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 20:35:09,381 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 20:35:09,381 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-03 20:35:09,381 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1016937835] [2025-03-03 20:35:09,381 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 20:35:09,381 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-03 20:35:09,381 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 20:35:09,381 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-03 20:35:09,381 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-03-03 20:35:09,382 INFO L87 Difference]: Start difference. First operand 281 states and 432 transitions. Second operand has 4 states, 4 states have (on average 10.75) internal successors, (43), 4 states have internal predecessors, (43), 1 states have call successors, (27), 1 states have call predecessors, (27), 1 states have return successors, (27), 1 states have call predecessors, (27), 1 states have call successors, (27) [2025-03-03 20:35:09,460 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 20:35:09,461 INFO L93 Difference]: Finished difference Result 544 states and 835 transitions. [2025-03-03 20:35:09,461 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-03 20:35:09,461 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 10.75) internal successors, (43), 4 states have internal predecessors, (43), 1 states have call successors, (27), 1 states have call predecessors, (27), 1 states have return successors, (27), 1 states have call predecessors, (27), 1 states have call successors, (27) Word has length 175 [2025-03-03 20:35:09,462 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 20:35:09,463 INFO L225 Difference]: With dead ends: 544 [2025-03-03 20:35:09,463 INFO L226 Difference]: Without dead ends: 355 [2025-03-03 20:35:09,464 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-03-03 20:35:09,464 INFO L435 NwaCegarLoop]: 182 mSDtfsCounter, 115 mSDsluCounter, 175 mSDsCounter, 0 mSdLazyCounter, 48 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 115 SdHoareTripleChecker+Valid, 357 SdHoareTripleChecker+Invalid, 48 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 48 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-03 20:35:09,466 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [115 Valid, 357 Invalid, 48 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 48 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-03 20:35:09,467 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 355 states. [2025-03-03 20:35:09,480 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 355 to 291. [2025-03-03 20:35:09,481 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 291 states, 206 states have (on average 1.3737864077669903) internal successors, (283), 206 states have internal predecessors, (283), 81 states have call successors, (81), 3 states have call predecessors, (81), 3 states have return successors, (81), 81 states have call predecessors, (81), 81 states have call successors, (81) [2025-03-03 20:35:09,483 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 291 states to 291 states and 445 transitions. [2025-03-03 20:35:09,483 INFO L78 Accepts]: Start accepts. Automaton has 291 states and 445 transitions. Word has length 175 [2025-03-03 20:35:09,484 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 20:35:09,484 INFO L471 AbstractCegarLoop]: Abstraction has 291 states and 445 transitions. [2025-03-03 20:35:09,484 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 10.75) internal successors, (43), 4 states have internal predecessors, (43), 1 states have call successors, (27), 1 states have call predecessors, (27), 1 states have return successors, (27), 1 states have call predecessors, (27), 1 states have call successors, (27) [2025-03-03 20:35:09,484 INFO L276 IsEmpty]: Start isEmpty. Operand 291 states and 445 transitions. [2025-03-03 20:35:09,485 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 176 [2025-03-03 20:35:09,486 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 20:35:09,486 INFO L218 NwaCegarLoop]: trace histogram [27, 27, 27, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 20:35:09,486 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-03-03 20:35:09,486 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 20:35:09,486 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 20:35:09,486 INFO L85 PathProgramCache]: Analyzing trace with hash 1689539377, now seen corresponding path program 1 times [2025-03-03 20:35:09,487 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 20:35:09,487 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1806856293] [2025-03-03 20:35:09,487 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 20:35:09,487 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 20:35:09,496 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 175 statements into 1 equivalence classes. [2025-03-03 20:35:09,535 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 175 of 175 statements. [2025-03-03 20:35:09,535 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 20:35:09,535 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 20:35:15,459 INFO L134 CoverageAnalysis]: Checked inductivity of 1404 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1404 trivial. 0 not checked. [2025-03-03 20:35:15,460 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 20:35:15,460 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1806856293] [2025-03-03 20:35:15,460 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1806856293] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 20:35:15,460 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 20:35:15,460 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [16] imperfect sequences [] total 16 [2025-03-03 20:35:15,460 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [998999564] [2025-03-03 20:35:15,460 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 20:35:15,461 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2025-03-03 20:35:15,461 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 20:35:15,462 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2025-03-03 20:35:15,462 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=54, Invalid=186, Unknown=0, NotChecked=0, Total=240 [2025-03-03 20:35:15,462 INFO L87 Difference]: Start difference. First operand 291 states and 445 transitions. Second operand has 16 states, 16 states have (on average 2.6875) internal successors, (43), 16 states have internal predecessors, (43), 1 states have call successors, (27), 1 states have call predecessors, (27), 1 states have return successors, (27), 1 states have call predecessors, (27), 1 states have call successors, (27) [2025-03-03 20:35:22,291 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 20:35:22,293 INFO L93 Difference]: Finished difference Result 524 states and 790 transitions. [2025-03-03 20:35:22,293 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2025-03-03 20:35:22,293 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 16 states have (on average 2.6875) internal successors, (43), 16 states have internal predecessors, (43), 1 states have call successors, (27), 1 states have call predecessors, (27), 1 states have return successors, (27), 1 states have call predecessors, (27), 1 states have call successors, (27) Word has length 175 [2025-03-03 20:35:22,293 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 20:35:22,295 INFO L225 Difference]: With dead ends: 524 [2025-03-03 20:35:22,295 INFO L226 Difference]: Without dead ends: 522 [2025-03-03 20:35:22,296 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 169 ImplicationChecksByTransitivity, 4.7s TimeCoverageRelationStatistics Valid=251, Invalid=741, Unknown=0, NotChecked=0, Total=992 [2025-03-03 20:35:22,296 INFO L435 NwaCegarLoop]: 156 mSDtfsCounter, 498 mSDsluCounter, 1110 mSDsCounter, 0 mSdLazyCounter, 623 mSolverCounterSat, 82 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 498 SdHoareTripleChecker+Valid, 1266 SdHoareTripleChecker+Invalid, 705 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 82 IncrementalHoareTripleChecker+Valid, 623 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.3s IncrementalHoareTripleChecker+Time [2025-03-03 20:35:22,296 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [498 Valid, 1266 Invalid, 705 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [82 Valid, 623 Invalid, 0 Unknown, 0 Unchecked, 3.3s Time] [2025-03-03 20:35:22,298 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 522 states. [2025-03-03 20:35:22,312 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 522 to 335. [2025-03-03 20:35:22,313 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 335 states, 250 states have (on average 1.4) internal successors, (350), 250 states have internal predecessors, (350), 81 states have call successors, (81), 3 states have call predecessors, (81), 3 states have return successors, (81), 81 states have call predecessors, (81), 81 states have call successors, (81) [2025-03-03 20:35:22,314 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 335 states to 335 states and 512 transitions. [2025-03-03 20:35:22,315 INFO L78 Accepts]: Start accepts. Automaton has 335 states and 512 transitions. Word has length 175 [2025-03-03 20:35:22,315 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 20:35:22,315 INFO L471 AbstractCegarLoop]: Abstraction has 335 states and 512 transitions. [2025-03-03 20:35:22,315 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 16 states have (on average 2.6875) internal successors, (43), 16 states have internal predecessors, (43), 1 states have call successors, (27), 1 states have call predecessors, (27), 1 states have return successors, (27), 1 states have call predecessors, (27), 1 states have call successors, (27) [2025-03-03 20:35:22,316 INFO L276 IsEmpty]: Start isEmpty. Operand 335 states and 512 transitions. [2025-03-03 20:35:22,317 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 176 [2025-03-03 20:35:22,317 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 20:35:22,318 INFO L218 NwaCegarLoop]: trace histogram [27, 27, 27, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 20:35:22,318 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-03-03 20:35:22,318 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 20:35:22,318 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 20:35:22,318 INFO L85 PathProgramCache]: Analyzing trace with hash 1179005200, now seen corresponding path program 1 times [2025-03-03 20:35:22,319 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 20:35:22,319 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1002467704] [2025-03-03 20:35:22,319 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 20:35:22,319 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 20:35:22,325 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 175 statements into 1 equivalence classes. [2025-03-03 20:35:22,359 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 175 of 175 statements. [2025-03-03 20:35:22,360 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 20:35:22,360 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 20:35:37,808 INFO L134 CoverageAnalysis]: Checked inductivity of 1404 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1404 trivial. 0 not checked. [2025-03-03 20:35:37,808 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 20:35:37,808 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1002467704] [2025-03-03 20:35:37,808 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1002467704] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 20:35:37,808 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 20:35:37,808 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [20] imperfect sequences [] total 20 [2025-03-03 20:35:37,808 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [547808815] [2025-03-03 20:35:37,808 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 20:35:37,808 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 20 states [2025-03-03 20:35:37,808 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 20:35:37,809 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2025-03-03 20:35:37,809 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=80, Invalid=300, Unknown=0, NotChecked=0, Total=380 [2025-03-03 20:35:37,809 INFO L87 Difference]: Start difference. First operand 335 states and 512 transitions. Second operand has 20 states, 20 states have (on average 2.15) internal successors, (43), 20 states have internal predecessors, (43), 3 states have call successors, (27), 1 states have call predecessors, (27), 1 states have return successors, (27), 3 states have call predecessors, (27), 3 states have call successors, (27) [2025-03-03 20:35:55,789 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 20:35:55,790 INFO L93 Difference]: Finished difference Result 520 states and 785 transitions. [2025-03-03 20:35:55,790 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2025-03-03 20:35:55,790 INFO L78 Accepts]: Start accepts. Automaton has has 20 states, 20 states have (on average 2.15) internal successors, (43), 20 states have internal predecessors, (43), 3 states have call successors, (27), 1 states have call predecessors, (27), 1 states have return successors, (27), 3 states have call predecessors, (27), 3 states have call successors, (27) Word has length 175 [2025-03-03 20:35:55,791 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 20:35:55,793 INFO L225 Difference]: With dead ends: 520 [2025-03-03 20:35:55,793 INFO L226 Difference]: Without dead ends: 518 [2025-03-03 20:35:55,794 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 44 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 36 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 249 ImplicationChecksByTransitivity, 15.3s TimeCoverageRelationStatistics Valid=358, Invalid=1048, Unknown=0, NotChecked=0, Total=1406 [2025-03-03 20:35:55,794 INFO L435 NwaCegarLoop]: 139 mSDtfsCounter, 680 mSDsluCounter, 1263 mSDsCounter, 0 mSdLazyCounter, 814 mSolverCounterSat, 139 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 7.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 680 SdHoareTripleChecker+Valid, 1402 SdHoareTripleChecker+Invalid, 953 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 139 IncrementalHoareTripleChecker+Valid, 814 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 7.2s IncrementalHoareTripleChecker+Time [2025-03-03 20:35:55,794 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [680 Valid, 1402 Invalid, 953 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [139 Valid, 814 Invalid, 0 Unknown, 0 Unchecked, 7.2s Time] [2025-03-03 20:35:55,795 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 518 states. [2025-03-03 20:35:55,811 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 518 to 339. [2025-03-03 20:35:55,812 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 339 states, 253 states have (on average 1.3952569169960474) internal successors, (353), 253 states have internal predecessors, (353), 81 states have call successors, (81), 4 states have call predecessors, (81), 4 states have return successors, (81), 81 states have call predecessors, (81), 81 states have call successors, (81) [2025-03-03 20:35:55,813 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 339 states to 339 states and 515 transitions. [2025-03-03 20:35:55,814 INFO L78 Accepts]: Start accepts. Automaton has 339 states and 515 transitions. Word has length 175 [2025-03-03 20:35:55,814 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 20:35:55,814 INFO L471 AbstractCegarLoop]: Abstraction has 339 states and 515 transitions. [2025-03-03 20:35:55,814 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 20 states, 20 states have (on average 2.15) internal successors, (43), 20 states have internal predecessors, (43), 3 states have call successors, (27), 1 states have call predecessors, (27), 1 states have return successors, (27), 3 states have call predecessors, (27), 3 states have call successors, (27) [2025-03-03 20:35:55,814 INFO L276 IsEmpty]: Start isEmpty. Operand 339 states and 515 transitions. [2025-03-03 20:35:55,816 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 177 [2025-03-03 20:35:55,816 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 20:35:55,816 INFO L218 NwaCegarLoop]: trace histogram [27, 27, 27, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 20:35:55,816 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2025-03-03 20:35:55,817 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 20:35:55,817 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 20:35:55,817 INFO L85 PathProgramCache]: Analyzing trace with hash -2039110594, now seen corresponding path program 1 times [2025-03-03 20:35:55,817 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 20:35:55,817 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1669667347] [2025-03-03 20:35:55,817 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 20:35:55,817 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 20:35:55,826 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 176 statements into 1 equivalence classes. [2025-03-03 20:35:55,875 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 176 of 176 statements. [2025-03-03 20:35:55,876 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 20:35:55,876 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 20:36:01,637 INFO L134 CoverageAnalysis]: Checked inductivity of 1404 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1404 trivial. 0 not checked. [2025-03-03 20:36:01,637 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 20:36:01,637 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1669667347] [2025-03-03 20:36:01,637 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1669667347] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 20:36:01,637 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 20:36:01,637 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [18] imperfect sequences [] total 18 [2025-03-03 20:36:01,637 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2105855515] [2025-03-03 20:36:01,637 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 20:36:01,637 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2025-03-03 20:36:01,637 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 20:36:01,638 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2025-03-03 20:36:01,638 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=58, Invalid=248, Unknown=0, NotChecked=0, Total=306 [2025-03-03 20:36:01,638 INFO L87 Difference]: Start difference. First operand 339 states and 515 transitions. Second operand has 18 states, 18 states have (on average 2.4444444444444446) internal successors, (44), 18 states have internal predecessors, (44), 3 states have call successors, (27), 1 states have call predecessors, (27), 1 states have return successors, (27), 3 states have call predecessors, (27), 3 states have call successors, (27) [2025-03-03 20:36:05,351 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 20:36:05,352 INFO L93 Difference]: Finished difference Result 503 states and 762 transitions. [2025-03-03 20:36:05,352 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2025-03-03 20:36:05,352 INFO L78 Accepts]: Start accepts. Automaton has has 18 states, 18 states have (on average 2.4444444444444446) internal successors, (44), 18 states have internal predecessors, (44), 3 states have call successors, (27), 1 states have call predecessors, (27), 1 states have return successors, (27), 3 states have call predecessors, (27), 3 states have call successors, (27) Word has length 176 [2025-03-03 20:36:05,353 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 20:36:05,355 INFO L225 Difference]: With dead ends: 503 [2025-03-03 20:36:05,355 INFO L226 Difference]: Without dead ends: 501 [2025-03-03 20:36:05,355 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 35 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 172 ImplicationChecksByTransitivity, 3.6s TimeCoverageRelationStatistics Valid=251, Invalid=741, Unknown=0, NotChecked=0, Total=992 [2025-03-03 20:36:05,356 INFO L435 NwaCegarLoop]: 165 mSDtfsCounter, 989 mSDsluCounter, 1189 mSDsCounter, 0 mSdLazyCounter, 1039 mSolverCounterSat, 150 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 989 SdHoareTripleChecker+Valid, 1354 SdHoareTripleChecker+Invalid, 1189 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 150 IncrementalHoareTripleChecker+Valid, 1039 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.3s IncrementalHoareTripleChecker+Time [2025-03-03 20:36:05,356 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [989 Valid, 1354 Invalid, 1189 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [150 Valid, 1039 Invalid, 0 Unknown, 0 Unchecked, 2.3s Time] [2025-03-03 20:36:05,356 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 501 states. [2025-03-03 20:36:05,369 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 501 to 337. [2025-03-03 20:36:05,370 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 337 states, 251 states have (on average 1.3944223107569722) internal successors, (350), 251 states have internal predecessors, (350), 81 states have call successors, (81), 4 states have call predecessors, (81), 4 states have return successors, (81), 81 states have call predecessors, (81), 81 states have call successors, (81) [2025-03-03 20:36:05,371 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 337 states to 337 states and 512 transitions. [2025-03-03 20:36:05,371 INFO L78 Accepts]: Start accepts. Automaton has 337 states and 512 transitions. Word has length 176 [2025-03-03 20:36:05,372 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 20:36:05,372 INFO L471 AbstractCegarLoop]: Abstraction has 337 states and 512 transitions. [2025-03-03 20:36:05,372 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 18 states have (on average 2.4444444444444446) internal successors, (44), 18 states have internal predecessors, (44), 3 states have call successors, (27), 1 states have call predecessors, (27), 1 states have return successors, (27), 3 states have call predecessors, (27), 3 states have call successors, (27) [2025-03-03 20:36:05,372 INFO L276 IsEmpty]: Start isEmpty. Operand 337 states and 512 transitions. [2025-03-03 20:36:05,373 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 177 [2025-03-03 20:36:05,374 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 20:36:05,374 INFO L218 NwaCegarLoop]: trace histogram [27, 27, 27, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 20:36:05,374 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2025-03-03 20:36:05,374 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 20:36:05,374 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 20:36:05,375 INFO L85 PathProgramCache]: Analyzing trace with hash 1458319199, now seen corresponding path program 1 times [2025-03-03 20:36:05,375 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 20:36:05,375 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1620786107] [2025-03-03 20:36:05,375 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 20:36:05,375 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 20:36:05,382 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 176 statements into 1 equivalence classes. [2025-03-03 20:36:05,421 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 176 of 176 statements. [2025-03-03 20:36:05,421 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 20:36:05,421 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 20:36:13,797 INFO L134 CoverageAnalysis]: Checked inductivity of 1404 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1404 trivial. 0 not checked. [2025-03-03 20:36:13,798 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 20:36:13,798 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1620786107] [2025-03-03 20:36:13,798 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1620786107] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 20:36:13,798 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 20:36:13,798 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [17] imperfect sequences [] total 17 [2025-03-03 20:36:13,798 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1314726458] [2025-03-03 20:36:13,798 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 20:36:13,799 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2025-03-03 20:36:13,799 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 20:36:13,799 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2025-03-03 20:36:13,799 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=59, Invalid=213, Unknown=0, NotChecked=0, Total=272 [2025-03-03 20:36:13,800 INFO L87 Difference]: Start difference. First operand 337 states and 512 transitions. Second operand has 17 states, 17 states have (on average 2.588235294117647) internal successors, (44), 17 states have internal predecessors, (44), 1 states have call successors, (27), 1 states have call predecessors, (27), 1 states have return successors, (27), 1 states have call predecessors, (27), 1 states have call successors, (27)