./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/eca-rers2012/Problem19_label38.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 8fc3dc66 Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/eca-rers2012/Problem19_label38.c -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash cf45ccd02a611bb9297bfb1cd355a12d9c6a10c7fde3ac90ab820bcc5d1ae5fb --- Real Ultimate output --- This is Ultimate 0.3.0-?-8fc3dc6-m [2025-03-16 15:31:03,172 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-16 15:31:03,225 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2025-03-16 15:31:03,228 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-16 15:31:03,229 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-16 15:31:03,248 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-16 15:31:03,248 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-16 15:31:03,248 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-16 15:31:03,249 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-16 15:31:03,249 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-16 15:31:03,249 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-16 15:31:03,249 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-16 15:31:03,249 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-16 15:31:03,249 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-16 15:31:03,249 INFO L153 SettingsManager]: * Use SBE=true [2025-03-16 15:31:03,249 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-16 15:31:03,250 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-16 15:31:03,250 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-16 15:31:03,250 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-16 15:31:03,250 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-16 15:31:03,250 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-16 15:31:03,250 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-16 15:31:03,250 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-16 15:31:03,250 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-16 15:31:03,250 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-16 15:31:03,250 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-16 15:31:03,250 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-16 15:31:03,251 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-16 15:31:03,251 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-16 15:31:03,251 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-16 15:31:03,251 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-16 15:31:03,251 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-16 15:31:03,251 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-16 15:31:03,251 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-16 15:31:03,251 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-16 15:31:03,251 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-16 15:31:03,251 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-16 15:31:03,252 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-16 15:31:03,252 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-16 15:31:03,252 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-16 15:31:03,252 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-16 15:31:03,252 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-16 15:31:03,252 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-16 15:31:03,252 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 -> cf45ccd02a611bb9297bfb1cd355a12d9c6a10c7fde3ac90ab820bcc5d1ae5fb [2025-03-16 15:31:03,508 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-16 15:31:03,516 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-16 15:31:03,518 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-16 15:31:03,519 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-16 15:31:03,520 INFO L274 PluginConnector]: CDTParser initialized [2025-03-16 15:31:03,520 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/eca-rers2012/Problem19_label38.c [2025-03-16 15:31:04,627 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/9fcff9975/975ac4f64c4c48f2970b889779d10a0f/FLAG78ec3201c [2025-03-16 15:31:05,190 INFO L384 CDTParser]: Found 1 translation units. [2025-03-16 15:31:05,191 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/eca-rers2012/Problem19_label38.c [2025-03-16 15:31:05,238 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/9fcff9975/975ac4f64c4c48f2970b889779d10a0f/FLAG78ec3201c [2025-03-16 15:31:05,253 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/9fcff9975/975ac4f64c4c48f2970b889779d10a0f [2025-03-16 15:31:05,256 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-16 15:31:05,257 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-16 15:31:05,258 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-16 15:31:05,258 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-16 15:31:05,261 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-16 15:31:05,262 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.03 03:31:05" (1/1) ... [2025-03-16 15:31:05,263 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@179209d7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 03:31:05, skipping insertion in model container [2025-03-16 15:31:05,263 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.03 03:31:05" (1/1) ... [2025-03-16 15:31:05,373 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-16 15:31:05,631 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/eca-rers2012/Problem19_label38.c[7658,7671] [2025-03-16 15:31:06,359 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-16 15:31:06,369 INFO L200 MainTranslator]: Completed pre-run [2025-03-16 15:31:06,385 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/eca-rers2012/Problem19_label38.c[7658,7671] [2025-03-16 15:31:06,809 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-16 15:31:06,834 INFO L204 MainTranslator]: Completed translation [2025-03-16 15:31:06,835 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 03:31:06 WrapperNode [2025-03-16 15:31:06,835 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-16 15:31:06,836 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-16 15:31:06,836 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-16 15:31:06,836 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-16 15:31:06,840 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 03:31:06" (1/1) ... [2025-03-16 15:31:06,896 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 03:31:06" (1/1) ... [2025-03-16 15:31:07,444 INFO L138 Inliner]: procedures = 19, calls = 13, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 9428 [2025-03-16 15:31:07,444 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-16 15:31:07,445 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-16 15:31:07,446 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-16 15:31:07,446 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-16 15:31:07,455 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 03:31:06" (1/1) ... [2025-03-16 15:31:07,456 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 03:31:06" (1/1) ... [2025-03-16 15:31:07,659 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 03:31:06" (1/1) ... [2025-03-16 15:31:07,950 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2025-03-16 15:31:07,950 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 03:31:06" (1/1) ... [2025-03-16 15:31:07,950 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 03:31:06" (1/1) ... [2025-03-16 15:31:08,141 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 03:31:06" (1/1) ... [2025-03-16 15:31:08,164 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 03:31:06" (1/1) ... [2025-03-16 15:31:08,248 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 03:31:06" (1/1) ... [2025-03-16 15:31:08,269 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 03:31:06" (1/1) ... [2025-03-16 15:31:08,336 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-16 15:31:08,338 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-16 15:31:08,339 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-16 15:31:08,339 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-16 15:31:08,339 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 03:31:06" (1/1) ... [2025-03-16 15:31:08,344 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-16 15:31:08,353 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-16 15:31:08,366 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-16 15:31:08,373 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-16 15:31:08,387 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-16 15:31:08,387 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-03-16 15:31:08,387 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-16 15:31:08,387 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-16 15:31:08,446 INFO L256 CfgBuilder]: Building ICFG [2025-03-16 15:31:08,448 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-16 15:31:14,368 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L6717: havoc calculate_output4_#t~ret14#1; [2025-03-16 15:31:14,368 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L3435: havoc calculate_output2_#t~ret12#1; [2025-03-16 15:31:14,368 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L1859: havoc calculate_output_#t~ret11#1; [2025-03-16 15:31:14,368 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L8350: havoc calculate_output5_#t~ret15#1; [2025-03-16 15:31:14,369 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L5079: havoc calculate_output3_#t~ret13#1; [2025-03-16 15:31:14,577 INFO L? ?]: Removed 1320 outVars from TransFormulas that were not future-live. [2025-03-16 15:31:14,577 INFO L307 CfgBuilder]: Performing block encoding [2025-03-16 15:31:14,621 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-16 15:31:14,621 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-16 15:31:14,621 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 16.03 03:31:14 BoogieIcfgContainer [2025-03-16 15:31:14,621 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-16 15:31:14,623 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-16 15:31:14,626 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-16 15:31:14,629 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-16 15:31:14,630 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 16.03 03:31:05" (1/3) ... [2025-03-16 15:31:14,630 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@abb805 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.03 03:31:14, skipping insertion in model container [2025-03-16 15:31:14,630 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 03:31:06" (2/3) ... [2025-03-16 15:31:14,630 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@abb805 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.03 03:31:14, skipping insertion in model container [2025-03-16 15:31:14,630 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 16.03 03:31:14" (3/3) ... [2025-03-16 15:31:14,631 INFO L128 eAbstractionObserver]: Analyzing ICFG Problem19_label38.c [2025-03-16 15:31:14,640 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-16 15:31:14,642 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG Problem19_label38.c that has 1 procedures, 1687 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-03-16 15:31:14,723 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-16 15:31:14,732 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;@32ae083c, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-16 15:31:14,733 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-03-16 15:31:14,740 INFO L276 IsEmpty]: Start isEmpty. Operand has 1687 states, 1685 states have (on average 1.9008902077151335) internal successors, (3203), 1686 states have internal predecessors, (3203), 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-16 15:31:14,745 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2025-03-16 15:31:14,745 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 15:31:14,746 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 15:31:14,746 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 15:31:14,750 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 15:31:14,750 INFO L85 PathProgramCache]: Analyzing trace with hash -307869340, now seen corresponding path program 1 times [2025-03-16 15:31:14,755 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 15:31:14,757 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1481749252] [2025-03-16 15:31:14,757 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 15:31:14,758 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 15:31:14,812 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 58 statements into 1 equivalence classes. [2025-03-16 15:31:14,829 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 58 of 58 statements. [2025-03-16 15:31:14,829 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 15:31:14,829 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 15:31:14,887 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-16 15:31:14,887 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 15:31:14,887 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1481749252] [2025-03-16 15:31:14,888 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1481749252] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 15:31:14,888 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 15:31:14,888 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-16 15:31:14,889 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1988894983] [2025-03-16 15:31:14,889 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 15:31:14,896 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-03-16 15:31:14,896 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 15:31:14,913 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-03-16 15:31:14,913 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-03-16 15:31:14,919 INFO L87 Difference]: Start difference. First operand has 1687 states, 1685 states have (on average 1.9008902077151335) internal successors, (3203), 1686 states have internal predecessors, (3203), 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 2 states, 2 states have (on average 29.0) internal successors, (58), 2 states have internal predecessors, (58), 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-16 15:31:15,013 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 15:31:15,014 INFO L93 Difference]: Finished difference Result 3373 states and 6405 transitions. [2025-03-16 15:31:15,015 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-03-16 15:31:15,016 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 29.0) internal successors, (58), 2 states have internal predecessors, (58), 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 58 [2025-03-16 15:31:15,016 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 15:31:15,033 INFO L225 Difference]: With dead ends: 3373 [2025-03-16 15:31:15,034 INFO L226 Difference]: Without dead ends: 1684 [2025-03-16 15:31:15,043 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-03-16 15:31:15,045 INFO L435 NwaCegarLoop]: 3141 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 0 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 3141 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-16 15:31:15,047 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 3141 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-16 15:31:15,060 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1684 states. [2025-03-16 15:31:15,128 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1684 to 1684. [2025-03-16 15:31:15,133 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1684 states, 1683 states have (on average 1.8645276292335116) internal successors, (3138), 1683 states have internal predecessors, (3138), 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-16 15:31:15,142 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1684 states to 1684 states and 3138 transitions. [2025-03-16 15:31:15,144 INFO L78 Accepts]: Start accepts. Automaton has 1684 states and 3138 transitions. Word has length 58 [2025-03-16 15:31:15,144 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 15:31:15,144 INFO L471 AbstractCegarLoop]: Abstraction has 1684 states and 3138 transitions. [2025-03-16 15:31:15,144 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 29.0) internal successors, (58), 2 states have internal predecessors, (58), 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-16 15:31:15,144 INFO L276 IsEmpty]: Start isEmpty. Operand 1684 states and 3138 transitions. [2025-03-16 15:31:15,145 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2025-03-16 15:31:15,145 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 15:31:15,145 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 15:31:15,145 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-03-16 15:31:15,145 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 15:31:15,146 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 15:31:15,146 INFO L85 PathProgramCache]: Analyzing trace with hash 1983457765, now seen corresponding path program 1 times [2025-03-16 15:31:15,146 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 15:31:15,146 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2078235658] [2025-03-16 15:31:15,146 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 15:31:15,147 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 15:31:15,156 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 58 statements into 1 equivalence classes. [2025-03-16 15:31:15,181 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 58 of 58 statements. [2025-03-16 15:31:15,181 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 15:31:15,181 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 15:31:15,475 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-16 15:31:15,477 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 15:31:15,477 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2078235658] [2025-03-16 15:31:15,477 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2078235658] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 15:31:15,477 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 15:31:15,477 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-16 15:31:15,477 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1971004746] [2025-03-16 15:31:15,478 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 15:31:15,478 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-16 15:31:15,479 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 15:31:15,480 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-16 15:31:15,480 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-16 15:31:15,481 INFO L87 Difference]: Start difference. First operand 1684 states and 3138 transitions. Second operand has 4 states, 4 states have (on average 14.5) internal successors, (58), 3 states have internal predecessors, (58), 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-16 15:31:24,130 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 15:31:24,130 INFO L93 Difference]: Finished difference Result 6153 states and 11660 transitions. [2025-03-16 15:31:24,130 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-16 15:31:24,131 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 14.5) internal successors, (58), 3 states have internal predecessors, (58), 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 58 [2025-03-16 15:31:24,131 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 15:31:24,149 INFO L225 Difference]: With dead ends: 6153 [2025-03-16 15:31:24,149 INFO L226 Difference]: Without dead ends: 4470 [2025-03-16 15:31:24,153 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-03-16 15:31:24,156 INFO L435 NwaCegarLoop]: 704 mSDtfsCounter, 4511 mSDsluCounter, 270 mSDsCounter, 0 mSdLazyCounter, 7004 mSolverCounterSat, 3531 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 7.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4511 SdHoareTripleChecker+Valid, 974 SdHoareTripleChecker+Invalid, 10535 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3531 IncrementalHoareTripleChecker+Valid, 7004 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 8.4s IncrementalHoareTripleChecker+Time [2025-03-16 15:31:24,156 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [4511 Valid, 974 Invalid, 10535 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3531 Valid, 7004 Invalid, 0 Unknown, 0 Unchecked, 8.4s Time] [2025-03-16 15:31:24,164 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4470 states. [2025-03-16 15:31:24,244 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4470 to 4466. [2025-03-16 15:31:24,250 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4466 states, 4465 states have (on average 1.5666293393057111) internal successors, (6995), 4465 states have internal predecessors, (6995), 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-16 15:31:24,260 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4466 states to 4466 states and 6995 transitions. [2025-03-16 15:31:24,261 INFO L78 Accepts]: Start accepts. Automaton has 4466 states and 6995 transitions. Word has length 58 [2025-03-16 15:31:24,261 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 15:31:24,261 INFO L471 AbstractCegarLoop]: Abstraction has 4466 states and 6995 transitions. [2025-03-16 15:31:24,261 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 14.5) internal successors, (58), 3 states have internal predecessors, (58), 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-16 15:31:24,261 INFO L276 IsEmpty]: Start isEmpty. Operand 4466 states and 6995 transitions. [2025-03-16 15:31:24,267 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 333 [2025-03-16 15:31:24,267 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 15:31:24,268 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 15:31:24,268 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-03-16 15:31:24,268 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 15:31:24,268 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 15:31:24,269 INFO L85 PathProgramCache]: Analyzing trace with hash 1682618456, now seen corresponding path program 1 times [2025-03-16 15:31:24,269 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 15:31:24,269 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1827229679] [2025-03-16 15:31:24,269 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 15:31:24,269 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 15:31:24,322 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 332 statements into 1 equivalence classes. [2025-03-16 15:31:24,368 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 332 of 332 statements. [2025-03-16 15:31:24,368 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 15:31:24,368 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 15:31:25,360 INFO L134 CoverageAnalysis]: Checked inductivity of 177 backedges. 120 proven. 0 refuted. 0 times theorem prover too weak. 57 trivial. 0 not checked. [2025-03-16 15:31:25,363 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 15:31:25,363 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1827229679] [2025-03-16 15:31:25,363 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1827229679] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 15:31:25,363 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 15:31:25,364 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-16 15:31:25,364 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [508944716] [2025-03-16 15:31:25,364 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 15:31:25,364 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-16 15:31:25,364 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 15:31:25,366 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-16 15:31:25,366 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-16 15:31:25,366 INFO L87 Difference]: Start difference. First operand 4466 states and 6995 transitions. Second operand has 4 states, 4 states have (on average 69.0) internal successors, (276), 3 states have internal predecessors, (276), 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-16 15:31:33,200 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 15:31:33,200 INFO L93 Difference]: Finished difference Result 11709 states and 20220 transitions. [2025-03-16 15:31:33,201 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-16 15:31:33,201 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 69.0) internal successors, (276), 3 states have internal predecessors, (276), 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 332 [2025-03-16 15:31:33,202 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 15:31:33,226 INFO L225 Difference]: With dead ends: 11709 [2025-03-16 15:31:33,226 INFO L226 Difference]: Without dead ends: 8609 [2025-03-16 15:31:33,233 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-03-16 15:31:33,236 INFO L435 NwaCegarLoop]: 1801 mSDtfsCounter, 3755 mSDsluCounter, 355 mSDsCounter, 0 mSdLazyCounter, 9445 mSolverCounterSat, 1331 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 6.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3755 SdHoareTripleChecker+Valid, 2156 SdHoareTripleChecker+Invalid, 10776 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1331 IncrementalHoareTripleChecker+Valid, 9445 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 7.7s IncrementalHoareTripleChecker+Time [2025-03-16 15:31:33,237 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [3755 Valid, 2156 Invalid, 10776 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1331 Valid, 9445 Invalid, 0 Unknown, 0 Unchecked, 7.7s Time] [2025-03-16 15:31:33,246 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8609 states. [2025-03-16 15:31:33,392 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8609 to 8595. [2025-03-16 15:31:33,405 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8595 states, 8594 states have (on average 1.348498952757738) internal successors, (11589), 8594 states have internal predecessors, (11589), 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-16 15:31:33,418 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8595 states to 8595 states and 11589 transitions. [2025-03-16 15:31:33,418 INFO L78 Accepts]: Start accepts. Automaton has 8595 states and 11589 transitions. Word has length 332 [2025-03-16 15:31:33,420 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 15:31:33,420 INFO L471 AbstractCegarLoop]: Abstraction has 8595 states and 11589 transitions. [2025-03-16 15:31:33,420 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 69.0) internal successors, (276), 3 states have internal predecessors, (276), 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-16 15:31:33,420 INFO L276 IsEmpty]: Start isEmpty. Operand 8595 states and 11589 transitions. [2025-03-16 15:31:33,424 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 361 [2025-03-16 15:31:33,424 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 15:31:33,424 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 15:31:33,425 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-03-16 15:31:33,425 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 15:31:33,426 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 15:31:33,427 INFO L85 PathProgramCache]: Analyzing trace with hash 1355576938, now seen corresponding path program 1 times [2025-03-16 15:31:33,427 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 15:31:33,427 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [473286874] [2025-03-16 15:31:33,427 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 15:31:33,427 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 15:31:33,460 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 360 statements into 1 equivalence classes. [2025-03-16 15:31:33,483 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 360 of 360 statements. [2025-03-16 15:31:33,483 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 15:31:33,484 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 15:31:33,951 INFO L134 CoverageAnalysis]: Checked inductivity of 177 backedges. 146 proven. 0 refuted. 0 times theorem prover too weak. 31 trivial. 0 not checked. [2025-03-16 15:31:33,952 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 15:31:33,952 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [473286874] [2025-03-16 15:31:33,952 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [473286874] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 15:31:33,952 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 15:31:33,953 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-16 15:31:33,953 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2027672473] [2025-03-16 15:31:33,953 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 15:31:33,953 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-16 15:31:33,953 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 15:31:33,954 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-16 15:31:33,954 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-03-16 15:31:33,954 INFO L87 Difference]: Start difference. First operand 8595 states and 11589 transitions. Second operand has 4 states, 4 states have (on average 82.5) internal successors, (330), 3 states have internal predecessors, (330), 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-16 15:31:38,948 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 15:31:38,949 INFO L93 Difference]: Finished difference Result 14490 states and 20460 transitions. [2025-03-16 15:31:38,949 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-16 15:31:38,949 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 82.5) internal successors, (330), 3 states have internal predecessors, (330), 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 360 [2025-03-16 15:31:38,950 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 15:31:38,972 INFO L225 Difference]: With dead ends: 14490 [2025-03-16 15:31:38,972 INFO L226 Difference]: Without dead ends: 8595 [2025-03-16 15:31:38,981 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-03-16 15:31:38,982 INFO L435 NwaCegarLoop]: 1772 mSDtfsCounter, 1138 mSDsluCounter, 341 mSDsCounter, 0 mSdLazyCounter, 7321 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1138 SdHoareTripleChecker+Valid, 2113 SdHoareTripleChecker+Invalid, 7329 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 7321 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.9s IncrementalHoareTripleChecker+Time [2025-03-16 15:31:38,982 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1138 Valid, 2113 Invalid, 7329 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 7321 Invalid, 0 Unknown, 0 Unchecked, 4.9s Time] [2025-03-16 15:31:38,991 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8595 states. [2025-03-16 15:31:39,086 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8595 to 8595. [2025-03-16 15:31:39,099 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8595 states, 8594 states have (on average 1.346986269490342) internal successors, (11576), 8594 states have internal predecessors, (11576), 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-16 15:31:39,112 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8595 states to 8595 states and 11576 transitions. [2025-03-16 15:31:39,112 INFO L78 Accepts]: Start accepts. Automaton has 8595 states and 11576 transitions. Word has length 360 [2025-03-16 15:31:39,112 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 15:31:39,112 INFO L471 AbstractCegarLoop]: Abstraction has 8595 states and 11576 transitions. [2025-03-16 15:31:39,113 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 82.5) internal successors, (330), 3 states have internal predecessors, (330), 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-16 15:31:39,114 INFO L276 IsEmpty]: Start isEmpty. Operand 8595 states and 11576 transitions. [2025-03-16 15:31:39,124 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 613 [2025-03-16 15:31:39,124 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 15:31:39,125 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 15:31:39,126 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-03-16 15:31:39,126 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 15:31:39,126 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 15:31:39,127 INFO L85 PathProgramCache]: Analyzing trace with hash 828527097, now seen corresponding path program 1 times [2025-03-16 15:31:39,127 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 15:31:39,127 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2140245746] [2025-03-16 15:31:39,127 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 15:31:39,127 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 15:31:39,237 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 612 statements into 1 equivalence classes. [2025-03-16 15:31:39,263 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 612 of 612 statements. [2025-03-16 15:31:39,264 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 15:31:39,264 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 15:31:39,770 INFO L134 CoverageAnalysis]: Checked inductivity of 177 backedges. 113 proven. 37 refuted. 0 times theorem prover too weak. 27 trivial. 0 not checked. [2025-03-16 15:31:39,771 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 15:31:39,771 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2140245746] [2025-03-16 15:31:39,771 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2140245746] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-16 15:31:39,771 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1105337571] [2025-03-16 15:31:39,771 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 15:31:39,771 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-16 15:31:39,771 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-16 15:31:39,774 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-16 15:31:39,775 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-16 15:31:39,849 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 612 statements into 1 equivalence classes. [2025-03-16 15:31:39,940 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 612 of 612 statements. [2025-03-16 15:31:39,941 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 15:31:39,941 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 15:31:39,944 INFO L256 TraceCheckSpWp]: Trace formula consists of 720 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-03-16 15:31:39,958 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-16 15:31:40,080 INFO L134 CoverageAnalysis]: Checked inductivity of 177 backedges. 177 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-16 15:31:40,081 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-16 15:31:40,081 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1105337571] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 15:31:40,082 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-16 15:31:40,082 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [3] total 5 [2025-03-16 15:31:40,082 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [977182078] [2025-03-16 15:31:40,082 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 15:31:40,082 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-16 15:31:40,083 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 15:31:40,083 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-16 15:31:40,083 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-03-16 15:31:40,088 INFO L87 Difference]: Start difference. First operand 8595 states and 11576 transitions. Second operand has 3 states, 3 states have (on average 204.0) internal successors, (612), 3 states have internal predecessors, (612), 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-16 15:31:44,522 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 15:31:44,522 INFO L93 Difference]: Finished difference Result 19934 states and 28707 transitions. [2025-03-16 15:31:44,522 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-16 15:31:44,523 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 204.0) internal successors, (612), 3 states have internal predecessors, (612), 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 612 [2025-03-16 15:31:44,524 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 15:31:44,545 INFO L225 Difference]: With dead ends: 19934 [2025-03-16 15:31:44,545 INFO L226 Difference]: Without dead ends: 14070 [2025-03-16 15:31:44,550 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 614 GetRequests, 611 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-03-16 15:31:44,550 INFO L435 NwaCegarLoop]: 1366 mSDtfsCounter, 1729 mSDsluCounter, 137 mSDsCounter, 0 mSdLazyCounter, 3864 mSolverCounterSat, 1728 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1729 SdHoareTripleChecker+Valid, 1503 SdHoareTripleChecker+Invalid, 5592 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1728 IncrementalHoareTripleChecker+Valid, 3864 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.3s IncrementalHoareTripleChecker+Time [2025-03-16 15:31:44,550 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1729 Valid, 1503 Invalid, 5592 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1728 Valid, 3864 Invalid, 0 Unknown, 0 Unchecked, 4.3s Time] [2025-03-16 15:31:44,557 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14070 states. [2025-03-16 15:31:44,661 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14070 to 14070. [2025-03-16 15:31:44,677 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 14070 states, 14069 states have (on average 1.2694576728978606) internal successors, (17860), 14069 states have internal predecessors, (17860), 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-16 15:31:44,694 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14070 states to 14070 states and 17860 transitions. [2025-03-16 15:31:44,695 INFO L78 Accepts]: Start accepts. Automaton has 14070 states and 17860 transitions. Word has length 612 [2025-03-16 15:31:44,695 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 15:31:44,696 INFO L471 AbstractCegarLoop]: Abstraction has 14070 states and 17860 transitions. [2025-03-16 15:31:44,696 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 204.0) internal successors, (612), 3 states have internal predecessors, (612), 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-16 15:31:44,698 INFO L276 IsEmpty]: Start isEmpty. Operand 14070 states and 17860 transitions. [2025-03-16 15:31:44,704 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 614 [2025-03-16 15:31:44,705 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 15:31:44,705 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 15:31:44,715 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2025-03-16 15:31:44,908 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-16 15:31:44,908 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 15:31:44,909 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 15:31:44,909 INFO L85 PathProgramCache]: Analyzing trace with hash 976303208, now seen corresponding path program 1 times [2025-03-16 15:31:44,909 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 15:31:44,909 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1002731059] [2025-03-16 15:31:44,909 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 15:31:44,909 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 15:31:44,966 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 613 statements into 1 equivalence classes. [2025-03-16 15:31:44,995 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 613 of 613 statements. [2025-03-16 15:31:44,995 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 15:31:44,996 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 15:31:45,360 INFO L134 CoverageAnalysis]: Checked inductivity of 180 backedges. 113 proven. 0 refuted. 0 times theorem prover too weak. 67 trivial. 0 not checked. [2025-03-16 15:31:45,362 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 15:31:45,362 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1002731059] [2025-03-16 15:31:45,362 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1002731059] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 15:31:45,362 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 15:31:45,362 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-16 15:31:45,362 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1503263311] [2025-03-16 15:31:45,362 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 15:31:45,363 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-16 15:31:45,363 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 15:31:45,363 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-16 15:31:45,363 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-16 15:31:45,364 INFO L87 Difference]: Start difference. First operand 14070 states and 17860 transitions. Second operand has 3 states, 3 states have (on average 182.33333333333334) internal successors, (547), 2 states have internal predecessors, (547), 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-16 15:31:50,287 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 15:31:50,287 INFO L93 Difference]: Finished difference Result 36503 states and 47793 transitions. [2025-03-16 15:31:50,287 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-16 15:31:50,287 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 182.33333333333334) internal successors, (547), 2 states have internal predecessors, (547), 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 613 [2025-03-16 15:31:50,288 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 15:31:50,325 INFO L225 Difference]: With dead ends: 36503 [2025-03-16 15:31:50,325 INFO L226 Difference]: Without dead ends: 25164 [2025-03-16 15:31:50,332 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-16 15:31:50,334 INFO L435 NwaCegarLoop]: 693 mSDtfsCounter, 2110 mSDsluCounter, 269 mSDsCounter, 0 mSdLazyCounter, 5095 mSolverCounterSat, 434 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2110 SdHoareTripleChecker+Valid, 962 SdHoareTripleChecker+Invalid, 5529 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 434 IncrementalHoareTripleChecker+Valid, 5095 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.8s IncrementalHoareTripleChecker+Time [2025-03-16 15:31:50,334 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2110 Valid, 962 Invalid, 5529 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [434 Valid, 5095 Invalid, 0 Unknown, 0 Unchecked, 4.8s Time] [2025-03-16 15:31:50,353 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25164 states. [2025-03-16 15:31:50,518 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25164 to 23796. [2025-03-16 15:31:50,542 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 23796 states, 23795 states have (on average 1.267451145198571) internal successors, (30159), 23795 states have internal predecessors, (30159), 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-16 15:31:50,567 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23796 states to 23796 states and 30159 transitions. [2025-03-16 15:31:50,568 INFO L78 Accepts]: Start accepts. Automaton has 23796 states and 30159 transitions. Word has length 613 [2025-03-16 15:31:50,569 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 15:31:50,569 INFO L471 AbstractCegarLoop]: Abstraction has 23796 states and 30159 transitions. [2025-03-16 15:31:50,569 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 182.33333333333334) internal successors, (547), 2 states have internal predecessors, (547), 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-16 15:31:50,569 INFO L276 IsEmpty]: Start isEmpty. Operand 23796 states and 30159 transitions. [2025-03-16 15:31:50,579 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 631 [2025-03-16 15:31:50,580 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 15:31:50,580 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 15:31:50,580 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-03-16 15:31:50,580 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 15:31:50,581 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 15:31:50,581 INFO L85 PathProgramCache]: Analyzing trace with hash -391387083, now seen corresponding path program 1 times [2025-03-16 15:31:50,582 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 15:31:50,582 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1889233425] [2025-03-16 15:31:50,582 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 15:31:50,582 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 15:31:50,638 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 630 statements into 1 equivalence classes. [2025-03-16 15:31:50,674 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 630 of 630 statements. [2025-03-16 15:31:50,675 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 15:31:50,675 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 15:31:50,877 INFO L134 CoverageAnalysis]: Checked inductivity of 197 backedges. 113 proven. 0 refuted. 0 times theorem prover too weak. 84 trivial. 0 not checked. [2025-03-16 15:31:50,877 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 15:31:50,877 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1889233425] [2025-03-16 15:31:50,878 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1889233425] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 15:31:50,878 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 15:31:50,878 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-16 15:31:50,878 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [590746636] [2025-03-16 15:31:50,878 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 15:31:50,879 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-16 15:31:50,879 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 15:31:50,880 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-16 15:31:50,880 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-16 15:31:50,880 INFO L87 Difference]: Start difference. First operand 23796 states and 30159 transitions. Second operand has 3 states, 3 states have (on average 182.33333333333334) internal successors, (547), 2 states have internal predecessors, (547), 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-16 15:31:55,137 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 15:31:55,137 INFO L93 Difference]: Finished difference Result 50346 states and 65461 transitions. [2025-03-16 15:31:55,137 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-16 15:31:55,137 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 182.33333333333334) internal successors, (547), 2 states have internal predecessors, (547), 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 630 [2025-03-16 15:31:55,138 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 15:31:55,178 INFO L225 Difference]: With dead ends: 50346 [2025-03-16 15:31:55,178 INFO L226 Difference]: Without dead ends: 29281 [2025-03-16 15:31:55,190 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-16 15:31:55,191 INFO L435 NwaCegarLoop]: 675 mSDtfsCounter, 1377 mSDsluCounter, 47 mSDsCounter, 0 mSdLazyCounter, 3921 mSolverCounterSat, 2125 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1377 SdHoareTripleChecker+Valid, 722 SdHoareTripleChecker+Invalid, 6046 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2125 IncrementalHoareTripleChecker+Valid, 3921 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.0s IncrementalHoareTripleChecker+Time [2025-03-16 15:31:55,191 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1377 Valid, 722 Invalid, 6046 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2125 Valid, 3921 Invalid, 0 Unknown, 0 Unchecked, 4.0s Time] [2025-03-16 15:31:55,210 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29281 states. [2025-03-16 15:31:55,383 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29281 to 29266. [2025-03-16 15:31:55,408 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 29266 states, 29265 states have (on average 1.2553220570647532) internal successors, (36737), 29265 states have internal predecessors, (36737), 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-16 15:31:55,438 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29266 states to 29266 states and 36737 transitions. [2025-03-16 15:31:55,439 INFO L78 Accepts]: Start accepts. Automaton has 29266 states and 36737 transitions. Word has length 630 [2025-03-16 15:31:55,440 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 15:31:55,440 INFO L471 AbstractCegarLoop]: Abstraction has 29266 states and 36737 transitions. [2025-03-16 15:31:55,440 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 182.33333333333334) internal successors, (547), 2 states have internal predecessors, (547), 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-16 15:31:55,440 INFO L276 IsEmpty]: Start isEmpty. Operand 29266 states and 36737 transitions. [2025-03-16 15:31:55,446 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 843 [2025-03-16 15:31:55,446 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 15:31:55,447 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 15:31:55,447 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-03-16 15:31:55,447 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 15:31:55,447 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 15:31:55,448 INFO L85 PathProgramCache]: Analyzing trace with hash 1377132870, now seen corresponding path program 1 times [2025-03-16 15:31:55,448 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 15:31:55,448 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [419518570] [2025-03-16 15:31:55,448 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 15:31:55,448 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 15:31:55,505 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 842 statements into 1 equivalence classes. [2025-03-16 15:31:55,537 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 842 of 842 statements. [2025-03-16 15:31:55,537 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 15:31:55,538 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 15:31:55,815 INFO L134 CoverageAnalysis]: Checked inductivity of 548 backedges. 339 proven. 0 refuted. 0 times theorem prover too weak. 209 trivial. 0 not checked. [2025-03-16 15:31:55,815 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 15:31:55,815 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [419518570] [2025-03-16 15:31:55,815 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [419518570] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 15:31:55,815 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 15:31:55,815 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-16 15:31:55,815 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [281812660] [2025-03-16 15:31:55,815 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 15:31:55,816 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-16 15:31:55,816 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 15:31:55,817 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-16 15:31:55,817 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-03-16 15:31:55,817 INFO L87 Difference]: Start difference. First operand 29266 states and 36737 transitions. Second operand has 4 states, 4 states have (on average 158.5) internal successors, (634), 4 states have internal predecessors, (634), 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-16 15:32:03,567 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 15:32:03,567 INFO L93 Difference]: Finished difference Result 98281 states and 126942 transitions. [2025-03-16 15:32:03,568 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-16 15:32:03,568 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 158.5) internal successors, (634), 4 states have internal predecessors, (634), 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 842 [2025-03-16 15:32:03,569 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 15:32:03,667 INFO L225 Difference]: With dead ends: 98281 [2025-03-16 15:32:03,667 INFO L226 Difference]: Without dead ends: 71746 [2025-03-16 15:32:03,693 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-03-16 15:32:03,694 INFO L435 NwaCegarLoop]: 817 mSDtfsCounter, 3378 mSDsluCounter, 258 mSDsCounter, 0 mSdLazyCounter, 8462 mSolverCounterSat, 3304 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 6.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3378 SdHoareTripleChecker+Valid, 1075 SdHoareTripleChecker+Invalid, 11766 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3304 IncrementalHoareTripleChecker+Valid, 8462 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 7.4s IncrementalHoareTripleChecker+Time [2025-03-16 15:32:03,694 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [3378 Valid, 1075 Invalid, 11766 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3304 Valid, 8462 Invalid, 0 Unknown, 0 Unchecked, 7.4s Time] [2025-03-16 15:32:03,745 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 71746 states. [2025-03-16 15:32:04,196 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 71746 to 68932. [2025-03-16 15:32:04,256 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 68932 states, 68931 states have (on average 1.2231216723970346) internal successors, (84311), 68931 states have internal predecessors, (84311), 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-16 15:32:04,617 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 68932 states to 68932 states and 84311 transitions. [2025-03-16 15:32:04,618 INFO L78 Accepts]: Start accepts. Automaton has 68932 states and 84311 transitions. Word has length 842 [2025-03-16 15:32:04,619 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 15:32:04,619 INFO L471 AbstractCegarLoop]: Abstraction has 68932 states and 84311 transitions. [2025-03-16 15:32:04,619 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 158.5) internal successors, (634), 4 states have internal predecessors, (634), 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-16 15:32:04,619 INFO L276 IsEmpty]: Start isEmpty. Operand 68932 states and 84311 transitions. [2025-03-16 15:32:04,626 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 919 [2025-03-16 15:32:04,626 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 15:32:04,626 INFO L218 NwaCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 15:32:04,627 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-03-16 15:32:04,627 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 15:32:04,628 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 15:32:04,628 INFO L85 PathProgramCache]: Analyzing trace with hash -747572712, now seen corresponding path program 1 times [2025-03-16 15:32:04,628 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 15:32:04,628 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1960995143] [2025-03-16 15:32:04,629 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 15:32:04,629 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 15:32:04,695 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 918 statements into 1 equivalence classes. [2025-03-16 15:32:04,735 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 918 of 918 statements. [2025-03-16 15:32:04,736 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 15:32:04,736 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 15:32:05,149 INFO L134 CoverageAnalysis]: Checked inductivity of 817 backedges. 227 proven. 0 refuted. 0 times theorem prover too weak. 590 trivial. 0 not checked. [2025-03-16 15:32:05,149 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 15:32:05,149 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1960995143] [2025-03-16 15:32:05,149 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1960995143] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 15:32:05,149 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 15:32:05,150 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-16 15:32:05,150 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2056451495] [2025-03-16 15:32:05,150 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 15:32:05,150 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-16 15:32:05,150 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 15:32:05,151 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-16 15:32:05,151 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-03-16 15:32:05,151 INFO L87 Difference]: Start difference. First operand 68932 states and 84311 transitions. Second operand has 4 states, 4 states have (on average 138.25) internal successors, (553), 4 states have internal predecessors, (553), 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-16 15:32:13,693 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 15:32:13,694 INFO L93 Difference]: Finished difference Result 192491 states and 245926 transitions. [2025-03-16 15:32:13,694 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-16 15:32:13,694 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 138.25) internal successors, (553), 4 states have internal predecessors, (553), 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 918 [2025-03-16 15:32:13,695 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 15:32:13,888 INFO L225 Difference]: With dead ends: 192491 [2025-03-16 15:32:13,888 INFO L226 Difference]: Without dead ends: 126290 [2025-03-16 15:32:13,939 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-03-16 15:32:13,939 INFO L435 NwaCegarLoop]: 2641 mSDtfsCounter, 2860 mSDsluCounter, 470 mSDsCounter, 0 mSdLazyCounter, 9873 mSolverCounterSat, 1367 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 6.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2860 SdHoareTripleChecker+Valid, 3111 SdHoareTripleChecker+Invalid, 11240 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1367 IncrementalHoareTripleChecker+Valid, 9873 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 7.8s IncrementalHoareTripleChecker+Time [2025-03-16 15:32:13,940 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2860 Valid, 3111 Invalid, 11240 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1367 Valid, 9873 Invalid, 0 Unknown, 0 Unchecked, 7.8s Time] [2025-03-16 15:32:14,035 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 126290 states. [2025-03-16 15:32:15,192 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 126290 to 126279. [2025-03-16 15:32:15,290 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 126279 states, 126278 states have (on average 1.240239788403364) internal successors, (156615), 126278 states have internal predecessors, (156615), 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-16 15:32:15,439 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 126279 states to 126279 states and 156615 transitions. [2025-03-16 15:32:15,440 INFO L78 Accepts]: Start accepts. Automaton has 126279 states and 156615 transitions. Word has length 918 [2025-03-16 15:32:15,441 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 15:32:15,441 INFO L471 AbstractCegarLoop]: Abstraction has 126279 states and 156615 transitions. [2025-03-16 15:32:15,441 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 138.25) internal successors, (553), 4 states have internal predecessors, (553), 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-16 15:32:15,441 INFO L276 IsEmpty]: Start isEmpty. Operand 126279 states and 156615 transitions. [2025-03-16 15:32:15,453 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1042 [2025-03-16 15:32:15,454 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 15:32:15,454 INFO L218 NwaCegarLoop]: trace histogram [6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 15:32:15,454 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-03-16 15:32:15,454 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 15:32:15,455 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 15:32:15,455 INFO L85 PathProgramCache]: Analyzing trace with hash 1012845601, now seen corresponding path program 1 times [2025-03-16 15:32:15,455 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 15:32:15,455 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1262433470] [2025-03-16 15:32:15,455 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 15:32:15,455 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 15:32:15,697 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 1041 statements into 1 equivalence classes. [2025-03-16 15:32:15,732 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 1041 of 1041 statements. [2025-03-16 15:32:15,732 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 15:32:15,732 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 15:32:16,773 INFO L134 CoverageAnalysis]: Checked inductivity of 1278 backedges. 761 proven. 366 refuted. 0 times theorem prover too weak. 151 trivial. 0 not checked. [2025-03-16 15:32:16,773 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 15:32:16,773 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1262433470] [2025-03-16 15:32:16,773 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1262433470] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-16 15:32:16,773 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [540244011] [2025-03-16 15:32:16,773 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 15:32:16,773 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-16 15:32:16,774 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-16 15:32:16,775 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-16 15:32:16,777 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-16 15:32:16,899 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 1041 statements into 1 equivalence classes. [2025-03-16 15:32:17,049 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 1041 of 1041 statements. [2025-03-16 15:32:17,049 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 15:32:17,049 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 15:32:17,052 INFO L256 TraceCheckSpWp]: Trace formula consists of 1223 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-03-16 15:32:17,067 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-16 15:32:17,231 INFO L134 CoverageAnalysis]: Checked inductivity of 1278 backedges. 688 proven. 0 refuted. 0 times theorem prover too weak. 590 trivial. 0 not checked. [2025-03-16 15:32:17,232 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-16 15:32:17,232 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [540244011] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 15:32:17,232 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-16 15:32:17,232 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [4] total 5 [2025-03-16 15:32:17,232 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [898588981] [2025-03-16 15:32:17,232 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 15:32:17,233 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-16 15:32:17,233 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 15:32:17,234 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-16 15:32:17,234 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-03-16 15:32:17,234 INFO L87 Difference]: Start difference. First operand 126279 states and 156615 transitions. Second operand has 3 states, 3 states have (on average 225.33333333333334) internal successors, (676), 3 states have internal predecessors, (676), 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-16 15:32:21,984 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 15:32:21,984 INFO L93 Difference]: Finished difference Result 293503 states and 362619 transitions. [2025-03-16 15:32:21,985 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-16 15:32:21,985 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 225.33333333333334) internal successors, (676), 3 states have internal predecessors, (676), 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 1041 [2025-03-16 15:32:21,986 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 15:32:22,252 INFO L225 Difference]: With dead ends: 293503 [2025-03-16 15:32:22,252 INFO L226 Difference]: Without dead ends: 167223 [2025-03-16 15:32:22,355 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 1046 GetRequests, 1043 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-03-16 15:32:22,356 INFO L435 NwaCegarLoop]: 2587 mSDtfsCounter, 1554 mSDsluCounter, 87 mSDsCounter, 0 mSdLazyCounter, 3790 mSolverCounterSat, 1658 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1554 SdHoareTripleChecker+Valid, 2674 SdHoareTripleChecker+Invalid, 5448 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1658 IncrementalHoareTripleChecker+Valid, 3790 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.9s IncrementalHoareTripleChecker+Time [2025-03-16 15:32:22,356 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1554 Valid, 2674 Invalid, 5448 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1658 Valid, 3790 Invalid, 0 Unknown, 0 Unchecked, 3.9s Time] [2025-03-16 15:32:22,517 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 167223 states. [2025-03-16 15:32:24,107 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 167223 to 165847. [2025-03-16 15:32:24,221 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 165847 states, 165846 states have (on average 1.1925038891501754) internal successors, (197772), 165846 states have internal predecessors, (197772), 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-16 15:32:24,458 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 165847 states to 165847 states and 197772 transitions. [2025-03-16 15:32:24,459 INFO L78 Accepts]: Start accepts. Automaton has 165847 states and 197772 transitions. Word has length 1041 [2025-03-16 15:32:24,459 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 15:32:24,459 INFO L471 AbstractCegarLoop]: Abstraction has 165847 states and 197772 transitions. [2025-03-16 15:32:24,460 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 225.33333333333334) internal successors, (676), 3 states have internal predecessors, (676), 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-16 15:32:24,460 INFO L276 IsEmpty]: Start isEmpty. Operand 165847 states and 197772 transitions. [2025-03-16 15:32:24,480 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1075 [2025-03-16 15:32:24,480 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 15:32:24,481 INFO L218 NwaCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 15:32:24,488 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2025-03-16 15:32:24,685 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,SelfDestructingSolverStorable9 [2025-03-16 15:32:24,685 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 15:32:24,685 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 15:32:24,686 INFO L85 PathProgramCache]: Analyzing trace with hash 812932019, now seen corresponding path program 1 times [2025-03-16 15:32:24,686 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 15:32:24,686 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1395058260] [2025-03-16 15:32:24,686 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 15:32:24,686 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 15:32:24,790 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 1074 statements into 1 equivalence classes. [2025-03-16 15:32:24,846 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 1074 of 1074 statements. [2025-03-16 15:32:24,846 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 15:32:24,846 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 15:32:25,623 INFO L134 CoverageAnalysis]: Checked inductivity of 1074 backedges. 712 proven. 0 refuted. 0 times theorem prover too weak. 362 trivial. 0 not checked. [2025-03-16 15:32:25,623 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 15:32:25,623 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1395058260] [2025-03-16 15:32:25,623 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1395058260] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 15:32:25,624 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 15:32:25,624 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-16 15:32:25,624 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [396658721] [2025-03-16 15:32:25,624 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 15:32:25,624 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-16 15:32:25,624 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 15:32:25,625 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-16 15:32:25,625 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-16 15:32:25,625 INFO L87 Difference]: Start difference. First operand 165847 states and 197772 transitions. Second operand has 3 states, 3 states have (on average 238.0) internal successors, (714), 3 states have internal predecessors, (714), 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)