./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/array-lopstr16/flag_loopdep_simple.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/array-lopstr16/flag_loopdep_simple.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 2e1c46549da470f14361a9b2a5fb79d079bbffb4006138f4fef05b9b152f9be7 --- Real Ultimate output --- This is Ultimate 0.3.0-?-798a7b3-m [2025-03-03 09:33:06,107 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-03 09:33:06,162 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2025-03-03 09:33:06,168 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-03 09:33:06,168 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-03 09:33:06,187 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-03 09:33:06,188 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-03 09:33:06,188 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-03 09:33:06,189 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-03 09:33:06,189 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-03 09:33:06,190 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-03 09:33:06,190 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-03 09:33:06,190 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-03 09:33:06,190 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-03 09:33:06,190 INFO L153 SettingsManager]: * Use SBE=true [2025-03-03 09:33:06,191 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-03 09:33:06,191 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-03 09:33:06,191 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-03 09:33:06,191 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-03 09:33:06,191 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-03 09:33:06,191 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-03 09:33:06,191 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-03 09:33:06,191 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-03 09:33:06,191 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-03 09:33:06,191 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-03 09:33:06,192 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-03 09:33:06,192 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-03 09:33:06,192 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-03 09:33:06,192 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-03 09:33:06,192 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-03 09:33:06,192 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-03 09:33:06,192 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-03 09:33:06,192 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-03 09:33:06,192 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-03 09:33:06,193 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-03 09:33:06,193 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-03 09:33:06,193 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-03 09:33:06,193 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-03 09:33:06,193 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-03 09:33:06,193 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-03 09:33:06,193 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-03 09:33:06,193 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-03 09:33:06,193 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-03 09:33:06,193 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 -> 2e1c46549da470f14361a9b2a5fb79d079bbffb4006138f4fef05b9b152f9be7 [2025-03-03 09:33:06,438 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-03 09:33:06,445 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-03 09:33:06,446 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-03 09:33:06,448 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-03 09:33:06,449 INFO L274 PluginConnector]: CDTParser initialized [2025-03-03 09:33:06,450 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/array-lopstr16/flag_loopdep_simple.i [2025-03-03 09:33:07,598 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/117f37620/5c59b346bb6d48c7ae5c8294e53ef423/FLAG4f405495a [2025-03-03 09:33:07,823 INFO L384 CDTParser]: Found 1 translation units. [2025-03-03 09:33:07,825 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/array-lopstr16/flag_loopdep_simple.i [2025-03-03 09:33:07,846 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/117f37620/5c59b346bb6d48c7ae5c8294e53ef423/FLAG4f405495a [2025-03-03 09:33:08,187 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/117f37620/5c59b346bb6d48c7ae5c8294e53ef423 [2025-03-03 09:33:08,189 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-03 09:33:08,190 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-03 09:33:08,191 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-03 09:33:08,191 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-03 09:33:08,194 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-03 09:33:08,195 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 03.03 09:33:08" (1/1) ... [2025-03-03 09:33:08,195 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5dd8bed5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 09:33:08, skipping insertion in model container [2025-03-03 09:33:08,195 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 03.03 09:33:08" (1/1) ... [2025-03-03 09:33:08,207 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-03 09:33:08,303 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/array-lopstr16/flag_loopdep_simple.i[812,825] [2025-03-03 09:33:08,320 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-03 09:33:08,326 INFO L200 MainTranslator]: Completed pre-run [2025-03-03 09:33:08,333 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/array-lopstr16/flag_loopdep_simple.i[812,825] [2025-03-03 09:33:08,338 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-03 09:33:08,347 INFO L204 MainTranslator]: Completed translation [2025-03-03 09:33:08,347 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 09:33:08 WrapperNode [2025-03-03 09:33:08,347 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-03 09:33:08,348 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-03 09:33:08,348 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-03 09:33:08,348 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-03 09:33:08,353 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 09:33:08" (1/1) ... [2025-03-03 09:33:08,357 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 09:33:08" (1/1) ... [2025-03-03 09:33:08,367 INFO L138 Inliner]: procedures = 17, calls = 14, calls flagged for inlining = 4, calls inlined = 4, statements flattened = 54 [2025-03-03 09:33:08,367 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-03 09:33:08,367 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-03 09:33:08,367 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-03 09:33:08,367 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-03 09:33:08,372 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 09:33:08" (1/1) ... [2025-03-03 09:33:08,372 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 09:33:08" (1/1) ... [2025-03-03 09:33:08,373 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 09:33:08" (1/1) ... [2025-03-03 09:33:08,380 INFO L175 MemorySlicer]: Split 5 memory accesses to 2 slices as follows [2, 3]. 60 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2, 0]. The 1 writes are split as follows [0, 1]. [2025-03-03 09:33:08,380 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 09:33:08" (1/1) ... [2025-03-03 09:33:08,380 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 09:33:08" (1/1) ... [2025-03-03 09:33:08,383 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 09:33:08" (1/1) ... [2025-03-03 09:33:08,383 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 09:33:08" (1/1) ... [2025-03-03 09:33:08,384 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 09:33:08" (1/1) ... [2025-03-03 09:33:08,384 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 09:33:08" (1/1) ... [2025-03-03 09:33:08,385 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-03 09:33:08,386 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-03 09:33:08,386 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-03 09:33:08,386 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-03 09:33:08,387 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 09:33:08" (1/1) ... [2025-03-03 09:33:08,390 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-03 09:33:08,399 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 09:33:08,408 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 09:33:08,410 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 09:33:08,426 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-03 09:33:08,426 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-03-03 09:33:08,427 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2025-03-03 09:33:08,427 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2025-03-03 09:33:08,427 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2025-03-03 09:33:08,427 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2025-03-03 09:33:08,427 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-03 09:33:08,427 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-03 09:33:08,427 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2025-03-03 09:33:08,427 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2025-03-03 09:33:08,427 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2025-03-03 09:33:08,478 INFO L256 CfgBuilder]: Building ICFG [2025-03-03 09:33:08,480 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-03 09:33:08,583 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L29: call ULTIMATE.dealloc(main_~#a~0#1.base, main_~#a~0#1.offset);havoc main_~#a~0#1.base, main_~#a~0#1.offset; [2025-03-03 09:33:08,590 INFO L? ?]: Removed 12 outVars from TransFormulas that were not future-live. [2025-03-03 09:33:08,591 INFO L307 CfgBuilder]: Performing block encoding [2025-03-03 09:33:08,598 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-03 09:33:08,599 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-03 09:33:08,599 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 03.03 09:33:08 BoogieIcfgContainer [2025-03-03 09:33:08,600 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-03 09:33:08,602 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-03 09:33:08,602 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-03 09:33:08,605 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-03 09:33:08,606 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 03.03 09:33:08" (1/3) ... [2025-03-03 09:33:08,607 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@783058fe and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 03.03 09:33:08, skipping insertion in model container [2025-03-03 09:33:08,607 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 09:33:08" (2/3) ... [2025-03-03 09:33:08,607 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@783058fe and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 03.03 09:33:08, skipping insertion in model container [2025-03-03 09:33:08,607 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 03.03 09:33:08" (3/3) ... [2025-03-03 09:33:08,609 INFO L128 eAbstractionObserver]: Analyzing ICFG flag_loopdep_simple.i [2025-03-03 09:33:08,619 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-03 09:33:08,621 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG flag_loopdep_simple.i that has 1 procedures, 17 locations, 1 initial locations, 3 loop locations, and 1 error locations. [2025-03-03 09:33:08,661 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-03 09:33:08,671 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;@79d1ac43, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-03 09:33:08,672 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-03-03 09:33:08,675 INFO L276 IsEmpty]: Start isEmpty. Operand has 17 states, 15 states have (on average 1.4666666666666666) internal successors, (22), 16 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 09:33:08,678 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2025-03-03 09:33:08,679 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 09:33:08,679 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 09:33:08,680 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 09:33:08,685 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 09:33:08,685 INFO L85 PathProgramCache]: Analyzing trace with hash 2031374924, now seen corresponding path program 1 times [2025-03-03 09:33:08,690 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 09:33:08,691 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [158343385] [2025-03-03 09:33:08,693 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 09:33:08,693 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 09:33:08,744 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 9 statements into 1 equivalence classes. [2025-03-03 09:33:08,757 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 9 of 9 statements. [2025-03-03 09:33:08,757 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 09:33:08,757 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 09:33:08,874 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 09:33:08,875 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 09:33:08,875 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [158343385] [2025-03-03 09:33:08,875 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [158343385] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 09:33:08,875 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 09:33:08,875 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-03 09:33:08,876 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [540136050] [2025-03-03 09:33:08,877 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 09:33:08,879 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-03 09:33:08,879 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 09:33:08,891 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-03 09:33:08,892 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 09:33:08,893 INFO L87 Difference]: Start difference. First operand has 17 states, 15 states have (on average 1.4666666666666666) internal successors, (22), 16 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 3 states, 3 states have (on average 3.0) internal successors, (9), 3 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 09:33:08,907 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 09:33:08,907 INFO L93 Difference]: Finished difference Result 32 states and 42 transitions. [2025-03-03 09:33:08,908 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-03 09:33:08,909 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 3.0) internal successors, (9), 3 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 9 [2025-03-03 09:33:08,909 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 09:33:08,913 INFO L225 Difference]: With dead ends: 32 [2025-03-03 09:33:08,913 INFO L226 Difference]: Without dead ends: 15 [2025-03-03 09:33:08,915 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 09:33:08,917 INFO L435 NwaCegarLoop]: 20 mSDtfsCounter, 0 mSDsluCounter, 17 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 37 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 09:33:08,917 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 37 Invalid, 4 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-03 09:33:08,926 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15 states. [2025-03-03 09:33:08,932 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15 to 15. [2025-03-03 09:33:08,933 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 15 states, 14 states have (on average 1.3571428571428572) internal successors, (19), 14 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 09:33:08,935 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 19 transitions. [2025-03-03 09:33:08,936 INFO L78 Accepts]: Start accepts. Automaton has 15 states and 19 transitions. Word has length 9 [2025-03-03 09:33:08,936 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 09:33:08,936 INFO L471 AbstractCegarLoop]: Abstraction has 15 states and 19 transitions. [2025-03-03 09:33:08,936 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 3.0) internal successors, (9), 3 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 09:33:08,936 INFO L276 IsEmpty]: Start isEmpty. Operand 15 states and 19 transitions. [2025-03-03 09:33:08,937 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2025-03-03 09:33:08,937 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 09:33:08,937 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 09:33:08,937 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-03-03 09:33:08,937 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 09:33:08,937 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 09:33:08,937 INFO L85 PathProgramCache]: Analyzing trace with hash -1275558951, now seen corresponding path program 1 times [2025-03-03 09:33:08,938 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 09:33:08,938 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1830309700] [2025-03-03 09:33:08,938 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 09:33:08,938 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 09:33:08,949 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 10 statements into 1 equivalence classes. [2025-03-03 09:33:08,958 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 10 of 10 statements. [2025-03-03 09:33:08,961 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 09:33:08,961 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 09:33:09,004 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-03-03 09:33:09,008 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 09:33:09,009 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1830309700] [2025-03-03 09:33:09,009 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1830309700] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 09:33:09,009 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 09:33:09,009 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-03 09:33:09,009 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2079346983] [2025-03-03 09:33:09,009 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 09:33:09,009 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-03 09:33:09,010 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 09:33:09,010 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-03 09:33:09,010 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 09:33:09,010 INFO L87 Difference]: Start difference. First operand 15 states and 19 transitions. Second operand has 3 states, 3 states have (on average 3.3333333333333335) internal successors, (10), 3 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 09:33:09,035 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 09:33:09,035 INFO L93 Difference]: Finished difference Result 32 states and 40 transitions. [2025-03-03 09:33:09,036 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-03 09:33:09,036 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 3.3333333333333335) internal successors, (10), 3 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 10 [2025-03-03 09:33:09,036 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 09:33:09,037 INFO L225 Difference]: With dead ends: 32 [2025-03-03 09:33:09,037 INFO L226 Difference]: Without dead ends: 25 [2025-03-03 09:33:09,037 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 09:33:09,037 INFO L435 NwaCegarLoop]: 13 mSDtfsCounter, 10 mSDsluCounter, 10 mSDsCounter, 0 mSdLazyCounter, 11 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 10 SdHoareTripleChecker+Valid, 23 SdHoareTripleChecker+Invalid, 12 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 11 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-03 09:33:09,038 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [10 Valid, 23 Invalid, 12 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 11 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-03 09:33:09,038 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25 states. [2025-03-03 09:33:09,039 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25 to 16. [2025-03-03 09:33:09,041 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 16 states, 15 states have (on average 1.3333333333333333) internal successors, (20), 15 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 09:33:09,042 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 20 transitions. [2025-03-03 09:33:09,042 INFO L78 Accepts]: Start accepts. Automaton has 16 states and 20 transitions. Word has length 10 [2025-03-03 09:33:09,042 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 09:33:09,042 INFO L471 AbstractCegarLoop]: Abstraction has 16 states and 20 transitions. [2025-03-03 09:33:09,043 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 3.3333333333333335) internal successors, (10), 3 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 09:33:09,043 INFO L276 IsEmpty]: Start isEmpty. Operand 16 states and 20 transitions. [2025-03-03 09:33:09,043 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2025-03-03 09:33:09,043 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 09:33:09,043 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 09:33:09,043 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-03-03 09:33:09,044 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 09:33:09,044 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 09:33:09,044 INFO L85 PathProgramCache]: Analyzing trace with hash -550427028, now seen corresponding path program 1 times [2025-03-03 09:33:09,044 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 09:33:09,044 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1482266545] [2025-03-03 09:33:09,044 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 09:33:09,044 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 09:33:09,059 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 13 statements into 1 equivalence classes. [2025-03-03 09:33:09,070 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 13 of 13 statements. [2025-03-03 09:33:09,070 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 09:33:09,070 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 09:33:09,129 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-03-03 09:33:09,129 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 09:33:09,129 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1482266545] [2025-03-03 09:33:09,129 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1482266545] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-03 09:33:09,129 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1646435213] [2025-03-03 09:33:09,129 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 09:33:09,129 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 09:33:09,129 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 09:33:09,133 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 09:33:09,134 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 09:33:09,181 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 13 statements into 1 equivalence classes. [2025-03-03 09:33:09,195 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 13 of 13 statements. [2025-03-03 09:33:09,195 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 09:33:09,195 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 09:33:09,197 INFO L256 TraceCheckSpWp]: Trace formula consists of 79 conjuncts, 5 conjuncts are in the unsatisfiable core [2025-03-03 09:33:09,204 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 09:33:09,247 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-03-03 09:33:09,248 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-03 09:33:09,274 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-03-03 09:33:09,276 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1646435213] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-03 09:33:09,276 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-03 09:33:09,276 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 8 [2025-03-03 09:33:09,276 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1674719531] [2025-03-03 09:33:09,276 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-03 09:33:09,277 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-03-03 09:33:09,277 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 09:33:09,278 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-03-03 09:33:09,278 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=36, Unknown=0, NotChecked=0, Total=56 [2025-03-03 09:33:09,278 INFO L87 Difference]: Start difference. First operand 16 states and 20 transitions. Second operand has 8 states, 8 states have (on average 3.0) internal successors, (24), 8 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 09:33:09,328 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 09:33:09,329 INFO L93 Difference]: Finished difference Result 50 states and 65 transitions. [2025-03-03 09:33:09,332 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-03-03 09:33:09,332 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 3.0) internal successors, (24), 8 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 13 [2025-03-03 09:33:09,332 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 09:33:09,332 INFO L225 Difference]: With dead ends: 50 [2025-03-03 09:33:09,332 INFO L226 Difference]: Without dead ends: 38 [2025-03-03 09:33:09,333 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 22 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=20, Invalid=36, Unknown=0, NotChecked=0, Total=56 [2025-03-03 09:33:09,333 INFO L435 NwaCegarLoop]: 12 mSDtfsCounter, 18 mSDsluCounter, 36 mSDsCounter, 0 mSdLazyCounter, 38 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 18 SdHoareTripleChecker+Valid, 48 SdHoareTripleChecker+Invalid, 41 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 38 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-03 09:33:09,333 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [18 Valid, 48 Invalid, 41 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 38 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-03 09:33:09,334 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 38 states. [2025-03-03 09:33:09,338 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 38 to 22. [2025-03-03 09:33:09,338 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 22 states, 21 states have (on average 1.2857142857142858) internal successors, (27), 21 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 09:33:09,339 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 27 transitions. [2025-03-03 09:33:09,339 INFO L78 Accepts]: Start accepts. Automaton has 22 states and 27 transitions. Word has length 13 [2025-03-03 09:33:09,339 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 09:33:09,339 INFO L471 AbstractCegarLoop]: Abstraction has 22 states and 27 transitions. [2025-03-03 09:33:09,339 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 3.0) internal successors, (24), 8 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 09:33:09,339 INFO L276 IsEmpty]: Start isEmpty. Operand 22 states and 27 transitions. [2025-03-03 09:33:09,340 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2025-03-03 09:33:09,341 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 09:33:09,341 INFO L218 NwaCegarLoop]: trace histogram [4, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 09:33:09,346 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 09:33:09,541 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 09:33:09,542 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 09:33:09,542 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 09:33:09,542 INFO L85 PathProgramCache]: Analyzing trace with hash -1700589972, now seen corresponding path program 2 times [2025-03-03 09:33:09,542 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 09:33:09,542 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [516259187] [2025-03-03 09:33:09,542 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-03 09:33:09,542 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 09:33:09,552 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 19 statements into 2 equivalence classes. [2025-03-03 09:33:09,569 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 19 of 19 statements. [2025-03-03 09:33:09,569 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-03 09:33:09,570 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 09:33:09,756 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2025-03-03 09:33:09,756 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 09:33:09,756 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [516259187] [2025-03-03 09:33:09,756 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [516259187] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-03 09:33:09,756 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1469564031] [2025-03-03 09:33:09,757 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-03 09:33:09,757 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 09:33:09,757 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 09:33:09,760 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-03 09:33:09,762 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2025-03-03 09:33:09,798 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 19 statements into 2 equivalence classes. [2025-03-03 09:33:09,816 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 19 of 19 statements. [2025-03-03 09:33:09,817 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-03 09:33:09,817 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 09:33:09,818 INFO L256 TraceCheckSpWp]: Trace formula consists of 113 conjuncts, 8 conjuncts are in the unsatisfiable core [2025-03-03 09:33:09,819 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 09:33:09,904 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2025-03-03 09:33:09,904 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-03 09:33:09,998 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2025-03-03 09:33:09,998 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1469564031] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-03 09:33:09,999 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-03 09:33:09,999 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7] total 17 [2025-03-03 09:33:09,999 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [751056358] [2025-03-03 09:33:09,999 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-03 09:33:10,000 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2025-03-03 09:33:10,000 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 09:33:10,000 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2025-03-03 09:33:10,001 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=126, Invalid=146, Unknown=0, NotChecked=0, Total=272 [2025-03-03 09:33:10,001 INFO L87 Difference]: Start difference. First operand 22 states and 27 transitions. Second operand has 17 states, 17 states have (on average 1.6470588235294117) internal successors, (28), 17 states have internal predecessors, (28), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 09:33:10,026 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 09:33:10,027 INFO L93 Difference]: Finished difference Result 43 states and 58 transitions. [2025-03-03 09:33:10,027 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2025-03-03 09:33:10,028 INFO L78 Accepts]: Start accepts. Automaton has has 17 states, 17 states have (on average 1.6470588235294117) internal successors, (28), 17 states have internal predecessors, (28), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 19 [2025-03-03 09:33:10,028 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 09:33:10,028 INFO L225 Difference]: With dead ends: 43 [2025-03-03 09:33:10,028 INFO L226 Difference]: Without dead ends: 28 [2025-03-03 09:33:10,028 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 43 GetRequests, 28 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=126, Invalid=146, Unknown=0, NotChecked=0, Total=272 [2025-03-03 09:33:10,029 INFO L435 NwaCegarLoop]: 17 mSDtfsCounter, 0 mSDsluCounter, 56 mSDsCounter, 0 mSdLazyCounter, 23 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 73 SdHoareTripleChecker+Invalid, 24 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 23 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-03 09:33:10,029 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 73 Invalid, 24 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 23 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-03 09:33:10,029 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28 states. [2025-03-03 09:33:10,033 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28 to 28. [2025-03-03 09:33:10,035 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 28 states, 27 states have (on average 1.2222222222222223) internal successors, (33), 27 states have internal predecessors, (33), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 09:33:10,035 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 33 transitions. [2025-03-03 09:33:10,036 INFO L78 Accepts]: Start accepts. Automaton has 28 states and 33 transitions. Word has length 19 [2025-03-03 09:33:10,036 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 09:33:10,036 INFO L471 AbstractCegarLoop]: Abstraction has 28 states and 33 transitions. [2025-03-03 09:33:10,036 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 17 states have (on average 1.6470588235294117) internal successors, (28), 17 states have internal predecessors, (28), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 09:33:10,036 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 33 transitions. [2025-03-03 09:33:10,037 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2025-03-03 09:33:10,037 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 09:33:10,037 INFO L218 NwaCegarLoop]: trace histogram [10, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 09:33:10,042 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2025-03-03 09:33:10,241 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable3 [2025-03-03 09:33:10,241 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 09:33:10,241 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 09:33:10,241 INFO L85 PathProgramCache]: Analyzing trace with hash 1761039180, now seen corresponding path program 3 times [2025-03-03 09:33:10,242 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 09:33:10,242 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [780909790] [2025-03-03 09:33:10,242 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-03-03 09:33:10,242 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 09:33:10,256 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 25 statements into 6 equivalence classes. [2025-03-03 09:33:10,269 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) and asserted 19 of 25 statements. [2025-03-03 09:33:10,273 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2025-03-03 09:33:10,273 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 09:33:10,334 INFO L134 CoverageAnalysis]: Checked inductivity of 60 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2025-03-03 09:33:10,334 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 09:33:10,334 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [780909790] [2025-03-03 09:33:10,334 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [780909790] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-03 09:33:10,335 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1526456989] [2025-03-03 09:33:10,335 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-03-03 09:33:10,335 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 09:33:10,335 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 09:33:10,337 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-03 09:33:10,338 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2025-03-03 09:33:10,380 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 25 statements into 6 equivalence classes. [2025-03-03 09:33:10,394 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) and asserted 19 of 25 statements. [2025-03-03 09:33:10,395 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2025-03-03 09:33:10,395 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 09:33:10,399 INFO L256 TraceCheckSpWp]: Trace formula consists of 113 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-03-03 09:33:10,400 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 09:33:10,419 INFO L134 CoverageAnalysis]: Checked inductivity of 60 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2025-03-03 09:33:10,419 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-03 09:33:10,453 INFO L134 CoverageAnalysis]: Checked inductivity of 60 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2025-03-03 09:33:10,456 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1526456989] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-03 09:33:10,457 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-03 09:33:10,457 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 9 [2025-03-03 09:33:10,457 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1233649788] [2025-03-03 09:33:10,457 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-03 09:33:10,457 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-03-03 09:33:10,457 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 09:33:10,457 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-03-03 09:33:10,457 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=36, Unknown=0, NotChecked=0, Total=72 [2025-03-03 09:33:10,458 INFO L87 Difference]: Start difference. First operand 28 states and 33 transitions. Second operand has 9 states, 9 states have (on average 3.111111111111111) internal successors, (28), 9 states have internal predecessors, (28), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 09:33:10,515 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 09:33:10,515 INFO L93 Difference]: Finished difference Result 83 states and 102 transitions. [2025-03-03 09:33:10,516 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-03-03 09:33:10,516 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 3.111111111111111) internal successors, (28), 9 states have internal predecessors, (28), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 25 [2025-03-03 09:33:10,516 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 09:33:10,517 INFO L225 Difference]: With dead ends: 83 [2025-03-03 09:33:10,517 INFO L226 Difference]: Without dead ends: 76 [2025-03-03 09:33:10,517 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 53 GetRequests, 46 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=36, Invalid=36, Unknown=0, NotChecked=0, Total=72 [2025-03-03 09:33:10,517 INFO L435 NwaCegarLoop]: 13 mSDtfsCounter, 84 mSDsluCounter, 51 mSDsCounter, 0 mSdLazyCounter, 40 mSolverCounterSat, 13 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 84 SdHoareTripleChecker+Valid, 64 SdHoareTripleChecker+Invalid, 53 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 13 IncrementalHoareTripleChecker+Valid, 40 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-03 09:33:10,517 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [84 Valid, 64 Invalid, 53 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [13 Valid, 40 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-03 09:33:10,518 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 76 states. [2025-03-03 09:33:10,524 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 76 to 40. [2025-03-03 09:33:10,524 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 40 states, 39 states have (on average 1.2564102564102564) internal successors, (49), 39 states have internal predecessors, (49), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 09:33:10,524 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40 states to 40 states and 49 transitions. [2025-03-03 09:33:10,524 INFO L78 Accepts]: Start accepts. Automaton has 40 states and 49 transitions. Word has length 25 [2025-03-03 09:33:10,524 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 09:33:10,524 INFO L471 AbstractCegarLoop]: Abstraction has 40 states and 49 transitions. [2025-03-03 09:33:10,524 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 3.111111111111111) internal successors, (28), 9 states have internal predecessors, (28), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 09:33:10,525 INFO L276 IsEmpty]: Start isEmpty. Operand 40 states and 49 transitions. [2025-03-03 09:33:10,525 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2025-03-03 09:33:10,525 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 09:33:10,525 INFO L218 NwaCegarLoop]: trace histogram [10, 6, 6, 6, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 09:33:10,532 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2025-03-03 09:33:10,725 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 09:33:10,726 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 09:33:10,726 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 09:33:10,726 INFO L85 PathProgramCache]: Analyzing trace with hash 2020674828, now seen corresponding path program 4 times [2025-03-03 09:33:10,726 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 09:33:10,726 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [745730434] [2025-03-03 09:33:10,726 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-03-03 09:33:10,726 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 09:33:10,737 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 37 statements into 2 equivalence classes. [2025-03-03 09:33:10,750 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 37 of 37 statements. [2025-03-03 09:33:10,751 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-03-03 09:33:10,751 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 09:33:10,923 INFO L134 CoverageAnalysis]: Checked inductivity of 106 backedges. 0 proven. 51 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2025-03-03 09:33:10,923 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 09:33:10,924 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [745730434] [2025-03-03 09:33:10,924 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [745730434] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-03 09:33:10,924 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1175244729] [2025-03-03 09:33:10,924 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-03-03 09:33:10,924 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 09:33:10,924 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 09:33:10,926 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-03 09:33:10,927 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2025-03-03 09:33:10,964 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 37 statements into 2 equivalence classes. [2025-03-03 09:33:10,984 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 37 of 37 statements. [2025-03-03 09:33:10,984 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-03-03 09:33:10,984 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 09:33:10,985 INFO L256 TraceCheckSpWp]: Trace formula consists of 195 conjuncts, 8 conjuncts are in the unsatisfiable core [2025-03-03 09:33:10,986 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 09:33:11,015 INFO L134 CoverageAnalysis]: Checked inductivity of 106 backedges. 0 proven. 51 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2025-03-03 09:33:11,015 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-03 09:33:11,110 INFO L134 CoverageAnalysis]: Checked inductivity of 106 backedges. 0 proven. 51 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2025-03-03 09:33:11,111 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1175244729] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-03 09:33:11,111 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-03 09:33:11,111 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 9, 9] total 18 [2025-03-03 09:33:11,111 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1245219696] [2025-03-03 09:33:11,112 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-03 09:33:11,112 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2025-03-03 09:33:11,112 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 09:33:11,112 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2025-03-03 09:33:11,113 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=138, Invalid=168, Unknown=0, NotChecked=0, Total=306 [2025-03-03 09:33:11,114 INFO L87 Difference]: Start difference. First operand 40 states and 49 transitions. Second operand has 18 states, 18 states have (on average 3.0) internal successors, (54), 18 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 09:33:11,228 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 09:33:11,228 INFO L93 Difference]: Finished difference Result 163 states and 202 transitions. [2025-03-03 09:33:11,228 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2025-03-03 09:33:11,228 INFO L78 Accepts]: Start accepts. Automaton has has 18 states, 18 states have (on average 3.0) internal successors, (54), 18 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 37 [2025-03-03 09:33:11,228 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 09:33:11,229 INFO L225 Difference]: With dead ends: 163 [2025-03-03 09:33:11,229 INFO L226 Difference]: Without dead ends: 156 [2025-03-03 09:33:11,230 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 83 GetRequests, 67 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 30 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=138, Invalid=168, Unknown=0, NotChecked=0, Total=306 [2025-03-03 09:33:11,230 INFO L435 NwaCegarLoop]: 13 mSDtfsCounter, 292 mSDsluCounter, 110 mSDsCounter, 0 mSdLazyCounter, 83 mSolverCounterSat, 39 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 292 SdHoareTripleChecker+Valid, 123 SdHoareTripleChecker+Invalid, 122 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 39 IncrementalHoareTripleChecker+Valid, 83 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-03 09:33:11,230 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [292 Valid, 123 Invalid, 122 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [39 Valid, 83 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-03 09:33:11,231 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 156 states. [2025-03-03 09:33:11,237 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 156 to 64. [2025-03-03 09:33:11,237 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 64 states, 63 states have (on average 1.2857142857142858) internal successors, (81), 63 states have internal predecessors, (81), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 09:33:11,238 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 64 states to 64 states and 81 transitions. [2025-03-03 09:33:11,238 INFO L78 Accepts]: Start accepts. Automaton has 64 states and 81 transitions. Word has length 37 [2025-03-03 09:33:11,238 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 09:33:11,238 INFO L471 AbstractCegarLoop]: Abstraction has 64 states and 81 transitions. [2025-03-03 09:33:11,238 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 18 states have (on average 3.0) internal successors, (54), 18 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 09:33:11,238 INFO L276 IsEmpty]: Start isEmpty. Operand 64 states and 81 transitions. [2025-03-03 09:33:11,240 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2025-03-03 09:33:11,240 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 09:33:11,240 INFO L218 NwaCegarLoop]: trace histogram [14, 14, 14, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 09:33:11,246 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2025-03-03 09:33:11,444 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 09:33:11,444 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 09:33:11,445 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 09:33:11,445 INFO L85 PathProgramCache]: Analyzing trace with hash 750428300, now seen corresponding path program 5 times [2025-03-03 09:33:11,445 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 09:33:11,445 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2113519219] [2025-03-03 09:33:11,445 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-03-03 09:33:11,445 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 09:33:11,462 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 61 statements into 15 equivalence classes. [2025-03-03 09:33:11,492 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 15 check-sat command(s) and asserted 61 of 61 statements. [2025-03-03 09:33:11,493 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 15 check-sat command(s) [2025-03-03 09:33:11,493 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 09:33:11,749 INFO L134 CoverageAnalysis]: Checked inductivity of 342 backedges. 0 proven. 287 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2025-03-03 09:33:11,749 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 09:33:11,749 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2113519219] [2025-03-03 09:33:11,749 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2113519219] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-03 09:33:11,749 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [163884282] [2025-03-03 09:33:11,749 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-03-03 09:33:11,750 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 09:33:11,750 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 09:33:11,751 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-03 09:33:11,753 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2025-03-03 09:33:11,798 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 61 statements into 15 equivalence classes. [2025-03-03 09:33:11,841 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 15 check-sat command(s) and asserted 61 of 61 statements. [2025-03-03 09:33:11,842 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 15 check-sat command(s) [2025-03-03 09:33:11,842 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 09:33:11,845 INFO L256 TraceCheckSpWp]: Trace formula consists of 251 conjuncts, 16 conjuncts are in the unsatisfiable core [2025-03-03 09:33:11,846 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 09:33:11,904 INFO L134 CoverageAnalysis]: Checked inductivity of 342 backedges. 0 proven. 287 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2025-03-03 09:33:11,905 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-03 09:33:12,222 INFO L134 CoverageAnalysis]: Checked inductivity of 342 backedges. 0 proven. 287 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2025-03-03 09:33:12,222 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [163884282] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-03 09:33:12,222 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-03 09:33:12,222 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 17, 17] total 32 [2025-03-03 09:33:12,222 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [421897816] [2025-03-03 09:33:12,222 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-03 09:33:12,222 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 32 states [2025-03-03 09:33:12,222 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 09:33:12,223 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 32 interpolants. [2025-03-03 09:33:12,224 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=496, Invalid=496, Unknown=0, NotChecked=0, Total=992 [2025-03-03 09:33:12,224 INFO L87 Difference]: Start difference. First operand 64 states and 81 transitions. Second operand has 32 states, 32 states have (on average 3.0) internal successors, (96), 32 states have internal predecessors, (96), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 09:33:12,464 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 09:33:12,465 INFO L93 Difference]: Finished difference Result 323 states and 402 transitions. [2025-03-03 09:33:12,465 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2025-03-03 09:33:12,465 INFO L78 Accepts]: Start accepts. Automaton has has 32 states, 32 states have (on average 3.0) internal successors, (96), 32 states have internal predecessors, (96), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 61 [2025-03-03 09:33:12,465 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 09:33:12,466 INFO L225 Difference]: With dead ends: 323 [2025-03-03 09:33:12,466 INFO L226 Difference]: Without dead ends: 316 [2025-03-03 09:33:12,467 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 137 GetRequests, 107 SyntacticMatches, 0 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=496, Invalid=496, Unknown=0, NotChecked=0, Total=992 [2025-03-03 09:33:12,468 INFO L435 NwaCegarLoop]: 13 mSDtfsCounter, 764 mSDsluCounter, 212 mSDsCounter, 0 mSdLazyCounter, 155 mSolverCounterSat, 98 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 764 SdHoareTripleChecker+Valid, 225 SdHoareTripleChecker+Invalid, 253 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 98 IncrementalHoareTripleChecker+Valid, 155 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-03 09:33:12,468 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [764 Valid, 225 Invalid, 253 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [98 Valid, 155 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-03 09:33:12,469 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 316 states. [2025-03-03 09:33:12,474 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 316 to 112. [2025-03-03 09:33:12,475 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 112 states, 111 states have (on average 1.3063063063063063) internal successors, (145), 111 states have internal predecessors, (145), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 09:33:12,475 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 112 states to 112 states and 145 transitions. [2025-03-03 09:33:12,475 INFO L78 Accepts]: Start accepts. Automaton has 112 states and 145 transitions. Word has length 61 [2025-03-03 09:33:12,475 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 09:33:12,476 INFO L471 AbstractCegarLoop]: Abstraction has 112 states and 145 transitions. [2025-03-03 09:33:12,476 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 32 states, 32 states have (on average 3.0) internal successors, (96), 32 states have internal predecessors, (96), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 09:33:12,476 INFO L276 IsEmpty]: Start isEmpty. Operand 112 states and 145 transitions. [2025-03-03 09:33:12,477 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 110 [2025-03-03 09:33:12,477 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 09:33:12,477 INFO L218 NwaCegarLoop]: trace histogram [30, 30, 30, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 09:33:12,483 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2025-03-03 09:33:12,697 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 09:33:12,698 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 09:33:12,698 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 09:33:12,698 INFO L85 PathProgramCache]: Analyzing trace with hash 283527052, now seen corresponding path program 6 times [2025-03-03 09:33:12,699 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 09:33:12,699 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1759146444] [2025-03-03 09:33:12,699 INFO L95 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2025-03-03 09:33:12,699 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 09:33:12,718 INFO L108 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE partitioned 109 statements into 31 equivalence classes. [2025-03-03 09:33:12,725 INFO L111 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 5 check-sat command(s) and asserted 25 of 109 statements. [2025-03-03 09:33:12,725 INFO L114 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 5 check-sat command(s) [2025-03-03 09:33:12,725 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 09:33:12,881 INFO L134 CoverageAnalysis]: Checked inductivity of 1390 backedges. 0 proven. 59 refuted. 0 times theorem prover too weak. 1331 trivial. 0 not checked. [2025-03-03 09:33:12,881 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 09:33:12,881 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1759146444] [2025-03-03 09:33:12,881 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1759146444] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-03 09:33:12,881 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [237765409] [2025-03-03 09:33:12,881 INFO L95 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2025-03-03 09:33:12,882 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 09:33:12,882 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 09:33:12,884 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-03 09:33:12,885 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2025-03-03 09:33:12,935 INFO L108 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE partitioned 109 statements into 31 equivalence classes. [2025-03-03 09:33:12,950 INFO L111 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 5 check-sat command(s) and asserted 25 of 109 statements. [2025-03-03 09:33:12,950 INFO L114 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 5 check-sat command(s) [2025-03-03 09:33:12,950 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 09:33:12,951 INFO L256 TraceCheckSpWp]: Trace formula consists of 127 conjuncts, 15 conjuncts are in the unsatisfiable core [2025-03-03 09:33:12,954 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 09:33:13,239 INFO L134 CoverageAnalysis]: Checked inductivity of 1390 backedges. 0 proven. 59 refuted. 0 times theorem prover too weak. 1331 trivial. 0 not checked. [2025-03-03 09:33:13,239 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-03 09:33:13,385 INFO L349 Elim1Store]: treesize reduction 5, result has 37.5 percent of original size [2025-03-03 09:33:13,386 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 20 treesize of output 11 [2025-03-03 09:33:13,394 INFO L134 CoverageAnalysis]: Checked inductivity of 1390 backedges. 29 proven. 30 refuted. 0 times theorem prover too weak. 1331 trivial. 0 not checked. [2025-03-03 09:33:13,394 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [237765409] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-03 09:33:13,394 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-03 09:33:13,394 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8, 7] total 13 [2025-03-03 09:33:13,395 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [337633229] [2025-03-03 09:33:13,395 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-03 09:33:13,395 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2025-03-03 09:33:13,395 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 09:33:13,395 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2025-03-03 09:33:13,396 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=39, Invalid=117, Unknown=0, NotChecked=0, Total=156 [2025-03-03 09:33:13,396 INFO L87 Difference]: Start difference. First operand 112 states and 145 transitions. Second operand has 13 states, 13 states have (on average 2.230769230769231) internal successors, (29), 13 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 09:33:13,459 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 09:33:13,459 INFO L93 Difference]: Finished difference Result 222 states and 288 transitions. [2025-03-03 09:33:13,460 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-03-03 09:33:13,460 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 2.230769230769231) internal successors, (29), 13 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 109 [2025-03-03 09:33:13,460 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 09:33:13,461 INFO L225 Difference]: With dead ends: 222 [2025-03-03 09:33:13,461 INFO L226 Difference]: Without dead ends: 220 [2025-03-03 09:33:13,461 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 226 GetRequests, 212 SyntacticMatches, 1 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 40 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=58, Invalid=152, Unknown=0, NotChecked=0, Total=210 [2025-03-03 09:33:13,462 INFO L435 NwaCegarLoop]: 14 mSDtfsCounter, 50 mSDsluCounter, 85 mSDsCounter, 0 mSdLazyCounter, 84 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 50 SdHoareTripleChecker+Valid, 99 SdHoareTripleChecker+Invalid, 87 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 84 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-03 09:33:13,462 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [50 Valid, 99 Invalid, 87 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 84 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-03 09:33:13,462 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 220 states. [2025-03-03 09:33:13,481 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 220 to 204. [2025-03-03 09:33:13,482 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 204 states, 203 states have (on average 1.3201970443349753) internal successors, (268), 203 states have internal predecessors, (268), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 09:33:13,483 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 204 states to 204 states and 268 transitions. [2025-03-03 09:33:13,483 INFO L78 Accepts]: Start accepts. Automaton has 204 states and 268 transitions. Word has length 109 [2025-03-03 09:33:13,483 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 09:33:13,483 INFO L471 AbstractCegarLoop]: Abstraction has 204 states and 268 transitions. [2025-03-03 09:33:13,483 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 2.230769230769231) internal successors, (29), 13 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 09:33:13,483 INFO L276 IsEmpty]: Start isEmpty. Operand 204 states and 268 transitions. [2025-03-03 09:33:13,486 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 110 [2025-03-03 09:33:13,486 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 09:33:13,486 INFO L218 NwaCegarLoop]: trace histogram [30, 30, 29, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 09:33:13,497 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Ended with exit code 0 [2025-03-03 09:33:13,687 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 09:33:13,687 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 09:33:13,688 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 09:33:13,688 INFO L85 PathProgramCache]: Analyzing trace with hash 1093014509, now seen corresponding path program 1 times [2025-03-03 09:33:13,688 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 09:33:13,688 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1401869239] [2025-03-03 09:33:13,688 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 09:33:13,688 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 09:33:13,697 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 109 statements into 1 equivalence classes. [2025-03-03 09:33:13,705 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 109 of 109 statements. [2025-03-03 09:33:13,705 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 09:33:13,705 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 09:33:13,768 INFO L134 CoverageAnalysis]: Checked inductivity of 1390 backedges. 59 proven. 0 refuted. 0 times theorem prover too weak. 1331 trivial. 0 not checked. [2025-03-03 09:33:13,768 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 09:33:13,768 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1401869239] [2025-03-03 09:33:13,769 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1401869239] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 09:33:13,769 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 09:33:13,769 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-03 09:33:13,769 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1998825741] [2025-03-03 09:33:13,769 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 09:33:13,769 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-03 09:33:13,769 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 09:33:13,770 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-03 09:33:13,770 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 09:33:13,770 INFO L87 Difference]: Start difference. First operand 204 states and 268 transitions. Second operand has 3 states, 3 states have (on average 5.0) internal successors, (15), 3 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 09:33:13,781 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 09:33:13,781 INFO L93 Difference]: Finished difference Result 303 states and 399 transitions. [2025-03-03 09:33:13,781 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-03 09:33:13,781 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 5.0) internal successors, (15), 3 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 109 [2025-03-03 09:33:13,782 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 09:33:13,782 INFO L225 Difference]: With dead ends: 303 [2025-03-03 09:33:13,782 INFO L226 Difference]: Without dead ends: 115 [2025-03-03 09:33:13,783 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 09:33:13,783 INFO L435 NwaCegarLoop]: 25 mSDtfsCounter, 2 mSDsluCounter, 14 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 39 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 09:33:13,783 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 39 Invalid, 4 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-03 09:33:13,784 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 115 states. [2025-03-03 09:33:13,788 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 115 to 115. [2025-03-03 09:33:13,789 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 115 states, 114 states have (on average 1.043859649122807) internal successors, (119), 114 states have internal predecessors, (119), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 09:33:13,789 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 115 states to 115 states and 119 transitions. [2025-03-03 09:33:13,789 INFO L78 Accepts]: Start accepts. Automaton has 115 states and 119 transitions. Word has length 109 [2025-03-03 09:33:13,789 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 09:33:13,789 INFO L471 AbstractCegarLoop]: Abstraction has 115 states and 119 transitions. [2025-03-03 09:33:13,789 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 5.0) internal successors, (15), 3 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 09:33:13,790 INFO L276 IsEmpty]: Start isEmpty. Operand 115 states and 119 transitions. [2025-03-03 09:33:13,790 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 113 [2025-03-03 09:33:13,790 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 09:33:13,790 INFO L218 NwaCegarLoop]: trace histogram [30, 30, 30, 10, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 09:33:13,790 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-03-03 09:33:13,790 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 09:33:13,791 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 09:33:13,791 INFO L85 PathProgramCache]: Analyzing trace with hash -1621171213, now seen corresponding path program 1 times [2025-03-03 09:33:13,791 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 09:33:13,791 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [180852013] [2025-03-03 09:33:13,791 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 09:33:13,791 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 09:33:13,800 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 112 statements into 1 equivalence classes. [2025-03-03 09:33:13,807 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 112 of 112 statements. [2025-03-03 09:33:13,807 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 09:33:13,807 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 09:33:13,847 INFO L134 CoverageAnalysis]: Checked inductivity of 1392 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 1390 trivial. 0 not checked. [2025-03-03 09:33:13,848 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 09:33:13,848 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [180852013] [2025-03-03 09:33:13,848 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [180852013] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 09:33:13,848 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 09:33:13,848 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-03 09:33:13,848 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [465601748] [2025-03-03 09:33:13,848 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 09:33:13,848 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-03 09:33:13,848 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 09:33:13,849 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-03 09:33:13,849 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 09:33:13,849 INFO L87 Difference]: Start difference. First operand 115 states and 119 transitions. Second operand has 3 states, 3 states have (on average 5.333333333333333) internal successors, (16), 3 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 09:33:13,861 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 09:33:13,861 INFO L93 Difference]: Finished difference Result 122 states and 127 transitions. [2025-03-03 09:33:13,861 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-03 09:33:13,862 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 5.333333333333333) internal successors, (16), 3 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 112 [2025-03-03 09:33:13,862 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 09:33:13,862 INFO L225 Difference]: With dead ends: 122 [2025-03-03 09:33:13,862 INFO L226 Difference]: Without dead ends: 115 [2025-03-03 09:33:13,862 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 09:33:13,863 INFO L435 NwaCegarLoop]: 15 mSDtfsCounter, 6 mSDsluCounter, 1 mSDsCounter, 0 mSdLazyCounter, 1 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6 SdHoareTripleChecker+Valid, 16 SdHoareTripleChecker+Invalid, 1 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 1 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-03 09:33:13,863 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [6 Valid, 16 Invalid, 1 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 1 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-03 09:33:13,864 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 115 states. [2025-03-03 09:33:13,869 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 115 to 115. [2025-03-03 09:33:13,869 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 115 states, 114 states have (on average 1.0263157894736843) internal successors, (117), 114 states have internal predecessors, (117), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 09:33:13,869 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 115 states to 115 states and 117 transitions. [2025-03-03 09:33:13,869 INFO L78 Accepts]: Start accepts. Automaton has 115 states and 117 transitions. Word has length 112 [2025-03-03 09:33:13,870 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 09:33:13,870 INFO L471 AbstractCegarLoop]: Abstraction has 115 states and 117 transitions. [2025-03-03 09:33:13,870 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 5.333333333333333) internal successors, (16), 3 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 09:33:13,870 INFO L276 IsEmpty]: Start isEmpty. Operand 115 states and 117 transitions. [2025-03-03 09:33:13,870 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 115 [2025-03-03 09:33:13,870 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 09:33:13,870 INFO L218 NwaCegarLoop]: trace histogram [30, 30, 30, 10, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 09:33:13,871 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-03-03 09:33:13,871 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 09:33:13,872 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 09:33:13,872 INFO L85 PathProgramCache]: Analyzing trace with hash -678489352, now seen corresponding path program 1 times [2025-03-03 09:33:13,872 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 09:33:13,872 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [792113782] [2025-03-03 09:33:13,872 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 09:33:13,872 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 09:33:13,882 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 114 statements into 1 equivalence classes. [2025-03-03 09:33:13,898 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 114 of 114 statements. [2025-03-03 09:33:13,899 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 09:33:13,899 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 09:33:14,149 INFO L134 CoverageAnalysis]: Checked inductivity of 1393 backedges. 0 proven. 55 refuted. 0 times theorem prover too weak. 1338 trivial. 0 not checked. [2025-03-03 09:33:14,149 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 09:33:14,149 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [792113782] [2025-03-03 09:33:14,149 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [792113782] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-03 09:33:14,149 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [188201237] [2025-03-03 09:33:14,150 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 09:33:14,150 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 09:33:14,150 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 09:33:14,151 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-03 09:33:14,153 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2025-03-03 09:33:14,201 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 114 statements into 1 equivalence classes. [2025-03-03 09:33:14,233 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 114 of 114 statements. [2025-03-03 09:33:14,234 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 09:33:14,234 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 09:33:14,235 INFO L256 TraceCheckSpWp]: Trace formula consists of 376 conjuncts, 14 conjuncts are in the unsatisfiable core [2025-03-03 09:33:14,237 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 09:33:14,411 INFO L134 CoverageAnalysis]: Checked inductivity of 1393 backedges. 0 proven. 55 refuted. 0 times theorem prover too weak. 1338 trivial. 0 not checked. [2025-03-03 09:33:14,412 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-03 09:33:14,701 INFO L134 CoverageAnalysis]: Checked inductivity of 1393 backedges. 0 proven. 55 refuted. 0 times theorem prover too weak. 1338 trivial. 0 not checked. [2025-03-03 09:33:14,701 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [188201237] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-03 09:33:14,701 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-03 09:33:14,701 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 13, 13] total 35 [2025-03-03 09:33:14,701 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1135557091] [2025-03-03 09:33:14,701 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-03 09:33:14,701 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 35 states [2025-03-03 09:33:14,701 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 09:33:14,702 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 35 interpolants. [2025-03-03 09:33:14,703 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=540, Invalid=650, Unknown=0, NotChecked=0, Total=1190 [2025-03-03 09:33:14,703 INFO L87 Difference]: Start difference. First operand 115 states and 117 transitions. Second operand has 35 states, 35 states have (on average 1.4) internal successors, (49), 35 states have internal predecessors, (49), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 09:33:14,735 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 09:33:14,735 INFO L93 Difference]: Finished difference Result 229 states and 244 transitions. [2025-03-03 09:33:14,735 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2025-03-03 09:33:14,736 INFO L78 Accepts]: Start accepts. Automaton has has 35 states, 35 states have (on average 1.4) internal successors, (49), 35 states have internal predecessors, (49), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 114 [2025-03-03 09:33:14,736 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 09:33:14,737 INFO L225 Difference]: With dead ends: 229 [2025-03-03 09:33:14,737 INFO L226 Difference]: Without dead ends: 127 [2025-03-03 09:33:14,738 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 239 GetRequests, 206 SyntacticMatches, 0 SemanticMatches, 33 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 45 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=540, Invalid=650, Unknown=0, NotChecked=0, Total=1190 [2025-03-03 09:33:14,739 INFO L435 NwaCegarLoop]: 15 mSDtfsCounter, 0 mSDsluCounter, 96 mSDsCounter, 0 mSdLazyCounter, 43 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 111 SdHoareTripleChecker+Invalid, 44 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 43 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-03 09:33:14,739 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 111 Invalid, 44 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 43 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-03 09:33:14,739 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 127 states. [2025-03-03 09:33:14,752 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 127 to 127. [2025-03-03 09:33:14,753 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 127 states, 126 states have (on average 1.0238095238095237) internal successors, (129), 126 states have internal predecessors, (129), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 09:33:14,754 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 127 states to 127 states and 129 transitions. [2025-03-03 09:33:14,755 INFO L78 Accepts]: Start accepts. Automaton has 127 states and 129 transitions. Word has length 114 [2025-03-03 09:33:14,755 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 09:33:14,755 INFO L471 AbstractCegarLoop]: Abstraction has 127 states and 129 transitions. [2025-03-03 09:33:14,755 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 35 states, 35 states have (on average 1.4) internal successors, (49), 35 states have internal predecessors, (49), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 09:33:14,755 INFO L276 IsEmpty]: Start isEmpty. Operand 127 states and 129 transitions. [2025-03-03 09:33:14,757 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 127 [2025-03-03 09:33:14,758 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 09:33:14,758 INFO L218 NwaCegarLoop]: trace histogram [30, 30, 30, 22, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 09:33:14,765 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Forceful destruction successful, exit code 0 [2025-03-03 09:33:14,959 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 09:33:14,959 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 09:33:14,959 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 09:33:14,959 INFO L85 PathProgramCache]: Analyzing trace with hash 329742648, now seen corresponding path program 2 times [2025-03-03 09:33:14,960 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 09:33:14,960 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1819417347] [2025-03-03 09:33:14,960 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-03 09:33:14,960 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 09:33:14,980 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 126 statements into 2 equivalence classes. [2025-03-03 09:33:14,998 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 126 of 126 statements. [2025-03-03 09:33:14,999 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-03 09:33:14,999 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 09:33:15,595 INFO L134 CoverageAnalysis]: Checked inductivity of 1591 backedges. 0 proven. 253 refuted. 0 times theorem prover too weak. 1338 trivial. 0 not checked. [2025-03-03 09:33:15,596 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 09:33:15,596 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1819417347] [2025-03-03 09:33:15,596 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1819417347] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-03 09:33:15,596 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1529647274] [2025-03-03 09:33:15,596 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-03 09:33:15,596 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 09:33:15,596 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 09:33:15,598 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-03 09:33:15,599 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2025-03-03 09:33:15,666 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 126 statements into 2 equivalence classes. [2025-03-03 09:33:15,707 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 126 of 126 statements. [2025-03-03 09:33:15,707 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-03 09:33:15,707 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 09:33:15,709 INFO L256 TraceCheckSpWp]: Trace formula consists of 484 conjuncts, 26 conjuncts are in the unsatisfiable core [2025-03-03 09:33:15,713 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 09:33:16,055 INFO L134 CoverageAnalysis]: Checked inductivity of 1591 backedges. 0 proven. 253 refuted. 0 times theorem prover too weak. 1338 trivial. 0 not checked. [2025-03-03 09:33:16,056 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-03 09:33:16,647 INFO L134 CoverageAnalysis]: Checked inductivity of 1591 backedges. 0 proven. 253 refuted. 0 times theorem prover too weak. 1338 trivial. 0 not checked. [2025-03-03 09:33:16,648 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1529647274] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-03 09:33:16,648 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-03 09:33:16,648 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [25, 25, 25] total 71 [2025-03-03 09:33:16,648 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [124996818] [2025-03-03 09:33:16,648 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-03 09:33:16,649 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 71 states [2025-03-03 09:33:16,649 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 09:33:16,649 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 71 interpolants. [2025-03-03 09:33:16,651 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=2254, Invalid=2716, Unknown=0, NotChecked=0, Total=4970 [2025-03-03 09:33:16,651 INFO L87 Difference]: Start difference. First operand 127 states and 129 transitions. Second operand has 71 states, 71 states have (on average 1.1971830985915493) internal successors, (85), 71 states have internal predecessors, (85), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 09:33:16,703 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 09:33:16,704 INFO L93 Difference]: Finished difference Result 253 states and 280 transitions. [2025-03-03 09:33:16,704 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 48 states. [2025-03-03 09:33:16,704 INFO L78 Accepts]: Start accepts. Automaton has has 71 states, 71 states have (on average 1.1971830985915493) internal successors, (85), 71 states have internal predecessors, (85), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 126 [2025-03-03 09:33:16,705 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 09:33:16,706 INFO L225 Difference]: With dead ends: 253 [2025-03-03 09:33:16,706 INFO L226 Difference]: Without dead ends: 151 [2025-03-03 09:33:16,708 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 275 GetRequests, 206 SyntacticMatches, 0 SemanticMatches, 69 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2045 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=2254, Invalid=2716, Unknown=0, NotChecked=0, Total=4970 [2025-03-03 09:33:16,708 INFO L435 NwaCegarLoop]: 15 mSDtfsCounter, 0 mSDsluCounter, 72 mSDsCounter, 0 mSdLazyCounter, 72 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 87 SdHoareTripleChecker+Invalid, 73 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 72 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-03 09:33:16,708 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 87 Invalid, 73 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 72 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-03 09:33:16,709 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 151 states. [2025-03-03 09:33:16,714 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 151 to 151. [2025-03-03 09:33:16,715 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 151 states, 150 states have (on average 1.02) internal successors, (153), 150 states have internal predecessors, (153), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 09:33:16,715 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 151 states to 151 states and 153 transitions. [2025-03-03 09:33:16,716 INFO L78 Accepts]: Start accepts. Automaton has 151 states and 153 transitions. Word has length 126 [2025-03-03 09:33:16,716 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 09:33:16,716 INFO L471 AbstractCegarLoop]: Abstraction has 151 states and 153 transitions. [2025-03-03 09:33:16,716 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 71 states, 71 states have (on average 1.1971830985915493) internal successors, (85), 71 states have internal predecessors, (85), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 09:33:16,716 INFO L276 IsEmpty]: Start isEmpty. Operand 151 states and 153 transitions. [2025-03-03 09:33:16,717 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 151 [2025-03-03 09:33:16,717 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 09:33:16,717 INFO L218 NwaCegarLoop]: trace histogram [46, 30, 30, 30, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 09:33:16,725 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Forceful destruction successful, exit code 0 [2025-03-03 09:33:16,917 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable11 [2025-03-03 09:33:16,918 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 09:33:16,918 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 09:33:16,918 INFO L85 PathProgramCache]: Analyzing trace with hash 2146575800, now seen corresponding path program 3 times [2025-03-03 09:33:16,918 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 09:33:16,918 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [992392367] [2025-03-03 09:33:16,918 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-03-03 09:33:16,918 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 09:33:16,938 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 150 statements into 31 equivalence classes. [2025-03-03 09:33:16,961 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 6 check-sat command(s) and asserted 39 of 150 statements. [2025-03-03 09:33:16,961 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 6 check-sat command(s) [2025-03-03 09:33:16,961 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 09:33:17,144 INFO L134 CoverageAnalysis]: Checked inductivity of 2419 backedges. 0 proven. 148 refuted. 0 times theorem prover too weak. 2271 trivial. 0 not checked. [2025-03-03 09:33:17,144 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 09:33:17,144 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [992392367] [2025-03-03 09:33:17,144 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [992392367] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-03 09:33:17,144 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1557783674] [2025-03-03 09:33:17,145 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-03-03 09:33:17,145 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 09:33:17,145 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 09:33:17,146 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-03 09:33:17,148 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2025-03-03 09:33:17,226 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 150 statements into 31 equivalence classes. [2025-03-03 09:33:17,265 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 6 check-sat command(s) and asserted 39 of 150 statements. [2025-03-03 09:33:17,265 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 6 check-sat command(s) [2025-03-03 09:33:17,265 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 09:33:17,267 INFO L256 TraceCheckSpWp]: Trace formula consists of 201 conjuncts, 22 conjuncts are in the unsatisfiable core [2025-03-03 09:33:17,269 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 09:33:17,608 INFO L134 CoverageAnalysis]: Checked inductivity of 2419 backedges. 0 proven. 148 refuted. 0 times theorem prover too weak. 2271 trivial. 0 not checked. [2025-03-03 09:33:17,608 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-03 09:33:17,752 INFO L349 Elim1Store]: treesize reduction 5, result has 37.5 percent of original size [2025-03-03 09:33:17,752 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 22 treesize of output 11 [2025-03-03 09:33:17,762 INFO L134 CoverageAnalysis]: Checked inductivity of 2419 backedges. 28 proven. 120 refuted. 0 times theorem prover too weak. 2271 trivial. 0 not checked. [2025-03-03 09:33:17,762 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1557783674] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-03 09:33:17,762 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-03 09:33:17,762 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 10, 9] total 19 [2025-03-03 09:33:17,762 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [738528794] [2025-03-03 09:33:17,762 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-03 09:33:17,763 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2025-03-03 09:33:17,763 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 09:33:17,763 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2025-03-03 09:33:17,763 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=67, Invalid=275, Unknown=0, NotChecked=0, Total=342 [2025-03-03 09:33:17,763 INFO L87 Difference]: Start difference. First operand 151 states and 153 transitions. Second operand has 19 states, 19 states have (on average 2.736842105263158) internal successors, (52), 19 states have internal predecessors, (52), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 09:33:17,849 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 09:33:17,849 INFO L93 Difference]: Finished difference Result 160 states and 162 transitions. [2025-03-03 09:33:17,849 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-03-03 09:33:17,849 INFO L78 Accepts]: Start accepts. Automaton has has 19 states, 19 states have (on average 2.736842105263158) internal successors, (52), 19 states have internal predecessors, (52), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 150 [2025-03-03 09:33:17,850 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 09:33:17,850 INFO L225 Difference]: With dead ends: 160 [2025-03-03 09:33:17,850 INFO L226 Difference]: Without dead ends: 158 [2025-03-03 09:33:17,851 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 309 GetRequests, 290 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 59 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=87, Invalid=333, Unknown=0, NotChecked=0, Total=420 [2025-03-03 09:33:17,851 INFO L435 NwaCegarLoop]: 13 mSDtfsCounter, 15 mSDsluCounter, 84 mSDsCounter, 0 mSdLazyCounter, 145 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 15 SdHoareTripleChecker+Valid, 97 SdHoareTripleChecker+Invalid, 147 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 145 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-03 09:33:17,851 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [15 Valid, 97 Invalid, 147 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 145 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-03 09:33:17,852 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 158 states. [2025-03-03 09:33:17,861 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 158 to 156. [2025-03-03 09:33:17,862 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 156 states, 155 states have (on average 1.0193548387096774) internal successors, (158), 155 states have internal predecessors, (158), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 09:33:17,862 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 156 states to 156 states and 158 transitions. [2025-03-03 09:33:17,863 INFO L78 Accepts]: Start accepts. Automaton has 156 states and 158 transitions. Word has length 150 [2025-03-03 09:33:17,863 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 09:33:17,863 INFO L471 AbstractCegarLoop]: Abstraction has 156 states and 158 transitions. [2025-03-03 09:33:17,863 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 19 states, 19 states have (on average 2.736842105263158) internal successors, (52), 19 states have internal predecessors, (52), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 09:33:17,863 INFO L276 IsEmpty]: Start isEmpty. Operand 156 states and 158 transitions. [2025-03-03 09:33:17,864 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 156 [2025-03-03 09:33:17,864 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 09:33:17,864 INFO L218 NwaCegarLoop]: trace histogram [46, 30, 30, 30, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 09:33:17,870 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Forceful destruction successful, exit code 0 [2025-03-03 09:33:18,064 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable12 [2025-03-03 09:33:18,064 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 09:33:18,065 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 09:33:18,065 INFO L85 PathProgramCache]: Analyzing trace with hash 911421516, now seen corresponding path program 4 times [2025-03-03 09:33:18,065 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 09:33:18,065 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1881060102] [2025-03-03 09:33:18,065 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-03-03 09:33:18,065 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 09:33:18,087 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 155 statements into 2 equivalence classes. [2025-03-03 09:33:18,110 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 155 of 155 statements. [2025-03-03 09:33:18,110 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-03-03 09:33:18,110 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 09:33:18,971 INFO L134 CoverageAnalysis]: Checked inductivity of 2427 backedges. 0 proven. 1337 refuted. 0 times theorem prover too weak. 1090 trivial. 0 not checked. [2025-03-03 09:33:18,972 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 09:33:18,972 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1881060102] [2025-03-03 09:33:18,972 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1881060102] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-03 09:33:18,972 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1092464651] [2025-03-03 09:33:18,972 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-03-03 09:33:18,972 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 09:33:18,972 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 09:33:18,974 INFO L229 MonitoredProcess]: Starting monitored process 11 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-03 09:33:18,975 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Waiting until timeout for monitored process [2025-03-03 09:33:19,063 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 155 statements into 2 equivalence classes. [2025-03-03 09:33:19,121 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 155 of 155 statements. [2025-03-03 09:33:19,121 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-03-03 09:33:19,121 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 09:33:19,128 INFO L256 TraceCheckSpWp]: Trace formula consists of 713 conjuncts, 32 conjuncts are in the unsatisfiable core [2025-03-03 09:33:19,131 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 09:33:19,226 INFO L134 CoverageAnalysis]: Checked inductivity of 2427 backedges. 0 proven. 1335 refuted. 0 times theorem prover too weak. 1092 trivial. 0 not checked. [2025-03-03 09:33:19,226 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-03 09:33:20,189 INFO L134 CoverageAnalysis]: Checked inductivity of 2427 backedges. 0 proven. 1335 refuted. 0 times theorem prover too weak. 1092 trivial. 0 not checked. [2025-03-03 09:33:20,189 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1092464651] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-03 09:33:20,189 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-03 09:33:20,189 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [34, 33, 33] total 66 [2025-03-03 09:33:20,189 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1478824247] [2025-03-03 09:33:20,190 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-03 09:33:20,190 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 66 states [2025-03-03 09:33:20,190 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 09:33:20,191 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 66 interpolants. [2025-03-03 09:33:20,192 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=2082, Invalid=2208, Unknown=0, NotChecked=0, Total=4290 [2025-03-03 09:33:20,193 INFO L87 Difference]: Start difference. First operand 156 states and 158 transitions. Second operand has 66 states, 66 states have (on average 3.0454545454545454) internal successors, (201), 66 states have internal predecessors, (201), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 09:33:20,969 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 09:33:20,969 INFO L93 Difference]: Finished difference Result 683 states and 717 transitions. [2025-03-03 09:33:20,969 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 64 states. [2025-03-03 09:33:20,970 INFO L78 Accepts]: Start accepts. Automaton has has 66 states, 66 states have (on average 3.0454545454545454) internal successors, (201), 66 states have internal predecessors, (201), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 155 [2025-03-03 09:33:20,970 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 09:33:20,972 INFO L225 Difference]: With dead ends: 683 [2025-03-03 09:33:20,972 INFO L226 Difference]: Without dead ends: 668 [2025-03-03 09:33:20,972 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 343 GetRequests, 279 SyntacticMatches, 0 SemanticMatches, 64 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 150 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=2082, Invalid=2208, Unknown=0, NotChecked=0, Total=4290 [2025-03-03 09:33:20,973 INFO L435 NwaCegarLoop]: 11 mSDtfsCounter, 1294 mSDsluCounter, 328 mSDsCounter, 0 mSdLazyCounter, 329 mSolverCounterSat, 221 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1294 SdHoareTripleChecker+Valid, 339 SdHoareTripleChecker+Invalid, 550 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 221 IncrementalHoareTripleChecker+Valid, 329 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-03-03 09:33:20,973 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1294 Valid, 339 Invalid, 550 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [221 Valid, 329 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-03 09:33:20,973 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 668 states. [2025-03-03 09:33:20,982 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 668 to 252. [2025-03-03 09:33:20,982 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 252 states, 251 states have (on average 1.0119521912350598) internal successors, (254), 251 states have internal predecessors, (254), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 09:33:20,983 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 252 states to 252 states and 254 transitions. [2025-03-03 09:33:20,983 INFO L78 Accepts]: Start accepts. Automaton has 252 states and 254 transitions. Word has length 155 [2025-03-03 09:33:20,983 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 09:33:20,983 INFO L471 AbstractCegarLoop]: Abstraction has 252 states and 254 transitions. [2025-03-03 09:33:20,983 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 66 states, 66 states have (on average 3.0454545454545454) internal successors, (201), 66 states have internal predecessors, (201), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 09:33:20,983 INFO L276 IsEmpty]: Start isEmpty. Operand 252 states and 254 transitions. [2025-03-03 09:33:20,985 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 252 [2025-03-03 09:33:20,985 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 09:33:20,985 INFO L218 NwaCegarLoop]: trace histogram [62, 62, 62, 46, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 09:33:20,992 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Forceful destruction successful, exit code 0 [2025-03-03 09:33:21,185 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable13 [2025-03-03 09:33:21,185 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 09:33:21,186 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 09:33:21,186 INFO L85 PathProgramCache]: Analyzing trace with hash 76807756, now seen corresponding path program 5 times [2025-03-03 09:33:21,186 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 09:33:21,186 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [945614652] [2025-03-03 09:33:21,186 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-03-03 09:33:21,186 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 09:33:21,212 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 251 statements into 63 equivalence classes. [2025-03-03 09:33:21,439 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 63 check-sat command(s) and asserted 251 of 251 statements. [2025-03-03 09:33:21,440 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 63 check-sat command(s) [2025-03-03 09:33:21,440 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 09:33:23,549 INFO L134 CoverageAnalysis]: Checked inductivity of 6827 backedges. 0 proven. 5735 refuted. 0 times theorem prover too weak. 1092 trivial. 0 not checked. [2025-03-03 09:33:23,549 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 09:33:23,549 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [945614652] [2025-03-03 09:33:23,549 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [945614652] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-03 09:33:23,549 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [338239739] [2025-03-03 09:33:23,549 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-03-03 09:33:23,549 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 09:33:23,550 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 09:33:23,551 INFO L229 MonitoredProcess]: Starting monitored process 12 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-03 09:33:23,552 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Waiting until timeout for monitored process [2025-03-03 09:33:23,648 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 251 statements into 63 equivalence classes. [2025-03-03 09:33:41,450 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 63 check-sat command(s) and asserted 251 of 251 statements. [2025-03-03 09:33:41,451 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 63 check-sat command(s) [2025-03-03 09:33:41,451 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 09:33:41,469 INFO L256 TraceCheckSpWp]: Trace formula consists of 937 conjuncts, 64 conjuncts are in the unsatisfiable core [2025-03-03 09:33:41,472 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 09:33:41,645 INFO L134 CoverageAnalysis]: Checked inductivity of 6827 backedges. 0 proven. 5735 refuted. 0 times theorem prover too weak. 1092 trivial. 0 not checked. [2025-03-03 09:33:41,645 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-03 09:33:44,722 INFO L134 CoverageAnalysis]: Checked inductivity of 6827 backedges. 0 proven. 5735 refuted. 0 times theorem prover too weak. 1092 trivial. 0 not checked. [2025-03-03 09:33:44,722 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [338239739] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-03 09:33:44,722 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-03 09:33:44,722 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [65, 65, 65] total 128 [2025-03-03 09:33:44,722 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2066313837] [2025-03-03 09:33:44,722 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-03 09:33:44,723 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 128 states [2025-03-03 09:33:44,723 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 09:33:44,724 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 128 interpolants. [2025-03-03 09:33:44,727 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8128, Invalid=8128, Unknown=0, NotChecked=0, Total=16256 [2025-03-03 09:33:44,727 INFO L87 Difference]: Start difference. First operand 252 states and 254 transitions. Second operand has 128 states, 128 states have (on average 3.0234375) internal successors, (387), 128 states have internal predecessors, (387), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 09:33:50,338 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 09:33:50,339 INFO L93 Difference]: Finished difference Result 1323 states and 1389 transitions. [2025-03-03 09:33:50,339 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 128 states. [2025-03-03 09:33:50,339 INFO L78 Accepts]: Start accepts. Automaton has has 128 states, 128 states have (on average 3.0234375) internal successors, (387), 128 states have internal predecessors, (387), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 251 [2025-03-03 09:33:50,340 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 09:33:50,343 INFO L225 Difference]: With dead ends: 1323 [2025-03-03 09:33:50,343 INFO L226 Difference]: Without dead ends: 1308 [2025-03-03 09:33:50,345 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 565 GetRequests, 439 SyntacticMatches, 0 SemanticMatches, 126 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 4.0s TimeCoverageRelationStatistics Valid=8128, Invalid=8128, Unknown=0, NotChecked=0, Total=16256 [2025-03-03 09:33:50,346 INFO L435 NwaCegarLoop]: 11 mSDtfsCounter, 3712 mSDsluCounter, 638 mSDsCounter, 0 mSdLazyCounter, 637 mSolverCounterSat, 622 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3712 SdHoareTripleChecker+Valid, 649 SdHoareTripleChecker+Invalid, 1259 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 622 IncrementalHoareTripleChecker+Valid, 637 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-03-03 09:33:50,346 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [3712 Valid, 649 Invalid, 1259 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [622 Valid, 637 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-03-03 09:33:50,347 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1308 states. [2025-03-03 09:33:50,362 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1308 to 444. [2025-03-03 09:33:50,363 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 444 states, 443 states have (on average 1.0067720090293453) internal successors, (446), 443 states have internal predecessors, (446), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 09:33:50,363 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 444 states to 444 states and 446 transitions. [2025-03-03 09:33:50,364 INFO L78 Accepts]: Start accepts. Automaton has 444 states and 446 transitions. Word has length 251 [2025-03-03 09:33:50,364 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 09:33:50,364 INFO L471 AbstractCegarLoop]: Abstraction has 444 states and 446 transitions. [2025-03-03 09:33:50,365 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 128 states, 128 states have (on average 3.0234375) internal successors, (387), 128 states have internal predecessors, (387), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 09:33:50,365 INFO L276 IsEmpty]: Start isEmpty. Operand 444 states and 446 transitions. [2025-03-03 09:33:50,368 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 444 [2025-03-03 09:33:50,368 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 09:33:50,368 INFO L218 NwaCegarLoop]: trace histogram [126, 126, 126, 46, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 09:33:50,386 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Ended with exit code 0 [2025-03-03 09:33:50,568 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable14 [2025-03-03 09:33:50,569 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 09:33:50,569 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 09:33:50,569 INFO L85 PathProgramCache]: Analyzing trace with hash -996304308, now seen corresponding path program 6 times [2025-03-03 09:33:50,569 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 09:33:50,569 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [547332795] [2025-03-03 09:33:50,569 INFO L95 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2025-03-03 09:33:50,570 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 09:33:50,598 INFO L108 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE partitioned 443 statements into 127 equivalence classes. [2025-03-03 09:33:50,632 INFO L111 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 17 check-sat command(s) and asserted 83 of 443 statements. [2025-03-03 09:33:50,632 INFO L114 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 17 check-sat command(s) [2025-03-03 09:33:50,632 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 09:33:50,858 INFO L134 CoverageAnalysis]: Checked inductivity of 24843 backedges. 0 proven. 1007 refuted. 0 times theorem prover too weak. 23836 trivial. 0 not checked. [2025-03-03 09:33:50,858 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 09:33:50,858 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [547332795] [2025-03-03 09:33:50,858 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [547332795] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-03 09:33:50,858 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [522487128] [2025-03-03 09:33:50,858 INFO L95 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2025-03-03 09:33:50,859 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 09:33:50,859 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 09:33:50,862 INFO L229 MonitoredProcess]: Starting monitored process 13 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-03 09:33:50,864 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Waiting until timeout for monitored process [2025-03-03 09:33:50,993 INFO L108 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE partitioned 443 statements into 127 equivalence classes. [2025-03-03 09:33:51,294 INFO L111 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 17 check-sat command(s) and asserted 83 of 443 statements. [2025-03-03 09:33:51,294 INFO L114 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 17 check-sat command(s) [2025-03-03 09:33:51,294 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 09:33:51,297 INFO L256 TraceCheckSpWp]: Trace formula consists of 345 conjuncts, 26 conjuncts are in the unsatisfiable core [2025-03-03 09:33:51,301 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 09:33:52,145 INFO L134 CoverageAnalysis]: Checked inductivity of 24843 backedges. 0 proven. 1007 refuted. 0 times theorem prover too weak. 23836 trivial. 0 not checked. [2025-03-03 09:33:52,145 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-03 09:33:52,537 INFO L349 Elim1Store]: treesize reduction 5, result has 37.5 percent of original size [2025-03-03 09:33:52,537 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 22 treesize of output 11 [2025-03-03 09:33:52,548 INFO L134 CoverageAnalysis]: Checked inductivity of 24843 backedges. 123 proven. 884 refuted. 0 times theorem prover too weak. 23836 trivial. 0 not checked. [2025-03-03 09:33:52,548 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [522487128] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-03 09:33:52,548 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-03 09:33:52,548 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 12, 11] total 23 [2025-03-03 09:33:52,548 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [386127235] [2025-03-03 09:33:52,548 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-03 09:33:52,549 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 23 states [2025-03-03 09:33:52,549 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 09:33:52,549 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2025-03-03 09:33:52,549 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=84, Invalid=422, Unknown=0, NotChecked=0, Total=506 [2025-03-03 09:33:52,549 INFO L87 Difference]: Start difference. First operand 444 states and 446 transitions. Second operand has 23 states, 23 states have (on average 2.9565217391304346) internal successors, (68), 23 states have internal predecessors, (68), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 09:33:52,677 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 09:33:52,677 INFO L93 Difference]: Finished difference Result 453 states and 455 transitions. [2025-03-03 09:33:52,677 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2025-03-03 09:33:52,677 INFO L78 Accepts]: Start accepts. Automaton has has 23 states, 23 states have (on average 2.9565217391304346) internal successors, (68), 23 states have internal predecessors, (68), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 443 [2025-03-03 09:33:52,679 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 09:33:52,680 INFO L225 Difference]: With dead ends: 453 [2025-03-03 09:33:52,680 INFO L226 Difference]: Without dead ends: 451 [2025-03-03 09:33:52,681 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 897 GetRequests, 874 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 84 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=104, Invalid=496, Unknown=0, NotChecked=0, Total=600 [2025-03-03 09:33:52,681 INFO L435 NwaCegarLoop]: 16 mSDtfsCounter, 28 mSDsluCounter, 140 mSDsCounter, 0 mSdLazyCounter, 255 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 28 SdHoareTripleChecker+Valid, 156 SdHoareTripleChecker+Invalid, 256 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 255 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-03 09:33:52,681 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [28 Valid, 156 Invalid, 256 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 255 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-03 09:33:52,682 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 451 states. [2025-03-03 09:33:52,702 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 451 to 449. [2025-03-03 09:33:52,702 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 449 states, 448 states have (on average 1.0066964285714286) internal successors, (451), 448 states have internal predecessors, (451), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 09:33:52,703 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 449 states to 449 states and 451 transitions. [2025-03-03 09:33:52,704 INFO L78 Accepts]: Start accepts. Automaton has 449 states and 451 transitions. Word has length 443 [2025-03-03 09:33:52,705 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 09:33:52,705 INFO L471 AbstractCegarLoop]: Abstraction has 449 states and 451 transitions. [2025-03-03 09:33:52,705 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 23 states, 23 states have (on average 2.9565217391304346) internal successors, (68), 23 states have internal predecessors, (68), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 09:33:52,705 INFO L276 IsEmpty]: Start isEmpty. Operand 449 states and 451 transitions. [2025-03-03 09:33:52,710 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 449 [2025-03-03 09:33:52,710 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 09:33:52,710 INFO L218 NwaCegarLoop]: trace histogram [126, 126, 126, 46, 4, 4, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 09:33:52,717 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Ended with exit code 0 [2025-03-03 09:33:52,911 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 13 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable15 [2025-03-03 09:33:52,914 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 09:33:52,914 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 09:33:52,914 INFO L85 PathProgramCache]: Analyzing trace with hash 322795576, now seen corresponding path program 7 times [2025-03-03 09:33:52,914 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 09:33:52,914 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1299148716] [2025-03-03 09:33:52,914 INFO L95 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2025-03-03 09:33:52,914 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 09:33:52,940 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 448 statements into 1 equivalence classes. [2025-03-03 09:33:52,992 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 448 of 448 statements. [2025-03-03 09:33:52,992 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 09:33:52,992 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 09:33:59,779 INFO L134 CoverageAnalysis]: Checked inductivity of 24856 backedges. 0 proven. 23751 refuted. 0 times theorem prover too weak. 1105 trivial. 0 not checked. [2025-03-03 09:33:59,779 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 09:33:59,779 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1299148716] [2025-03-03 09:33:59,779 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1299148716] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-03 09:33:59,779 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [88729204] [2025-03-03 09:33:59,779 INFO L95 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2025-03-03 09:33:59,779 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 09:33:59,779 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 09:33:59,781 INFO L229 MonitoredProcess]: Starting monitored process 14 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-03 09:33:59,782 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Waiting until timeout for monitored process [2025-03-03 09:33:59,908 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 448 statements into 1 equivalence classes. [2025-03-03 09:34:00,005 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 448 of 448 statements. [2025-03-03 09:34:00,005 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 09:34:00,005 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 09:34:00,010 INFO L256 TraceCheckSpWp]: Trace formula consists of 1398 conjuncts, 50 conjuncts are in the unsatisfiable core [2025-03-03 09:34:00,014 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 09:34:02,356 INFO L134 CoverageAnalysis]: Checked inductivity of 24856 backedges. 0 proven. 1081 refuted. 0 times theorem prover too weak. 23775 trivial. 0 not checked. [2025-03-03 09:34:02,357 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-03 09:34:05,868 INFO L134 CoverageAnalysis]: Checked inductivity of 24856 backedges. 0 proven. 1081 refuted. 0 times theorem prover too weak. 23775 trivial. 0 not checked. [2025-03-03 09:34:05,868 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [88729204] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-03 09:34:05,868 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-03 09:34:05,869 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [129, 49, 49] total 223 [2025-03-03 09:34:05,869 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2093972920] [2025-03-03 09:34:05,869 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-03 09:34:05,869 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 223 states [2025-03-03 09:34:05,869 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 09:34:05,872 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 223 interpolants. [2025-03-03 09:34:05,876 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=12815, Invalid=36691, Unknown=0, NotChecked=0, Total=49506 [2025-03-03 09:34:05,877 INFO L87 Difference]: Start difference. First operand 449 states and 451 transitions. Second operand has 223 states, 223 states have (on average 2.2062780269058297) internal successors, (492), 223 states have internal predecessors, (492), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 09:34:12,386 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 09:34:12,386 INFO L93 Difference]: Finished difference Result 1772 states and 1824 transitions. [2025-03-03 09:34:12,386 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 223 states. [2025-03-03 09:34:12,387 INFO L78 Accepts]: Start accepts. Automaton has has 223 states, 223 states have (on average 2.2062780269058297) internal successors, (492), 223 states have internal predecessors, (492), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 448 [2025-03-03 09:34:12,387 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 09:34:12,390 INFO L225 Difference]: With dead ends: 1772 [2025-03-03 09:34:12,390 INFO L226 Difference]: Without dead ends: 1372 [2025-03-03 09:34:12,392 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 1023 GetRequests, 802 SyntacticMatches, 0 SemanticMatches, 221 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11844 ImplicationChecksByTransitivity, 9.6s TimeCoverageRelationStatistics Valid=12815, Invalid=36691, Unknown=0, NotChecked=0, Total=49506 [2025-03-03 09:34:12,393 INFO L435 NwaCegarLoop]: 10 mSDtfsCounter, 3878 mSDsluCounter, 706 mSDsCounter, 0 mSdLazyCounter, 806 mSolverCounterSat, 651 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3878 SdHoareTripleChecker+Valid, 716 SdHoareTripleChecker+Invalid, 1457 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 651 IncrementalHoareTripleChecker+Valid, 806 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2025-03-03 09:34:12,393 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [3878 Valid, 716 Invalid, 1457 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [651 Valid, 806 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2025-03-03 09:34:12,394 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1372 states. [2025-03-03 09:34:12,416 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1372 to 500. [2025-03-03 09:34:12,417 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 500 states, 499 states have (on average 1.006012024048096) internal successors, (502), 499 states have internal predecessors, (502), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 09:34:12,418 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 500 states to 500 states and 502 transitions. [2025-03-03 09:34:12,418 INFO L78 Accepts]: Start accepts. Automaton has 500 states and 502 transitions. Word has length 448 [2025-03-03 09:34:12,418 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 09:34:12,418 INFO L471 AbstractCegarLoop]: Abstraction has 500 states and 502 transitions. [2025-03-03 09:34:12,419 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 223 states, 223 states have (on average 2.2062780269058297) internal successors, (492), 223 states have internal predecessors, (492), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 09:34:12,419 INFO L276 IsEmpty]: Start isEmpty. Operand 500 states and 502 transitions. [2025-03-03 09:34:12,420 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 500 [2025-03-03 09:34:12,420 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 09:34:12,420 INFO L218 NwaCegarLoop]: trace histogram [127, 127, 127, 94, 4, 4, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 09:34:12,428 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Ended with exit code 0 [2025-03-03 09:34:12,621 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 14 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable16 [2025-03-03 09:34:12,621 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 09:34:12,621 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 09:34:12,621 INFO L85 PathProgramCache]: Analyzing trace with hash 902920139, now seen corresponding path program 8 times [2025-03-03 09:34:12,622 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 09:34:12,622 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [977568227] [2025-03-03 09:34:12,622 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-03 09:34:12,622 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 09:34:12,659 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 499 statements into 2 equivalence classes. [2025-03-03 09:34:12,708 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 499 of 499 statements. [2025-03-03 09:34:12,708 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-03 09:34:12,708 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 09:34:17,623 INFO L134 CoverageAnalysis]: Checked inductivity of 28619 backedges. 0 proven. 4465 refuted. 0 times theorem prover too weak. 24154 trivial. 0 not checked. [2025-03-03 09:34:17,623 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 09:34:17,623 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [977568227] [2025-03-03 09:34:17,623 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [977568227] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-03 09:34:17,623 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2113407164] [2025-03-03 09:34:17,623 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-03 09:34:17,623 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 09:34:17,623 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 09:34:17,626 INFO L229 MonitoredProcess]: Starting monitored process 15 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-03 09:34:17,626 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Waiting until timeout for monitored process [2025-03-03 09:34:17,783 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 499 statements into 2 equivalence classes. [2025-03-03 09:34:17,904 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 499 of 499 statements. [2025-03-03 09:34:17,904 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-03 09:34:17,904 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 09:34:17,911 INFO L256 TraceCheckSpWp]: Trace formula consists of 1837 conjuncts, 98 conjuncts are in the unsatisfiable core [2025-03-03 09:34:17,916 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 09:34:20,791 INFO L134 CoverageAnalysis]: Checked inductivity of 28619 backedges. 0 proven. 4465 refuted. 0 times theorem prover too weak. 24154 trivial. 0 not checked. [2025-03-03 09:34:20,791 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-03 09:34:28,395 INFO L134 CoverageAnalysis]: Checked inductivity of 28619 backedges. 0 proven. 4465 refuted. 0 times theorem prover too weak. 24154 trivial. 0 not checked. [2025-03-03 09:34:28,395 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2113407164] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-03 09:34:28,395 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-03 09:34:28,395 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [97, 97, 97] total 287 [2025-03-03 09:34:28,395 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [888845227] [2025-03-03 09:34:28,395 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-03 09:34:28,396 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 287 states [2025-03-03 09:34:28,396 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 09:34:28,403 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 287 interpolants. [2025-03-03 09:34:28,407 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=36670, Invalid=45412, Unknown=0, NotChecked=0, Total=82082 [2025-03-03 09:34:28,408 INFO L87 Difference]: Start difference. First operand 500 states and 502 transitions. Second operand has 287 states, 287 states have (on average 1.048780487804878) internal successors, (301), 287 states have internal predecessors, (301), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 09:34:28,791 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 09:34:28,791 INFO L93 Difference]: Finished difference Result 999 states and 1098 transitions. [2025-03-03 09:34:28,791 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 192 states. [2025-03-03 09:34:28,792 INFO L78 Accepts]: Start accepts. Automaton has has 287 states, 287 states have (on average 1.048780487804878) internal successors, (301), 287 states have internal predecessors, (301), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 499 [2025-03-03 09:34:28,792 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 09:34:28,793 INFO L225 Difference]: With dead ends: 999 [2025-03-03 09:34:28,793 INFO L226 Difference]: Without dead ends: 596 [2025-03-03 09:34:28,797 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 1093 GetRequests, 808 SyntacticMatches, 0 SemanticMatches, 285 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 35813 ImplicationChecksByTransitivity, 12.6s TimeCoverageRelationStatistics Valid=36670, Invalid=45412, Unknown=0, NotChecked=0, Total=82082 [2025-03-03 09:34:28,798 INFO L435 NwaCegarLoop]: 15 mSDtfsCounter, 0 mSDsluCounter, 120 mSDsCounter, 0 mSdLazyCounter, 256 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 135 SdHoareTripleChecker+Invalid, 257 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 256 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-03 09:34:28,798 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 135 Invalid, 257 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 256 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-03 09:34:28,798 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 596 states. [2025-03-03 09:34:28,817 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 596 to 596. [2025-03-03 09:34:28,818 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 596 states, 595 states have (on average 1.0050420168067227) internal successors, (598), 595 states have internal predecessors, (598), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 09:34:28,819 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 596 states to 596 states and 598 transitions. [2025-03-03 09:34:28,820 INFO L78 Accepts]: Start accepts. Automaton has 596 states and 598 transitions. Word has length 499 [2025-03-03 09:34:28,820 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 09:34:28,820 INFO L471 AbstractCegarLoop]: Abstraction has 596 states and 598 transitions. [2025-03-03 09:34:28,820 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 287 states, 287 states have (on average 1.048780487804878) internal successors, (301), 287 states have internal predecessors, (301), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 09:34:28,820 INFO L276 IsEmpty]: Start isEmpty. Operand 596 states and 598 transitions. [2025-03-03 09:34:28,822 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 596 [2025-03-03 09:34:28,823 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 09:34:28,823 INFO L218 NwaCegarLoop]: trace histogram [190, 127, 127, 127, 4, 4, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 09:34:28,831 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Ended with exit code 0 [2025-03-03 09:34:29,023 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17,15 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 09:34:29,023 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 09:34:29,024 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 09:34:29,024 INFO L85 PathProgramCache]: Analyzing trace with hash 1171457483, now seen corresponding path program 9 times [2025-03-03 09:34:29,024 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 09:34:29,024 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [169031889] [2025-03-03 09:34:29,024 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-03-03 09:34:29,024 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 09:34:29,081 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 595 statements into 128 equivalence classes. [2025-03-03 09:34:29,110 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 12 check-sat command(s) and asserted 79 of 595 statements. [2025-03-03 09:34:29,110 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 12 check-sat command(s) [2025-03-03 09:34:29,110 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 09:34:29,328 INFO L134 CoverageAnalysis]: Checked inductivity of 42299 backedges. 0 proven. 1399 refuted. 0 times theorem prover too weak. 40900 trivial. 0 not checked. [2025-03-03 09:34:29,328 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 09:34:29,328 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [169031889] [2025-03-03 09:34:29,328 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [169031889] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-03 09:34:29,328 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1666658414] [2025-03-03 09:34:29,328 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-03-03 09:34:29,328 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 09:34:29,328 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 09:34:29,330 INFO L229 MonitoredProcess]: Starting monitored process 16 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-03 09:34:29,332 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (16)] Waiting until timeout for monitored process [2025-03-03 09:34:29,585 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 595 statements into 128 equivalence classes. [2025-03-03 09:34:30,906 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 12 check-sat command(s) and asserted 79 of 595 statements. [2025-03-03 09:34:30,906 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 12 check-sat command(s) [2025-03-03 09:34:30,906 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 09:34:30,910 INFO L256 TraceCheckSpWp]: Trace formula consists of 377 conjuncts, 49 conjuncts are in the unsatisfiable core [2025-03-03 09:34:30,916 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 09:34:32,431 INFO L134 CoverageAnalysis]: Checked inductivity of 42299 backedges. 0 proven. 1589 refuted. 0 times theorem prover too weak. 40710 trivial. 0 not checked. [2025-03-03 09:34:32,431 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-03 09:34:33,444 INFO L349 Elim1Store]: treesize reduction 28, result has 20.0 percent of original size [2025-03-03 09:34:33,444 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 45 treesize of output 22 [2025-03-03 09:34:33,492 INFO L134 CoverageAnalysis]: Checked inductivity of 42299 backedges. 866 proven. 533 refuted. 0 times theorem prover too weak. 40900 trivial. 0 not checked. [2025-03-03 09:34:33,492 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1666658414] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-03 09:34:33,492 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-03 09:34:33,492 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 18, 17] total 40 [2025-03-03 09:34:33,492 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1793120506] [2025-03-03 09:34:33,492 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-03 09:34:33,493 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 40 states [2025-03-03 09:34:33,493 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 09:34:33,493 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 40 interpolants. [2025-03-03 09:34:33,493 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=233, Invalid=1327, Unknown=0, NotChecked=0, Total=1560 [2025-03-03 09:34:33,493 INFO L87 Difference]: Start difference. First operand 596 states and 598 transitions. Second operand has 40 states, 40 states have (on average 2.525) internal successors, (101), 40 states have internal predecessors, (101), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 09:34:33,703 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 09:34:33,704 INFO L93 Difference]: Finished difference Result 605 states and 607 transitions. [2025-03-03 09:34:33,704 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2025-03-03 09:34:33,704 INFO L78 Accepts]: Start accepts. Automaton has has 40 states, 40 states have (on average 2.525) internal successors, (101), 40 states have internal predecessors, (101), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 595 [2025-03-03 09:34:33,705 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 09:34:33,706 INFO L225 Difference]: With dead ends: 605 [2025-03-03 09:34:33,706 INFO L226 Difference]: Without dead ends: 603 [2025-03-03 09:34:33,707 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 1203 GetRequests, 1163 SyntacticMatches, 0 SemanticMatches, 40 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 418 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=262, Invalid=1460, Unknown=0, NotChecked=0, Total=1722 [2025-03-03 09:34:33,707 INFO L435 NwaCegarLoop]: 16 mSDtfsCounter, 22 mSDsluCounter, 179 mSDsCounter, 0 mSdLazyCounter, 451 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 22 SdHoareTripleChecker+Valid, 195 SdHoareTripleChecker+Invalid, 452 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 451 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-03 09:34:33,707 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [22 Valid, 195 Invalid, 452 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 451 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-03 09:34:33,708 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 603 states. [2025-03-03 09:34:33,730 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 603 to 601. [2025-03-03 09:34:33,731 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 601 states, 600 states have (on average 1.005) internal successors, (603), 600 states have internal predecessors, (603), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 09:34:33,732 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 601 states to 601 states and 603 transitions. [2025-03-03 09:34:33,732 INFO L78 Accepts]: Start accepts. Automaton has 601 states and 603 transitions. Word has length 595 [2025-03-03 09:34:33,733 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 09:34:33,734 INFO L471 AbstractCegarLoop]: Abstraction has 601 states and 603 transitions. [2025-03-03 09:34:33,734 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 40 states, 40 states have (on average 2.525) internal successors, (101), 40 states have internal predecessors, (101), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 09:34:33,734 INFO L276 IsEmpty]: Start isEmpty. Operand 601 states and 603 transitions. [2025-03-03 09:34:33,736 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 601 [2025-03-03 09:34:33,736 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 09:34:33,736 INFO L218 NwaCegarLoop]: trace histogram [190, 127, 127, 127, 5, 5, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 09:34:33,745 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (16)] Forceful destruction successful, exit code 0 [2025-03-03 09:34:33,936 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18,16 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 09:34:33,938 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 09:34:33,938 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 09:34:33,938 INFO L85 PathProgramCache]: Analyzing trace with hash 2053792793, now seen corresponding path program 10 times [2025-03-03 09:34:33,939 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 09:34:33,939 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1768023564] [2025-03-03 09:34:33,939 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-03-03 09:34:33,939 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 09:34:33,996 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 600 statements into 2 equivalence classes. [2025-03-03 09:34:34,037 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 600 of 600 statements. [2025-03-03 09:34:34,037 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-03-03 09:34:34,037 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat