./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/eca-rers2012/Problem15_label11.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 798a7b37 Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/eca-rers2012/Problem15_label11.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 b0d31ac0a4760541f0d40c4e2a162c7e746a87cea96b874d39053630478d669b --- Real Ultimate output --- This is Ultimate 0.3.0-?-798a7b3-m [2025-03-03 10:49:21,537 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-03 10:49:21,593 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2025-03-03 10:49:21,598 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-03 10:49:21,598 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-03 10:49:21,620 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-03 10:49:21,620 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-03 10:49:21,621 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-03 10:49:21,621 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-03 10:49:21,621 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-03 10:49:21,621 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-03 10:49:21,621 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-03 10:49:21,621 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-03 10:49:21,621 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-03 10:49:21,621 INFO L153 SettingsManager]: * Use SBE=true [2025-03-03 10:49:21,621 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-03 10:49:21,621 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-03 10:49:21,621 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-03 10:49:21,621 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-03 10:49:21,622 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-03 10:49:21,622 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-03 10:49:21,622 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-03 10:49:21,622 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-03 10:49:21,622 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-03 10:49:21,622 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-03 10:49:21,622 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-03 10:49:21,622 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-03 10:49:21,622 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-03 10:49:21,622 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-03 10:49:21,622 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-03 10:49:21,622 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-03 10:49:21,622 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-03 10:49:21,622 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-03 10:49:21,622 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-03 10:49:21,622 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-03 10:49:21,622 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-03 10:49:21,622 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-03 10:49:21,622 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-03 10:49:21,622 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-03 10:49:21,622 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-03 10:49:21,622 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-03 10:49:21,623 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-03 10:49:21,623 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-03 10:49:21,623 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 -> b0d31ac0a4760541f0d40c4e2a162c7e746a87cea96b874d39053630478d669b [2025-03-03 10:49:21,852 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-03 10:49:21,859 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-03 10:49:21,861 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-03 10:49:21,862 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-03 10:49:21,862 INFO L274 PluginConnector]: CDTParser initialized [2025-03-03 10:49:21,865 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/eca-rers2012/Problem15_label11.c [2025-03-03 10:49:22,988 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/013a5d880/d9c4eb6393da49c9a902ec21dd22d1ef/FLAG1047ac76b [2025-03-03 10:49:23,344 INFO L384 CDTParser]: Found 1 translation units. [2025-03-03 10:49:23,345 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/eca-rers2012/Problem15_label11.c [2025-03-03 10:49:23,363 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/013a5d880/d9c4eb6393da49c9a902ec21dd22d1ef/FLAG1047ac76b [2025-03-03 10:49:23,561 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/013a5d880/d9c4eb6393da49c9a902ec21dd22d1ef [2025-03-03 10:49:23,563 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-03 10:49:23,566 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-03 10:49:23,567 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-03 10:49:23,567 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-03 10:49:23,570 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-03 10:49:23,571 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 03.03 10:49:23" (1/1) ... [2025-03-03 10:49:23,571 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@32e8355b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 10:49:23, skipping insertion in model container [2025-03-03 10:49:23,572 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 03.03 10:49:23" (1/1) ... [2025-03-03 10:49:23,609 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-03 10:49:23,769 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/Problem15_label11.c[6732,6745] [2025-03-03 10:49:24,016 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-03 10:49:24,026 INFO L200 MainTranslator]: Completed pre-run [2025-03-03 10:49:24,043 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/Problem15_label11.c[6732,6745] [2025-03-03 10:49:24,166 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-03 10:49:24,179 INFO L204 MainTranslator]: Completed translation [2025-03-03 10:49:24,180 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 10:49:24 WrapperNode [2025-03-03 10:49:24,180 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-03 10:49:24,181 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-03 10:49:24,181 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-03 10:49:24,181 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-03 10:49:24,185 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 10:49:24" (1/1) ... [2025-03-03 10:49:24,201 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 10:49:24" (1/1) ... [2025-03-03 10:49:24,325 INFO L138 Inliner]: procedures = 15, calls = 9, calls flagged for inlining = 4, calls inlined = 4, statements flattened = 1757 [2025-03-03 10:49:24,325 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-03 10:49:24,326 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-03 10:49:24,326 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-03 10:49:24,326 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-03 10:49:24,333 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 10:49:24" (1/1) ... [2025-03-03 10:49:24,333 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 10:49:24" (1/1) ... [2025-03-03 10:49:24,358 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 10:49:24" (1/1) ... [2025-03-03 10:49:24,455 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2025-03-03 10:49:24,455 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 10:49:24" (1/1) ... [2025-03-03 10:49:24,455 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 10:49:24" (1/1) ... [2025-03-03 10:49:24,496 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 10:49:24" (1/1) ... [2025-03-03 10:49:24,509 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 10:49:24" (1/1) ... [2025-03-03 10:49:24,518 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 10:49:24" (1/1) ... [2025-03-03 10:49:24,526 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 10:49:24" (1/1) ... [2025-03-03 10:49:24,551 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-03 10:49:24,553 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-03 10:49:24,554 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-03 10:49:24,554 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-03 10:49:24,555 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 10:49:24" (1/1) ... [2025-03-03 10:49:24,559 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-03 10:49:24,587 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 10:49:24,598 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-03-03 10:49:24,603 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-03-03 10:49:24,618 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-03 10:49:24,619 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-03-03 10:49:24,619 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-03 10:49:24,619 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-03 10:49:24,667 INFO L256 CfgBuilder]: Building ICFG [2025-03-03 10:49:24,669 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-03 10:49:26,579 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L1665: havoc calculate_output_#t~ret7#1; [2025-03-03 10:49:26,650 INFO L? ?]: Removed 246 outVars from TransFormulas that were not future-live. [2025-03-03 10:49:26,650 INFO L307 CfgBuilder]: Performing block encoding [2025-03-03 10:49:26,670 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-03 10:49:26,670 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-03 10:49:26,671 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 03.03 10:49:26 BoogieIcfgContainer [2025-03-03 10:49:26,671 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-03 10:49:26,672 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-03 10:49:26,673 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-03 10:49:26,676 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-03 10:49:26,676 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 03.03 10:49:23" (1/3) ... [2025-03-03 10:49:26,677 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@206981c5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 03.03 10:49:26, skipping insertion in model container [2025-03-03 10:49:26,677 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 10:49:24" (2/3) ... [2025-03-03 10:49:26,677 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@206981c5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 03.03 10:49:26, skipping insertion in model container [2025-03-03 10:49:26,677 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 03.03 10:49:26" (3/3) ... [2025-03-03 10:49:26,678 INFO L128 eAbstractionObserver]: Analyzing ICFG Problem15_label11.c [2025-03-03 10:49:26,689 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-03 10:49:26,690 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG Problem15_label11.c that has 1 procedures, 424 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-03-03 10:49:26,740 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-03 10:49:26,746 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;@3171f7f8, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-03 10:49:26,747 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-03-03 10:49:26,750 INFO L276 IsEmpty]: Start isEmpty. Operand has 424 states, 422 states have (on average 1.7748815165876777) internal successors, (749), 423 states have internal predecessors, (749), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 10:49:26,754 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2025-03-03 10:49:26,754 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 10:49:26,754 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] [2025-03-03 10:49:26,754 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 10:49:26,760 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 10:49:26,760 INFO L85 PathProgramCache]: Analyzing trace with hash 916857806, now seen corresponding path program 1 times [2025-03-03 10:49:26,765 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 10:49:26,765 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [991901403] [2025-03-03 10:49:26,766 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 10:49:26,766 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 10:49:26,814 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 55 statements into 1 equivalence classes. [2025-03-03 10:49:26,854 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 55 of 55 statements. [2025-03-03 10:49:26,854 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 10:49:26,854 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 10:49:27,069 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 10:49:27,069 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 10:49:27,071 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [991901403] [2025-03-03 10:49:27,071 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [991901403] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 10:49:27,072 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 10:49:27,072 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-03 10:49:27,073 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1867272660] [2025-03-03 10:49:27,073 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 10:49:27,075 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-03 10:49:27,075 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 10:49:27,090 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-03 10:49:27,090 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 10:49:27,092 INFO L87 Difference]: Start difference. First operand has 424 states, 422 states have (on average 1.7748815165876777) internal successors, (749), 423 states have internal predecessors, (749), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 3 states, 3 states have (on average 18.333333333333332) internal successors, (55), 2 states have internal predecessors, (55), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 10:49:28,540 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 10:49:28,541 INFO L93 Difference]: Finished difference Result 1155 states and 2103 transitions. [2025-03-03 10:49:28,542 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-03 10:49:28,543 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 18.333333333333332) internal successors, (55), 2 states have internal predecessors, (55), 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 55 [2025-03-03 10:49:28,543 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 10:49:28,554 INFO L225 Difference]: With dead ends: 1155 [2025-03-03 10:49:28,554 INFO L226 Difference]: Without dead ends: 667 [2025-03-03 10:49:28,557 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 10:49:28,559 INFO L435 NwaCegarLoop]: 328 mSDtfsCounter, 289 mSDsluCounter, 42 mSDsCounter, 0 mSdLazyCounter, 899 mSolverCounterSat, 345 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 289 SdHoareTripleChecker+Valid, 370 SdHoareTripleChecker+Invalid, 1244 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 345 IncrementalHoareTripleChecker+Valid, 899 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.4s IncrementalHoareTripleChecker+Time [2025-03-03 10:49:28,560 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [289 Valid, 370 Invalid, 1244 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [345 Valid, 899 Invalid, 0 Unknown, 0 Unchecked, 1.4s Time] [2025-03-03 10:49:28,575 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 667 states. [2025-03-03 10:49:28,607 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 667 to 665. [2025-03-03 10:49:28,611 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 665 states, 664 states have (on average 1.4789156626506024) internal successors, (982), 664 states have internal predecessors, (982), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 10:49:28,616 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 665 states to 665 states and 982 transitions. [2025-03-03 10:49:28,617 INFO L78 Accepts]: Start accepts. Automaton has 665 states and 982 transitions. Word has length 55 [2025-03-03 10:49:28,617 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 10:49:28,617 INFO L471 AbstractCegarLoop]: Abstraction has 665 states and 982 transitions. [2025-03-03 10:49:28,617 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 18.333333333333332) internal successors, (55), 2 states have internal predecessors, (55), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 10:49:28,617 INFO L276 IsEmpty]: Start isEmpty. Operand 665 states and 982 transitions. [2025-03-03 10:49:28,621 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 131 [2025-03-03 10:49:28,621 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 10:49:28,622 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 10:49:28,622 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-03-03 10:49:28,622 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 10:49:28,623 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 10:49:28,623 INFO L85 PathProgramCache]: Analyzing trace with hash 196703879, now seen corresponding path program 1 times [2025-03-03 10:49:28,623 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 10:49:28,623 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1829812724] [2025-03-03 10:49:28,623 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 10:49:28,623 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 10:49:28,645 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 130 statements into 1 equivalence classes. [2025-03-03 10:49:28,664 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 130 of 130 statements. [2025-03-03 10:49:28,665 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 10:49:28,665 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 10:49:28,845 INFO L134 CoverageAnalysis]: Checked inductivity of 52 backedges. 52 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 10:49:28,846 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 10:49:28,846 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1829812724] [2025-03-03 10:49:28,846 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1829812724] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 10:49:28,846 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 10:49:28,846 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-03 10:49:28,846 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1632017470] [2025-03-03 10:49:28,846 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 10:49:28,847 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-03 10:49:28,848 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 10:49:28,848 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-03 10:49:28,848 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 10:49:28,849 INFO L87 Difference]: Start difference. First operand 665 states and 982 transitions. Second operand has 3 states, 3 states have (on average 43.333333333333336) internal successors, (130), 2 states have internal predecessors, (130), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 10:49:30,223 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 10:49:30,224 INFO L93 Difference]: Finished difference Result 1953 states and 2893 transitions. [2025-03-03 10:49:30,228 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-03 10:49:30,228 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 43.333333333333336) internal successors, (130), 2 states have internal predecessors, (130), 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 130 [2025-03-03 10:49:30,228 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 10:49:30,232 INFO L225 Difference]: With dead ends: 1953 [2025-03-03 10:49:30,233 INFO L226 Difference]: Without dead ends: 1290 [2025-03-03 10:49:30,237 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 10:49:30,238 INFO L435 NwaCegarLoop]: 286 mSDtfsCounter, 257 mSDsluCounter, 37 mSDsCounter, 0 mSdLazyCounter, 1039 mSolverCounterSat, 210 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 257 SdHoareTripleChecker+Valid, 323 SdHoareTripleChecker+Invalid, 1249 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 210 IncrementalHoareTripleChecker+Valid, 1039 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.3s IncrementalHoareTripleChecker+Time [2025-03-03 10:49:30,238 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [257 Valid, 323 Invalid, 1249 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [210 Valid, 1039 Invalid, 0 Unknown, 0 Unchecked, 1.3s Time] [2025-03-03 10:49:30,241 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1290 states. [2025-03-03 10:49:30,272 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1290 to 1282. [2025-03-03 10:49:30,276 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1282 states, 1281 states have (on average 1.3989071038251366) internal successors, (1792), 1281 states have internal predecessors, (1792), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 10:49:30,280 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1282 states to 1282 states and 1792 transitions. [2025-03-03 10:49:30,281 INFO L78 Accepts]: Start accepts. Automaton has 1282 states and 1792 transitions. Word has length 130 [2025-03-03 10:49:30,281 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 10:49:30,283 INFO L471 AbstractCegarLoop]: Abstraction has 1282 states and 1792 transitions. [2025-03-03 10:49:30,283 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 43.333333333333336) internal successors, (130), 2 states have internal predecessors, (130), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 10:49:30,283 INFO L276 IsEmpty]: Start isEmpty. Operand 1282 states and 1792 transitions. [2025-03-03 10:49:30,284 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 135 [2025-03-03 10:49:30,285 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 10:49:30,285 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 10:49:30,285 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-03-03 10:49:30,285 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 10:49:30,285 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 10:49:30,285 INFO L85 PathProgramCache]: Analyzing trace with hash 1520932177, now seen corresponding path program 1 times [2025-03-03 10:49:30,289 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 10:49:30,290 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2132161802] [2025-03-03 10:49:30,290 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 10:49:30,290 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 10:49:30,306 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 134 statements into 1 equivalence classes. [2025-03-03 10:49:30,318 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 134 of 134 statements. [2025-03-03 10:49:30,319 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 10:49:30,319 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 10:49:30,462 INFO L134 CoverageAnalysis]: Checked inductivity of 52 backedges. 52 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 10:49:30,462 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 10:49:30,463 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2132161802] [2025-03-03 10:49:30,463 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2132161802] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 10:49:30,463 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 10:49:30,463 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-03 10:49:30,463 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [36679958] [2025-03-03 10:49:30,463 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 10:49:30,463 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-03 10:49:30,464 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 10:49:30,464 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-03 10:49:30,464 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 10:49:30,465 INFO L87 Difference]: Start difference. First operand 1282 states and 1792 transitions. Second operand has 3 states, 3 states have (on average 44.666666666666664) internal successors, (134), 2 states have internal predecessors, (134), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 10:49:31,592 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 10:49:31,593 INFO L93 Difference]: Finished difference Result 3766 states and 5264 transitions. [2025-03-03 10:49:31,594 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-03 10:49:31,594 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 44.666666666666664) internal successors, (134), 2 states have internal predecessors, (134), 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 134 [2025-03-03 10:49:31,594 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 10:49:31,602 INFO L225 Difference]: With dead ends: 3766 [2025-03-03 10:49:31,602 INFO L226 Difference]: Without dead ends: 2486 [2025-03-03 10:49:31,604 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 10:49:31,604 INFO L435 NwaCegarLoop]: 271 mSDtfsCounter, 271 mSDsluCounter, 67 mSDsCounter, 0 mSdLazyCounter, 791 mSolverCounterSat, 298 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 271 SdHoareTripleChecker+Valid, 338 SdHoareTripleChecker+Invalid, 1089 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 298 IncrementalHoareTripleChecker+Valid, 791 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2025-03-03 10:49:31,604 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [271 Valid, 338 Invalid, 1089 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [298 Valid, 791 Invalid, 0 Unknown, 0 Unchecked, 1.1s Time] [2025-03-03 10:49:31,607 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2486 states. [2025-03-03 10:49:31,665 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2486 to 2182. [2025-03-03 10:49:31,669 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2182 states, 2181 states have (on average 1.2824392480513527) internal successors, (2797), 2181 states have internal predecessors, (2797), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 10:49:31,674 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2182 states to 2182 states and 2797 transitions. [2025-03-03 10:49:31,675 INFO L78 Accepts]: Start accepts. Automaton has 2182 states and 2797 transitions. Word has length 134 [2025-03-03 10:49:31,675 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 10:49:31,675 INFO L471 AbstractCegarLoop]: Abstraction has 2182 states and 2797 transitions. [2025-03-03 10:49:31,675 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 44.666666666666664) internal successors, (134), 2 states have internal predecessors, (134), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 10:49:31,675 INFO L276 IsEmpty]: Start isEmpty. Operand 2182 states and 2797 transitions. [2025-03-03 10:49:31,677 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 252 [2025-03-03 10:49:31,681 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 10:49:31,681 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 10:49:31,681 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-03-03 10:49:31,681 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 10:49:31,682 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 10:49:31,682 INFO L85 PathProgramCache]: Analyzing trace with hash -1047697960, now seen corresponding path program 1 times [2025-03-03 10:49:31,682 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 10:49:31,682 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [662454978] [2025-03-03 10:49:31,682 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 10:49:31,682 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 10:49:31,709 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 251 statements into 1 equivalence classes. [2025-03-03 10:49:31,732 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 251 of 251 statements. [2025-03-03 10:49:31,733 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 10:49:31,733 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 10:49:31,976 INFO L134 CoverageAnalysis]: Checked inductivity of 52 backedges. 52 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 10:49:31,977 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 10:49:31,977 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [662454978] [2025-03-03 10:49:31,977 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [662454978] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 10:49:31,977 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 10:49:31,977 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-03 10:49:31,978 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [952568662] [2025-03-03 10:49:31,978 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 10:49:31,978 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-03 10:49:31,978 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 10:49:31,979 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-03 10:49:31,979 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 10:49:31,979 INFO L87 Difference]: Start difference. First operand 2182 states and 2797 transitions. Second operand has 3 states, 3 states have (on average 83.66666666666667) internal successors, (251), 3 states have internal predecessors, (251), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 10:49:33,184 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 10:49:33,185 INFO L93 Difference]: Finished difference Result 5567 states and 7272 transitions. [2025-03-03 10:49:33,185 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-03 10:49:33,185 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 83.66666666666667) internal successors, (251), 3 states have internal predecessors, (251), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 251 [2025-03-03 10:49:33,186 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 10:49:33,194 INFO L225 Difference]: With dead ends: 5567 [2025-03-03 10:49:33,195 INFO L226 Difference]: Without dead ends: 3387 [2025-03-03 10:49:33,197 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 10:49:33,199 INFO L435 NwaCegarLoop]: 575 mSDtfsCounter, 273 mSDsluCounter, 39 mSDsCounter, 0 mSdLazyCounter, 878 mSolverCounterSat, 243 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 273 SdHoareTripleChecker+Valid, 614 SdHoareTripleChecker+Invalid, 1121 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 243 IncrementalHoareTripleChecker+Valid, 878 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.2s IncrementalHoareTripleChecker+Time [2025-03-03 10:49:33,200 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [273 Valid, 614 Invalid, 1121 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [243 Valid, 878 Invalid, 0 Unknown, 0 Unchecked, 1.2s Time] [2025-03-03 10:49:33,203 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3387 states. [2025-03-03 10:49:33,235 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3387 to 3385. [2025-03-03 10:49:33,239 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3385 states, 3384 states have (on average 1.2166075650118204) internal successors, (4117), 3384 states have internal predecessors, (4117), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 10:49:33,245 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3385 states to 3385 states and 4117 transitions. [2025-03-03 10:49:33,246 INFO L78 Accepts]: Start accepts. Automaton has 3385 states and 4117 transitions. Word has length 251 [2025-03-03 10:49:33,246 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 10:49:33,246 INFO L471 AbstractCegarLoop]: Abstraction has 3385 states and 4117 transitions. [2025-03-03 10:49:33,247 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 83.66666666666667) internal successors, (251), 3 states have internal predecessors, (251), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 10:49:33,247 INFO L276 IsEmpty]: Start isEmpty. Operand 3385 states and 4117 transitions. [2025-03-03 10:49:33,249 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 326 [2025-03-03 10:49:33,249 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 10:49:33,250 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 10:49:33,250 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-03-03 10:49:33,250 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 10:49:33,250 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 10:49:33,251 INFO L85 PathProgramCache]: Analyzing trace with hash 922986180, now seen corresponding path program 1 times [2025-03-03 10:49:33,251 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 10:49:33,251 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1537829457] [2025-03-03 10:49:33,251 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 10:49:33,251 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 10:49:33,285 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 325 statements into 1 equivalence classes. [2025-03-03 10:49:33,308 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 325 of 325 statements. [2025-03-03 10:49:33,309 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 10:49:33,309 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 10:49:33,550 INFO L134 CoverageAnalysis]: Checked inductivity of 52 backedges. 52 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 10:49:33,551 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 10:49:33,551 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1537829457] [2025-03-03 10:49:33,551 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1537829457] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 10:49:33,551 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 10:49:33,551 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-03 10:49:33,551 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [689860749] [2025-03-03 10:49:33,551 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 10:49:33,552 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-03 10:49:33,552 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 10:49:33,553 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-03 10:49:33,553 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 10:49:33,553 INFO L87 Difference]: Start difference. First operand 3385 states and 4117 transitions. Second operand has 3 states, 3 states have (on average 108.33333333333333) internal successors, (325), 3 states have internal predecessors, (325), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 10:49:34,756 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 10:49:34,756 INFO L93 Difference]: Finished difference Result 7972 states and 9913 transitions. [2025-03-03 10:49:34,756 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-03 10:49:34,757 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 108.33333333333333) internal successors, (325), 3 states have internal predecessors, (325), 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 325 [2025-03-03 10:49:34,757 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 10:49:34,768 INFO L225 Difference]: With dead ends: 7972 [2025-03-03 10:49:34,768 INFO L226 Difference]: Without dead ends: 4589 [2025-03-03 10:49:34,771 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 10:49:34,773 INFO L435 NwaCegarLoop]: 593 mSDtfsCounter, 274 mSDsluCounter, 38 mSDsCounter, 0 mSdLazyCounter, 925 mSolverCounterSat, 217 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 274 SdHoareTripleChecker+Valid, 631 SdHoareTripleChecker+Invalid, 1142 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 217 IncrementalHoareTripleChecker+Valid, 925 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2025-03-03 10:49:34,773 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [274 Valid, 631 Invalid, 1142 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [217 Valid, 925 Invalid, 0 Unknown, 0 Unchecked, 1.1s Time] [2025-03-03 10:49:34,776 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4589 states. [2025-03-03 10:49:34,810 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4589 to 4285. [2025-03-03 10:49:34,815 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4285 states, 4284 states have (on average 1.199813258636788) internal successors, (5140), 4284 states have internal predecessors, (5140), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 10:49:34,821 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4285 states to 4285 states and 5140 transitions. [2025-03-03 10:49:34,822 INFO L78 Accepts]: Start accepts. Automaton has 4285 states and 5140 transitions. Word has length 325 [2025-03-03 10:49:34,822 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 10:49:34,822 INFO L471 AbstractCegarLoop]: Abstraction has 4285 states and 5140 transitions. [2025-03-03 10:49:34,822 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 108.33333333333333) internal successors, (325), 3 states have internal predecessors, (325), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 10:49:34,822 INFO L276 IsEmpty]: Start isEmpty. Operand 4285 states and 5140 transitions. [2025-03-03 10:49:34,829 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 416 [2025-03-03 10:49:34,829 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 10:49:34,830 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2025-03-03 10:49:34,830 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-03-03 10:49:34,830 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 10:49:34,830 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 10:49:34,830 INFO L85 PathProgramCache]: Analyzing trace with hash -1937679893, now seen corresponding path program 1 times [2025-03-03 10:49:34,831 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 10:49:34,831 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2004139495] [2025-03-03 10:49:34,831 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 10:49:34,831 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 10:49:34,863 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 415 statements into 1 equivalence classes. [2025-03-03 10:49:34,878 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 415 of 415 statements. [2025-03-03 10:49:34,878 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 10:49:34,878 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 10:49:35,454 INFO L134 CoverageAnalysis]: Checked inductivity of 268 backedges. 215 proven. 0 refuted. 0 times theorem prover too weak. 53 trivial. 0 not checked. [2025-03-03 10:49:35,455 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 10:49:35,455 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2004139495] [2025-03-03 10:49:35,455 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2004139495] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 10:49:35,455 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 10:49:35,455 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-03 10:49:35,455 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1788981980] [2025-03-03 10:49:35,455 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 10:49:35,456 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-03 10:49:35,456 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 10:49:35,456 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-03 10:49:35,458 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 10:49:35,458 INFO L87 Difference]: Start difference. First operand 4285 states and 5140 transitions. Second operand has 3 states, 3 states have (on average 121.0) internal successors, (363), 2 states have internal predecessors, (363), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 10:49:36,592 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 10:49:36,592 INFO L93 Difference]: Finished difference Result 8867 states and 10589 transitions. [2025-03-03 10:49:36,592 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-03 10:49:36,593 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 121.0) internal successors, (363), 2 states have internal predecessors, (363), 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 415 [2025-03-03 10:49:36,593 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 10:49:36,602 INFO L225 Difference]: With dead ends: 8867 [2025-03-03 10:49:36,602 INFO L226 Difference]: Without dead ends: 4584 [2025-03-03 10:49:36,605 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 10:49:36,606 INFO L435 NwaCegarLoop]: 319 mSDtfsCounter, 105 mSDsluCounter, 35 mSDsCounter, 0 mSdLazyCounter, 883 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 105 SdHoareTripleChecker+Valid, 354 SdHoareTripleChecker+Invalid, 888 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 883 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2025-03-03 10:49:36,606 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [105 Valid, 354 Invalid, 888 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 883 Invalid, 0 Unknown, 0 Unchecked, 1.1s Time] [2025-03-03 10:49:36,611 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4584 states. [2025-03-03 10:49:36,645 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4584 to 4584. [2025-03-03 10:49:36,650 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4584 states, 4583 states have (on average 1.1880864062840935) internal successors, (5445), 4583 states have internal predecessors, (5445), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 10:49:36,656 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4584 states to 4584 states and 5445 transitions. [2025-03-03 10:49:36,657 INFO L78 Accepts]: Start accepts. Automaton has 4584 states and 5445 transitions. Word has length 415 [2025-03-03 10:49:36,658 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 10:49:36,658 INFO L471 AbstractCegarLoop]: Abstraction has 4584 states and 5445 transitions. [2025-03-03 10:49:36,658 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 121.0) internal successors, (363), 2 states have internal predecessors, (363), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 10:49:36,658 INFO L276 IsEmpty]: Start isEmpty. Operand 4584 states and 5445 transitions. [2025-03-03 10:49:36,664 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 507 [2025-03-03 10:49:36,664 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 10:49:36,665 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, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 10:49:36,665 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-03-03 10:49:36,666 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 10:49:36,666 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 10:49:36,666 INFO L85 PathProgramCache]: Analyzing trace with hash 1777821777, now seen corresponding path program 1 times [2025-03-03 10:49:36,666 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 10:49:36,666 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1850044710] [2025-03-03 10:49:36,666 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 10:49:36,666 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 10:49:36,700 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 506 statements into 1 equivalence classes. [2025-03-03 10:49:36,729 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 506 of 506 statements. [2025-03-03 10:49:36,729 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 10:49:36,729 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 10:49:36,996 INFO L134 CoverageAnalysis]: Checked inductivity of 502 backedges. 158 proven. 0 refuted. 0 times theorem prover too weak. 344 trivial. 0 not checked. [2025-03-03 10:49:36,997 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 10:49:36,997 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1850044710] [2025-03-03 10:49:36,997 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1850044710] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 10:49:36,997 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 10:49:36,997 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-03 10:49:36,997 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1364288662] [2025-03-03 10:49:36,997 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 10:49:36,998 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-03 10:49:36,998 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 10:49:36,998 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-03 10:49:36,998 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 10:49:36,998 INFO L87 Difference]: Start difference. First operand 4584 states and 5445 transitions. Second operand has 3 states, 3 states have (on average 84.66666666666667) internal successors, (254), 3 states have internal predecessors, (254), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 10:49:38,176 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 10:49:38,176 INFO L93 Difference]: Finished difference Result 10066 states and 12254 transitions. [2025-03-03 10:49:38,177 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-03 10:49:38,177 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 84.66666666666667) internal successors, (254), 3 states have internal predecessors, (254), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 506 [2025-03-03 10:49:38,177 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 10:49:38,190 INFO L225 Difference]: With dead ends: 10066 [2025-03-03 10:49:38,190 INFO L226 Difference]: Without dead ends: 5783 [2025-03-03 10:49:38,193 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 10:49:38,195 INFO L435 NwaCegarLoop]: 570 mSDtfsCounter, 276 mSDsluCounter, 39 mSDsCounter, 0 mSdLazyCounter, 880 mSolverCounterSat, 227 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 276 SdHoareTripleChecker+Valid, 609 SdHoareTripleChecker+Invalid, 1107 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 227 IncrementalHoareTripleChecker+Valid, 880 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2025-03-03 10:49:38,195 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [276 Valid, 609 Invalid, 1107 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [227 Valid, 880 Invalid, 0 Unknown, 0 Unchecked, 1.1s Time] [2025-03-03 10:49:38,200 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5783 states. [2025-03-03 10:49:38,254 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5783 to 5782. [2025-03-03 10:49:38,260 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5782 states, 5781 states have (on average 1.1674450787061061) internal successors, (6749), 5781 states have internal predecessors, (6749), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 10:49:38,273 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5782 states to 5782 states and 6749 transitions. [2025-03-03 10:49:38,274 INFO L78 Accepts]: Start accepts. Automaton has 5782 states and 6749 transitions. Word has length 506 [2025-03-03 10:49:38,274 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 10:49:38,275 INFO L471 AbstractCegarLoop]: Abstraction has 5782 states and 6749 transitions. [2025-03-03 10:49:38,275 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 84.66666666666667) internal successors, (254), 3 states have internal predecessors, (254), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 10:49:38,275 INFO L276 IsEmpty]: Start isEmpty. Operand 5782 states and 6749 transitions. [2025-03-03 10:49:38,280 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 515 [2025-03-03 10:49:38,280 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 10:49:38,280 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, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2025-03-03 10:49:38,281 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-03-03 10:49:38,281 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 10:49:38,281 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 10:49:38,281 INFO L85 PathProgramCache]: Analyzing trace with hash 1532991760, now seen corresponding path program 1 times [2025-03-03 10:49:38,281 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 10:49:38,282 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [812579371] [2025-03-03 10:49:38,282 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 10:49:38,282 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 10:49:38,347 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 514 statements into 1 equivalence classes. [2025-03-03 10:49:38,384 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 514 of 514 statements. [2025-03-03 10:49:38,384 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 10:49:38,384 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 10:49:38,592 INFO L134 CoverageAnalysis]: Checked inductivity of 293 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 293 trivial. 0 not checked. [2025-03-03 10:49:38,592 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 10:49:38,592 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [812579371] [2025-03-03 10:49:38,592 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [812579371] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 10:49:38,592 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 10:49:38,592 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-03 10:49:38,592 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2088038511] [2025-03-03 10:49:38,592 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 10:49:38,593 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-03 10:49:38,593 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 10:49:38,593 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-03 10:49:38,593 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 10:49:38,593 INFO L87 Difference]: Start difference. First operand 5782 states and 6749 transitions. Second operand has 3 states, 3 states have (on average 91.66666666666667) internal successors, (275), 2 states have internal predecessors, (275), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 10:49:39,736 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 10:49:39,736 INFO L93 Difference]: Finished difference Result 14561 states and 17101 transitions. [2025-03-03 10:49:39,736 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-03 10:49:39,737 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 91.66666666666667) internal successors, (275), 2 states have internal predecessors, (275), 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 514 [2025-03-03 10:49:39,737 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 10:49:39,757 INFO L225 Difference]: With dead ends: 14561 [2025-03-03 10:49:39,757 INFO L226 Difference]: Without dead ends: 9080 [2025-03-03 10:49:39,762 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 10:49:39,762 INFO L435 NwaCegarLoop]: 304 mSDtfsCounter, 42 mSDsluCounter, 43 mSDsCounter, 0 mSdLazyCounter, 942 mSolverCounterSat, 195 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 42 SdHoareTripleChecker+Valid, 347 SdHoareTripleChecker+Invalid, 1137 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 195 IncrementalHoareTripleChecker+Valid, 942 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2025-03-03 10:49:39,763 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [42 Valid, 347 Invalid, 1137 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [195 Valid, 942 Invalid, 0 Unknown, 0 Unchecked, 1.1s Time] [2025-03-03 10:49:39,768 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9080 states. [2025-03-03 10:49:39,825 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9080 to 9077. [2025-03-03 10:49:39,834 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9077 states, 9076 states have (on average 1.135962979286029) internal successors, (10310), 9076 states have internal predecessors, (10310), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 10:49:39,845 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9077 states to 9077 states and 10310 transitions. [2025-03-03 10:49:39,846 INFO L78 Accepts]: Start accepts. Automaton has 9077 states and 10310 transitions. Word has length 514 [2025-03-03 10:49:39,847 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 10:49:39,847 INFO L471 AbstractCegarLoop]: Abstraction has 9077 states and 10310 transitions. [2025-03-03 10:49:39,847 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 91.66666666666667) internal successors, (275), 2 states have internal predecessors, (275), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 10:49:39,847 INFO L276 IsEmpty]: Start isEmpty. Operand 9077 states and 10310 transitions. [2025-03-03 10:49:39,852 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 530 [2025-03-03 10:49:39,853 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 10:49:39,853 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, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 10:49:39,853 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-03-03 10:49:39,854 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 10:49:39,854 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 10:49:39,854 INFO L85 PathProgramCache]: Analyzing trace with hash -315818613, now seen corresponding path program 1 times [2025-03-03 10:49:39,854 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 10:49:39,854 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1706452448] [2025-03-03 10:49:39,855 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 10:49:39,855 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 10:49:39,889 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 529 statements into 1 equivalence classes. [2025-03-03 10:49:39,913 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 529 of 529 statements. [2025-03-03 10:49:39,913 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 10:49:39,913 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 10:49:40,113 INFO L134 CoverageAnalysis]: Checked inductivity of 457 backedges. 158 proven. 0 refuted. 0 times theorem prover too weak. 299 trivial. 0 not checked. [2025-03-03 10:49:40,113 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 10:49:40,114 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1706452448] [2025-03-03 10:49:40,114 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1706452448] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 10:49:40,114 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 10:49:40,114 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-03 10:49:40,114 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1050402661] [2025-03-03 10:49:40,114 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 10:49:40,114 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-03 10:49:40,114 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 10:49:40,115 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-03 10:49:40,115 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 10:49:40,115 INFO L87 Difference]: Start difference. First operand 9077 states and 10310 transitions. Second operand has 3 states, 3 states have (on average 109.33333333333333) internal successors, (328), 3 states have internal predecessors, (328), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 10:49:41,686 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 10:49:41,686 INFO L93 Difference]: Finished difference Result 20238 states and 23258 transitions. [2025-03-03 10:49:41,687 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-03 10:49:41,687 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 109.33333333333333) internal successors, (328), 3 states have internal predecessors, (328), 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 529 [2025-03-03 10:49:41,687 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 10:49:41,704 INFO L225 Difference]: With dead ends: 20238 [2025-03-03 10:49:41,704 INFO L226 Difference]: Without dead ends: 11462 [2025-03-03 10:49:41,711 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 10:49:41,711 INFO L435 NwaCegarLoop]: 238 mSDtfsCounter, 281 mSDsluCounter, 35 mSDsCounter, 0 mSdLazyCounter, 959 mSolverCounterSat, 197 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 281 SdHoareTripleChecker+Valid, 273 SdHoareTripleChecker+Invalid, 1156 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 197 IncrementalHoareTripleChecker+Valid, 959 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.5s IncrementalHoareTripleChecker+Time [2025-03-03 10:49:41,711 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [281 Valid, 273 Invalid, 1156 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [197 Valid, 959 Invalid, 0 Unknown, 0 Unchecked, 1.5s Time] [2025-03-03 10:49:41,717 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11462 states. [2025-03-03 10:49:41,768 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11462 to 8169. [2025-03-03 10:49:41,775 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8169 states, 8168 states have (on average 1.1606268364348677) internal successors, (9480), 8168 states have internal predecessors, (9480), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 10:49:41,782 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8169 states to 8169 states and 9480 transitions. [2025-03-03 10:49:41,783 INFO L78 Accepts]: Start accepts. Automaton has 8169 states and 9480 transitions. Word has length 529 [2025-03-03 10:49:41,783 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 10:49:41,783 INFO L471 AbstractCegarLoop]: Abstraction has 8169 states and 9480 transitions. [2025-03-03 10:49:41,784 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 109.33333333333333) internal successors, (328), 3 states have internal predecessors, (328), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 10:49:41,784 INFO L276 IsEmpty]: Start isEmpty. Operand 8169 states and 9480 transitions. [2025-03-03 10:49:41,788 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 583 [2025-03-03 10:49:41,788 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 10:49:41,789 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, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 10:49:41,789 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-03-03 10:49:41,789 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 10:49:41,789 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 10:49:41,790 INFO L85 PathProgramCache]: Analyzing trace with hash -1027551404, now seen corresponding path program 1 times [2025-03-03 10:49:41,790 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 10:49:41,790 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1117325191] [2025-03-03 10:49:41,790 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 10:49:41,790 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 10:49:41,826 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 582 statements into 1 equivalence classes. [2025-03-03 10:49:41,857 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 582 of 582 statements. [2025-03-03 10:49:41,858 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 10:49:41,858 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 10:49:42,130 INFO L134 CoverageAnalysis]: Checked inductivity of 520 backedges. 414 proven. 0 refuted. 0 times theorem prover too weak. 106 trivial. 0 not checked. [2025-03-03 10:49:42,131 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 10:49:42,131 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1117325191] [2025-03-03 10:49:42,131 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1117325191] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 10:49:42,131 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 10:49:42,131 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-03 10:49:42,131 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1375859889] [2025-03-03 10:49:42,131 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 10:49:42,132 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-03 10:49:42,132 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 10:49:42,132 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-03 10:49:42,132 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 10:49:42,133 INFO L87 Difference]: Start difference. First operand 8169 states and 9480 transitions. Second operand has 3 states, 3 states have (on average 159.0) internal successors, (477), 3 states have internal predecessors, (477), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 10:49:43,329 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 10:49:43,329 INFO L93 Difference]: Finished difference Result 19924 states and 23317 transitions. [2025-03-03 10:49:43,330 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-03 10:49:43,330 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 159.0) internal successors, (477), 3 states have internal predecessors, (477), 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 582 [2025-03-03 10:49:43,330 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 10:49:43,353 INFO L225 Difference]: With dead ends: 19924 [2025-03-03 10:49:43,354 INFO L226 Difference]: Without dead ends: 12056 [2025-03-03 10:49:43,359 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 10:49:43,359 INFO L435 NwaCegarLoop]: 209 mSDtfsCounter, 209 mSDsluCounter, 29 mSDsCounter, 0 mSdLazyCounter, 1003 mSolverCounterSat, 183 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 209 SdHoareTripleChecker+Valid, 238 SdHoareTripleChecker+Invalid, 1186 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 183 IncrementalHoareTripleChecker+Valid, 1003 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2025-03-03 10:49:43,359 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [209 Valid, 238 Invalid, 1186 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [183 Valid, 1003 Invalid, 0 Unknown, 0 Unchecked, 1.1s Time] [2025-03-03 10:49:43,366 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12056 states. [2025-03-03 10:49:43,455 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12056 to 10262. [2025-03-03 10:49:43,464 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10262 states, 10261 states have (on average 1.1758113244323165) internal successors, (12065), 10261 states have internal predecessors, (12065), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 10:49:43,476 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10262 states to 10262 states and 12065 transitions. [2025-03-03 10:49:43,477 INFO L78 Accepts]: Start accepts. Automaton has 10262 states and 12065 transitions. Word has length 582 [2025-03-03 10:49:43,477 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 10:49:43,478 INFO L471 AbstractCegarLoop]: Abstraction has 10262 states and 12065 transitions. [2025-03-03 10:49:43,478 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 159.0) internal successors, (477), 3 states have internal predecessors, (477), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 10:49:43,478 INFO L276 IsEmpty]: Start isEmpty. Operand 10262 states and 12065 transitions. [2025-03-03 10:49:43,485 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 583 [2025-03-03 10:49:43,485 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 10:49:43,485 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, 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, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2025-03-03 10:49:43,485 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-03-03 10:49:43,486 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 10:49:43,486 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 10:49:43,486 INFO L85 PathProgramCache]: Analyzing trace with hash 1018080934, now seen corresponding path program 1 times [2025-03-03 10:49:43,486 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 10:49:43,486 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [255599601] [2025-03-03 10:49:43,486 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 10:49:43,487 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 10:49:43,540 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 582 statements into 1 equivalence classes. [2025-03-03 10:49:43,557 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 582 of 582 statements. [2025-03-03 10:49:43,557 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 10:49:43,557 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 10:49:43,892 INFO L134 CoverageAnalysis]: Checked inductivity of 782 backedges. 561 proven. 39 refuted. 0 times theorem prover too weak. 182 trivial. 0 not checked. [2025-03-03 10:49:43,892 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 10:49:43,892 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [255599601] [2025-03-03 10:49:43,893 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [255599601] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-03 10:49:43,893 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [890632414] [2025-03-03 10:49:43,893 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 10:49:43,893 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 10:49:43,893 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 10:49:43,895 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-03 10:49:43,897 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2025-03-03 10:49:43,957 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 582 statements into 1 equivalence classes. [2025-03-03 10:49:44,042 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 582 of 582 statements. [2025-03-03 10:49:44,042 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 10:49:44,042 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 10:49:44,046 INFO L256 TraceCheckSpWp]: Trace formula consists of 712 conjuncts, 7 conjuncts are in the unsatisfiable core [2025-03-03 10:49:44,061 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 10:49:44,748 INFO L134 CoverageAnalysis]: Checked inductivity of 782 backedges. 561 proven. 39 refuted. 0 times theorem prover too weak. 182 trivial. 0 not checked. [2025-03-03 10:49:44,748 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-03 10:49:45,290 INFO L134 CoverageAnalysis]: Checked inductivity of 782 backedges. 561 proven. 39 refuted. 0 times theorem prover too weak. 182 trivial. 0 not checked. [2025-03-03 10:49:45,290 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [890632414] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-03 10:49:45,290 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-03 10:49:45,290 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 8 [2025-03-03 10:49:45,290 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2072075633] [2025-03-03 10:49:45,290 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-03 10:49:45,291 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-03-03 10:49:45,291 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 10:49:45,292 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-03-03 10:49:45,292 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=44, Unknown=0, NotChecked=0, Total=72 [2025-03-03 10:49:45,292 INFO L87 Difference]: Start difference. First operand 10262 states and 12065 transitions. Second operand has 9 states, 9 states have (on average 82.55555555555556) internal successors, (743), 8 states have internal predecessors, (743), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 10:49:49,186 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 10:49:49,186 INFO L93 Difference]: Finished difference Result 28556 states and 33041 transitions. [2025-03-03 10:49:49,186 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2025-03-03 10:49:49,187 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 82.55555555555556) internal successors, (743), 8 states have internal predecessors, (743), 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 582 [2025-03-03 10:49:49,187 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 10:49:49,223 INFO L225 Difference]: With dead ends: 28556 [2025-03-03 10:49:49,223 INFO L226 Difference]: Without dead ends: 13850 [2025-03-03 10:49:49,235 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 1173 GetRequests, 1159 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 41 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=89, Invalid=151, Unknown=0, NotChecked=0, Total=240 [2025-03-03 10:49:49,236 INFO L435 NwaCegarLoop]: 102 mSDtfsCounter, 2889 mSDsluCounter, 139 mSDsCounter, 0 mSdLazyCounter, 5585 mSolverCounterSat, 642 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2889 SdHoareTripleChecker+Valid, 241 SdHoareTripleChecker+Invalid, 6227 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 642 IncrementalHoareTripleChecker+Valid, 5585 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.6s IncrementalHoareTripleChecker+Time [2025-03-03 10:49:49,236 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2889 Valid, 241 Invalid, 6227 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [642 Valid, 5585 Invalid, 0 Unknown, 0 Unchecked, 3.6s Time] [2025-03-03 10:49:49,248 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13850 states. [2025-03-03 10:49:49,332 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13850 to 13250. [2025-03-03 10:49:49,343 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 13250 states, 13249 states have (on average 1.06415578534229) internal successors, (14099), 13249 states have internal predecessors, (14099), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 10:49:49,355 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13250 states to 13250 states and 14099 transitions. [2025-03-03 10:49:49,355 INFO L78 Accepts]: Start accepts. Automaton has 13250 states and 14099 transitions. Word has length 582 [2025-03-03 10:49:49,355 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 10:49:49,355 INFO L471 AbstractCegarLoop]: Abstraction has 13250 states and 14099 transitions. [2025-03-03 10:49:49,356 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 82.55555555555556) internal successors, (743), 8 states have internal predecessors, (743), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 10:49:49,356 INFO L276 IsEmpty]: Start isEmpty. Operand 13250 states and 14099 transitions. [2025-03-03 10:49:49,358 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 591 [2025-03-03 10:49:49,359 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 10:49:49,359 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, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 10:49:49,366 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-03 10:49:49,561 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable10 [2025-03-03 10:49:49,562 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 10:49:49,563 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 10:49:49,563 INFO L85 PathProgramCache]: Analyzing trace with hash 1675575525, now seen corresponding path program 1 times [2025-03-03 10:49:49,563 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 10:49:49,564 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1608301144] [2025-03-03 10:49:49,564 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 10:49:49,564 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 10:49:49,603 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 590 statements into 1 equivalence classes. [2025-03-03 10:49:49,632 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 590 of 590 statements. [2025-03-03 10:49:49,634 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 10:49:49,634 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 10:49:50,266 INFO L134 CoverageAnalysis]: Checked inductivity of 497 backedges. 256 proven. 53 refuted. 0 times theorem prover too weak. 188 trivial. 0 not checked. [2025-03-03 10:49:50,267 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 10:49:50,267 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1608301144] [2025-03-03 10:49:50,267 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1608301144] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-03 10:49:50,267 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [334399138] [2025-03-03 10:49:50,267 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 10:49:50,267 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 10:49:50,267 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 10:49:50,270 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-03 10:49:50,273 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2025-03-03 10:49:50,378 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 590 statements into 1 equivalence classes. [2025-03-03 10:49:50,479 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 590 of 590 statements. [2025-03-03 10:49:50,479 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 10:49:50,479 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 10:49:50,481 INFO L256 TraceCheckSpWp]: Trace formula consists of 700 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-03-03 10:49:50,488 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 10:49:51,066 INFO L134 CoverageAnalysis]: Checked inductivity of 497 backedges. 158 proven. 0 refuted. 0 times theorem prover too weak. 339 trivial. 0 not checked. [2025-03-03 10:49:51,066 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-03 10:49:51,066 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [334399138] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 10:49:51,066 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-03 10:49:51,066 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [5] total 7 [2025-03-03 10:49:51,066 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2130307594] [2025-03-03 10:49:51,066 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 10:49:51,067 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-03 10:49:51,067 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 10:49:51,067 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-03 10:49:51,067 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2025-03-03 10:49:51,067 INFO L87 Difference]: Start difference. First operand 13250 states and 14099 transitions. Second operand has 4 states, 4 states have (on average 82.0) internal successors, (328), 3 states have internal predecessors, (328), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 10:49:52,147 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 10:49:52,148 INFO L93 Difference]: Finished difference Result 39427 states and 42040 transitions. [2025-03-03 10:49:52,148 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-03 10:49:52,148 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 82.0) internal successors, (328), 3 states have internal predecessors, (328), 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 590 [2025-03-03 10:49:52,149 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 10:49:52,175 INFO L225 Difference]: With dead ends: 39427 [2025-03-03 10:49:52,175 INFO L226 Difference]: Without dead ends: 26478 [2025-03-03 10:49:52,189 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 594 GetRequests, 589 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2025-03-03 10:49:52,189 INFO L435 NwaCegarLoop]: 77 mSDtfsCounter, 602 mSDsluCounter, 73 mSDsCounter, 0 mSdLazyCounter, 1490 mSolverCounterSat, 102 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 602 SdHoareTripleChecker+Valid, 150 SdHoareTripleChecker+Invalid, 1592 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 102 IncrementalHoareTripleChecker+Valid, 1490 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2025-03-03 10:49:52,189 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [602 Valid, 150 Invalid, 1592 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [102 Valid, 1490 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2025-03-03 10:49:52,207 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26478 states. [2025-03-03 10:49:52,408 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26478 to 23180. [2025-03-03 10:49:52,427 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 23180 states, 23179 states have (on average 1.0659648820052634) internal successors, (24708), 23179 states have internal predecessors, (24708), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 10:49:52,452 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23180 states to 23180 states and 24708 transitions. [2025-03-03 10:49:52,452 INFO L78 Accepts]: Start accepts. Automaton has 23180 states and 24708 transitions. Word has length 590 [2025-03-03 10:49:52,453 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 10:49:52,453 INFO L471 AbstractCegarLoop]: Abstraction has 23180 states and 24708 transitions. [2025-03-03 10:49:52,453 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 82.0) internal successors, (328), 3 states have internal predecessors, (328), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 10:49:52,453 INFO L276 IsEmpty]: Start isEmpty. Operand 23180 states and 24708 transitions. [2025-03-03 10:49:52,459 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 685 [2025-03-03 10:49:52,459 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 10:49:52,460 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, 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, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2025-03-03 10:49:52,466 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2025-03-03 10:49:52,660 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,SelfDestructingSolverStorable11 [2025-03-03 10:49:52,660 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 10:49:52,661 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 10:49:52,661 INFO L85 PathProgramCache]: Analyzing trace with hash 937359630, now seen corresponding path program 1 times [2025-03-03 10:49:52,661 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 10:49:52,661 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2119052987] [2025-03-03 10:49:52,661 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 10:49:52,661 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 10:49:52,704 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 684 statements into 1 equivalence classes. [2025-03-03 10:49:52,736 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 684 of 684 statements. [2025-03-03 10:49:52,736 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 10:49:52,736 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 10:49:52,994 INFO L134 CoverageAnalysis]: Checked inductivity of 813 backedges. 474 proven. 0 refuted. 0 times theorem prover too weak. 339 trivial. 0 not checked. [2025-03-03 10:49:52,994 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 10:49:52,994 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2119052987] [2025-03-03 10:49:52,994 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2119052987] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 10:49:52,994 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 10:49:52,994 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-03 10:49:52,994 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1277615735] [2025-03-03 10:49:52,994 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 10:49:52,995 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-03 10:49:52,995 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 10:49:52,995 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-03 10:49:52,995 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 10:49:52,996 INFO L87 Difference]: Start difference. First operand 23180 states and 24708 transitions. Second operand has 3 states, 3 states have (on average 140.66666666666666) internal successors, (422), 3 states have internal predecessors, (422), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 10:49:53,813 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 10:49:53,813 INFO L93 Difference]: Finished difference Result 49040 states and 52433 transitions. [2025-03-03 10:49:53,813 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-03 10:49:53,814 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 140.66666666666666) internal successors, (422), 3 states have internal predecessors, (422), 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 684 [2025-03-03 10:49:53,814 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 10:49:53,838 INFO L225 Difference]: With dead ends: 49040 [2025-03-03 10:49:53,838 INFO L226 Difference]: Without dead ends: 27360 [2025-03-03 10:49:53,852 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 10:49:53,852 INFO L435 NwaCegarLoop]: 479 mSDtfsCounter, 227 mSDsluCounter, 38 mSDsCounter, 0 mSdLazyCounter, 731 mSolverCounterSat, 107 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 227 SdHoareTripleChecker+Valid, 517 SdHoareTripleChecker+Invalid, 838 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 107 IncrementalHoareTripleChecker+Valid, 731 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2025-03-03 10:49:53,852 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [227 Valid, 517 Invalid, 838 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [107 Valid, 731 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2025-03-03 10:49:53,867 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27360 states. [2025-03-03 10:49:54,016 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27360 to 26762. [2025-03-03 10:49:54,033 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 26762 states, 26761 states have (on average 1.057695900751093) internal successors, (28305), 26761 states have internal predecessors, (28305), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 10:49:54,056 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26762 states to 26762 states and 28305 transitions. [2025-03-03 10:49:54,056 INFO L78 Accepts]: Start accepts. Automaton has 26762 states and 28305 transitions. Word has length 684 [2025-03-03 10:49:54,057 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 10:49:54,057 INFO L471 AbstractCegarLoop]: Abstraction has 26762 states and 28305 transitions. [2025-03-03 10:49:54,057 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 140.66666666666666) internal successors, (422), 3 states have internal predecessors, (422), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 10:49:54,057 INFO L276 IsEmpty]: Start isEmpty. Operand 26762 states and 28305 transitions. [2025-03-03 10:49:54,065 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 731 [2025-03-03 10:49:54,065 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 10:49:54,066 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, 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, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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] [2025-03-03 10:49:54,066 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2025-03-03 10:49:54,066 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 10:49:54,066 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 10:49:54,066 INFO L85 PathProgramCache]: Analyzing trace with hash -1346354552, now seen corresponding path program 1 times [2025-03-03 10:49:54,066 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 10:49:54,066 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1502083777] [2025-03-03 10:49:54,066 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 10:49:54,067 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 10:49:54,105 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 730 statements into 1 equivalence classes. [2025-03-03 10:49:54,123 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 730 of 730 statements. [2025-03-03 10:49:54,123 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 10:49:54,124 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 10:49:54,309 INFO L134 CoverageAnalysis]: Checked inductivity of 1194 backedges. 678 proven. 0 refuted. 0 times theorem prover too weak. 516 trivial. 0 not checked. [2025-03-03 10:49:54,310 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 10:49:54,310 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1502083777] [2025-03-03 10:49:54,310 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1502083777] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 10:49:54,310 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 10:49:54,310 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-03 10:49:54,311 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [787557771] [2025-03-03 10:49:54,311 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 10:49:54,311 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-03 10:49:54,311 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 10:49:54,313 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-03 10:49:54,313 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 10:49:54,314 INFO L87 Difference]: Start difference. First operand 26762 states and 28305 transitions. Second operand has 3 states, 3 states have (on average 125.66666666666667) internal successors, (377), 3 states have internal predecessors, (377), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 10:49:54,960 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 10:49:54,961 INFO L93 Difference]: Finished difference Result 52022 states and 55029 transitions. [2025-03-03 10:49:54,962 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-03 10:49:54,962 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 125.66666666666667) internal successors, (377), 3 states have internal predecessors, (377), 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 730 [2025-03-03 10:49:54,962 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 10:49:54,984 INFO L225 Difference]: With dead ends: 52022 [2025-03-03 10:49:54,984 INFO L226 Difference]: Without dead ends: 26760 [2025-03-03 10:49:54,999 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 10:49:55,000 INFO L435 NwaCegarLoop]: 61 mSDtfsCounter, 434 mSDsluCounter, 5 mSDsCounter, 0 mSdLazyCounter, 723 mSolverCounterSat, 79 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 434 SdHoareTripleChecker+Valid, 66 SdHoareTripleChecker+Invalid, 802 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 79 IncrementalHoareTripleChecker+Valid, 723 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-03-03 10:49:55,000 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [434 Valid, 66 Invalid, 802 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [79 Valid, 723 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-03-03 10:49:55,017 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26760 states. [2025-03-03 10:49:55,164 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26760 to 26461. [2025-03-03 10:49:55,180 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 26461 states, 26460 states have (on average 1.0558578987150415) internal successors, (27938), 26460 states have internal predecessors, (27938), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 10:49:55,200 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26461 states to 26461 states and 27938 transitions. [2025-03-03 10:49:55,201 INFO L78 Accepts]: Start accepts. Automaton has 26461 states and 27938 transitions. Word has length 730 [2025-03-03 10:49:55,201 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 10:49:55,201 INFO L471 AbstractCegarLoop]: Abstraction has 26461 states and 27938 transitions. [2025-03-03 10:49:55,201 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 125.66666666666667) internal successors, (377), 3 states have internal predecessors, (377), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 10:49:55,201 INFO L276 IsEmpty]: Start isEmpty. Operand 26461 states and 27938 transitions. [2025-03-03 10:49:55,209 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 733 [2025-03-03 10:49:55,209 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 10:49:55,209 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, 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, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2025-03-03 10:49:55,209 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2025-03-03 10:49:55,209 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 10:49:55,209 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 10:49:55,210 INFO L85 PathProgramCache]: Analyzing trace with hash 142753179, now seen corresponding path program 1 times [2025-03-03 10:49:55,210 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 10:49:55,210 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [592593176] [2025-03-03 10:49:55,210 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 10:49:55,210 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 10:49:55,299 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 732 statements into 1 equivalence classes. [2025-03-03 10:49:55,349 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 732 of 732 statements. [2025-03-03 10:49:55,350 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 10:49:55,350 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 10:49:55,913 INFO L134 CoverageAnalysis]: Checked inductivity of 908 backedges. 802 proven. 0 refuted. 0 times theorem prover too weak. 106 trivial. 0 not checked. [2025-03-03 10:49:55,913 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 10:49:55,913 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [592593176] [2025-03-03 10:49:55,913 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [592593176] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 10:49:55,913 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 10:49:55,913 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-03 10:49:55,913 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1240056409] [2025-03-03 10:49:55,913 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 10:49:55,914 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-03 10:49:55,914 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 10:49:55,914 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-03 10:49:55,915 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-03-03 10:49:55,915 INFO L87 Difference]: Start difference. First operand 26461 states and 27938 transitions. Second operand has 4 states, 4 states have (on average 156.75) internal successors, (627), 4 states have internal predecessors, (627), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 10:49:57,063 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 10:49:57,063 INFO L93 Difference]: Finished difference Result 61028 states and 64444 transitions. [2025-03-03 10:49:57,063 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-03 10:49:57,063 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 156.75) internal successors, (627), 4 states have internal predecessors, (627), 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 732 [2025-03-03 10:49:57,064 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 10:49:57,092 INFO L225 Difference]: With dead ends: 61028 [2025-03-03 10:49:57,093 INFO L226 Difference]: Without dead ends: 36067 [2025-03-03 10:49:57,102 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-03 10:49:57,102 INFO L435 NwaCegarLoop]: 457 mSDtfsCounter, 368 mSDsluCounter, 50 mSDsCounter, 0 mSdLazyCounter, 1431 mSolverCounterSat, 164 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 368 SdHoareTripleChecker+Valid, 507 SdHoareTripleChecker+Invalid, 1595 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 164 IncrementalHoareTripleChecker+Valid, 1431 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2025-03-03 10:49:57,102 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [368 Valid, 507 Invalid, 1595 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [164 Valid, 1431 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2025-03-03 10:49:57,117 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 36067 states. [2025-03-03 10:49:57,284 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 36067 to 32770. [2025-03-03 10:49:57,302 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 32770 states, 32769 states have (on average 1.0487656016356923) internal successors, (34367), 32769 states have internal predecessors, (34367), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 10:49:57,326 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32770 states to 32770 states and 34367 transitions. [2025-03-03 10:49:57,327 INFO L78 Accepts]: Start accepts. Automaton has 32770 states and 34367 transitions. Word has length 732 [2025-03-03 10:49:57,327 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 10:49:57,327 INFO L471 AbstractCegarLoop]: Abstraction has 32770 states and 34367 transitions. [2025-03-03 10:49:57,327 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 156.75) internal successors, (627), 4 states have internal predecessors, (627), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 10:49:57,328 INFO L276 IsEmpty]: Start isEmpty. Operand 32770 states and 34367 transitions. [2025-03-03 10:49:57,334 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 741 [2025-03-03 10:49:57,334 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 10:49:57,334 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, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 10:49:57,334 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2025-03-03 10:49:57,334 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 10:49:57,335 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 10:49:57,335 INFO L85 PathProgramCache]: Analyzing trace with hash -749557328, now seen corresponding path program 1 times [2025-03-03 10:49:57,335 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 10:49:57,335 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1476953592] [2025-03-03 10:49:57,335 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 10:49:57,335 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 10:49:57,374 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 740 statements into 1 equivalence classes. [2025-03-03 10:49:57,398 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 740 of 740 statements. [2025-03-03 10:49:57,398 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 10:49:57,398 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 10:49:57,867 INFO L134 CoverageAnalysis]: Checked inductivity of 925 backedges. 586 proven. 0 refuted. 0 times theorem prover too weak. 339 trivial. 0 not checked. [2025-03-03 10:49:57,867 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 10:49:57,867 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1476953592] [2025-03-03 10:49:57,867 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1476953592] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 10:49:57,867 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 10:49:57,868 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-03 10:49:57,868 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1813130292] [2025-03-03 10:49:57,868 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 10:49:57,868 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-03 10:49:57,868 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 10:49:57,869 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-03 10:49:57,869 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 10:49:57,869 INFO L87 Difference]: Start difference. First operand 32770 states and 34367 transitions. Second operand has 3 states, 3 states have (on average 159.33333333333334) internal successors, (478), 3 states have internal predecessors, (478), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 10:49:58,571 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 10:49:58,571 INFO L93 Difference]: Finished difference Result 65247 states and 68443 transitions. [2025-03-03 10:49:58,571 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-03 10:49:58,571 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 159.33333333333334) internal successors, (478), 3 states have internal predecessors, (478), 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 740 [2025-03-03 10:49:58,572 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 10:49:58,600 INFO L225 Difference]: With dead ends: 65247 [2025-03-03 10:49:58,600 INFO L226 Difference]: Without dead ends: 32778 [2025-03-03 10:49:58,618 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 10:49:58,618 INFO L435 NwaCegarLoop]: 94 mSDtfsCounter, 226 mSDsluCounter, 13 mSDsCounter, 0 mSdLazyCounter, 728 mSolverCounterSat, 97 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 226 SdHoareTripleChecker+Valid, 107 SdHoareTripleChecker+Invalid, 825 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 97 IncrementalHoareTripleChecker+Valid, 728 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-03-03 10:49:58,619 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [226 Valid, 107 Invalid, 825 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [97 Valid, 728 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-03-03 10:49:58,636 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32778 states. [2025-03-03 10:49:58,798 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32778 to 32770. [2025-03-03 10:49:58,817 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 32770 states, 32769 states have (on average 1.046232719948732) internal successors, (34284), 32769 states have internal predecessors, (34284), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 10:49:58,842 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32770 states to 32770 states and 34284 transitions. [2025-03-03 10:49:58,843 INFO L78 Accepts]: Start accepts. Automaton has 32770 states and 34284 transitions. Word has length 740 [2025-03-03 10:49:58,843 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 10:49:58,843 INFO L471 AbstractCegarLoop]: Abstraction has 32770 states and 34284 transitions. [2025-03-03 10:49:58,844 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 159.33333333333334) internal successors, (478), 3 states have internal predecessors, (478), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 10:49:58,844 INFO L276 IsEmpty]: Start isEmpty. Operand 32770 states and 34284 transitions. [2025-03-03 10:49:58,850 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 747 [2025-03-03 10:49:58,850 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 10:49:58,850 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, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 10:49:58,850 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2025-03-03 10:49:58,850 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 10:49:58,851 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 10:49:58,851 INFO L85 PathProgramCache]: Analyzing trace with hash -296916886, now seen corresponding path program 1 times [2025-03-03 10:49:58,851 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 10:49:58,851 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1274953287] [2025-03-03 10:49:58,851 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 10:49:58,851 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 10:49:58,896 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 746 statements into 1 equivalence classes. [2025-03-03 10:49:58,922 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 746 of 746 statements. [2025-03-03 10:49:58,922 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 10:49:58,922 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 10:49:59,713 INFO L134 CoverageAnalysis]: Checked inductivity of 937 backedges. 563 proven. 188 refuted. 0 times theorem prover too weak. 186 trivial. 0 not checked. [2025-03-03 10:49:59,713 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 10:49:59,713 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1274953287] [2025-03-03 10:49:59,713 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1274953287] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-03 10:49:59,713 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1753685952] [2025-03-03 10:49:59,713 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 10:49:59,713 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 10:49:59,714 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 10:49:59,715 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-03 10:49:59,716 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2025-03-03 10:49:59,807 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 746 statements into 1 equivalence classes. [2025-03-03 10:49:59,915 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 746 of 746 statements. [2025-03-03 10:49:59,915 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 10:49:59,915 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 10:49:59,918 INFO L256 TraceCheckSpWp]: Trace formula consists of 882 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-03-03 10:49:59,924 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 10:50:03,529 INFO L134 CoverageAnalysis]: Checked inductivity of 937 backedges. 211 proven. 0 refuted. 0 times theorem prover too weak. 726 trivial. 0 not checked. [2025-03-03 10:50:03,529 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-03 10:50:03,529 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1753685952] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 10:50:03,529 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-03 10:50:03,529 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [4] total 6 [2025-03-03 10:50:03,529 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1181560457] [2025-03-03 10:50:03,529 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 10:50:03,530 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-03 10:50:03,530 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 10:50:03,530 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-03 10:50:03,530 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2025-03-03 10:50:03,530 INFO L87 Difference]: Start difference. First operand 32770 states and 34284 transitions. Second operand has 3 states, 3 states have (on average 110.33333333333333) internal successors, (331), 3 states have internal predecessors, (331), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 10:50:05,857 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 10:50:05,857 INFO L93 Difference]: Finished difference Result 69450 states and 72603 transitions. [2025-03-03 10:50:05,858 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-03 10:50:05,858 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 110.33333333333333) internal successors, (331), 3 states have internal predecessors, (331), 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 746 [2025-03-03 10:50:05,858 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 10:50:05,891 INFO L225 Difference]: With dead ends: 69450 [2025-03-03 10:50:05,891 INFO L226 Difference]: Without dead ends: 37881 [2025-03-03 10:50:05,910 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 749 GetRequests, 693 SyntacticMatches, 52 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2025-03-03 10:50:05,910 INFO L435 NwaCegarLoop]: 73 mSDtfsCounter, 308 mSDsluCounter, 16 mSDsCounter, 0 mSdLazyCounter, 782 mSolverCounterSat, 145 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 308 SdHoareTripleChecker+Valid, 89 SdHoareTripleChecker+Invalid, 927 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 145 IncrementalHoareTripleChecker+Valid, 782 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.1s IncrementalHoareTripleChecker+Time [2025-03-03 10:50:05,910 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [308 Valid, 89 Invalid, 927 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [145 Valid, 782 Invalid, 0 Unknown, 0 Unchecked, 2.1s Time] [2025-03-03 10:50:05,929 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 37881 states. [2025-03-03 10:50:06,164 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 37881 to 36069. [2025-03-03 10:50:06,189 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 36069 states, 36068 states have (on average 1.0420871686813795) internal successors, (37586), 36068 states have internal predecessors, (37586), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 10:50:06,221 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36069 states to 36069 states and 37586 transitions. [2025-03-03 10:50:06,221 INFO L78 Accepts]: Start accepts. Automaton has 36069 states and 37586 transitions. Word has length 746 [2025-03-03 10:50:06,222 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 10:50:06,222 INFO L471 AbstractCegarLoop]: Abstraction has 36069 states and 37586 transitions. [2025-03-03 10:50:06,222 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 110.33333333333333) internal successors, (331), 3 states have internal predecessors, (331), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 10:50:06,222 INFO L276 IsEmpty]: Start isEmpty. Operand 36069 states and 37586 transitions. [2025-03-03 10:50:06,235 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 866 [2025-03-03 10:50:06,235 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 10:50:06,235 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, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 10:50:06,242 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2025-03-03 10:50:06,436 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 10:50:06,436 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 10:50:06,437 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 10:50:06,437 INFO L85 PathProgramCache]: Analyzing trace with hash 1268210568, now seen corresponding path program 1 times [2025-03-03 10:50:06,437 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 10:50:06,437 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [951125825] [2025-03-03 10:50:06,437 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 10:50:06,437 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 10:50:06,557 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 865 statements into 1 equivalence classes. [2025-03-03 10:50:06,585 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 865 of 865 statements. [2025-03-03 10:50:06,585 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 10:50:06,585 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 10:50:07,426 INFO L134 CoverageAnalysis]: Checked inductivity of 1385 backedges. 803 proven. 0 refuted. 0 times theorem prover too weak. 582 trivial. 0 not checked. [2025-03-03 10:50:07,427 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 10:50:07,427 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [951125825] [2025-03-03 10:50:07,427 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [951125825] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 10:50:07,427 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 10:50:07,427 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-03 10:50:07,427 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [372063640] [2025-03-03 10:50:07,427 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 10:50:07,428 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-03 10:50:07,428 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 10:50:07,428 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-03 10:50:07,429 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-03 10:50:07,429 INFO L87 Difference]: Start difference. First operand 36069 states and 37586 transitions. Second operand has 4 states, 4 states have (on average 130.0) internal successors, (520), 4 states have internal predecessors, (520), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 10:50:08,408 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 10:50:08,408 INFO L93 Difference]: Finished difference Result 71838 states and 74852 transitions. [2025-03-03 10:50:08,409 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-03 10:50:08,409 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 130.0) internal successors, (520), 4 states have internal predecessors, (520), 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 865 [2025-03-03 10:50:08,409 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 10:50:08,440 INFO L225 Difference]: With dead ends: 71838 [2025-03-03 10:50:08,440 INFO L226 Difference]: Without dead ends: 37269 [2025-03-03 10:50:08,460 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-03-03 10:50:08,460 INFO L435 NwaCegarLoop]: 492 mSDtfsCounter, 244 mSDsluCounter, 194 mSDsCounter, 0 mSdLazyCounter, 1249 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 244 SdHoareTripleChecker+Valid, 686 SdHoareTripleChecker+Invalid, 1251 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 1249 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2025-03-03 10:50:08,460 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [244 Valid, 686 Invalid, 1251 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 1249 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2025-03-03 10:50:08,479 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 37269 states. [2025-03-03 10:50:08,790 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 37269 to 37265. [2025-03-03 10:50:08,816 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 37265 states, 37264 states have (on average 1.0409510519536282) internal successors, (38790), 37264 states have internal predecessors, (38790), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 10:50:08,849 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37265 states to 37265 states and 38790 transitions. [2025-03-03 10:50:08,849 INFO L78 Accepts]: Start accepts. Automaton has 37265 states and 38790 transitions. Word has length 865 [2025-03-03 10:50:08,850 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 10:50:08,850 INFO L471 AbstractCegarLoop]: Abstraction has 37265 states and 38790 transitions. [2025-03-03 10:50:08,850 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 130.0) internal successors, (520), 4 states have internal predecessors, (520), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 10:50:08,850 INFO L276 IsEmpty]: Start isEmpty. Operand 37265 states and 38790 transitions. [2025-03-03 10:50:08,865 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 896 [2025-03-03 10:50:08,865 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 10:50:08,865 INFO L218 NwaCegarLoop]: trace histogram [7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 10:50:08,865 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2025-03-03 10:50:08,866 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 10:50:08,866 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 10:50:08,866 INFO L85 PathProgramCache]: Analyzing trace with hash 1094458929, now seen corresponding path program 1 times [2025-03-03 10:50:08,866 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 10:50:08,866 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [63229182] [2025-03-03 10:50:08,866 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 10:50:08,867 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 10:50:08,911 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 895 statements into 1 equivalence classes. [2025-03-03 10:50:08,990 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 895 of 895 statements. [2025-03-03 10:50:08,990 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 10:50:08,990 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 10:50:09,315 INFO L134 CoverageAnalysis]: Checked inductivity of 1763 backedges. 1068 proven. 0 refuted. 0 times theorem prover too weak. 695 trivial. 0 not checked. [2025-03-03 10:50:09,315 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 10:50:09,315 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [63229182] [2025-03-03 10:50:09,315 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [63229182] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 10:50:09,315 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 10:50:09,315 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-03 10:50:09,316 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [255299004] [2025-03-03 10:50:09,316 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 10:50:09,316 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-03 10:50:09,316 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 10:50:09,316 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-03 10:50:09,317 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 10:50:09,317 INFO L87 Difference]: Start difference. First operand 37265 states and 38790 transitions. Second operand has 3 states, 3 states have (on average 156.0) internal successors, (468), 3 states have internal predecessors, (468), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 10:50:10,117 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 10:50:10,117 INFO L93 Difference]: Finished difference Result 72723 states and 75730 transitions. [2025-03-03 10:50:10,118 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-03 10:50:10,118 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 156.0) internal successors, (468), 3 states have internal predecessors, (468), 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 895 [2025-03-03 10:50:10,119 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 10:50:10,150 INFO L225 Difference]: With dead ends: 72723 [2025-03-03 10:50:10,151 INFO L226 Difference]: Without dead ends: 36958 [2025-03-03 10:50:10,169 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 10:50:10,170 INFO L435 NwaCegarLoop]: 435 mSDtfsCounter, 248 mSDsluCounter, 26 mSDsCounter, 0 mSdLazyCounter, 725 mSolverCounterSat, 111 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 248 SdHoareTripleChecker+Valid, 461 SdHoareTripleChecker+Invalid, 836 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 111 IncrementalHoareTripleChecker+Valid, 725 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-03-03 10:50:10,170 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [248 Valid, 461 Invalid, 836 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [111 Valid, 725 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-03-03 10:50:10,188 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 36958 states. [2025-03-03 10:50:10,413 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 36958 to 33966. [2025-03-03 10:50:10,437 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 33966 states, 33965 states have (on average 1.0389518622110996) internal successors, (35288), 33965 states have internal predecessors, (35288), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 10:50:10,464 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33966 states to 33966 states and 35288 transitions. [2025-03-03 10:50:10,465 INFO L78 Accepts]: Start accepts. Automaton has 33966 states and 35288 transitions. Word has length 895 [2025-03-03 10:50:10,465 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 10:50:10,465 INFO L471 AbstractCegarLoop]: Abstraction has 33966 states and 35288 transitions. [2025-03-03 10:50:10,466 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 156.0) internal successors, (468), 3 states have internal predecessors, (468), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 10:50:10,466 INFO L276 IsEmpty]: Start isEmpty. Operand 33966 states and 35288 transitions. [2025-03-03 10:50:10,478 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 901 [2025-03-03 10:50:10,478 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 10:50:10,479 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, 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, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 10:50:10,479 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2025-03-03 10:50:10,479 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 10:50:10,479 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 10:50:10,479 INFO L85 PathProgramCache]: Analyzing trace with hash -666025247, now seen corresponding path program 1 times [2025-03-03 10:50:10,480 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 10:50:10,480 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2033471314] [2025-03-03 10:50:10,480 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 10:50:10,480 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 10:50:10,577 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 900 statements into 1 equivalence classes. [2025-03-03 10:50:10,604 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 900 of 900 statements. [2025-03-03 10:50:10,604 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 10:50:10,604 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 10:50:12,017 INFO L134 CoverageAnalysis]: Checked inductivity of 1484 backedges. 871 proven. 531 refuted. 0 times theorem prover too weak. 82 trivial. 0 not checked. [2025-03-03 10:50:12,017 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 10:50:12,017 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2033471314] [2025-03-03 10:50:12,017 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2033471314] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-03 10:50:12,017 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1807123770] [2025-03-03 10:50:12,017 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 10:50:12,018 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 10:50:12,018 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 10:50:12,022 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-03 10:50:12,023 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2025-03-03 10:50:12,139 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 900 statements into 1 equivalence classes. [2025-03-03 10:50:12,265 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 900 of 900 statements. [2025-03-03 10:50:12,266 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 10:50:12,266 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 10:50:12,269 INFO L256 TraceCheckSpWp]: Trace formula consists of 1049 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-03-03 10:50:12,283 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 10:50:12,392 INFO L134 CoverageAnalysis]: Checked inductivity of 1484 backedges. 1092 proven. 0 refuted. 0 times theorem prover too weak. 392 trivial. 0 not checked. [2025-03-03 10:50:12,392 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-03 10:50:12,392 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1807123770] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 10:50:12,392 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-03 10:50:12,393 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [7] total 8 [2025-03-03 10:50:12,393 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [542681080] [2025-03-03 10:50:12,393 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 10:50:12,395 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-03 10:50:12,395 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 10:50:12,395 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-03 10:50:12,396 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2025-03-03 10:50:12,396 INFO L87 Difference]: Start difference. First operand 33966 states and 35288 transitions. Second operand has 3 states, 3 states have (on average 195.33333333333334) internal successors, (586), 3 states have internal predecessors, (586), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 10:50:13,190 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 10:50:13,191 INFO L93 Difference]: Finished difference Result 67325 states and 69946 transitions. [2025-03-03 10:50:13,191 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-03 10:50:13,191 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 195.33333333333334) internal successors, (586), 3 states have internal predecessors, (586), 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 900 [2025-03-03 10:50:13,192 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 10:50:13,226 INFO L225 Difference]: With dead ends: 67325 [2025-03-03 10:50:13,226 INFO L226 Difference]: Without dead ends: 33660 [2025-03-03 10:50:13,238 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 908 GetRequests, 902 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2025-03-03 10:50:13,239 INFO L435 NwaCegarLoop]: 437 mSDtfsCounter, 226 mSDsluCounter, 25 mSDsCounter, 0 mSdLazyCounter, 735 mSolverCounterSat, 74 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 226 SdHoareTripleChecker+Valid, 462 SdHoareTripleChecker+Invalid, 809 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 74 IncrementalHoareTripleChecker+Valid, 735 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-03-03 10:50:13,239 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [226 Valid, 462 Invalid, 809 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [74 Valid, 735 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-03-03 10:50:13,256 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33660 states. [2025-03-03 10:50:13,466 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33660 to 33660. [2025-03-03 10:50:13,487 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 33660 states, 33659 states have (on average 1.0324133218455689) internal successors, (34750), 33659 states have internal predecessors, (34750), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 10:50:13,515 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33660 states to 33660 states and 34750 transitions. [2025-03-03 10:50:13,516 INFO L78 Accepts]: Start accepts. Automaton has 33660 states and 34750 transitions. Word has length 900 [2025-03-03 10:50:13,517 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 10:50:13,517 INFO L471 AbstractCegarLoop]: Abstraction has 33660 states and 34750 transitions. [2025-03-03 10:50:13,517 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 195.33333333333334) internal successors, (586), 3 states have internal predecessors, (586), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 10:50:13,517 INFO L276 IsEmpty]: Start isEmpty. Operand 33660 states and 34750 transitions. [2025-03-03 10:50:13,531 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 920 [2025-03-03 10:50:13,531 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 10:50:13,532 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, 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, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 10:50:13,590 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2025-03-03 10:50:13,732 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 10:50:13,732 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 10:50:13,733 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 10:50:13,733 INFO L85 PathProgramCache]: Analyzing trace with hash -1022356581, now seen corresponding path program 1 times [2025-03-03 10:50:13,733 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 10:50:13,733 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2117583019] [2025-03-03 10:50:13,733 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 10:50:13,733 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 10:50:13,781 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 919 statements into 1 equivalence classes. [2025-03-03 10:50:13,811 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 919 of 919 statements. [2025-03-03 10:50:13,811 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 10:50:13,811 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 10:50:14,601 INFO L134 CoverageAnalysis]: Checked inductivity of 1560 backedges. 855 proven. 0 refuted. 0 times theorem prover too weak. 705 trivial. 0 not checked. [2025-03-03 10:50:14,602 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 10:50:14,602 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2117583019] [2025-03-03 10:50:14,602 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2117583019] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 10:50:14,602 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 10:50:14,602 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-03 10:50:14,602 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [532421655] [2025-03-03 10:50:14,602 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 10:50:14,602 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-03 10:50:14,602 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 10:50:14,603 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-03 10:50:14,603 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-03-03 10:50:14,603 INFO L87 Difference]: Start difference. First operand 33660 states and 34750 transitions. Second operand has 5 states, 5 states have (on average 104.4) internal successors, (522), 5 states have internal predecessors, (522), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 10:50:15,880 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 10:50:15,881 INFO L93 Difference]: Finished difference Result 69112 states and 71324 transitions. [2025-03-03 10:50:15,881 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-03 10:50:15,881 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 104.4) internal successors, (522), 5 states have internal predecessors, (522), 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 919 [2025-03-03 10:50:15,882 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 10:50:15,918 INFO L225 Difference]: With dead ends: 69112 [2025-03-03 10:50:15,918 INFO L226 Difference]: Without dead ends: 36951 [2025-03-03 10:50:15,930 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2025-03-03 10:50:15,931 INFO L435 NwaCegarLoop]: 469 mSDtfsCounter, 562 mSDsluCounter, 199 mSDsCounter, 0 mSdLazyCounter, 2169 mSolverCounterSat, 38 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 562 SdHoareTripleChecker+Valid, 668 SdHoareTripleChecker+Invalid, 2207 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 38 IncrementalHoareTripleChecker+Valid, 2169 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2025-03-03 10:50:15,932 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [562 Valid, 668 Invalid, 2207 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [38 Valid, 2169 Invalid, 0 Unknown, 0 Unchecked, 1.1s Time] [2025-03-03 10:50:15,950 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 36951 states. [2025-03-03 10:50:16,182 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 36951 to 32464. [2025-03-03 10:50:16,202 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 32464 states, 32463 states have (on average 1.0329606012999415) internal successors, (33533), 32463 states have internal predecessors, (33533), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 10:50:16,228 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32464 states to 32464 states and 33533 transitions. [2025-03-03 10:50:16,229 INFO L78 Accepts]: Start accepts. Automaton has 32464 states and 33533 transitions. Word has length 919 [2025-03-03 10:50:16,229 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 10:50:16,229 INFO L471 AbstractCegarLoop]: Abstraction has 32464 states and 33533 transitions. [2025-03-03 10:50:16,229 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 104.4) internal successors, (522), 5 states have internal predecessors, (522), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 10:50:16,229 INFO L276 IsEmpty]: Start isEmpty. Operand 32464 states and 33533 transitions. [2025-03-03 10:50:16,300 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1013 [2025-03-03 10:50:16,300 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 10:50:16,301 INFO L218 NwaCegarLoop]: trace histogram [8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 10:50:16,301 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2025-03-03 10:50:16,301 INFO L396 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 10:50:16,301 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 10:50:16,301 INFO L85 PathProgramCache]: Analyzing trace with hash 655226799, now seen corresponding path program 1 times [2025-03-03 10:50:16,301 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 10:50:16,301 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1732982862] [2025-03-03 10:50:16,302 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 10:50:16,302 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 10:50:16,383 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 1012 statements into 1 equivalence classes. [2025-03-03 10:50:16,414 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 1012 of 1012 statements. [2025-03-03 10:50:16,415 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 10:50:16,415 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 10:50:16,723 INFO L134 CoverageAnalysis]: Checked inductivity of 2364 backedges. 1459 proven. 0 refuted. 0 times theorem prover too weak. 905 trivial. 0 not checked. [2025-03-03 10:50:16,723 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 10:50:16,723 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1732982862] [2025-03-03 10:50:16,723 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1732982862] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 10:50:16,723 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 10:50:16,723 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-03 10:50:16,723 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2120537020] [2025-03-03 10:50:16,723 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 10:50:16,723 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-03 10:50:16,723 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 10:50:16,724 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-03 10:50:16,724 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 10:50:16,724 INFO L87 Difference]: Start difference. First operand 32464 states and 33533 transitions. Second operand has 3 states, 3 states have (on average 171.33333333333334) internal successors, (514), 3 states have internal predecessors, (514), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 10:50:17,446 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 10:50:17,447 INFO L93 Difference]: Finished difference Result 64627 states and 66763 transitions. [2025-03-03 10:50:17,450 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-03 10:50:17,450 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 171.33333333333334) internal successors, (514), 3 states have internal predecessors, (514), 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 1012 [2025-03-03 10:50:17,450 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 10:50:17,484 INFO L225 Difference]: With dead ends: 64627 [2025-03-03 10:50:17,484 INFO L226 Difference]: Without dead ends: 32464 [2025-03-03 10:50:17,497 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 10:50:17,503 INFO L435 NwaCegarLoop]: 465 mSDtfsCounter, 238 mSDsluCounter, 31 mSDsCounter, 0 mSdLazyCounter, 738 mSolverCounterSat, 41 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 238 SdHoareTripleChecker+Valid, 496 SdHoareTripleChecker+Invalid, 779 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 41 IncrementalHoareTripleChecker+Valid, 738 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-03-03 10:50:17,503 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [238 Valid, 496 Invalid, 779 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [41 Valid, 738 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-03-03 10:50:17,537 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32464 states. [2025-03-03 10:50:17,741 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32464 to 32464. [2025-03-03 10:50:17,764 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 32464 states, 32463 states have (on average 1.0295721282691064) internal successors, (33423), 32463 states have internal predecessors, (33423), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 10:50:17,876 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32464 states to 32464 states and 33423 transitions. [2025-03-03 10:50:17,876 INFO L78 Accepts]: Start accepts. Automaton has 32464 states and 33423 transitions. Word has length 1012 [2025-03-03 10:50:17,877 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 10:50:17,877 INFO L471 AbstractCegarLoop]: Abstraction has 32464 states and 33423 transitions. [2025-03-03 10:50:17,877 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 171.33333333333334) internal successors, (514), 3 states have internal predecessors, (514), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 10:50:17,877 INFO L276 IsEmpty]: Start isEmpty. Operand 32464 states and 33423 transitions. [2025-03-03 10:50:17,892 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1014 [2025-03-03 10:50:17,892 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 10:50:17,892 INFO L218 NwaCegarLoop]: trace histogram [8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 10:50:17,893 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2025-03-03 10:50:17,893 INFO L396 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 10:50:17,893 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 10:50:17,894 INFO L85 PathProgramCache]: Analyzing trace with hash -235515675, now seen corresponding path program 1 times [2025-03-03 10:50:17,894 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 10:50:17,894 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [542401767] [2025-03-03 10:50:17,894 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 10:50:17,894 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 10:50:17,950 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 1013 statements into 1 equivalence classes. [2025-03-03 10:50:17,982 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 1013 of 1013 statements. [2025-03-03 10:50:17,982 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 10:50:17,982 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 10:50:18,480 INFO L134 CoverageAnalysis]: Checked inductivity of 2359 backedges. 1295 proven. 0 refuted. 0 times theorem prover too weak. 1064 trivial. 0 not checked. [2025-03-03 10:50:18,481 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 10:50:18,481 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [542401767] [2025-03-03 10:50:18,481 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [542401767] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 10:50:18,481 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 10:50:18,481 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-03 10:50:18,481 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1299026342] [2025-03-03 10:50:18,482 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 10:50:18,482 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-03 10:50:18,483 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 10:50:18,483 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-03 10:50:18,483 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 10:50:18,483 INFO L87 Difference]: Start difference. First operand 32464 states and 33423 transitions. Second operand has 3 states, 3 states have (on average 145.33333333333334) internal successors, (436), 3 states have internal predecessors, (436), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 10:50:19,333 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 10:50:19,333 INFO L93 Difference]: Finished difference Result 72399 states and 74457 transitions. [2025-03-03 10:50:19,333 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-03 10:50:19,334 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 145.33333333333334) internal successors, (436), 3 states have internal predecessors, (436), 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 1013 [2025-03-03 10:50:19,334 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 10:50:19,366 INFO L225 Difference]: With dead ends: 72399 [2025-03-03 10:50:19,366 INFO L226 Difference]: Without dead ends: 40236 [2025-03-03 10:50:19,386 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 10:50:19,386 INFO L435 NwaCegarLoop]: 113 mSDtfsCounter, 341 mSDsluCounter, 20 mSDsCounter, 0 mSdLazyCounter, 790 mSolverCounterSat, 134 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 341 SdHoareTripleChecker+Valid, 133 SdHoareTripleChecker+Invalid, 924 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 134 IncrementalHoareTripleChecker+Valid, 790 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2025-03-03 10:50:19,386 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [341 Valid, 133 Invalid, 924 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [134 Valid, 790 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2025-03-03 10:50:19,405 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 40236 states. [2025-03-03 10:50:19,599 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 40236 to 20128. [2025-03-03 10:50:19,610 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 20128 states, 20127 states have (on average 1.0297610175386298) internal successors, (20726), 20127 states have internal predecessors, (20726), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 10:50:19,624 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20128 states to 20128 states and 20726 transitions. [2025-03-03 10:50:19,625 INFO L78 Accepts]: Start accepts. Automaton has 20128 states and 20726 transitions. Word has length 1013 [2025-03-03 10:50:19,625 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 10:50:19,626 INFO L471 AbstractCegarLoop]: Abstraction has 20128 states and 20726 transitions. [2025-03-03 10:50:19,626 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 145.33333333333334) internal successors, (436), 3 states have internal predecessors, (436), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 10:50:19,626 INFO L276 IsEmpty]: Start isEmpty. Operand 20128 states and 20726 transitions. [2025-03-03 10:50:19,636 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1165 [2025-03-03 10:50:19,637 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 10:50:19,637 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, 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, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 10:50:19,637 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2025-03-03 10:50:19,637 INFO L396 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 10:50:19,638 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 10:50:19,638 INFO L85 PathProgramCache]: Analyzing trace with hash 777708781, now seen corresponding path program 1 times [2025-03-03 10:50:19,638 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 10:50:19,638 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [605976820] [2025-03-03 10:50:19,638 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 10:50:19,638 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 10:50:19,698 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 1164 statements into 1 equivalence classes. [2025-03-03 10:50:19,730 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 1164 of 1164 statements. [2025-03-03 10:50:19,730 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 10:50:19,730 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 10:50:20,124 INFO L134 CoverageAnalysis]: Checked inductivity of 1970 backedges. 1487 proven. 0 refuted. 0 times theorem prover too weak. 483 trivial. 0 not checked. [2025-03-03 10:50:20,124 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 10:50:20,124 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [605976820] [2025-03-03 10:50:20,124 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [605976820] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 10:50:20,124 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 10:50:20,124 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-03 10:50:20,124 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1004228450] [2025-03-03 10:50:20,124 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 10:50:20,124 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-03 10:50:20,124 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 10:50:20,125 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-03 10:50:20,125 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 10:50:20,125 INFO L87 Difference]: Start difference. First operand 20128 states and 20726 transitions. Second operand has 3 states, 3 states have (on average 254.66666666666666) internal successors, (764), 3 states have internal predecessors, (764), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 10:50:20,823 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 10:50:20,823 INFO L93 Difference]: Finished difference Result 42956 states and 44211 transitions. [2025-03-03 10:50:20,823 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-03 10:50:20,823 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 254.66666666666666) internal successors, (764), 3 states have internal predecessors, (764), 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 1164 [2025-03-03 10:50:20,824 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 10:50:20,842 INFO L225 Difference]: With dead ends: 42956 [2025-03-03 10:50:20,842 INFO L226 Difference]: Without dead ends: 23129 [2025-03-03 10:50:20,852 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 10:50:20,852 INFO L435 NwaCegarLoop]: 487 mSDtfsCounter, 23 mSDsluCounter, 37 mSDsCounter, 0 mSdLazyCounter, 793 mSolverCounterSat, 23 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 23 SdHoareTripleChecker+Valid, 524 SdHoareTripleChecker+Invalid, 816 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 23 IncrementalHoareTripleChecker+Valid, 793 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-03-03 10:50:20,853 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [23 Valid, 524 Invalid, 816 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [23 Valid, 793 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-03-03 10:50:20,862 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23129 states. [2025-03-03 10:50:20,979 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23129 to 21628. [2025-03-03 10:50:20,993 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 21628 states, 21627 states have (on average 1.0288528228603135) internal successors, (22251), 21627 states have internal predecessors, (22251), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 10:50:21,009 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21628 states to 21628 states and 22251 transitions. [2025-03-03 10:50:21,010 INFO L78 Accepts]: Start accepts. Automaton has 21628 states and 22251 transitions. Word has length 1164 [2025-03-03 10:50:21,011 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 10:50:21,011 INFO L471 AbstractCegarLoop]: Abstraction has 21628 states and 22251 transitions. [2025-03-03 10:50:21,011 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 254.66666666666666) internal successors, (764), 3 states have internal predecessors, (764), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 10:50:21,011 INFO L276 IsEmpty]: Start isEmpty. Operand 21628 states and 22251 transitions. [2025-03-03 10:50:21,023 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1167 [2025-03-03 10:50:21,024 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 10:50:21,024 INFO L218 NwaCegarLoop]: trace histogram [7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 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, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 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, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2025-03-03 10:50:21,024 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2025-03-03 10:50:21,024 INFO L396 AbstractCegarLoop]: === Iteration 25 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 10:50:21,024 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 10:50:21,025 INFO L85 PathProgramCache]: Analyzing trace with hash 309514978, now seen corresponding path program 1 times [2025-03-03 10:50:21,025 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 10:50:21,025 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [379665828] [2025-03-03 10:50:21,025 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 10:50:21,025 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 10:50:21,083 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 1166 statements into 1 equivalence classes. [2025-03-03 10:50:21,120 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 1166 of 1166 statements. [2025-03-03 10:50:21,120 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 10:50:21,120 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 10:50:22,464 INFO L134 CoverageAnalysis]: Checked inductivity of 2271 backedges. 1634 proven. 41 refuted. 0 times theorem prover too weak. 596 trivial. 0 not checked. [2025-03-03 10:50:22,464 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 10:50:22,464 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [379665828] [2025-03-03 10:50:22,464 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [379665828] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-03 10:50:22,465 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [39321713] [2025-03-03 10:50:22,465 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 10:50:22,465 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 10:50:22,465 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 10:50:22,467 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-03 10:50:22,468 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2025-03-03 10:50:22,562 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 1166 statements into 1 equivalence classes. [2025-03-03 10:50:22,700 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 1166 of 1166 statements. [2025-03-03 10:50:22,700 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 10:50:22,700 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 10:50:22,705 INFO L256 TraceCheckSpWp]: Trace formula consists of 1352 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-03-03 10:50:22,713 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 10:50:22,917 INFO L134 CoverageAnalysis]: Checked inductivity of 2271 backedges. 999 proven. 53 refuted. 0 times theorem prover too weak. 1219 trivial. 0 not checked. [2025-03-03 10:50:22,917 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-03 10:50:23,130 INFO L134 CoverageAnalysis]: Checked inductivity of 2271 backedges. 999 proven. 53 refuted. 0 times theorem prover too weak. 1219 trivial. 0 not checked. [2025-03-03 10:50:23,130 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [39321713] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-03 10:50:23,130 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-03 10:50:23,131 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 4, 4] total 10 [2025-03-03 10:50:23,131 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1983139994] [2025-03-03 10:50:23,131 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-03 10:50:23,132 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-03-03 10:50:23,132 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 10:50:23,133 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-03-03 10:50:23,133 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=66, Unknown=0, NotChecked=0, Total=90 [2025-03-03 10:50:23,133 INFO L87 Difference]: Start difference. First operand 21628 states and 22251 transitions. Second operand has 10 states, 10 states have (on average 133.3) internal successors, (1333), 10 states have internal predecessors, (1333), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 10:50:29,908 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 10:50:29,908 INFO L93 Difference]: Finished difference Result 39362 states and 40288 transitions. [2025-03-03 10:50:29,908 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 34 states. [2025-03-03 10:50:29,909 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 133.3) internal successors, (1333), 10 states have internal predecessors, (1333), 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 1166 [2025-03-03 10:50:29,909 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 10:50:29,928 INFO L225 Difference]: With dead ends: 39362 [2025-03-03 10:50:29,928 INFO L226 Difference]: Without dead ends: 18035 [2025-03-03 10:50:29,942 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 2384 GetRequests, 2349 SyntacticMatches, 0 SemanticMatches, 35 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 353 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=296, Invalid=1036, Unknown=0, NotChecked=0, Total=1332 [2025-03-03 10:50:29,942 INFO L435 NwaCegarLoop]: 63 mSDtfsCounter, 3273 mSDsluCounter, 237 mSDsCounter, 0 mSdLazyCounter, 15738 mSolverCounterSat, 243 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 5.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3273 SdHoareTripleChecker+Valid, 300 SdHoareTripleChecker+Invalid, 15981 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 243 IncrementalHoareTripleChecker+Valid, 15738 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 6.2s IncrementalHoareTripleChecker+Time [2025-03-03 10:50:29,943 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [3273 Valid, 300 Invalid, 15981 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [243 Valid, 15738 Invalid, 0 Unknown, 0 Unchecked, 6.2s Time] [2025-03-03 10:50:29,955 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18035 states. [2025-03-03 10:50:30,043 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18035 to 11110. [2025-03-03 10:50:30,050 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 11110 states, 11109 states have (on average 1.01647312989468) internal successors, (11292), 11109 states have internal predecessors, (11292), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 10:50:30,058 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11110 states to 11110 states and 11292 transitions. [2025-03-03 10:50:30,059 INFO L78 Accepts]: Start accepts. Automaton has 11110 states and 11292 transitions. Word has length 1166 [2025-03-03 10:50:30,060 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 10:50:30,060 INFO L471 AbstractCegarLoop]: Abstraction has 11110 states and 11292 transitions. [2025-03-03 10:50:30,060 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 133.3) internal successors, (1333), 10 states have internal predecessors, (1333), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 10:50:30,060 INFO L276 IsEmpty]: Start isEmpty. Operand 11110 states and 11292 transitions. [2025-03-03 10:50:30,070 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1200 [2025-03-03 10:50:30,071 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 10:50:30,071 INFO L218 NwaCegarLoop]: trace histogram [7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 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, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2025-03-03 10:50:30,078 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Ended with exit code 0 [2025-03-03 10:50:30,271 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable24 [2025-03-03 10:50:30,272 INFO L396 AbstractCegarLoop]: === Iteration 26 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 10:50:30,272 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 10:50:30,272 INFO L85 PathProgramCache]: Analyzing trace with hash -1177932405, now seen corresponding path program 1 times [2025-03-03 10:50:30,272 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 10:50:30,272 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1531690519] [2025-03-03 10:50:30,272 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 10:50:30,272 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 10:50:30,354 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 1199 statements into 1 equivalence classes. [2025-03-03 10:50:30,385 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 1199 of 1199 statements. [2025-03-03 10:50:30,385 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 10:50:30,385 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 10:50:31,875 INFO L134 CoverageAnalysis]: Checked inductivity of 2434 backedges. 1598 proven. 458 refuted. 0 times theorem prover too weak. 378 trivial. 0 not checked. [2025-03-03 10:50:31,875 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 10:50:31,876 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1531690519] [2025-03-03 10:50:31,876 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1531690519] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-03 10:50:31,876 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1660546887] [2025-03-03 10:50:31,876 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 10:50:31,876 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 10:50:31,876 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 10:50:31,878 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-03 10:50:31,879 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2025-03-03 10:50:31,971 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 1199 statements into 1 equivalence classes. [2025-03-03 10:50:32,108 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 1199 of 1199 statements. [2025-03-03 10:50:32,108 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 10:50:32,108 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 10:50:32,112 INFO L256 TraceCheckSpWp]: Trace formula consists of 1376 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-03-03 10:50:32,118 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 10:50:32,355 INFO L134 CoverageAnalysis]: Checked inductivity of 2434 backedges. 1707 proven. 0 refuted. 0 times theorem prover too weak. 727 trivial. 0 not checked. [2025-03-03 10:50:32,356 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-03 10:50:32,356 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1660546887] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 10:50:32,356 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-03 10:50:32,356 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [6] total 7 [2025-03-03 10:50:32,356 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [887143619] [2025-03-03 10:50:32,356 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 10:50:32,357 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-03 10:50:32,357 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 10:50:32,357 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-03 10:50:32,357 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2025-03-03 10:50:32,357 INFO L87 Difference]: Start difference. First operand 11110 states and 11292 transitions. Second operand has 3 states, 3 states have (on average 203.0) internal successors, (609), 3 states have internal predecessors, (609), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 10:50:32,943 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 10:50:32,943 INFO L93 Difference]: Finished difference Result 22219 states and 22585 transitions. [2025-03-03 10:50:32,943 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-03 10:50:32,943 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 203.0) internal successors, (609), 3 states have internal predecessors, (609), 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 1199 [2025-03-03 10:50:32,944 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 10:50:32,952 INFO L225 Difference]: With dead ends: 22219 [2025-03-03 10:50:32,952 INFO L226 Difference]: Without dead ends: 11410 [2025-03-03 10:50:32,955 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 1204 GetRequests, 1199 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2025-03-03 10:50:32,956 INFO L435 NwaCegarLoop]: 403 mSDtfsCounter, 195 mSDsluCounter, 19 mSDsCounter, 0 mSdLazyCounter, 698 mSolverCounterSat, 13 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 195 SdHoareTripleChecker+Valid, 422 SdHoareTripleChecker+Invalid, 711 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 13 IncrementalHoareTripleChecker+Valid, 698 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-03-03 10:50:32,956 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [195 Valid, 422 Invalid, 711 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [13 Valid, 698 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-03-03 10:50:32,960 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11410 states. [2025-03-03 10:50:33,038 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11410 to 10809. [2025-03-03 10:50:33,045 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10809 states, 10808 states have (on average 1.0160066617320502) internal successors, (10981), 10808 states have internal predecessors, (10981), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 10:50:33,057 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10809 states to 10809 states and 10981 transitions. [2025-03-03 10:50:33,058 INFO L78 Accepts]: Start accepts. Automaton has 10809 states and 10981 transitions. Word has length 1199 [2025-03-03 10:50:33,058 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 10:50:33,059 INFO L471 AbstractCegarLoop]: Abstraction has 10809 states and 10981 transitions. [2025-03-03 10:50:33,059 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 203.0) internal successors, (609), 3 states have internal predecessors, (609), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 10:50:33,059 INFO L276 IsEmpty]: Start isEmpty. Operand 10809 states and 10981 transitions. [2025-03-03 10:50:33,079 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1202 [2025-03-03 10:50:33,079 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 10:50:33,080 INFO L218 NwaCegarLoop]: trace histogram [8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 6, 6, 6, 6, 6, 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, 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, 2, 2, 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] [2025-03-03 10:50:33,087 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Ended with exit code 0 [2025-03-03 10:50:33,280 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable25 [2025-03-03 10:50:33,280 INFO L396 AbstractCegarLoop]: === Iteration 27 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 10:50:33,281 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 10:50:33,281 INFO L85 PathProgramCache]: Analyzing trace with hash 772019062, now seen corresponding path program 1 times [2025-03-03 10:50:33,281 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 10:50:33,281 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1215198840] [2025-03-03 10:50:33,281 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 10:50:33,281 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 10:50:33,385 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 1201 statements into 1 equivalence classes. [2025-03-03 10:50:33,450 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 1201 of 1201 statements. [2025-03-03 10:50:33,450 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 10:50:33,450 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 10:50:35,060 INFO L134 CoverageAnalysis]: Checked inductivity of 2875 backedges. 1873 proven. 460 refuted. 0 times theorem prover too weak. 542 trivial. 0 not checked. [2025-03-03 10:50:35,060 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 10:50:35,060 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1215198840] [2025-03-03 10:50:35,060 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1215198840] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-03 10:50:35,060 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [894625429] [2025-03-03 10:50:35,060 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 10:50:35,060 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 10:50:35,060 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 10:50:35,064 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-03 10:50:35,065 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2025-03-03 10:50:35,160 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 1201 statements into 1 equivalence classes. [2025-03-03 10:50:35,307 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 1201 of 1201 statements. [2025-03-03 10:50:35,307 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 10:50:35,307 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 10:50:35,311 INFO L256 TraceCheckSpWp]: Trace formula consists of 1400 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-03-03 10:50:35,317 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 10:50:35,558 INFO L134 CoverageAnalysis]: Checked inductivity of 2875 backedges. 1215 proven. 0 refuted. 0 times theorem prover too weak. 1660 trivial. 0 not checked. [2025-03-03 10:50:35,558 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-03 10:50:35,558 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [894625429] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 10:50:35,558 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-03 10:50:35,558 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [4] total 6 [2025-03-03 10:50:35,559 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [694729451] [2025-03-03 10:50:35,559 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 10:50:35,559 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-03 10:50:35,559 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 10:50:35,559 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-03 10:50:35,559 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2025-03-03 10:50:35,560 INFO L87 Difference]: Start difference. First operand 10809 states and 10981 transitions. Second operand has 4 states, 4 states have (on average 131.5) internal successors, (526), 4 states have internal predecessors, (526), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 10:50:36,464 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 10:50:36,464 INFO L93 Difference]: Finished difference Result 23716 states and 24094 transitions. [2025-03-03 10:50:36,464 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-03 10:50:36,464 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 131.5) internal successors, (526), 4 states have internal predecessors, (526), 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 1201 [2025-03-03 10:50:36,465 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 10:50:36,466 INFO L225 Difference]: With dead ends: 23716 [2025-03-03 10:50:36,466 INFO L226 Difference]: Without dead ends: 0 [2025-03-03 10:50:36,474 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 1205 GetRequests, 1201 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2025-03-03 10:50:36,474 INFO L435 NwaCegarLoop]: 25 mSDtfsCounter, 393 mSDsluCounter, 23 mSDsCounter, 0 mSdLazyCounter, 1380 mSolverCounterSat, 84 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 393 SdHoareTripleChecker+Valid, 48 SdHoareTripleChecker+Invalid, 1464 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 84 IncrementalHoareTripleChecker+Valid, 1380 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2025-03-03 10:50:36,474 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [393 Valid, 48 Invalid, 1464 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [84 Valid, 1380 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2025-03-03 10:50:36,475 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2025-03-03 10:50:36,475 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2025-03-03 10:50:36,475 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 10:50:36,475 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2025-03-03 10:50:36,475 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 1201 [2025-03-03 10:50:36,476 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 10:50:36,476 INFO L471 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2025-03-03 10:50:36,476 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 131.5) internal successors, (526), 4 states have internal predecessors, (526), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 10:50:36,476 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2025-03-03 10:50:36,476 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2025-03-03 10:50:36,484 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2025-03-03 10:50:36,492 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Ended with exit code 0 [2025-03-03 10:50:36,685 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable26,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 10:50:36,689 INFO L422 BasicCegarLoop]: Path program 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] [2025-03-03 10:50:36,695 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2025-03-03 10:50:43,461 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2025-03-03 10:50:43,504 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Expression type not yet supported in backtranslation: QuantifierExpression [2025-03-03 10:50:43,511 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Expression type not yet supported in backtranslation: QuantifierExpression [2025-03-03 10:50:43,511 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Expression type not yet supported in backtranslation: QuantifierExpression [2025-03-03 10:50:43,511 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Expression type not yet supported in backtranslation: QuantifierExpression [2025-03-03 10:50:43,516 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Expression type not yet supported in backtranslation: QuantifierExpression [2025-03-03 10:50:43,516 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Expression type not yet supported in backtranslation: QuantifierExpression [2025-03-03 10:50:43,516 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Expression type not yet supported in backtranslation: QuantifierExpression [2025-03-03 10:50:43,516 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Expression type not yet supported in backtranslation: QuantifierExpression [2025-03-03 10:50:43,516 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Expression type not yet supported in backtranslation: QuantifierExpression [2025-03-03 10:50:43,517 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Expression type not yet supported in backtranslation: QuantifierExpression [2025-03-03 10:50:43,520 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 03.03 10:50:43 BoogieIcfgContainer [2025-03-03 10:50:43,522 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2025-03-03 10:50:43,525 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2025-03-03 10:50:43,528 INFO L270 PluginConnector]: Initializing Witness Printer... [2025-03-03 10:50:43,529 INFO L274 PluginConnector]: Witness Printer initialized [2025-03-03 10:50:43,530 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 03.03 10:49:26" (3/4) ... [2025-03-03 10:50:43,532 INFO L146 WitnessPrinter]: Generating witness for correct program [2025-03-03 10:50:43,568 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 12 nodes and edges [2025-03-03 10:50:43,570 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 4 nodes and edges [2025-03-03 10:50:43,572 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 3 nodes and edges [2025-03-03 10:50:43,573 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2025-03-03 10:50:43,787 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2025-03-03 10:50:43,790 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.yml [2025-03-03 10:50:43,790 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2025-03-03 10:50:43,791 INFO L158 Benchmark]: Toolchain (without parser) took 80224.68ms. Allocated memory was 142.6MB in the beginning and 1.6GB in the end (delta: 1.5GB). Free memory was 100.6MB in the beginning and 572.3MB in the end (delta: -471.7MB). Peak memory consumption was 997.6MB. Max. memory is 16.1GB. [2025-03-03 10:50:43,792 INFO L158 Benchmark]: CDTParser took 0.29ms. Allocated memory is still 201.3MB. Free memory is still 126.0MB. There was no memory consumed. Max. memory is 16.1GB. [2025-03-03 10:50:43,792 INFO L158 Benchmark]: CACSL2BoogieTranslator took 613.27ms. Allocated memory is still 142.6MB. Free memory was 100.6MB in the beginning and 89.3MB in the end (delta: 11.3MB). Peak memory consumption was 81.0MB. Max. memory is 16.1GB. [2025-03-03 10:50:43,792 INFO L158 Benchmark]: Boogie Procedure Inliner took 144.31ms. Allocated memory is still 142.6MB. Free memory was 89.3MB in the beginning and 51.8MB in the end (delta: 37.5MB). Peak memory consumption was 41.9MB. Max. memory is 16.1GB. [2025-03-03 10:50:43,793 INFO L158 Benchmark]: Boogie Preprocessor took 226.13ms. Allocated memory is still 142.6MB. Free memory was 51.8MB in the beginning and 46.8MB in the end (delta: 5.0MB). Peak memory consumption was 25.1MB. Max. memory is 16.1GB. [2025-03-03 10:50:43,793 INFO L158 Benchmark]: IcfgBuilder took 2118.01ms. Allocated memory was 142.6MB in the beginning and 369.1MB in the end (delta: 226.5MB). Free memory was 46.7MB in the beginning and 233.0MB in the end (delta: -186.4MB). Peak memory consumption was 193.1MB. Max. memory is 16.1GB. [2025-03-03 10:50:43,793 INFO L158 Benchmark]: TraceAbstraction took 76849.21ms. Allocated memory was 369.1MB in the beginning and 1.6GB in the end (delta: 1.2GB). Free memory was 233.0MB in the beginning and 597.5MB in the end (delta: -364.5MB). Peak memory consumption was 1.1GB. Max. memory is 16.1GB. [2025-03-03 10:50:43,793 INFO L158 Benchmark]: Witness Printer took 265.43ms. Allocated memory is still 1.6GB. Free memory was 597.5MB in the beginning and 572.3MB in the end (delta: 25.2MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB. [2025-03-03 10:50:43,794 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.29ms. Allocated memory is still 201.3MB. Free memory is still 126.0MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 613.27ms. Allocated memory is still 142.6MB. Free memory was 100.6MB in the beginning and 89.3MB in the end (delta: 11.3MB). Peak memory consumption was 81.0MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 144.31ms. Allocated memory is still 142.6MB. Free memory was 89.3MB in the beginning and 51.8MB in the end (delta: 37.5MB). Peak memory consumption was 41.9MB. Max. memory is 16.1GB. * Boogie Preprocessor took 226.13ms. Allocated memory is still 142.6MB. Free memory was 51.8MB in the beginning and 46.8MB in the end (delta: 5.0MB). Peak memory consumption was 25.1MB. Max. memory is 16.1GB. * IcfgBuilder took 2118.01ms. Allocated memory was 142.6MB in the beginning and 369.1MB in the end (delta: 226.5MB). Free memory was 46.7MB in the beginning and 233.0MB in the end (delta: -186.4MB). Peak memory consumption was 193.1MB. Max. memory is 16.1GB. * TraceAbstraction took 76849.21ms. Allocated memory was 369.1MB in the beginning and 1.6GB in the end (delta: 1.2GB). Free memory was 233.0MB in the beginning and 597.5MB in the end (delta: -364.5MB). Peak memory consumption was 1.1GB. Max. memory is 16.1GB. * Witness Printer took 265.43ms. Allocated memory is still 1.6GB. Free memory was 597.5MB in the beginning and 572.3MB in the end (delta: 25.2MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Expression type not yet supported in backtranslation: QuantifierExpression - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Expression type not yet supported in backtranslation: QuantifierExpression - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Expression type not yet supported in backtranslation: QuantifierExpression - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Expression type not yet supported in backtranslation: QuantifierExpression - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Expression type not yet supported in backtranslation: QuantifierExpression - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Expression type not yet supported in backtranslation: QuantifierExpression - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Expression type not yet supported in backtranslation: QuantifierExpression - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Expression type not yet supported in backtranslation: QuantifierExpression - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Expression type not yet supported in backtranslation: QuantifierExpression - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Expression type not yet supported in backtranslation: QuantifierExpression * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - PositiveResult [Line: 182]: a call to reach_error is unreachable For all program executions holds that a call to reach_error is unreachable at this location - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 424 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 70.0s, OverallIterations: 27, TraceHistogramMax: 8, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.3s, AutomataDifference: 38.5s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 13074 SdHoareTripleChecker+Valid, 34.3s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 13074 mSDsluCounter, 9974 SdHoareTripleChecker+Invalid, 29.0s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 1549 mSDsCounter, 4219 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 45684 IncrementalHoareTripleChecker+Invalid, 49903 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 4219 mSolverCounterUnsat, 8425 mSDtfsCounter, 45684 mSolverCounterSat, 0.2s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 8283 GetRequests, 8132 SyntacticMatches, 52 SemanticMatches, 99 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 400 ImplicationChecksByTransitivity, 1.4s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=37265occurred in iteration=18, InterpolantAutomatonStates: 129, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 4.4s AutomataMinimizationTime, 27 MinimizatonAttempts, 52241 StatesRemovedByMinimization, 23 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.6s SsaConstructionTime, 1.7s SatisfiabilityAnalysisTime, 21.3s InterpolantComputationTime, 24963 NumberOfCodeBlocks, 24963 NumberOfCodeBlocksAsserted, 34 NumberOfCheckSat, 26675 ConstructedInterpolants, 53 QuantifiedInterpolants, 87885 SizeOfPredicates, 7 NumberOfNonLiveVariables, 7471 ConjunctsInSsa, 26 ConjunctsInUnsatCore, 36 InterpolantComputations, 25 PerfectInterpolantSequences, 41148/43102 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available, ConComCheckerStatistics: No data available - AllSpecificationsHoldResult: All specifications hold 1 specifications checked. All of them hold - InvariantResult [Line: 1776]: Location Invariant Derived location invariant: ((((((((((((((((((((((((((((((2 == a2) && (((long long) 89 + a4) <= 0)) && (((long long) a0 + 61) <= 0)) || ((((((long long) 89 + a4) == 0) && (a2 == 1)) && (0 <= ((long long) 44 + a0))) && (((long long) a29 + 127) == 0))) || (((((((long long) 42 + a4) <= 0) && (0 <= ((long long) a4 + 85))) && (((long long) a0 + 99) <= 0)) && (0 <= ((long long) 146 + a0))) && (3 == a2))) || (((((long long) 89 + a4) <= 0) && (a2 == 1)) && (((long long) a0 + 61) <= 0))) || (((5 == a2) && (((long long) 89 + a4) <= 0)) && (((long long) a0 + 61) <= 0))) || (((((((long long) 89 + a4) <= 0) && (0 <= ((long long) 146 + a0))) && (0 <= ((long long) 599998 + a29))) && (a2 == 4)) && (a29 <= 43))) || ((((((long long) 216075 + a0) <= 0) && (((long long) 42 + a4) <= 0)) && (0 <= ((long long) a4 + 85))) && (3 == a2))) || (((((((long long) 42 + a4) <= 0) && (2 == a2)) && (0 <= ((long long) a4 + 85))) && (((long long) a0 + 147) <= 0)) && (0 <= ((long long) 599998 + a29)))) || ((((((((long long) 42 + a4) <= 0) && (0 <= ((long long) a4 + 85))) && (((long long) 98 + a0) <= 0)) && (0 <= ((long long) 146 + a0))) && (a2 == 1)) && (0 <= ((long long) 599998 + a29)))) || (((((((long long) 42 + a4) <= 0) && (0 <= ((long long) a4 + 85))) && (((long long) 98 + a0) <= 0)) && (((long long) a29 + 120873) <= 0)) && (3 == a2))) || ((((((long long) 42 + a4) <= 0) && (2 == a2)) && (0 <= ((long long) a4 + 85))) && (((long long) 98 + a0) <= 0))) || ((5 == a2) && (((long long) 89 + a4) <= 0))) || ((((5 == a2) && (((long long) 42 + a4) <= 0)) && (0 <= ((long long) a4 + 85))) && (((long long) 98 + a0) <= 0))) || (((5 == a2) && (((long long) 42 + a4) <= 0)) && (((long long) a0 + 147) <= 0))) || ((((((5 == a2) && (((long long) 42 + a4) <= 0)) && (0 <= ((long long) a4 + 85))) && (((long long) a0 + 99) <= 0)) && (0 <= ((long long) 146 + a0))) && (0 <= ((long long) 599998 + a29)))) || (((((((long long) 42 + a4) <= 0) && (0 <= ((long long) a4 + 85))) && (((long long) a0 + 147) <= 0)) && (0 <= ((long long) 599998 + a29))) && (a2 == 4))) || (((2 == a2) && (((long long) 89 + a4) <= 0)) && (0 <= ((long long) 599998 + a29)))) || (((((5 == a2) && (((long long) 216075 + a0) <= 0)) && (((long long) 42 + a4) <= 0)) && (0 <= ((long long) a4 + 85))) && (0 <= ((long long) a29 + 143)))) || (((a2 == 1) && (((long long) a4 + 86) <= 0)) && (((long long) a29 + 144) <= 0))) || (((((long long) 89 + a4) <= 0) && (0 <= ((long long) 146 + a0))) && (((long long) a0 + 61) <= 0))) || ((((long long) 89 + a4) <= 0) && (3 == a2))) || ((((((long long) 42 + a4) <= 0) && (0 <= ((long long) a4 + 85))) && (((long long) a0 + 147) <= 0)) && (a2 == 1))) || (((((((long long) 42 + a4) <= 0) && (0 <= ((long long) a4 + 85))) && (((long long) a0 + 147) <= 0)) && (3 == a2)) && (((long long) a29 + 144) <= 0))) || (((((long long) 216075 + a0) <= 0) && (((long long) 42 + a4) <= 0)) && (3 == a2))) || ((((long long) 89 + a4) <= 0) && (((long long) a0 + 147) <= 0))) || ((((((long long) 42 + a4) <= 0) && (0 <= ((long long) a4 + 85))) && (a2 == 1)) && (a29 <= 43))) || ((((((long long) 42 + a4) <= 0) && (((long long) a0 + 147) <= 0)) && (3 == a2)) && (a29 <= 43))) || ((((((long long) 42 + a4) <= 0) && (((long long) a0 + 147) <= 0)) && (0 <= ((long long) 62 + a4))) && (3 == a2))) RESULT: Ultimate proved your program to be correct! [2025-03-03 10:50:43,829 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Forceful destruction successful, exit code 0 Received shutdown request...