./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/eca-rers2012/Problem10_label20.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/Problem10_label20.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 d07934010d71201f260b1dca466306b0d1cde5b3f356e835c3486ab281635c25 --- Real Ultimate output --- This is Ultimate 0.3.0-?-798a7b3-m [2025-03-03 10:30:31,369 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-03 10:30:31,426 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2025-03-03 10:30:31,432 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-03 10:30:31,432 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-03 10:30:31,450 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-03 10:30:31,451 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-03 10:30:31,451 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-03 10:30:31,452 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-03 10:30:31,452 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-03 10:30:31,453 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-03 10:30:31,453 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-03 10:30:31,453 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-03 10:30:31,453 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-03 10:30:31,453 INFO L153 SettingsManager]: * Use SBE=true [2025-03-03 10:30:31,454 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-03 10:30:31,454 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-03 10:30:31,454 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-03 10:30:31,454 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-03 10:30:31,454 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-03 10:30:31,454 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-03 10:30:31,454 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-03 10:30:31,454 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-03 10:30:31,454 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-03 10:30:31,455 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-03 10:30:31,455 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-03 10:30:31,455 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-03 10:30:31,455 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-03 10:30:31,455 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-03 10:30:31,455 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-03 10:30:31,455 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-03 10:30:31,455 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-03 10:30:31,456 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-03 10:30:31,456 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-03 10:30:31,456 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-03 10:30:31,456 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-03 10:30:31,456 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-03 10:30:31,456 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-03 10:30:31,456 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-03 10:30:31,456 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-03 10:30:31,456 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-03 10:30:31,456 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-03 10:30:31,456 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-03 10:30:31,457 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 -> d07934010d71201f260b1dca466306b0d1cde5b3f356e835c3486ab281635c25 [2025-03-03 10:30:31,652 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-03 10:30:31,661 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-03 10:30:31,662 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-03 10:30:31,663 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-03 10:30:31,663 INFO L274 PluginConnector]: CDTParser initialized [2025-03-03 10:30:31,664 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/eca-rers2012/Problem10_label20.c [2025-03-03 10:30:32,748 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/4047e0298/71ac5f2660e54dd38d3db5f6e966073d/FLAG9b31dd83f [2025-03-03 10:30:33,042 INFO L384 CDTParser]: Found 1 translation units. [2025-03-03 10:30:33,043 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/eca-rers2012/Problem10_label20.c [2025-03-03 10:30:33,051 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/4047e0298/71ac5f2660e54dd38d3db5f6e966073d/FLAG9b31dd83f [2025-03-03 10:30:33,066 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/4047e0298/71ac5f2660e54dd38d3db5f6e966073d [2025-03-03 10:30:33,067 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-03 10:30:33,070 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-03 10:30:33,071 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-03 10:30:33,072 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-03 10:30:33,075 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-03 10:30:33,077 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 03.03 10:30:33" (1/1) ... [2025-03-03 10:30:33,077 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@36ff4fa5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 10:30:33, skipping insertion in model container [2025-03-03 10:30:33,078 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 03.03 10:30:33" (1/1) ... [2025-03-03 10:30:33,106 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-03 10:30:33,240 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/Problem10_label20.c[3385,3398] [2025-03-03 10:30:33,352 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-03 10:30:33,359 INFO L200 MainTranslator]: Completed pre-run [2025-03-03 10:30:33,372 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/Problem10_label20.c[3385,3398] [2025-03-03 10:30:33,429 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-03 10:30:33,444 INFO L204 MainTranslator]: Completed translation [2025-03-03 10:30:33,444 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 10:30:33 WrapperNode [2025-03-03 10:30:33,445 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-03 10:30:33,446 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-03 10:30:33,446 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-03 10:30:33,446 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-03 10:30:33,451 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:30:33" (1/1) ... [2025-03-03 10:30:33,465 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:30:33" (1/1) ... [2025-03-03 10:30:33,515 INFO L138 Inliner]: procedures = 14, calls = 8, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 595 [2025-03-03 10:30:33,516 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-03 10:30:33,516 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-03 10:30:33,516 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-03 10:30:33,516 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-03 10:30:33,524 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 10:30:33" (1/1) ... [2025-03-03 10:30:33,524 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 10:30:33" (1/1) ... [2025-03-03 10:30:33,531 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 10:30:33" (1/1) ... [2025-03-03 10:30:33,555 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:30:33,555 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 10:30:33" (1/1) ... [2025-03-03 10:30:33,555 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 10:30:33" (1/1) ... [2025-03-03 10:30:33,567 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 10:30:33" (1/1) ... [2025-03-03 10:30:33,569 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 10:30:33" (1/1) ... [2025-03-03 10:30:33,571 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 10:30:33" (1/1) ... [2025-03-03 10:30:33,572 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 10:30:33" (1/1) ... [2025-03-03 10:30:33,576 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-03 10:30:33,577 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-03 10:30:33,577 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-03 10:30:33,577 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-03 10:30:33,578 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 10:30:33" (1/1) ... [2025-03-03 10:30:33,584 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-03 10:30:33,593 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 10:30:33,606 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:30:33,613 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:30:33,628 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-03 10:30:33,628 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-03-03 10:30:33,628 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-03 10:30:33,628 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-03 10:30:33,675 INFO L256 CfgBuilder]: Building ICFG [2025-03-03 10:30:33,677 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-03 10:30:34,411 INFO L? ?]: Removed 84 outVars from TransFormulas that were not future-live. [2025-03-03 10:30:34,411 INFO L307 CfgBuilder]: Performing block encoding [2025-03-03 10:30:34,423 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-03 10:30:34,423 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-03 10:30:34,423 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 03.03 10:30:34 BoogieIcfgContainer [2025-03-03 10:30:34,424 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-03 10:30:34,425 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-03 10:30:34,426 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-03 10:30:34,429 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-03 10:30:34,430 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 03.03 10:30:33" (1/3) ... [2025-03-03 10:30:34,431 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4108a0f3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 03.03 10:30:34, skipping insertion in model container [2025-03-03 10:30:34,431 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 10:30:33" (2/3) ... [2025-03-03 10:30:34,432 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4108a0f3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 03.03 10:30:34, skipping insertion in model container [2025-03-03 10:30:34,433 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 03.03 10:30:34" (3/3) ... [2025-03-03 10:30:34,434 INFO L128 eAbstractionObserver]: Analyzing ICFG Problem10_label20.c [2025-03-03 10:30:34,448 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-03 10:30:34,449 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG Problem10_label20.c that has 1 procedures, 206 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-03-03 10:30:34,500 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-03 10:30:34,510 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;@2bd7a7d, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-03 10:30:34,510 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-03-03 10:30:34,514 INFO L276 IsEmpty]: Start isEmpty. Operand has 206 states, 204 states have (on average 1.6813725490196079) internal successors, (343), 205 states have internal predecessors, (343), 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:30:34,518 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2025-03-03 10:30:34,519 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 10:30:34,520 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] [2025-03-03 10:30:34,520 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 10:30:34,523 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 10:30:34,523 INFO L85 PathProgramCache]: Analyzing trace with hash 1662509853, now seen corresponding path program 1 times [2025-03-03 10:30:34,529 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 10:30:34,530 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1726591782] [2025-03-03 10:30:34,530 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 10:30:34,531 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 10:30:34,579 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 28 statements into 1 equivalence classes. [2025-03-03 10:30:34,599 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 28 of 28 statements. [2025-03-03 10:30:34,599 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 10:30:34,599 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 10:30:34,707 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:30:34,710 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 10:30:34,710 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1726591782] [2025-03-03 10:30:34,710 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1726591782] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 10:30:34,710 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 10:30:34,710 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-03 10:30:34,711 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1709655418] [2025-03-03 10:30:34,712 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 10:30:34,714 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-03 10:30:34,715 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 10:30:34,727 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-03 10:30:34,727 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 10:30:34,729 INFO L87 Difference]: Start difference. First operand has 206 states, 204 states have (on average 1.6813725490196079) internal successors, (343), 205 states have internal predecessors, (343), 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 9.333333333333334) internal successors, (28), 2 states have internal predecessors, (28), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 10:30:35,310 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 10:30:35,310 INFO L93 Difference]: Finished difference Result 552 states and 963 transitions. [2025-03-03 10:30:35,312 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-03 10:30:35,313 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 9.333333333333334) internal successors, (28), 2 states have internal predecessors, (28), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 28 [2025-03-03 10:30:35,313 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 10:30:35,320 INFO L225 Difference]: With dead ends: 552 [2025-03-03 10:30:35,321 INFO L226 Difference]: Without dead ends: 282 [2025-03-03 10:30:35,325 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:30:35,329 INFO L435 NwaCegarLoop]: 69 mSDtfsCounter, 160 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 424 mSolverCounterSat, 137 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 160 SdHoareTripleChecker+Valid, 76 SdHoareTripleChecker+Invalid, 561 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 137 IncrementalHoareTripleChecker+Valid, 424 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-03-03 10:30:35,329 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [160 Valid, 76 Invalid, 561 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [137 Valid, 424 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-03-03 10:30:35,341 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 282 states. [2025-03-03 10:30:35,360 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 282 to 282. [2025-03-03 10:30:35,361 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 282 states, 281 states have (on average 1.5373665480427046) internal successors, (432), 281 states have internal predecessors, (432), 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:30:35,364 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 282 states to 282 states and 432 transitions. [2025-03-03 10:30:35,366 INFO L78 Accepts]: Start accepts. Automaton has 282 states and 432 transitions. Word has length 28 [2025-03-03 10:30:35,366 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 10:30:35,366 INFO L471 AbstractCegarLoop]: Abstraction has 282 states and 432 transitions. [2025-03-03 10:30:35,366 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 9.333333333333334) internal successors, (28), 2 states have internal predecessors, (28), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 10:30:35,366 INFO L276 IsEmpty]: Start isEmpty. Operand 282 states and 432 transitions. [2025-03-03 10:30:35,368 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 98 [2025-03-03 10:30:35,368 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 10:30:35,368 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:30:35,368 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-03-03 10:30:35,369 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 10:30:35,369 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 10:30:35,369 INFO L85 PathProgramCache]: Analyzing trace with hash -264873581, now seen corresponding path program 1 times [2025-03-03 10:30:35,369 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 10:30:35,369 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1705464110] [2025-03-03 10:30:35,369 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 10:30:35,369 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 10:30:35,387 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 97 statements into 1 equivalence classes. [2025-03-03 10:30:35,417 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 97 of 97 statements. [2025-03-03 10:30:35,417 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 10:30:35,417 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 10:30:35,552 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 25 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 10:30:35,552 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 10:30:35,552 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1705464110] [2025-03-03 10:30:35,552 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1705464110] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 10:30:35,552 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 10:30:35,552 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-03 10:30:35,552 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1602081140] [2025-03-03 10:30:35,553 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 10:30:35,553 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-03 10:30:35,553 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 10:30:35,554 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-03 10:30:35,554 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 10:30:35,554 INFO L87 Difference]: Start difference. First operand 282 states and 432 transitions. Second operand has 3 states, 3 states have (on average 32.333333333333336) internal successors, (97), 2 states have internal predecessors, (97), 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:30:35,966 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 10:30:35,966 INFO L93 Difference]: Finished difference Result 701 states and 1076 transitions. [2025-03-03 10:30:35,967 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-03 10:30:35,967 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 32.333333333333336) internal successors, (97), 2 states have internal predecessors, (97), 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 97 [2025-03-03 10:30:35,967 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 10:30:35,969 INFO L225 Difference]: With dead ends: 701 [2025-03-03 10:30:35,969 INFO L226 Difference]: Without dead ends: 421 [2025-03-03 10:30:35,970 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:30:35,970 INFO L435 NwaCegarLoop]: 31 mSDtfsCounter, 109 mSDsluCounter, 3 mSDsCounter, 0 mSdLazyCounter, 334 mSolverCounterSat, 98 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 109 SdHoareTripleChecker+Valid, 34 SdHoareTripleChecker+Invalid, 432 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 98 IncrementalHoareTripleChecker+Valid, 334 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-03-03 10:30:35,970 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [109 Valid, 34 Invalid, 432 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [98 Valid, 334 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-03-03 10:30:35,971 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 421 states. [2025-03-03 10:30:35,982 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 421 to 421. [2025-03-03 10:30:35,983 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 421 states, 420 states have (on average 1.4190476190476191) internal successors, (596), 420 states have internal predecessors, (596), 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:30:35,984 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 421 states to 421 states and 596 transitions. [2025-03-03 10:30:35,984 INFO L78 Accepts]: Start accepts. Automaton has 421 states and 596 transitions. Word has length 97 [2025-03-03 10:30:35,984 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 10:30:35,984 INFO L471 AbstractCegarLoop]: Abstraction has 421 states and 596 transitions. [2025-03-03 10:30:35,984 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 32.333333333333336) internal successors, (97), 2 states have internal predecessors, (97), 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:30:35,988 INFO L276 IsEmpty]: Start isEmpty. Operand 421 states and 596 transitions. [2025-03-03 10:30:35,989 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 104 [2025-03-03 10:30:35,989 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 10:30:35,990 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:30:35,990 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-03-03 10:30:35,990 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 10:30:35,990 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 10:30:35,990 INFO L85 PathProgramCache]: Analyzing trace with hash -1367901436, now seen corresponding path program 1 times [2025-03-03 10:30:35,990 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 10:30:35,990 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [74837848] [2025-03-03 10:30:35,990 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 10:30:35,990 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 10:30:36,009 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 103 statements into 1 equivalence classes. [2025-03-03 10:30:36,032 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 103 of 103 statements. [2025-03-03 10:30:36,033 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 10:30:36,034 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 10:30:36,146 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 25 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 10:30:36,146 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 10:30:36,146 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [74837848] [2025-03-03 10:30:36,146 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [74837848] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 10:30:36,146 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 10:30:36,146 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-03 10:30:36,146 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1152054981] [2025-03-03 10:30:36,146 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 10:30:36,147 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-03 10:30:36,147 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 10:30:36,147 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-03 10:30:36,147 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 10:30:36,147 INFO L87 Difference]: Start difference. First operand 421 states and 596 transitions. Second operand has 3 states, 3 states have (on average 34.333333333333336) internal successors, (103), 3 states have internal predecessors, (103), 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:30:36,546 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 10:30:36,547 INFO L93 Difference]: Finished difference Result 1257 states and 1783 transitions. [2025-03-03 10:30:36,547 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-03 10:30:36,547 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 34.333333333333336) internal successors, (103), 3 states have internal predecessors, (103), 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 103 [2025-03-03 10:30:36,548 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 10:30:36,550 INFO L225 Difference]: With dead ends: 1257 [2025-03-03 10:30:36,550 INFO L226 Difference]: Without dead ends: 838 [2025-03-03 10:30:36,551 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:30:36,551 INFO L435 NwaCegarLoop]: 200 mSDtfsCounter, 121 mSDsluCounter, 5 mSDsCounter, 0 mSdLazyCounter, 371 mSolverCounterSat, 61 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 121 SdHoareTripleChecker+Valid, 205 SdHoareTripleChecker+Invalid, 432 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 61 IncrementalHoareTripleChecker+Valid, 371 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-03-03 10:30:36,552 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [121 Valid, 205 Invalid, 432 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [61 Valid, 371 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-03-03 10:30:36,554 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 838 states. [2025-03-03 10:30:36,567 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 838 to 699. [2025-03-03 10:30:36,568 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 699 states, 698 states have (on average 1.32378223495702) internal successors, (924), 698 states have internal predecessors, (924), 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:30:36,572 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 699 states to 699 states and 924 transitions. [2025-03-03 10:30:36,572 INFO L78 Accepts]: Start accepts. Automaton has 699 states and 924 transitions. Word has length 103 [2025-03-03 10:30:36,572 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 10:30:36,573 INFO L471 AbstractCegarLoop]: Abstraction has 699 states and 924 transitions. [2025-03-03 10:30:36,573 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 34.333333333333336) internal successors, (103), 3 states have internal predecessors, (103), 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:30:36,573 INFO L276 IsEmpty]: Start isEmpty. Operand 699 states and 924 transitions. [2025-03-03 10:30:36,577 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 115 [2025-03-03 10:30:36,577 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 10:30:36,577 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:30:36,577 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-03-03 10:30:36,577 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 10:30:36,578 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 10:30:36,578 INFO L85 PathProgramCache]: Analyzing trace with hash -2059254907, now seen corresponding path program 1 times [2025-03-03 10:30:36,578 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 10:30:36,578 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1042769472] [2025-03-03 10:30:36,578 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 10:30:36,578 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 10:30:36,600 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 114 statements into 1 equivalence classes. [2025-03-03 10:30:36,613 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 114 of 114 statements. [2025-03-03 10:30:36,614 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 10:30:36,614 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 10:30:36,734 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 25 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 10:30:36,734 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 10:30:36,734 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1042769472] [2025-03-03 10:30:36,734 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1042769472] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 10:30:36,734 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 10:30:36,735 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-03 10:30:36,735 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1507663845] [2025-03-03 10:30:36,735 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 10:30:36,735 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-03 10:30:36,735 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 10:30:36,736 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-03 10:30:36,736 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 10:30:36,736 INFO L87 Difference]: Start difference. First operand 699 states and 924 transitions. Second operand has 3 states, 3 states have (on average 38.0) internal successors, (114), 2 states have internal predecessors, (114), 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:30:37,127 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 10:30:37,128 INFO L93 Difference]: Finished difference Result 1674 states and 2225 transitions. [2025-03-03 10:30:37,128 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-03 10:30:37,128 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 38.0) internal successors, (114), 2 states have internal predecessors, (114), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 114 [2025-03-03 10:30:37,128 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 10:30:37,131 INFO L225 Difference]: With dead ends: 1674 [2025-03-03 10:30:37,131 INFO L226 Difference]: Without dead ends: 977 [2025-03-03 10:30:37,133 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:30:37,136 INFO L435 NwaCegarLoop]: 67 mSDtfsCounter, 61 mSDsluCounter, 3 mSDsCounter, 0 mSdLazyCounter, 359 mSolverCounterSat, 67 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 61 SdHoareTripleChecker+Valid, 70 SdHoareTripleChecker+Invalid, 426 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 67 IncrementalHoareTripleChecker+Valid, 359 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-03-03 10:30:37,136 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [61 Valid, 70 Invalid, 426 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [67 Valid, 359 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-03-03 10:30:37,139 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 977 states. [2025-03-03 10:30:37,152 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 977 to 977. [2025-03-03 10:30:37,153 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 977 states, 976 states have (on average 1.1967213114754098) internal successors, (1168), 976 states have internal predecessors, (1168), 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:30:37,160 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 977 states to 977 states and 1168 transitions. [2025-03-03 10:30:37,160 INFO L78 Accepts]: Start accepts. Automaton has 977 states and 1168 transitions. Word has length 114 [2025-03-03 10:30:37,161 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 10:30:37,161 INFO L471 AbstractCegarLoop]: Abstraction has 977 states and 1168 transitions. [2025-03-03 10:30:37,161 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 38.0) internal successors, (114), 2 states have internal predecessors, (114), 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:30:37,161 INFO L276 IsEmpty]: Start isEmpty. Operand 977 states and 1168 transitions. [2025-03-03 10:30:37,163 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 142 [2025-03-03 10:30:37,163 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 10:30:37,163 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:30:37,163 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-03-03 10:30:37,164 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 10:30:37,164 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 10:30:37,164 INFO L85 PathProgramCache]: Analyzing trace with hash 1730183205, now seen corresponding path program 1 times [2025-03-03 10:30:37,164 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 10:30:37,164 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [151081095] [2025-03-03 10:30:37,164 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 10:30:37,164 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 10:30:37,189 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 141 statements into 1 equivalence classes. [2025-03-03 10:30:37,203 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 141 of 141 statements. [2025-03-03 10:30:37,203 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 10:30:37,203 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 10:30:37,443 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 25 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 10:30:37,443 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 10:30:37,444 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [151081095] [2025-03-03 10:30:37,444 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [151081095] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 10:30:37,444 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 10:30:37,444 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-03 10:30:37,444 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [716307104] [2025-03-03 10:30:37,444 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 10:30:37,444 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-03 10:30:37,444 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 10:30:37,444 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-03 10:30:37,445 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 10:30:37,445 INFO L87 Difference]: Start difference. First operand 977 states and 1168 transitions. Second operand has 3 states, 3 states have (on average 47.0) internal successors, (141), 2 states have internal predecessors, (141), 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:30:37,774 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 10:30:37,774 INFO L93 Difference]: Finished difference Result 2091 states and 2483 transitions. [2025-03-03 10:30:37,774 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-03 10:30:37,774 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 47.0) internal successors, (141), 2 states have internal predecessors, (141), 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 141 [2025-03-03 10:30:37,775 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 10:30:37,778 INFO L225 Difference]: With dead ends: 2091 [2025-03-03 10:30:37,778 INFO L226 Difference]: Without dead ends: 1116 [2025-03-03 10:30:37,779 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:30:37,780 INFO L435 NwaCegarLoop]: 78 mSDtfsCounter, 28 mSDsluCounter, 4 mSDsCounter, 0 mSdLazyCounter, 353 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 28 SdHoareTripleChecker+Valid, 82 SdHoareTripleChecker+Invalid, 357 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 353 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-03-03 10:30:37,780 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [28 Valid, 82 Invalid, 357 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 353 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-03 10:30:37,781 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1116 states. [2025-03-03 10:30:37,793 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1116 to 1116. [2025-03-03 10:30:37,794 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1116 states, 1115 states have (on average 1.1766816143497758) internal successors, (1312), 1115 states have internal predecessors, (1312), 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:30:37,796 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1116 states to 1116 states and 1312 transitions. [2025-03-03 10:30:37,797 INFO L78 Accepts]: Start accepts. Automaton has 1116 states and 1312 transitions. Word has length 141 [2025-03-03 10:30:37,797 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 10:30:37,797 INFO L471 AbstractCegarLoop]: Abstraction has 1116 states and 1312 transitions. [2025-03-03 10:30:37,798 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 47.0) internal successors, (141), 2 states have internal predecessors, (141), 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:30:37,798 INFO L276 IsEmpty]: Start isEmpty. Operand 1116 states and 1312 transitions. [2025-03-03 10:30:37,799 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 181 [2025-03-03 10:30:37,799 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 10:30:37,800 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, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2025-03-03 10:30:37,800 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-03-03 10:30:37,800 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 10:30:37,800 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 10:30:37,800 INFO L85 PathProgramCache]: Analyzing trace with hash -1599436065, now seen corresponding path program 1 times [2025-03-03 10:30:37,800 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 10:30:37,800 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1612049094] [2025-03-03 10:30:37,801 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 10:30:37,801 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 10:30:37,816 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 180 statements into 1 equivalence classes. [2025-03-03 10:30:37,832 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 180 of 180 statements. [2025-03-03 10:30:37,832 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 10:30:37,832 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 10:30:37,947 INFO L134 CoverageAnalysis]: Checked inductivity of 116 backedges. 116 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 10:30:37,947 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 10:30:37,947 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1612049094] [2025-03-03 10:30:37,947 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1612049094] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 10:30:37,947 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 10:30:37,948 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-03 10:30:37,948 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2064067951] [2025-03-03 10:30:37,948 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 10:30:37,948 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-03 10:30:37,948 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 10:30:37,948 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-03 10:30:37,948 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 10:30:37,948 INFO L87 Difference]: Start difference. First operand 1116 states and 1312 transitions. Second operand has 3 states, 3 states have (on average 60.0) internal successors, (180), 3 states have internal predecessors, (180), 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:30:38,305 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 10:30:38,306 INFO L93 Difference]: Finished difference Result 2369 states and 2857 transitions. [2025-03-03 10:30:38,306 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-03 10:30:38,306 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 60.0) internal successors, (180), 3 states have internal predecessors, (180), 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 180 [2025-03-03 10:30:38,306 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 10:30:38,310 INFO L225 Difference]: With dead ends: 2369 [2025-03-03 10:30:38,310 INFO L226 Difference]: Without dead ends: 1394 [2025-03-03 10:30:38,311 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:30:38,312 INFO L435 NwaCegarLoop]: 210 mSDtfsCounter, 58 mSDsluCounter, 5 mSDsCounter, 0 mSdLazyCounter, 340 mSolverCounterSat, 60 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 58 SdHoareTripleChecker+Valid, 215 SdHoareTripleChecker+Invalid, 400 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 60 IncrementalHoareTripleChecker+Valid, 340 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-03-03 10:30:38,312 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [58 Valid, 215 Invalid, 400 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [60 Valid, 340 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-03 10:30:38,315 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1394 states. [2025-03-03 10:30:38,327 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1394 to 1255. [2025-03-03 10:30:38,329 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1255 states, 1254 states have (on average 1.1650717703349283) internal successors, (1461), 1254 states have internal predecessors, (1461), 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:30:38,331 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1255 states to 1255 states and 1461 transitions. [2025-03-03 10:30:38,331 INFO L78 Accepts]: Start accepts. Automaton has 1255 states and 1461 transitions. Word has length 180 [2025-03-03 10:30:38,331 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 10:30:38,332 INFO L471 AbstractCegarLoop]: Abstraction has 1255 states and 1461 transitions. [2025-03-03 10:30:38,332 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 60.0) internal successors, (180), 3 states have internal predecessors, (180), 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:30:38,332 INFO L276 IsEmpty]: Start isEmpty. Operand 1255 states and 1461 transitions. [2025-03-03 10:30:38,333 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 203 [2025-03-03 10:30:38,333 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 10:30:38,334 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, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2025-03-03 10:30:38,334 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-03-03 10:30:38,334 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 10:30:38,335 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 10:30:38,335 INFO L85 PathProgramCache]: Analyzing trace with hash -1642882488, now seen corresponding path program 1 times [2025-03-03 10:30:38,335 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 10:30:38,335 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1841149102] [2025-03-03 10:30:38,335 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 10:30:38,335 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 10:30:38,361 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 202 statements into 1 equivalence classes. [2025-03-03 10:30:38,373 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 202 of 202 statements. [2025-03-03 10:30:38,374 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 10:30:38,374 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 10:30:38,470 INFO L134 CoverageAnalysis]: Checked inductivity of 116 backedges. 51 proven. 0 refuted. 0 times theorem prover too weak. 65 trivial. 0 not checked. [2025-03-03 10:30:38,470 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 10:30:38,470 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1841149102] [2025-03-03 10:30:38,470 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1841149102] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 10:30:38,470 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 10:30:38,470 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-03 10:30:38,470 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [908992389] [2025-03-03 10:30:38,470 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 10:30:38,470 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-03 10:30:38,470 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 10:30:38,471 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-03 10:30:38,471 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 10:30:38,471 INFO L87 Difference]: Start difference. First operand 1255 states and 1461 transitions. Second operand has 3 states, 3 states have (on average 46.0) internal successors, (138), 3 states have internal predecessors, (138), 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:30:38,823 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 10:30:38,823 INFO L93 Difference]: Finished difference Result 1813 states and 2105 transitions. [2025-03-03 10:30:38,823 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-03 10:30:38,823 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 46.0) internal successors, (138), 3 states have internal predecessors, (138), 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 202 [2025-03-03 10:30:38,823 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 10:30:38,828 INFO L225 Difference]: With dead ends: 1813 [2025-03-03 10:30:38,828 INFO L226 Difference]: Without dead ends: 1811 [2025-03-03 10:30:38,828 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:30:38,829 INFO L435 NwaCegarLoop]: 7 mSDtfsCounter, 156 mSDsluCounter, 4 mSDsCounter, 0 mSdLazyCounter, 355 mSolverCounterSat, 73 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 156 SdHoareTripleChecker+Valid, 11 SdHoareTripleChecker+Invalid, 428 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 73 IncrementalHoareTripleChecker+Valid, 355 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-03-03 10:30:38,829 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [156 Valid, 11 Invalid, 428 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [73 Valid, 355 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-03 10:30:38,830 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1811 states. [2025-03-03 10:30:38,843 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1811 to 1255. [2025-03-03 10:30:38,845 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1255 states, 1254 states have (on average 1.1650717703349283) internal successors, (1461), 1254 states have internal predecessors, (1461), 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:30:38,847 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1255 states to 1255 states and 1461 transitions. [2025-03-03 10:30:38,848 INFO L78 Accepts]: Start accepts. Automaton has 1255 states and 1461 transitions. Word has length 202 [2025-03-03 10:30:38,848 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 10:30:38,848 INFO L471 AbstractCegarLoop]: Abstraction has 1255 states and 1461 transitions. [2025-03-03 10:30:38,848 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 46.0) internal successors, (138), 3 states have internal predecessors, (138), 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:30:38,848 INFO L276 IsEmpty]: Start isEmpty. Operand 1255 states and 1461 transitions. [2025-03-03 10:30:38,850 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 292 [2025-03-03 10:30:38,850 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 10:30:38,851 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, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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] [2025-03-03 10:30:38,851 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-03-03 10:30:38,851 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 10:30:38,851 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 10:30:38,851 INFO L85 PathProgramCache]: Analyzing trace with hash 731131163, now seen corresponding path program 1 times [2025-03-03 10:30:38,852 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 10:30:38,852 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2057594775] [2025-03-03 10:30:38,852 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 10:30:38,852 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 10:30:38,871 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 291 statements into 1 equivalence classes. [2025-03-03 10:30:38,882 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 291 of 291 statements. [2025-03-03 10:30:38,883 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 10:30:38,883 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 10:30:39,221 INFO L134 CoverageAnalysis]: Checked inductivity of 296 backedges. 252 proven. 0 refuted. 0 times theorem prover too weak. 44 trivial. 0 not checked. [2025-03-03 10:30:39,221 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 10:30:39,221 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2057594775] [2025-03-03 10:30:39,221 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2057594775] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 10:30:39,221 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 10:30:39,221 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-03 10:30:39,221 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [123913590] [2025-03-03 10:30:39,221 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 10:30:39,222 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-03-03 10:30:39,222 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 10:30:39,222 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-03-03 10:30:39,222 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2025-03-03 10:30:39,222 INFO L87 Difference]: Start difference. First operand 1255 states and 1461 transitions. Second operand has 7 states, 7 states have (on average 35.57142857142857) internal successors, (249), 6 states have internal predecessors, (249), 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:30:39,701 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 10:30:39,701 INFO L93 Difference]: Finished difference Result 2424 states and 2831 transitions. [2025-03-03 10:30:39,701 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-03-03 10:30:39,701 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 35.57142857142857) internal successors, (249), 6 states have internal predecessors, (249), 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 291 [2025-03-03 10:30:39,702 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 10:30:39,705 INFO L225 Difference]: With dead ends: 2424 [2025-03-03 10:30:39,705 INFO L226 Difference]: Without dead ends: 1255 [2025-03-03 10:30:39,706 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2025-03-03 10:30:39,706 INFO L435 NwaCegarLoop]: 9 mSDtfsCounter, 142 mSDsluCounter, 21 mSDsCounter, 0 mSdLazyCounter, 962 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 142 SdHoareTripleChecker+Valid, 30 SdHoareTripleChecker+Invalid, 962 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 962 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-03-03 10:30:39,707 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [142 Valid, 30 Invalid, 962 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 962 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-03-03 10:30:39,707 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1255 states. [2025-03-03 10:30:39,719 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1255 to 1255. [2025-03-03 10:30:39,720 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1255 states, 1254 states have (on average 1.1602870813397128) internal successors, (1455), 1254 states have internal predecessors, (1455), 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:30:39,723 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1255 states to 1255 states and 1455 transitions. [2025-03-03 10:30:39,723 INFO L78 Accepts]: Start accepts. Automaton has 1255 states and 1455 transitions. Word has length 291 [2025-03-03 10:30:39,723 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 10:30:39,723 INFO L471 AbstractCegarLoop]: Abstraction has 1255 states and 1455 transitions. [2025-03-03 10:30:39,723 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 35.57142857142857) internal successors, (249), 6 states have internal predecessors, (249), 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:30:39,723 INFO L276 IsEmpty]: Start isEmpty. Operand 1255 states and 1455 transitions. [2025-03-03 10:30:39,743 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 328 [2025-03-03 10:30:39,743 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 10:30:39,743 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, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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] [2025-03-03 10:30:39,744 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-03-03 10:30:39,744 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 10:30:39,744 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 10:30:39,744 INFO L85 PathProgramCache]: Analyzing trace with hash 447173825, now seen corresponding path program 1 times [2025-03-03 10:30:39,744 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 10:30:39,744 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [301305434] [2025-03-03 10:30:39,744 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 10:30:39,744 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 10:30:39,766 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 327 statements into 1 equivalence classes. [2025-03-03 10:30:39,783 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 327 of 327 statements. [2025-03-03 10:30:39,783 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 10:30:39,783 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 10:30:39,929 INFO L134 CoverageAnalysis]: Checked inductivity of 332 backedges. 77 proven. 0 refuted. 0 times theorem prover too weak. 255 trivial. 0 not checked. [2025-03-03 10:30:39,929 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 10:30:39,929 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [301305434] [2025-03-03 10:30:39,929 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [301305434] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 10:30:39,929 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 10:30:39,929 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-03 10:30:39,929 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1315031204] [2025-03-03 10:30:39,929 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 10:30:39,930 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-03 10:30:39,930 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 10:30:39,930 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-03 10:30:39,930 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 10:30:39,930 INFO L87 Difference]: Start difference. First operand 1255 states and 1455 transitions. Second operand has 3 states, 3 states have (on average 48.666666666666664) internal successors, (146), 3 states have internal predecessors, (146), 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:30:40,301 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 10:30:40,302 INFO L93 Difference]: Finished difference Result 2647 states and 3142 transitions. [2025-03-03 10:30:40,302 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-03 10:30:40,302 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 48.666666666666664) internal successors, (146), 3 states have internal predecessors, (146), 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 327 [2025-03-03 10:30:40,303 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 10:30:40,306 INFO L225 Difference]: With dead ends: 2647 [2025-03-03 10:30:40,306 INFO L226 Difference]: Without dead ends: 1533 [2025-03-03 10:30:40,307 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:30:40,308 INFO L435 NwaCegarLoop]: 210 mSDtfsCounter, 115 mSDsluCounter, 5 mSDsCounter, 0 mSdLazyCounter, 361 mSolverCounterSat, 41 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 115 SdHoareTripleChecker+Valid, 215 SdHoareTripleChecker+Invalid, 402 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 41 IncrementalHoareTripleChecker+Valid, 361 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-03-03 10:30:40,308 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [115 Valid, 215 Invalid, 402 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [41 Valid, 361 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-03-03 10:30:40,309 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1533 states. [2025-03-03 10:30:40,321 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1533 to 1394. [2025-03-03 10:30:40,323 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1394 states, 1393 states have (on average 1.1550610193826274) internal successors, (1609), 1393 states have internal predecessors, (1609), 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:30:40,326 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1394 states to 1394 states and 1609 transitions. [2025-03-03 10:30:40,326 INFO L78 Accepts]: Start accepts. Automaton has 1394 states and 1609 transitions. Word has length 327 [2025-03-03 10:30:40,326 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 10:30:40,326 INFO L471 AbstractCegarLoop]: Abstraction has 1394 states and 1609 transitions. [2025-03-03 10:30:40,326 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 48.666666666666664) internal successors, (146), 3 states have internal predecessors, (146), 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:30:40,326 INFO L276 IsEmpty]: Start isEmpty. Operand 1394 states and 1609 transitions. [2025-03-03 10:30:40,329 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 329 [2025-03-03 10:30:40,329 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 10:30:40,329 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, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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] [2025-03-03 10:30:40,329 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-03-03 10:30:40,329 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 10:30:40,330 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 10:30:40,330 INFO L85 PathProgramCache]: Analyzing trace with hash 1927327247, now seen corresponding path program 1 times [2025-03-03 10:30:40,330 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 10:30:40,330 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1411048285] [2025-03-03 10:30:40,330 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 10:30:40,330 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 10:30:40,364 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 328 statements into 1 equivalence classes. [2025-03-03 10:30:40,379 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 328 of 328 statements. [2025-03-03 10:30:40,380 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 10:30:40,380 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 10:30:40,665 INFO L134 CoverageAnalysis]: Checked inductivity of 322 backedges. 277 proven. 45 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 10:30:40,665 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 10:30:40,665 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1411048285] [2025-03-03 10:30:40,665 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1411048285] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-03 10:30:40,665 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1869032614] [2025-03-03 10:30:40,665 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 10:30:40,665 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 10:30:40,665 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 10:30:40,668 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:30:40,669 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:30:40,716 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 328 statements into 1 equivalence classes. [2025-03-03 10:30:40,762 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 328 of 328 statements. [2025-03-03 10:30:40,763 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 10:30:40,763 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 10:30:40,765 INFO L256 TraceCheckSpWp]: Trace formula consists of 456 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-03-03 10:30:40,772 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 10:30:40,939 INFO L134 CoverageAnalysis]: Checked inductivity of 322 backedges. 255 proven. 0 refuted. 0 times theorem prover too weak. 67 trivial. 0 not checked. [2025-03-03 10:30:40,942 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-03 10:30:40,943 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1869032614] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 10:30:40,943 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-03 10:30:40,943 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [5] total 7 [2025-03-03 10:30:40,943 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1789132117] [2025-03-03 10:30:40,943 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 10:30:40,943 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-03 10:30:40,943 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 10:30:40,944 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-03 10:30:40,944 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2025-03-03 10:30:40,944 INFO L87 Difference]: Start difference. First operand 1394 states and 1609 transitions. Second operand has 3 states, 3 states have (on average 87.33333333333333) internal successors, (262), 3 states have internal predecessors, (262), 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:30:41,306 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 10:30:41,307 INFO L93 Difference]: Finished difference Result 3481 states and 4040 transitions. [2025-03-03 10:30:41,307 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-03 10:30:41,307 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 87.33333333333333) internal successors, (262), 3 states have internal predecessors, (262), 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 328 [2025-03-03 10:30:41,308 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 10:30:41,314 INFO L225 Difference]: With dead ends: 3481 [2025-03-03 10:30:41,314 INFO L226 Difference]: Without dead ends: 2228 [2025-03-03 10:30:41,316 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 332 GetRequests, 327 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2025-03-03 10:30:41,317 INFO L435 NwaCegarLoop]: 200 mSDtfsCounter, 22 mSDsluCounter, 5 mSDsCounter, 0 mSdLazyCounter, 360 mSolverCounterSat, 61 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 22 SdHoareTripleChecker+Valid, 205 SdHoareTripleChecker+Invalid, 421 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 61 IncrementalHoareTripleChecker+Valid, 360 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-03-03 10:30:41,317 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [22 Valid, 205 Invalid, 421 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [61 Valid, 360 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-03 10:30:41,319 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2228 states. [2025-03-03 10:30:41,343 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2228 to 2228. [2025-03-03 10:30:41,346 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2228 states, 2227 states have (on average 1.1306690615177368) internal successors, (2518), 2227 states have internal predecessors, (2518), 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:30:41,351 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2228 states to 2228 states and 2518 transitions. [2025-03-03 10:30:41,352 INFO L78 Accepts]: Start accepts. Automaton has 2228 states and 2518 transitions. Word has length 328 [2025-03-03 10:30:41,352 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 10:30:41,352 INFO L471 AbstractCegarLoop]: Abstraction has 2228 states and 2518 transitions. [2025-03-03 10:30:41,352 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 87.33333333333333) internal successors, (262), 3 states have internal predecessors, (262), 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:30:41,352 INFO L276 IsEmpty]: Start isEmpty. Operand 2228 states and 2518 transitions. [2025-03-03 10:30:41,356 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 342 [2025-03-03 10:30:41,357 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 10:30:41,357 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, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 10:30:41,364 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:30:41,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,SelfDestructingSolverStorable9 [2025-03-03 10:30:41,561 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 10:30:41,562 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 10:30:41,562 INFO L85 PathProgramCache]: Analyzing trace with hash -2037301242, now seen corresponding path program 1 times [2025-03-03 10:30:41,562 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 10:30:41,562 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1689767434] [2025-03-03 10:30:41,562 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 10:30:41,562 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 10:30:41,588 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 341 statements into 1 equivalence classes. [2025-03-03 10:30:41,608 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 341 of 341 statements. [2025-03-03 10:30:41,608 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 10:30:41,609 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 10:30:41,771 INFO L134 CoverageAnalysis]: Checked inductivity of 348 backedges. 77 proven. 0 refuted. 0 times theorem prover too weak. 271 trivial. 0 not checked. [2025-03-03 10:30:41,771 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 10:30:41,772 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1689767434] [2025-03-03 10:30:41,772 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1689767434] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 10:30:41,772 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 10:30:41,772 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-03 10:30:41,772 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [869834204] [2025-03-03 10:30:41,772 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 10:30:41,773 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-03 10:30:41,773 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 10:30:41,773 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-03 10:30:41,773 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 10:30:41,773 INFO L87 Difference]: Start difference. First operand 2228 states and 2518 transitions. Second operand has 3 states, 3 states have (on average 50.666666666666664) internal successors, (152), 3 states have internal predecessors, (152), 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:30:42,121 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 10:30:42,122 INFO L93 Difference]: Finished difference Result 4315 states and 4891 transitions. [2025-03-03 10:30:42,122 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-03 10:30:42,122 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 50.666666666666664) internal successors, (152), 3 states have internal predecessors, (152), 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 341 [2025-03-03 10:30:42,122 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 10:30:42,129 INFO L225 Difference]: With dead ends: 4315 [2025-03-03 10:30:42,129 INFO L226 Difference]: Without dead ends: 2228 [2025-03-03 10:30:42,131 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:30:42,131 INFO L435 NwaCegarLoop]: 210 mSDtfsCounter, 118 mSDsluCounter, 5 mSDsCounter, 0 mSdLazyCounter, 354 mSolverCounterSat, 42 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 118 SdHoareTripleChecker+Valid, 215 SdHoareTripleChecker+Invalid, 396 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 42 IncrementalHoareTripleChecker+Valid, 354 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-03-03 10:30:42,132 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [118 Valid, 215 Invalid, 396 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [42 Valid, 354 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-03 10:30:42,133 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2228 states. [2025-03-03 10:30:42,157 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2228 to 2089. [2025-03-03 10:30:42,159 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2089 states, 2088 states have (on average 1.0919540229885059) internal successors, (2280), 2088 states have internal predecessors, (2280), 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:30:42,163 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2089 states to 2089 states and 2280 transitions. [2025-03-03 10:30:42,164 INFO L78 Accepts]: Start accepts. Automaton has 2089 states and 2280 transitions. Word has length 341 [2025-03-03 10:30:42,164 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 10:30:42,164 INFO L471 AbstractCegarLoop]: Abstraction has 2089 states and 2280 transitions. [2025-03-03 10:30:42,164 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 50.666666666666664) internal successors, (152), 3 states have internal predecessors, (152), 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:30:42,164 INFO L276 IsEmpty]: Start isEmpty. Operand 2089 states and 2280 transitions. [2025-03-03 10:30:42,167 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 343 [2025-03-03 10:30:42,168 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 10:30:42,168 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, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 10:30:42,168 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-03-03 10:30:42,168 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 10:30:42,168 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 10:30:42,169 INFO L85 PathProgramCache]: Analyzing trace with hash -2037608298, now seen corresponding path program 1 times [2025-03-03 10:30:42,169 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 10:30:42,169 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [531560834] [2025-03-03 10:30:42,169 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 10:30:42,169 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 10:30:42,195 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 342 statements into 1 equivalence classes. [2025-03-03 10:30:42,210 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 342 of 342 statements. [2025-03-03 10:30:42,211 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 10:30:42,211 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 10:30:42,331 INFO L134 CoverageAnalysis]: Checked inductivity of 348 backedges. 77 proven. 0 refuted. 0 times theorem prover too weak. 271 trivial. 0 not checked. [2025-03-03 10:30:42,331 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 10:30:42,331 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [531560834] [2025-03-03 10:30:42,331 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [531560834] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 10:30:42,331 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 10:30:42,331 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-03 10:30:42,331 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1901074634] [2025-03-03 10:30:42,331 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 10:30:42,332 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-03 10:30:42,332 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 10:30:42,332 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-03 10:30:42,332 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 10:30:42,332 INFO L87 Difference]: Start difference. First operand 2089 states and 2280 transitions. Second operand has 3 states, 3 states have (on average 51.0) internal successors, (153), 3 states have internal predecessors, (153), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 10:30:42,660 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 10:30:42,661 INFO L93 Difference]: Finished difference Result 4313 states and 4722 transitions. [2025-03-03 10:30:42,661 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-03 10:30:42,661 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 51.0) internal successors, (153), 3 states have internal predecessors, (153), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 342 [2025-03-03 10:30:42,662 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 10:30:42,662 INFO L225 Difference]: With dead ends: 4313 [2025-03-03 10:30:42,662 INFO L226 Difference]: Without dead ends: 0 [2025-03-03 10:30:42,664 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:30:42,665 INFO L435 NwaCegarLoop]: 218 mSDtfsCounter, 114 mSDsluCounter, 4 mSDsCounter, 0 mSdLazyCounter, 344 mSolverCounterSat, 36 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 114 SdHoareTripleChecker+Valid, 222 SdHoareTripleChecker+Invalid, 380 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 36 IncrementalHoareTripleChecker+Valid, 344 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-03-03 10:30:42,665 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [114 Valid, 222 Invalid, 380 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [36 Valid, 344 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-03 10:30:42,665 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2025-03-03 10:30:42,665 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2025-03-03 10:30:42,666 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:30:42,666 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2025-03-03 10:30:42,666 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 342 [2025-03-03 10:30:42,666 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 10:30:42,666 INFO L471 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2025-03-03 10:30:42,666 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 51.0) internal successors, (153), 3 states have internal predecessors, (153), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 10:30:42,666 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2025-03-03 10:30:42,666 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2025-03-03 10:30:42,668 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2025-03-03 10:30:42,668 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2025-03-03 10:30:42,670 INFO L422 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 10:30:42,672 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2025-03-03 10:30:42,903 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2025-03-03 10:30:42,919 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 03.03 10:30:42 BoogieIcfgContainer [2025-03-03 10:30:42,920 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2025-03-03 10:30:42,920 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2025-03-03 10:30:42,920 INFO L270 PluginConnector]: Initializing Witness Printer... [2025-03-03 10:30:42,921 INFO L274 PluginConnector]: Witness Printer initialized [2025-03-03 10:30:42,921 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 03.03 10:30:34" (3/4) ... [2025-03-03 10:30:42,923 INFO L146 WitnessPrinter]: Generating witness for correct program [2025-03-03 10:30:42,936 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 11 nodes and edges [2025-03-03 10:30:42,938 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 4 nodes and edges [2025-03-03 10:30:42,939 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 3 nodes and edges [2025-03-03 10:30:42,940 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2025-03-03 10:30:43,038 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2025-03-03 10:30:43,038 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.yml [2025-03-03 10:30:43,038 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2025-03-03 10:30:43,039 INFO L158 Benchmark]: Toolchain (without parser) took 9969.29ms. Allocated memory was 142.6MB in the beginning and 385.9MB in the end (delta: 243.3MB). Free memory was 103.5MB in the beginning and 198.1MB in the end (delta: -94.6MB). Peak memory consumption was 147.2MB. Max. memory is 16.1GB. [2025-03-03 10:30:43,039 INFO L158 Benchmark]: CDTParser took 0.20ms. Allocated memory is still 201.3MB. Free memory is still 126.9MB. There was no memory consumed. Max. memory is 16.1GB. [2025-03-03 10:30:43,039 INFO L158 Benchmark]: CACSL2BoogieTranslator took 374.24ms. Allocated memory is still 142.6MB. Free memory was 102.5MB in the beginning and 75.8MB in the end (delta: 26.7MB). Peak memory consumption was 33.6MB. Max. memory is 16.1GB. [2025-03-03 10:30:43,039 INFO L158 Benchmark]: Boogie Procedure Inliner took 69.87ms. Allocated memory is still 142.6MB. Free memory was 75.8MB in the beginning and 68.6MB in the end (delta: 7.2MB). There was no memory consumed. Max. memory is 16.1GB. [2025-03-03 10:30:43,040 INFO L158 Benchmark]: Boogie Preprocessor took 60.20ms. Allocated memory is still 142.6MB. Free memory was 68.6MB in the beginning and 60.2MB in the end (delta: 8.4MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-03-03 10:30:43,040 INFO L158 Benchmark]: IcfgBuilder took 846.70ms. Allocated memory is still 142.6MB. Free memory was 60.2MB in the beginning and 97.9MB in the end (delta: -37.7MB). Peak memory consumption was 46.7MB. Max. memory is 16.1GB. [2025-03-03 10:30:43,041 INFO L158 Benchmark]: TraceAbstraction took 8494.58ms. Allocated memory was 142.6MB in the beginning and 385.9MB in the end (delta: 243.3MB). Free memory was 97.0MB in the beginning and 210.3MB in the end (delta: -113.3MB). Peak memory consumption was 132.5MB. Max. memory is 16.1GB. [2025-03-03 10:30:43,041 INFO L158 Benchmark]: Witness Printer took 117.77ms. Allocated memory is still 385.9MB. Free memory was 210.3MB in the beginning and 198.1MB in the end (delta: 12.2MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-03-03 10:30:43,042 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.20ms. Allocated memory is still 201.3MB. Free memory is still 126.9MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 374.24ms. Allocated memory is still 142.6MB. Free memory was 102.5MB in the beginning and 75.8MB in the end (delta: 26.7MB). Peak memory consumption was 33.6MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 69.87ms. Allocated memory is still 142.6MB. Free memory was 75.8MB in the beginning and 68.6MB in the end (delta: 7.2MB). There was no memory consumed. Max. memory is 16.1GB. * Boogie Preprocessor took 60.20ms. Allocated memory is still 142.6MB. Free memory was 68.6MB in the beginning and 60.2MB in the end (delta: 8.4MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * IcfgBuilder took 846.70ms. Allocated memory is still 142.6MB. Free memory was 60.2MB in the beginning and 97.9MB in the end (delta: -37.7MB). Peak memory consumption was 46.7MB. Max. memory is 16.1GB. * TraceAbstraction took 8494.58ms. Allocated memory was 142.6MB in the beginning and 385.9MB in the end (delta: 243.3MB). Free memory was 97.0MB in the beginning and 210.3MB in the end (delta: -113.3MB). Peak memory consumption was 132.5MB. Max. memory is 16.1GB. * Witness Printer took 117.77ms. Allocated memory is still 385.9MB. Free memory was 210.3MB in the beginning and 198.1MB in the end (delta: 12.2MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * 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: 98]: 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, 206 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 8.2s, OverallIterations: 12, TraceHistogramMax: 4, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.1s, AutomataDifference: 4.8s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 1204 SdHoareTripleChecker+Valid, 4.4s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 1204 mSDsluCounter, 1580 SdHoareTripleChecker+Invalid, 3.7s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 71 mSDsCounter, 680 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 4917 IncrementalHoareTripleChecker+Invalid, 5597 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 680 mSolverCounterUnsat, 1509 mSDtfsCounter, 4917 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 364 GetRequests, 344 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=2228occurred in iteration=10, InterpolantAutomatonStates: 40, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.2s AutomataMinimizationTime, 12 MinimizatonAttempts, 1112 StatesRemovedByMinimization, 5 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.3s SatisfiabilityAnalysisTime, 2.1s InterpolantComputationTime, 2822 NumberOfCodeBlocks, 2822 NumberOfCodeBlocksAsserted, 13 NumberOfCheckSat, 2809 ConstructedInterpolants, 0 QuantifiedInterpolants, 7844 SizeOfPredicates, 0 NumberOfNonLiveVariables, 456 ConjunctsInSsa, 2 ConjunctsInUnsatCore, 13 InterpolantComputations, 12 PerfectInterpolantSequences, 2255/2300 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: 592]: Location Invariant Derived location invariant: (((((((((a10 <= 0) && (8 <= a19)) && (14 == a4)) && (a12 == 0)) || ((((a19 <= 9) && (a10 == 4)) && (14 == a4)) && (a12 == 0))) || ((((a19 <= 9) && (14 == a4)) && (a10 == 2)) && (a12 == 0))) || ((((a19 <= 9) && (a10 == 3)) && (14 == a4)) && (a12 == 0))) || (((a10 == 1) && (14 == a4)) && (a12 == 0))) || ((((a10 <= 0) && (14 == a4)) && (a12 == 0)) && (a19 == 6))) RESULT: Ultimate proved your program to be correct! [2025-03-03 10:30:43,055 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Ended with exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Result: TRUE