./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/eca-rers2012/Problem14_label33.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 8fc3dc66 Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/eca-rers2012/Problem14_label33.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 aec3d6b735697765f122fd4969787ab3e5c22f1789977e4ce823d6b216b50af2 --- Real Ultimate output --- This is Ultimate 0.3.0-?-8fc3dc6-m [2025-03-16 15:06:17,218 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-16 15:06:17,270 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2025-03-16 15:06:17,274 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-16 15:06:17,274 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-16 15:06:17,293 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-16 15:06:17,293 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-16 15:06:17,294 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-16 15:06:17,294 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-16 15:06:17,294 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-16 15:06:17,294 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-16 15:06:17,294 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-16 15:06:17,294 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-16 15:06:17,294 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-16 15:06:17,294 INFO L153 SettingsManager]: * Use SBE=true [2025-03-16 15:06:17,294 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-16 15:06:17,295 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-16 15:06:17,295 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-16 15:06:17,296 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-16 15:06:17,296 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-16 15:06:17,296 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-16 15:06:17,296 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-16 15:06:17,296 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-16 15:06:17,296 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-16 15:06:17,296 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-16 15:06:17,296 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-16 15:06:17,296 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-16 15:06:17,296 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-16 15:06:17,296 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-16 15:06:17,296 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-16 15:06:17,297 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-16 15:06:17,297 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-16 15:06:17,297 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-16 15:06:17,297 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-16 15:06:17,297 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-16 15:06:17,297 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-16 15:06:17,297 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-16 15:06:17,297 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-16 15:06:17,297 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-16 15:06:17,297 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-16 15:06:17,297 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-16 15:06:17,297 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-16 15:06:17,297 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-16 15:06:17,297 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 -> aec3d6b735697765f122fd4969787ab3e5c22f1789977e4ce823d6b216b50af2 [2025-03-16 15:06:17,525 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-16 15:06:17,530 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-16 15:06:17,532 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-16 15:06:17,533 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-16 15:06:17,533 INFO L274 PluginConnector]: CDTParser initialized [2025-03-16 15:06:17,534 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/eca-rers2012/Problem14_label33.c [2025-03-16 15:06:18,686 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/abb638918/a4225f28d508454ead8265e3b63480f3/FLAG3674c9cf9 [2025-03-16 15:06:18,959 INFO L384 CDTParser]: Found 1 translation units. [2025-03-16 15:06:18,960 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/eca-rers2012/Problem14_label33.c [2025-03-16 15:06:18,974 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/abb638918/a4225f28d508454ead8265e3b63480f3/FLAG3674c9cf9 [2025-03-16 15:06:18,990 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/abb638918/a4225f28d508454ead8265e3b63480f3 [2025-03-16 15:06:18,992 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-16 15:06:18,993 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-16 15:06:18,995 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-16 15:06:18,995 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-16 15:06:18,998 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-16 15:06:18,999 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.03 03:06:18" (1/1) ... [2025-03-16 15:06:18,999 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@aea1e71 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 03:06:18, skipping insertion in model container [2025-03-16 15:06:19,000 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.03 03:06:18" (1/1) ... [2025-03-16 15:06:19,034 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-16 15:06:19,169 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/Problem14_label33.c[5937,5950] [2025-03-16 15:06:19,268 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-16 15:06:19,279 INFO L200 MainTranslator]: Completed pre-run [2025-03-16 15:06:19,299 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/Problem14_label33.c[5937,5950] [2025-03-16 15:06:19,347 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-16 15:06:19,359 INFO L204 MainTranslator]: Completed translation [2025-03-16 15:06:19,360 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 03:06:19 WrapperNode [2025-03-16 15:06:19,360 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-16 15:06:19,361 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-16 15:06:19,361 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-16 15:06:19,361 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-16 15:06:19,366 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 03:06:19" (1/1) ... [2025-03-16 15:06:19,379 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 03:06:19" (1/1) ... [2025-03-16 15:06:19,421 INFO L138 Inliner]: procedures = 14, calls = 8, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 856 [2025-03-16 15:06:19,422 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-16 15:06:19,422 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-16 15:06:19,422 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-16 15:06:19,422 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-16 15:06:19,428 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 03:06:19" (1/1) ... [2025-03-16 15:06:19,429 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 03:06:19" (1/1) ... [2025-03-16 15:06:19,438 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 03:06:19" (1/1) ... [2025-03-16 15:06:19,462 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2025-03-16 15:06:19,463 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 03:06:19" (1/1) ... [2025-03-16 15:06:19,463 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 03:06:19" (1/1) ... [2025-03-16 15:06:19,481 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 03:06:19" (1/1) ... [2025-03-16 15:06:19,487 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 03:06:19" (1/1) ... [2025-03-16 15:06:19,495 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 03:06:19" (1/1) ... [2025-03-16 15:06:19,501 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 03:06:19" (1/1) ... [2025-03-16 15:06:19,509 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-16 15:06:19,509 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-16 15:06:19,510 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-16 15:06:19,510 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-16 15:06:19,511 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 03:06:19" (1/1) ... [2025-03-16 15:06:19,515 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-16 15:06:19,524 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-16 15:06:19,535 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-03-16 15:06:19,540 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-03-16 15:06:19,557 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-16 15:06:19,557 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-03-16 15:06:19,557 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-16 15:06:19,557 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-16 15:06:19,606 INFO L256 CfgBuilder]: Building ICFG [2025-03-16 15:06:19,607 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-16 15:06:20,519 INFO L? ?]: Removed 123 outVars from TransFormulas that were not future-live. [2025-03-16 15:06:20,519 INFO L307 CfgBuilder]: Performing block encoding [2025-03-16 15:06:20,532 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-16 15:06:20,532 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-16 15:06:20,533 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 16.03 03:06:20 BoogieIcfgContainer [2025-03-16 15:06:20,533 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-16 15:06:20,534 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-16 15:06:20,534 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-16 15:06:20,537 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-16 15:06:20,538 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 16.03 03:06:18" (1/3) ... [2025-03-16 15:06:20,538 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2a29492a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.03 03:06:20, skipping insertion in model container [2025-03-16 15:06:20,538 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 03:06:19" (2/3) ... [2025-03-16 15:06:20,538 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2a29492a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.03 03:06:20, skipping insertion in model container [2025-03-16 15:06:20,538 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 16.03 03:06:20" (3/3) ... [2025-03-16 15:06:20,539 INFO L128 eAbstractionObserver]: Analyzing ICFG Problem14_label33.c [2025-03-16 15:06:20,551 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-16 15:06:20,552 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG Problem14_label33.c that has 1 procedures, 184 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-03-16 15:06:20,599 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-16 15:06:20,609 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;@5ffb7a22, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-16 15:06:20,609 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-03-16 15:06:20,614 INFO L276 IsEmpty]: Start isEmpty. Operand has 184 states, 182 states have (on average 1.978021978021978) internal successors, (360), 183 states have internal predecessors, (360), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 15:06:20,619 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2025-03-16 15:06:20,620 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 15:06:20,621 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 15:06:20,621 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 15:06:20,625 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 15:06:20,626 INFO L85 PathProgramCache]: Analyzing trace with hash -753139410, now seen corresponding path program 1 times [2025-03-16 15:06:20,631 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 15:06:20,631 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [942005941] [2025-03-16 15:06:20,631 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 15:06:20,632 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 15:06:20,681 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 57 statements into 1 equivalence classes. [2025-03-16 15:06:20,696 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 57 of 57 statements. [2025-03-16 15:06:20,696 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 15:06:20,697 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 15:06:20,740 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-16 15:06:20,741 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 15:06:20,741 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [942005941] [2025-03-16 15:06:20,741 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [942005941] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 15:06:20,742 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 15:06:20,742 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-16 15:06:20,743 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1193921300] [2025-03-16 15:06:20,743 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 15:06:20,748 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-03-16 15:06:20,750 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 15:06:20,764 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-03-16 15:06:20,764 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-03-16 15:06:20,767 INFO L87 Difference]: Start difference. First operand has 184 states, 182 states have (on average 1.978021978021978) internal successors, (360), 183 states have internal predecessors, (360), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 2 states, 2 states have (on average 28.5) internal successors, (57), 2 states have internal predecessors, (57), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 15:06:20,794 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 15:06:20,794 INFO L93 Difference]: Finished difference Result 367 states and 719 transitions. [2025-03-16 15:06:20,795 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-03-16 15:06:20,796 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 28.5) internal successors, (57), 2 states have internal predecessors, (57), 0 states have call successors, (0), 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 57 [2025-03-16 15:06:20,796 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 15:06:20,803 INFO L225 Difference]: With dead ends: 367 [2025-03-16 15:06:20,804 INFO L226 Difference]: Without dead ends: 181 [2025-03-16 15:06:20,807 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-03-16 15:06:20,810 INFO L435 NwaCegarLoop]: 298 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 0 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 298 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-16 15:06:20,811 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 298 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-16 15:06:20,824 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 181 states. [2025-03-16 15:06:20,843 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 181 to 181. [2025-03-16 15:06:20,844 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 181 states, 180 states have (on average 1.6388888888888888) internal successors, (295), 180 states have internal predecessors, (295), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 15:06:20,847 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 181 states to 181 states and 295 transitions. [2025-03-16 15:06:20,851 INFO L78 Accepts]: Start accepts. Automaton has 181 states and 295 transitions. Word has length 57 [2025-03-16 15:06:20,851 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 15:06:20,852 INFO L471 AbstractCegarLoop]: Abstraction has 181 states and 295 transitions. [2025-03-16 15:06:20,852 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 28.5) internal successors, (57), 2 states have internal predecessors, (57), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 15:06:20,852 INFO L276 IsEmpty]: Start isEmpty. Operand 181 states and 295 transitions. [2025-03-16 15:06:20,853 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2025-03-16 15:06:20,853 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 15:06:20,854 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 15:06:20,854 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-03-16 15:06:20,854 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 15:06:20,854 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 15:06:20,854 INFO L85 PathProgramCache]: Analyzing trace with hash 114628391, now seen corresponding path program 1 times [2025-03-16 15:06:20,855 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 15:06:20,855 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1279703096] [2025-03-16 15:06:20,855 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 15:06:20,855 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 15:06:20,866 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 57 statements into 1 equivalence classes. [2025-03-16 15:06:20,897 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 57 of 57 statements. [2025-03-16 15:06:20,898 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 15:06:20,898 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 15:06:21,083 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-16 15:06:21,084 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 15:06:21,084 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1279703096] [2025-03-16 15:06:21,085 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1279703096] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 15:06:21,085 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 15:06:21,085 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-16 15:06:21,085 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1920309473] [2025-03-16 15:06:21,085 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 15:06:21,086 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-16 15:06:21,087 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 15:06:21,088 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-16 15:06:21,088 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-16 15:06:21,089 INFO L87 Difference]: Start difference. First operand 181 states and 295 transitions. Second operand has 3 states, 3 states have (on average 19.0) internal successors, (57), 2 states have internal predecessors, (57), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 15:06:21,713 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 15:06:21,713 INFO L93 Difference]: Finished difference Result 539 states and 882 transitions. [2025-03-16 15:06:21,713 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-16 15:06:21,714 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 19.0) internal successors, (57), 2 states have internal predecessors, (57), 0 states have call successors, (0), 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 57 [2025-03-16 15:06:21,714 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 15:06:21,715 INFO L225 Difference]: With dead ends: 539 [2025-03-16 15:06:21,718 INFO L226 Difference]: Without dead ends: 359 [2025-03-16 15:06:21,719 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-16 15:06:21,720 INFO L435 NwaCegarLoop]: 48 mSDtfsCounter, 124 mSDsluCounter, 4 mSDsCounter, 0 mSdLazyCounter, 459 mSolverCounterSat, 169 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 124 SdHoareTripleChecker+Valid, 52 SdHoareTripleChecker+Invalid, 628 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 169 IncrementalHoareTripleChecker+Valid, 459 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-03-16 15:06:21,720 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [124 Valid, 52 Invalid, 628 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [169 Valid, 459 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-03-16 15:06:21,721 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 359 states. [2025-03-16 15:06:21,741 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 359 to 359. [2025-03-16 15:06:21,745 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 359 states, 358 states have (on average 1.5223463687150838) internal successors, (545), 358 states have internal predecessors, (545), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 15:06:21,748 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 359 states to 359 states and 545 transitions. [2025-03-16 15:06:21,748 INFO L78 Accepts]: Start accepts. Automaton has 359 states and 545 transitions. Word has length 57 [2025-03-16 15:06:21,748 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 15:06:21,748 INFO L471 AbstractCegarLoop]: Abstraction has 359 states and 545 transitions. [2025-03-16 15:06:21,748 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 19.0) internal successors, (57), 2 states have internal predecessors, (57), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 15:06:21,748 INFO L276 IsEmpty]: Start isEmpty. Operand 359 states and 545 transitions. [2025-03-16 15:06:21,751 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 133 [2025-03-16 15:06:21,751 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 15:06:21,751 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2025-03-16 15:06:21,751 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-03-16 15:06:21,751 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 15:06:21,752 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 15:06:21,752 INFO L85 PathProgramCache]: Analyzing trace with hash 119319019, now seen corresponding path program 1 times [2025-03-16 15:06:21,752 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 15:06:21,752 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [813951595] [2025-03-16 15:06:21,752 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 15:06:21,752 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 15:06:21,775 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 132 statements into 1 equivalence classes. [2025-03-16 15:06:21,798 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 132 of 132 statements. [2025-03-16 15:06:21,799 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 15:06:21,799 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 15:06:21,974 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 55 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-16 15:06:21,975 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 15:06:21,975 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [813951595] [2025-03-16 15:06:21,975 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [813951595] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 15:06:21,975 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 15:06:21,975 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-16 15:06:21,975 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1891000626] [2025-03-16 15:06:21,975 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 15:06:21,975 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-16 15:06:21,977 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 15:06:21,977 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-16 15:06:21,977 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-16 15:06:21,977 INFO L87 Difference]: Start difference. First operand 359 states and 545 transitions. Second operand has 3 states, 3 states have (on average 44.0) internal successors, (132), 2 states have internal predecessors, (132), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 15:06:22,546 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 15:06:22,547 INFO L93 Difference]: Finished difference Result 1073 states and 1632 transitions. [2025-03-16 15:06:22,547 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-16 15:06:22,547 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 44.0) internal successors, (132), 2 states have internal predecessors, (132), 0 states have call successors, (0), 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 132 [2025-03-16 15:06:22,548 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 15:06:22,551 INFO L225 Difference]: With dead ends: 1073 [2025-03-16 15:06:22,551 INFO L226 Difference]: Without dead ends: 715 [2025-03-16 15:06:22,551 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-16 15:06:22,552 INFO L435 NwaCegarLoop]: 90 mSDtfsCounter, 122 mSDsluCounter, 4 mSDsCounter, 0 mSdLazyCounter, 460 mSolverCounterSat, 132 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 122 SdHoareTripleChecker+Valid, 94 SdHoareTripleChecker+Invalid, 592 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 132 IncrementalHoareTripleChecker+Valid, 460 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-03-16 15:06:22,552 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [122 Valid, 94 Invalid, 592 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [132 Valid, 460 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-03-16 15:06:22,554 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 715 states. [2025-03-16 15:06:22,567 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 715 to 715. [2025-03-16 15:06:22,568 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 715 states, 714 states have (on average 1.354341736694678) internal successors, (967), 714 states have internal predecessors, (967), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 15:06:22,570 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 715 states to 715 states and 967 transitions. [2025-03-16 15:06:22,570 INFO L78 Accepts]: Start accepts. Automaton has 715 states and 967 transitions. Word has length 132 [2025-03-16 15:06:22,571 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 15:06:22,571 INFO L471 AbstractCegarLoop]: Abstraction has 715 states and 967 transitions. [2025-03-16 15:06:22,571 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 44.0) internal successors, (132), 2 states have internal predecessors, (132), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 15:06:22,571 INFO L276 IsEmpty]: Start isEmpty. Operand 715 states and 967 transitions. [2025-03-16 15:06:22,577 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 137 [2025-03-16 15:06:22,577 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 15:06:22,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, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 15:06:22,577 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-03-16 15:06:22,577 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 15:06:22,578 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 15:06:22,578 INFO L85 PathProgramCache]: Analyzing trace with hash -2117210975, now seen corresponding path program 1 times [2025-03-16 15:06:22,578 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 15:06:22,578 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [936912937] [2025-03-16 15:06:22,578 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 15:06:22,578 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 15:06:22,594 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 136 statements into 1 equivalence classes. [2025-03-16 15:06:22,609 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 136 of 136 statements. [2025-03-16 15:06:22,609 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 15:06:22,609 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 15:06:22,890 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 55 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-16 15:06:22,890 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 15:06:22,890 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [936912937] [2025-03-16 15:06:22,890 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [936912937] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 15:06:22,891 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 15:06:22,891 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-16 15:06:22,891 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [291618379] [2025-03-16 15:06:22,891 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 15:06:22,891 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-16 15:06:22,891 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 15:06:22,892 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-16 15:06:22,892 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-16 15:06:22,892 INFO L87 Difference]: Start difference. First operand 715 states and 967 transitions. Second operand has 4 states, 4 states have (on average 34.0) internal successors, (136), 3 states have internal predecessors, (136), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 15:06:23,602 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 15:06:23,602 INFO L93 Difference]: Finished difference Result 1963 states and 2569 transitions. [2025-03-16 15:06:23,603 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-16 15:06:23,603 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 34.0) internal successors, (136), 3 states have internal predecessors, (136), 0 states have call successors, (0), 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 136 [2025-03-16 15:06:23,603 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 15:06:23,609 INFO L225 Difference]: With dead ends: 1963 [2025-03-16 15:06:23,609 INFO L226 Difference]: Without dead ends: 1249 [2025-03-16 15:06:23,610 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-03-16 15:06:23,612 INFO L435 NwaCegarLoop]: 109 mSDtfsCounter, 418 mSDsluCounter, 11 mSDsCounter, 0 mSdLazyCounter, 976 mSolverCounterSat, 40 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 418 SdHoareTripleChecker+Valid, 120 SdHoareTripleChecker+Invalid, 1016 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 40 IncrementalHoareTripleChecker+Valid, 976 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2025-03-16 15:06:23,612 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [418 Valid, 120 Invalid, 1016 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [40 Valid, 976 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2025-03-16 15:06:23,616 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1249 states. [2025-03-16 15:06:23,649 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1249 to 1249. [2025-03-16 15:06:23,652 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1249 states, 1248 states have (on average 1.236378205128205) internal successors, (1543), 1248 states have internal predecessors, (1543), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 15:06:23,656 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1249 states to 1249 states and 1543 transitions. [2025-03-16 15:06:23,656 INFO L78 Accepts]: Start accepts. Automaton has 1249 states and 1543 transitions. Word has length 136 [2025-03-16 15:06:23,657 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 15:06:23,657 INFO L471 AbstractCegarLoop]: Abstraction has 1249 states and 1543 transitions. [2025-03-16 15:06:23,657 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 34.0) internal successors, (136), 3 states have internal predecessors, (136), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 15:06:23,657 INFO L276 IsEmpty]: Start isEmpty. Operand 1249 states and 1543 transitions. [2025-03-16 15:06:23,663 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 217 [2025-03-16 15:06:23,663 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 15:06:23,663 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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] [2025-03-16 15:06:23,663 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-03-16 15:06:23,663 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 15:06:23,664 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 15:06:23,664 INFO L85 PathProgramCache]: Analyzing trace with hash -761543476, now seen corresponding path program 1 times [2025-03-16 15:06:23,664 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 15:06:23,664 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1540590749] [2025-03-16 15:06:23,664 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 15:06:23,664 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 15:06:23,689 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 216 statements into 1 equivalence classes. [2025-03-16 15:06:23,706 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 216 of 216 statements. [2025-03-16 15:06:23,707 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 15:06:23,707 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 15:06:23,923 INFO L134 CoverageAnalysis]: Checked inductivity of 189 backedges. 162 proven. 0 refuted. 0 times theorem prover too weak. 27 trivial. 0 not checked. [2025-03-16 15:06:23,924 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 15:06:23,924 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1540590749] [2025-03-16 15:06:23,924 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1540590749] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 15:06:23,924 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 15:06:23,924 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-16 15:06:23,924 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [404757615] [2025-03-16 15:06:23,924 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 15:06:23,925 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-16 15:06:23,925 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 15:06:23,925 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-16 15:06:23,925 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-03-16 15:06:23,925 INFO L87 Difference]: Start difference. First operand 1249 states and 1543 transitions. Second operand has 4 states, 4 states have (on average 47.5) internal successors, (190), 3 states have internal predecessors, (190), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 15:06:24,523 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 15:06:24,524 INFO L93 Difference]: Finished difference Result 2704 states and 3352 transitions. [2025-03-16 15:06:24,524 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-16 15:06:24,525 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 47.5) internal successors, (190), 3 states have internal predecessors, (190), 0 states have call successors, (0), 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 216 [2025-03-16 15:06:24,525 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 15:06:24,530 INFO L225 Difference]: With dead ends: 2704 [2025-03-16 15:06:24,530 INFO L226 Difference]: Without dead ends: 1605 [2025-03-16 15:06:24,531 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-03-16 15:06:24,532 INFO L435 NwaCegarLoop]: 110 mSDtfsCounter, 116 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 661 mSolverCounterSat, 110 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 116 SdHoareTripleChecker+Valid, 117 SdHoareTripleChecker+Invalid, 771 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 110 IncrementalHoareTripleChecker+Valid, 661 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-03-16 15:06:24,532 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [116 Valid, 117 Invalid, 771 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [110 Valid, 661 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-03-16 15:06:24,533 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1605 states. [2025-03-16 15:06:24,551 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1605 to 1605. [2025-03-16 15:06:24,553 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1605 states, 1604 states have (on average 1.1221945137157108) internal successors, (1800), 1604 states have internal predecessors, (1800), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 15:06:24,557 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1605 states to 1605 states and 1800 transitions. [2025-03-16 15:06:24,557 INFO L78 Accepts]: Start accepts. Automaton has 1605 states and 1800 transitions. Word has length 216 [2025-03-16 15:06:24,558 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 15:06:24,558 INFO L471 AbstractCegarLoop]: Abstraction has 1605 states and 1800 transitions. [2025-03-16 15:06:24,558 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 47.5) internal successors, (190), 3 states have internal predecessors, (190), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 15:06:24,558 INFO L276 IsEmpty]: Start isEmpty. Operand 1605 states and 1800 transitions. [2025-03-16 15:06:24,561 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 344 [2025-03-16 15:06:24,561 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 15:06:24,561 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 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] [2025-03-16 15:06:24,562 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-03-16 15:06:24,562 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 15:06:24,563 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 15:06:24,563 INFO L85 PathProgramCache]: Analyzing trace with hash -1862560730, now seen corresponding path program 1 times [2025-03-16 15:06:24,563 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 15:06:24,563 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1163090578] [2025-03-16 15:06:24,563 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 15:06:24,563 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 15:06:24,588 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 343 statements into 1 equivalence classes. [2025-03-16 15:06:24,608 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 343 of 343 statements. [2025-03-16 15:06:24,608 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 15:06:24,610 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 15:06:24,981 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 215 proven. 130 refuted. 0 times theorem prover too weak. 75 trivial. 0 not checked. [2025-03-16 15:06:24,982 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 15:06:24,982 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1163090578] [2025-03-16 15:06:24,982 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1163090578] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-16 15:06:24,982 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2146511564] [2025-03-16 15:06:24,982 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 15:06:24,982 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-16 15:06:24,982 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-16 15:06:24,987 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-16 15:06:24,988 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2025-03-16 15:06:25,056 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 343 statements into 1 equivalence classes. [2025-03-16 15:06:25,103 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 343 of 343 statements. [2025-03-16 15:06:25,104 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 15:06:25,104 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 15:06:25,106 INFO L256 TraceCheckSpWp]: Trace formula consists of 457 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-03-16 15:06:25,116 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-16 15:06:25,208 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 167 proven. 0 refuted. 0 times theorem prover too weak. 253 trivial. 0 not checked. [2025-03-16 15:06:25,209 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-16 15:06:25,209 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2146511564] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 15:06:25,209 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-16 15:06:25,210 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [4] total 6 [2025-03-16 15:06:25,210 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [614051125] [2025-03-16 15:06:25,210 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 15:06:25,210 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-16 15:06:25,210 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 15:06:25,211 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-16 15:06:25,211 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2025-03-16 15:06:25,211 INFO L87 Difference]: Start difference. First operand 1605 states and 1800 transitions. Second operand has 3 states, 3 states have (on average 55.333333333333336) internal successors, (166), 3 states have internal predecessors, (166), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 15:06:25,650 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 15:06:25,651 INFO L93 Difference]: Finished difference Result 3387 states and 3900 transitions. [2025-03-16 15:06:25,651 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-16 15:06:25,651 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 55.333333333333336) internal successors, (166), 3 states have internal predecessors, (166), 0 states have call successors, (0), 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 343 [2025-03-16 15:06:25,652 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 15:06:25,657 INFO L225 Difference]: With dead ends: 3387 [2025-03-16 15:06:25,657 INFO L226 Difference]: Without dead ends: 1961 [2025-03-16 15:06:25,658 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 346 GetRequests, 342 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2025-03-16 15:06:25,659 INFO L435 NwaCegarLoop]: 248 mSDtfsCounter, 127 mSDsluCounter, 4 mSDsCounter, 0 mSdLazyCounter, 458 mSolverCounterSat, 58 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 127 SdHoareTripleChecker+Valid, 252 SdHoareTripleChecker+Invalid, 516 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 58 IncrementalHoareTripleChecker+Valid, 458 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-03-16 15:06:25,659 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [127 Valid, 252 Invalid, 516 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [58 Valid, 458 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-03-16 15:06:25,662 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1961 states. [2025-03-16 15:06:25,682 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1961 to 1961. [2025-03-16 15:06:25,684 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1961 states, 1960 states have (on average 1.1321428571428571) internal successors, (2219), 1960 states have internal predecessors, (2219), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 15:06:25,688 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1961 states to 1961 states and 2219 transitions. [2025-03-16 15:06:25,688 INFO L78 Accepts]: Start accepts. Automaton has 1961 states and 2219 transitions. Word has length 343 [2025-03-16 15:06:25,689 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 15:06:25,689 INFO L471 AbstractCegarLoop]: Abstraction has 1961 states and 2219 transitions. [2025-03-16 15:06:25,689 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 55.333333333333336) internal successors, (166), 3 states have internal predecessors, (166), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 15:06:25,689 INFO L276 IsEmpty]: Start isEmpty. Operand 1961 states and 2219 transitions. [2025-03-16 15:06:25,691 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 348 [2025-03-16 15:06:25,691 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 15:06:25,691 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 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, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 15:06:25,698 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2025-03-16 15:06:25,892 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,SelfDestructingSolverStorable5 [2025-03-16 15:06:25,892 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 15:06:25,892 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 15:06:25,893 INFO L85 PathProgramCache]: Analyzing trace with hash -781762212, now seen corresponding path program 1 times [2025-03-16 15:06:25,893 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 15:06:25,893 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1870875081] [2025-03-16 15:06:25,893 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 15:06:25,893 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 15:06:25,915 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 347 statements into 1 equivalence classes. [2025-03-16 15:06:25,938 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 347 of 347 statements. [2025-03-16 15:06:25,938 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 15:06:25,938 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 15:06:26,403 INFO L134 CoverageAnalysis]: Checked inductivity of 428 backedges. 298 proven. 130 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-16 15:06:26,403 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 15:06:26,403 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1870875081] [2025-03-16 15:06:26,403 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1870875081] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-16 15:06:26,403 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1158687165] [2025-03-16 15:06:26,403 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 15:06:26,403 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-16 15:06:26,404 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-16 15:06:26,407 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-16 15:06:26,408 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2025-03-16 15:06:26,451 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 347 statements into 1 equivalence classes. [2025-03-16 15:06:26,509 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 347 of 347 statements. [2025-03-16 15:06:26,509 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 15:06:26,509 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 15:06:26,511 INFO L256 TraceCheckSpWp]: Trace formula consists of 462 conjuncts, 5 conjuncts are in the unsatisfiable core [2025-03-16 15:06:26,520 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-16 15:06:27,643 INFO L134 CoverageAnalysis]: Checked inductivity of 428 backedges. 267 proven. 0 refuted. 0 times theorem prover too weak. 161 trivial. 0 not checked. [2025-03-16 15:06:27,643 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-16 15:06:27,643 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1158687165] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 15:06:27,644 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-16 15:06:27,644 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [5] total 7 [2025-03-16 15:06:27,644 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1947681105] [2025-03-16 15:06:27,644 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 15:06:27,644 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-16 15:06:27,644 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 15:06:27,645 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-16 15:06:27,645 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=35, Unknown=0, NotChecked=0, Total=56 [2025-03-16 15:06:27,645 INFO L87 Difference]: Start difference. First operand 1961 states and 2219 transitions. Second operand has 4 states, 4 states have (on average 54.0) internal successors, (216), 3 states have internal predecessors, (216), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 15:06:28,126 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 15:06:28,126 INFO L93 Difference]: Finished difference Result 4691 states and 5401 transitions. [2025-03-16 15:06:28,126 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-16 15:06:28,127 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 54.0) internal successors, (216), 3 states have internal predecessors, (216), 0 states have call successors, (0), 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 347 [2025-03-16 15:06:28,127 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 15:06:28,134 INFO L225 Difference]: With dead ends: 4691 [2025-03-16 15:06:28,134 INFO L226 Difference]: Without dead ends: 2909 [2025-03-16 15:06:28,136 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 351 GetRequests, 345 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=35, Unknown=0, NotChecked=0, Total=56 [2025-03-16 15:06:28,136 INFO L435 NwaCegarLoop]: 49 mSDtfsCounter, 212 mSDsluCounter, 6 mSDsCounter, 0 mSdLazyCounter, 447 mSolverCounterSat, 172 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 212 SdHoareTripleChecker+Valid, 55 SdHoareTripleChecker+Invalid, 619 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 172 IncrementalHoareTripleChecker+Valid, 447 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-03-16 15:06:28,136 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [212 Valid, 55 Invalid, 619 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [172 Valid, 447 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-03-16 15:06:28,138 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2909 states. [2025-03-16 15:06:28,181 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2909 to 2673. [2025-03-16 15:06:28,184 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2673 states, 2672 states have (on average 1.1133982035928143) internal successors, (2975), 2672 states have internal predecessors, (2975), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 15:06:28,188 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2673 states to 2673 states and 2975 transitions. [2025-03-16 15:06:28,188 INFO L78 Accepts]: Start accepts. Automaton has 2673 states and 2975 transitions. Word has length 347 [2025-03-16 15:06:28,189 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 15:06:28,189 INFO L471 AbstractCegarLoop]: Abstraction has 2673 states and 2975 transitions. [2025-03-16 15:06:28,190 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 54.0) internal successors, (216), 3 states have internal predecessors, (216), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 15:06:28,190 INFO L276 IsEmpty]: Start isEmpty. Operand 2673 states and 2975 transitions. [2025-03-16 15:06:28,195 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 375 [2025-03-16 15:06:28,196 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 15:06:28,196 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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] [2025-03-16 15:06:28,202 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2025-03-16 15:06:28,396 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable6 [2025-03-16 15:06:28,397 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 15:06:28,397 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 15:06:28,397 INFO L85 PathProgramCache]: Analyzing trace with hash 1909930112, now seen corresponding path program 1 times [2025-03-16 15:06:28,397 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 15:06:28,397 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [268668186] [2025-03-16 15:06:28,397 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 15:06:28,397 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 15:06:28,428 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 374 statements into 1 equivalence classes. [2025-03-16 15:06:28,449 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 374 of 374 statements. [2025-03-16 15:06:28,449 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 15:06:28,449 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 15:06:28,584 INFO L134 CoverageAnalysis]: Checked inductivity of 481 backedges. 167 proven. 0 refuted. 0 times theorem prover too weak. 314 trivial. 0 not checked. [2025-03-16 15:06:28,584 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 15:06:28,584 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [268668186] [2025-03-16 15:06:28,584 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [268668186] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 15:06:28,584 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 15:06:28,584 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-16 15:06:28,585 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [795254629] [2025-03-16 15:06:28,585 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 15:06:28,585 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-16 15:06:28,585 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 15:06:28,586 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-16 15:06:28,586 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-16 15:06:28,587 INFO L87 Difference]: Start difference. First operand 2673 states and 2975 transitions. Second operand has 3 states, 3 states have (on average 55.333333333333336) internal successors, (166), 3 states have internal predecessors, (166), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 15:06:29,032 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 15:06:29,032 INFO L93 Difference]: Finished difference Result 5701 states and 6429 transitions. [2025-03-16 15:06:29,032 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-16 15:06:29,033 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 55.333333333333336) internal successors, (166), 3 states have internal predecessors, (166), 0 states have call successors, (0), 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 374 [2025-03-16 15:06:29,034 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 15:06:29,041 INFO L225 Difference]: With dead ends: 5701 [2025-03-16 15:06:29,041 INFO L226 Difference]: Without dead ends: 3207 [2025-03-16 15:06:29,044 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-16 15:06:29,044 INFO L435 NwaCegarLoop]: 74 mSDtfsCounter, 128 mSDsluCounter, 4 mSDsCounter, 0 mSdLazyCounter, 439 mSolverCounterSat, 71 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 128 SdHoareTripleChecker+Valid, 78 SdHoareTripleChecker+Invalid, 510 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 71 IncrementalHoareTripleChecker+Valid, 439 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-03-16 15:06:29,044 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [128 Valid, 78 Invalid, 510 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [71 Valid, 439 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-03-16 15:06:29,047 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3207 states. [2025-03-16 15:06:29,075 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3207 to 2673. [2025-03-16 15:06:29,077 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2673 states, 2672 states have (on average 1.1133982035928143) internal successors, (2975), 2672 states have internal predecessors, (2975), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 15:06:29,081 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2673 states to 2673 states and 2975 transitions. [2025-03-16 15:06:29,081 INFO L78 Accepts]: Start accepts. Automaton has 2673 states and 2975 transitions. Word has length 374 [2025-03-16 15:06:29,081 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 15:06:29,081 INFO L471 AbstractCegarLoop]: Abstraction has 2673 states and 2975 transitions. [2025-03-16 15:06:29,081 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 55.333333333333336) internal successors, (166), 3 states have internal predecessors, (166), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 15:06:29,081 INFO L276 IsEmpty]: Start isEmpty. Operand 2673 states and 2975 transitions. [2025-03-16 15:06:29,084 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 382 [2025-03-16 15:06:29,084 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 15:06:29,085 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 15:06:29,085 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-03-16 15:06:29,085 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 15:06:29,086 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 15:06:29,086 INFO L85 PathProgramCache]: Analyzing trace with hash -1565595737, now seen corresponding path program 1 times [2025-03-16 15:06:29,086 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 15:06:29,086 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1073856336] [2025-03-16 15:06:29,086 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 15:06:29,086 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 15:06:29,105 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 381 statements into 1 equivalence classes. [2025-03-16 15:06:29,118 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 381 of 381 statements. [2025-03-16 15:06:29,118 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 15:06:29,118 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 15:06:29,216 INFO L134 CoverageAnalysis]: Checked inductivity of 481 backedges. 167 proven. 0 refuted. 0 times theorem prover too weak. 314 trivial. 0 not checked. [2025-03-16 15:06:29,217 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 15:06:29,217 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1073856336] [2025-03-16 15:06:29,217 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1073856336] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 15:06:29,217 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 15:06:29,218 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-16 15:06:29,218 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1534791407] [2025-03-16 15:06:29,218 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 15:06:29,218 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-16 15:06:29,218 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 15:06:29,219 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-16 15:06:29,219 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-16 15:06:29,219 INFO L87 Difference]: Start difference. First operand 2673 states and 2975 transitions. Second operand has 3 states, 3 states have (on average 57.666666666666664) internal successors, (173), 3 states have internal predecessors, (173), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 15:06:29,668 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 15:06:29,669 INFO L93 Difference]: Finished difference Result 3743 states and 4222 transitions. [2025-03-16 15:06:29,669 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-16 15:06:29,669 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 57.666666666666664) internal successors, (173), 3 states have internal predecessors, (173), 0 states have call successors, (0), 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 381 [2025-03-16 15:06:29,670 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 15:06:29,679 INFO L225 Difference]: With dead ends: 3743 [2025-03-16 15:06:29,679 INFO L226 Difference]: Without dead ends: 3741 [2025-03-16 15:06:29,680 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-16 15:06:29,682 INFO L435 NwaCegarLoop]: 13 mSDtfsCounter, 126 mSDsluCounter, 4 mSDsCounter, 0 mSdLazyCounter, 439 mSolverCounterSat, 114 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 126 SdHoareTripleChecker+Valid, 17 SdHoareTripleChecker+Invalid, 553 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 114 IncrementalHoareTripleChecker+Valid, 439 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-03-16 15:06:29,682 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [126 Valid, 17 Invalid, 553 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [114 Valid, 439 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-03-16 15:06:29,685 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3741 states. [2025-03-16 15:06:29,727 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3741 to 3029. [2025-03-16 15:06:29,731 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3029 states, 3028 states have (on average 1.1350726552179657) internal successors, (3437), 3028 states have internal predecessors, (3437), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 15:06:29,736 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3029 states to 3029 states and 3437 transitions. [2025-03-16 15:06:29,737 INFO L78 Accepts]: Start accepts. Automaton has 3029 states and 3437 transitions. Word has length 381 [2025-03-16 15:06:29,737 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 15:06:29,737 INFO L471 AbstractCegarLoop]: Abstraction has 3029 states and 3437 transitions. [2025-03-16 15:06:29,738 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 57.666666666666664) internal successors, (173), 3 states have internal predecessors, (173), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 15:06:29,738 INFO L276 IsEmpty]: Start isEmpty. Operand 3029 states and 3437 transitions. [2025-03-16 15:06:29,744 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 459 [2025-03-16 15:06:29,744 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 15:06:29,745 INFO L218 NwaCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 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, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 15:06:29,745 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-03-16 15:06:29,745 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 15:06:29,746 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 15:06:29,746 INFO L85 PathProgramCache]: Analyzing trace with hash -1091993402, now seen corresponding path program 1 times [2025-03-16 15:06:29,746 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 15:06:29,746 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2111419287] [2025-03-16 15:06:29,746 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 15:06:29,746 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 15:06:29,773 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 458 statements into 1 equivalence classes. [2025-03-16 15:06:29,791 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 458 of 458 statements. [2025-03-16 15:06:29,791 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 15:06:29,791 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 15:06:29,892 INFO L134 CoverageAnalysis]: Checked inductivity of 767 backedges. 397 proven. 0 refuted. 0 times theorem prover too weak. 370 trivial. 0 not checked. [2025-03-16 15:06:29,892 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 15:06:29,892 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2111419287] [2025-03-16 15:06:29,892 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2111419287] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 15:06:29,892 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 15:06:29,892 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-16 15:06:29,893 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [163026348] [2025-03-16 15:06:29,893 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 15:06:29,894 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-16 15:06:29,894 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 15:06:29,894 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-16 15:06:29,894 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-16 15:06:29,894 INFO L87 Difference]: Start difference. First operand 3029 states and 3437 transitions. Second operand has 3 states, 3 states have (on average 65.0) internal successors, (195), 3 states have internal predecessors, (195), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 15:06:30,338 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 15:06:30,338 INFO L93 Difference]: Finished difference Result 6591 states and 7561 transitions. [2025-03-16 15:06:30,338 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-16 15:06:30,339 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 65.0) internal successors, (195), 3 states have internal predecessors, (195), 0 states have call successors, (0), 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 458 [2025-03-16 15:06:30,339 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 15:06:30,347 INFO L225 Difference]: With dead ends: 6591 [2025-03-16 15:06:30,347 INFO L226 Difference]: Without dead ends: 3741 [2025-03-16 15:06:30,350 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-16 15:06:30,350 INFO L435 NwaCegarLoop]: 59 mSDtfsCounter, 113 mSDsluCounter, 4 mSDsCounter, 0 mSdLazyCounter, 442 mSolverCounterSat, 72 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 113 SdHoareTripleChecker+Valid, 63 SdHoareTripleChecker+Invalid, 514 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 72 IncrementalHoareTripleChecker+Valid, 442 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-03-16 15:06:30,351 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [113 Valid, 63 Invalid, 514 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [72 Valid, 442 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-03-16 15:06:30,353 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3741 states. [2025-03-16 15:06:30,381 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3741 to 3385. [2025-03-16 15:06:30,384 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3385 states, 3384 states have (on average 1.12145390070922) internal successors, (3795), 3384 states have internal predecessors, (3795), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 15:06:30,388 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3385 states to 3385 states and 3795 transitions. [2025-03-16 15:06:30,388 INFO L78 Accepts]: Start accepts. Automaton has 3385 states and 3795 transitions. Word has length 458 [2025-03-16 15:06:30,389 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 15:06:30,389 INFO L471 AbstractCegarLoop]: Abstraction has 3385 states and 3795 transitions. [2025-03-16 15:06:30,389 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 65.0) internal successors, (195), 3 states have internal predecessors, (195), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 15:06:30,389 INFO L276 IsEmpty]: Start isEmpty. Operand 3385 states and 3795 transitions. [2025-03-16 15:06:30,393 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 655 [2025-03-16 15:06:30,393 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 15:06:30,394 INFO L218 NwaCegarLoop]: trace histogram [6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 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] [2025-03-16 15:06:30,394 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-03-16 15:06:30,394 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 15:06:30,394 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 15:06:30,395 INFO L85 PathProgramCache]: Analyzing trace with hash -189263863, now seen corresponding path program 1 times [2025-03-16 15:06:30,395 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 15:06:30,395 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1836661796] [2025-03-16 15:06:30,395 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 15:06:30,395 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 15:06:30,426 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 654 statements into 1 equivalence classes. [2025-03-16 15:06:30,445 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 654 of 654 statements. [2025-03-16 15:06:30,445 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 15:06:30,445 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 15:06:30,736 INFO L134 CoverageAnalysis]: Checked inductivity of 1259 backedges. 961 proven. 0 refuted. 0 times theorem prover too weak. 298 trivial. 0 not checked. [2025-03-16 15:06:30,736 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 15:06:30,736 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1836661796] [2025-03-16 15:06:30,736 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1836661796] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 15:06:30,736 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 15:06:30,737 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-16 15:06:30,737 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1908681808] [2025-03-16 15:06:30,737 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 15:06:30,737 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-16 15:06:30,737 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 15:06:30,738 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-16 15:06:30,738 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-16 15:06:30,738 INFO L87 Difference]: Start difference. First operand 3385 states and 3795 transitions. Second operand has 3 states, 3 states have (on average 138.33333333333334) internal successors, (415), 3 states have internal predecessors, (415), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 15:06:31,134 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 15:06:31,134 INFO L93 Difference]: Finished difference Result 7125 states and 8001 transitions. [2025-03-16 15:06:31,135 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-16 15:06:31,135 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 138.33333333333334) internal successors, (415), 3 states have internal predecessors, (415), 0 states have call successors, (0), 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 654 [2025-03-16 15:06:31,135 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 15:06:31,143 INFO L225 Difference]: With dead ends: 7125 [2025-03-16 15:06:31,143 INFO L226 Difference]: Without dead ends: 3919 [2025-03-16 15:06:31,146 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-16 15:06:31,146 INFO L435 NwaCegarLoop]: 75 mSDtfsCounter, 50 mSDsluCounter, 4 mSDsCounter, 0 mSdLazyCounter, 446 mSolverCounterSat, 23 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 50 SdHoareTripleChecker+Valid, 79 SdHoareTripleChecker+Invalid, 469 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 23 IncrementalHoareTripleChecker+Valid, 446 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-03-16 15:06:31,146 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [50 Valid, 79 Invalid, 469 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [23 Valid, 446 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-03-16 15:06:31,149 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3919 states. [2025-03-16 15:06:31,183 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3919 to 3919. [2025-03-16 15:06:31,187 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3919 states, 3918 states have (on average 1.1112812659520164) internal successors, (4354), 3918 states have internal predecessors, (4354), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 15:06:31,192 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3919 states to 3919 states and 4354 transitions. [2025-03-16 15:06:31,192 INFO L78 Accepts]: Start accepts. Automaton has 3919 states and 4354 transitions. Word has length 654 [2025-03-16 15:06:31,192 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 15:06:31,192 INFO L471 AbstractCegarLoop]: Abstraction has 3919 states and 4354 transitions. [2025-03-16 15:06:31,193 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 138.33333333333334) internal successors, (415), 3 states have internal predecessors, (415), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 15:06:31,193 INFO L276 IsEmpty]: Start isEmpty. Operand 3919 states and 4354 transitions. [2025-03-16 15:06:31,197 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 735 [2025-03-16 15:06:31,198 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 15:06:31,198 INFO L218 NwaCegarLoop]: trace histogram [7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 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-16 15:06:31,198 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-03-16 15:06:31,198 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 15:06:31,198 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 15:06:31,199 INFO L85 PathProgramCache]: Analyzing trace with hash -1918012418, now seen corresponding path program 1 times [2025-03-16 15:06:31,199 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 15:06:31,199 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1630497650] [2025-03-16 15:06:31,199 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 15:06:31,199 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 15:06:31,235 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 734 statements into 1 equivalence classes. [2025-03-16 15:06:31,252 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 734 of 734 statements. [2025-03-16 15:06:31,252 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 15:06:31,252 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 15:06:31,554 INFO L134 CoverageAnalysis]: Checked inductivity of 1714 backedges. 1077 proven. 0 refuted. 0 times theorem prover too weak. 637 trivial. 0 not checked. [2025-03-16 15:06:31,554 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 15:06:31,554 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1630497650] [2025-03-16 15:06:31,554 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1630497650] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 15:06:31,554 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 15:06:31,554 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-16 15:06:31,554 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1814804908] [2025-03-16 15:06:31,554 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 15:06:31,555 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-16 15:06:31,555 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 15:06:31,555 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-16 15:06:31,555 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-03-16 15:06:31,555 INFO L87 Difference]: Start difference. First operand 3919 states and 4354 transitions. Second operand has 4 states, 4 states have (on average 79.25) internal successors, (317), 3 states have internal predecessors, (317), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 15:06:32,036 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 15:06:32,037 INFO L93 Difference]: Finished difference Result 7688 states and 8557 transitions. [2025-03-16 15:06:32,037 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-16 15:06:32,037 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 79.25) internal successors, (317), 3 states have internal predecessors, (317), 0 states have call successors, (0), 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 734 [2025-03-16 15:06:32,038 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 15:06:32,046 INFO L225 Difference]: With dead ends: 7688 [2025-03-16 15:06:32,047 INFO L226 Difference]: Without dead ends: 3919 [2025-03-16 15:06:32,050 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-03-16 15:06:32,051 INFO L435 NwaCegarLoop]: 8 mSDtfsCounter, 141 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 685 mSolverCounterSat, 58 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 141 SdHoareTripleChecker+Valid, 15 SdHoareTripleChecker+Invalid, 743 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 58 IncrementalHoareTripleChecker+Valid, 685 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-03-16 15:06:32,051 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [141 Valid, 15 Invalid, 743 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [58 Valid, 685 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-03-16 15:06:32,053 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3919 states. [2025-03-16 15:06:32,087 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3919 to 3919. [2025-03-16 15:06:32,092 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3919 states, 3918 states have (on average 1.0704441041347625) internal successors, (4194), 3918 states have internal predecessors, (4194), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 15:06:32,096 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3919 states to 3919 states and 4194 transitions. [2025-03-16 15:06:32,096 INFO L78 Accepts]: Start accepts. Automaton has 3919 states and 4194 transitions. Word has length 734 [2025-03-16 15:06:32,097 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 15:06:32,097 INFO L471 AbstractCegarLoop]: Abstraction has 3919 states and 4194 transitions. [2025-03-16 15:06:32,097 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 79.25) internal successors, (317), 3 states have internal predecessors, (317), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 15:06:32,097 INFO L276 IsEmpty]: Start isEmpty. Operand 3919 states and 4194 transitions. [2025-03-16 15:06:32,102 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 761 [2025-03-16 15:06:32,102 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 15:06:32,103 INFO L218 NwaCegarLoop]: trace histogram [7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 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] [2025-03-16 15:06:32,103 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2025-03-16 15:06:32,103 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 15:06:32,104 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 15:06:32,104 INFO L85 PathProgramCache]: Analyzing trace with hash -999866435, now seen corresponding path program 2 times [2025-03-16 15:06:32,104 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 15:06:32,104 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1843294373] [2025-03-16 15:06:32,104 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-16 15:06:32,104 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 15:06:32,151 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 760 statements into 2 equivalence classes. [2025-03-16 15:06:32,176 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 760 of 760 statements. [2025-03-16 15:06:32,176 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-16 15:06:32,176 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 15:06:32,527 INFO L134 CoverageAnalysis]: Checked inductivity of 1819 backedges. 1243 proven. 68 refuted. 0 times theorem prover too weak. 508 trivial. 0 not checked. [2025-03-16 15:06:32,527 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 15:06:32,527 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1843294373] [2025-03-16 15:06:32,527 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1843294373] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-16 15:06:32,527 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [317385060] [2025-03-16 15:06:32,528 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-16 15:06:32,528 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-16 15:06:32,528 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-16 15:06:32,529 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-16 15:06:32,532 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2025-03-16 15:06:32,589 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 760 statements into 2 equivalence classes. [2025-03-16 15:06:32,679 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 760 of 760 statements. [2025-03-16 15:06:32,679 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-16 15:06:32,680 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 15:06:32,682 INFO L256 TraceCheckSpWp]: Trace formula consists of 941 conjuncts, 7 conjuncts are in the unsatisfiable core [2025-03-16 15:06:32,691 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-16 15:06:33,765 INFO L134 CoverageAnalysis]: Checked inductivity of 1819 backedges. 1108 proven. 203 refuted. 0 times theorem prover too weak. 508 trivial. 0 not checked. [2025-03-16 15:06:33,765 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-16 15:06:34,959 INFO L134 CoverageAnalysis]: Checked inductivity of 1819 backedges. 995 proven. 316 refuted. 0 times theorem prover too weak. 508 trivial. 0 not checked. [2025-03-16 15:06:34,960 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [317385060] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-16 15:06:34,960 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-16 15:06:34,960 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 9 [2025-03-16 15:06:34,960 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [356793852] [2025-03-16 15:06:34,960 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-16 15:06:34,961 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-03-16 15:06:34,961 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 15:06:34,962 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-03-16 15:06:34,962 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=58, Unknown=0, NotChecked=0, Total=90 [2025-03-16 15:06:34,962 INFO L87 Difference]: Start difference. First operand 3919 states and 4194 transitions. Second operand has 10 states, 10 states have (on average 78.4) internal successors, (784), 9 states have internal predecessors, (784), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 15:06:36,561 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 15:06:36,561 INFO L93 Difference]: Finished difference Result 8905 states and 9567 transitions. [2025-03-16 15:06:36,561 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2025-03-16 15:06:36,562 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 78.4) internal successors, (784), 9 states have internal predecessors, (784), 0 states have call successors, (0), 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 760 [2025-03-16 15:06:36,562 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 15:06:36,574 INFO L225 Difference]: With dead ends: 8905 [2025-03-16 15:06:36,574 INFO L226 Difference]: Without dead ends: 5165 [2025-03-16 15:06:36,577 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 1527 GetRequests, 1514 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 29 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=83, Invalid=127, Unknown=0, NotChecked=0, Total=210 [2025-03-16 15:06:36,578 INFO L435 NwaCegarLoop]: 7 mSDtfsCounter, 1560 mSDsluCounter, 30 mSDsCounter, 0 mSdLazyCounter, 2444 mSolverCounterSat, 225 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1560 SdHoareTripleChecker+Valid, 37 SdHoareTripleChecker+Invalid, 2669 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 225 IncrementalHoareTripleChecker+Valid, 2444 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.5s IncrementalHoareTripleChecker+Time [2025-03-16 15:06:36,578 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1560 Valid, 37 Invalid, 2669 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [225 Valid, 2444 Invalid, 0 Unknown, 0 Unchecked, 1.5s Time] [2025-03-16 15:06:36,580 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5165 states. [2025-03-16 15:06:36,605 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5165 to 3741. [2025-03-16 15:06:36,608 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3741 states, 3740 states have (on average 1.0663101604278076) internal successors, (3988), 3740 states have internal predecessors, (3988), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 15:06:36,611 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3741 states to 3741 states and 3988 transitions. [2025-03-16 15:06:36,612 INFO L78 Accepts]: Start accepts. Automaton has 3741 states and 3988 transitions. Word has length 760 [2025-03-16 15:06:36,612 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 15:06:36,612 INFO L471 AbstractCegarLoop]: Abstraction has 3741 states and 3988 transitions. [2025-03-16 15:06:36,613 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 78.4) internal successors, (784), 9 states have internal predecessors, (784), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 15:06:36,613 INFO L276 IsEmpty]: Start isEmpty. Operand 3741 states and 3988 transitions. [2025-03-16 15:06:36,617 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 866 [2025-03-16 15:06:36,618 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 15:06:36,618 INFO L218 NwaCegarLoop]: trace histogram [8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2025-03-16 15:06:36,625 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2025-03-16 15:06:36,818 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-16 15:06:36,819 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 15:06:36,819 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 15:06:36,819 INFO L85 PathProgramCache]: Analyzing trace with hash 1295331132, now seen corresponding path program 1 times [2025-03-16 15:06:36,819 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 15:06:36,819 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1573868410] [2025-03-16 15:06:36,819 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 15:06:36,819 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 15:06:36,865 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 865 statements into 1 equivalence classes. [2025-03-16 15:06:36,891 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 865 of 865 statements. [2025-03-16 15:06:36,891 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 15:06:36,891 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 15:06:37,081 INFO L134 CoverageAnalysis]: Checked inductivity of 2346 backedges. 1515 proven. 0 refuted. 0 times theorem prover too weak. 831 trivial. 0 not checked. [2025-03-16 15:06:37,081 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 15:06:37,081 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1573868410] [2025-03-16 15:06:37,081 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1573868410] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 15:06:37,081 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 15:06:37,082 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-16 15:06:37,082 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [178580402] [2025-03-16 15:06:37,082 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 15:06:37,082 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-16 15:06:37,082 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 15:06:37,083 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-16 15:06:37,083 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-16 15:06:37,083 INFO L87 Difference]: Start difference. First operand 3741 states and 3988 transitions. Second operand has 3 states, 3 states have (on average 136.33333333333334) internal successors, (409), 3 states have internal predecessors, (409), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 15:06:37,379 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 15:06:37,380 INFO L93 Difference]: Finished difference Result 8193 states and 8742 transitions. [2025-03-16 15:06:37,380 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-16 15:06:37,380 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 136.33333333333334) internal successors, (409), 3 states have internal predecessors, (409), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 865 [2025-03-16 15:06:37,381 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 15:06:37,387 INFO L225 Difference]: With dead ends: 8193 [2025-03-16 15:06:37,387 INFO L226 Difference]: Without dead ends: 4453 [2025-03-16 15:06:37,389 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-16 15:06:37,390 INFO L435 NwaCegarLoop]: 28 mSDtfsCounter, 107 mSDsluCounter, 4 mSDsCounter, 0 mSdLazyCounter, 416 mSolverCounterSat, 59 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 107 SdHoareTripleChecker+Valid, 32 SdHoareTripleChecker+Invalid, 475 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 59 IncrementalHoareTripleChecker+Valid, 416 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-03-16 15:06:37,390 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [107 Valid, 32 Invalid, 475 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [59 Valid, 416 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-16 15:06:37,392 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4453 states. [2025-03-16 15:06:37,435 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4453 to 4097. [2025-03-16 15:06:37,439 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4097 states, 4096 states have (on average 1.0576171875) internal successors, (4332), 4096 states have internal predecessors, (4332), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 15:06:37,442 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4097 states to 4097 states and 4332 transitions. [2025-03-16 15:06:37,442 INFO L78 Accepts]: Start accepts. Automaton has 4097 states and 4332 transitions. Word has length 865 [2025-03-16 15:06:37,442 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 15:06:37,443 INFO L471 AbstractCegarLoop]: Abstraction has 4097 states and 4332 transitions. [2025-03-16 15:06:37,443 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 136.33333333333334) internal successors, (409), 3 states have internal predecessors, (409), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 15:06:37,443 INFO L276 IsEmpty]: Start isEmpty. Operand 4097 states and 4332 transitions. [2025-03-16 15:06:37,448 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 884 [2025-03-16 15:06:37,448 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 15:06:37,449 INFO L218 NwaCegarLoop]: trace histogram [8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2025-03-16 15:06:37,449 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2025-03-16 15:06:37,449 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 15:06:37,450 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 15:06:37,450 INFO L85 PathProgramCache]: Analyzing trace with hash 1823133289, now seen corresponding path program 1 times [2025-03-16 15:06:37,450 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 15:06:37,450 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [304730341] [2025-03-16 15:06:37,450 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 15:06:37,450 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 15:06:37,490 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 883 statements into 1 equivalence classes. [2025-03-16 15:06:37,507 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 883 of 883 statements. [2025-03-16 15:06:37,507 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 15:06:37,507 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 15:06:37,908 INFO L134 CoverageAnalysis]: Checked inductivity of 2364 backedges. 1563 proven. 93 refuted. 0 times theorem prover too weak. 708 trivial. 0 not checked. [2025-03-16 15:06:37,908 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 15:06:37,908 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [304730341] [2025-03-16 15:06:37,908 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [304730341] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-16 15:06:37,908 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [968190616] [2025-03-16 15:06:37,908 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 15:06:37,908 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-16 15:06:37,908 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-16 15:06:37,911 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-16 15:06:37,912 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2025-03-16 15:06:37,975 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 883 statements into 1 equivalence classes. [2025-03-16 15:06:38,072 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 883 of 883 statements. [2025-03-16 15:06:38,072 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 15:06:38,072 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 15:06:38,075 INFO L256 TraceCheckSpWp]: Trace formula consists of 1087 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-03-16 15:06:38,081 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-16 15:06:38,155 INFO L134 CoverageAnalysis]: Checked inductivity of 2364 backedges. 391 proven. 0 refuted. 0 times theorem prover too weak. 1973 trivial. 0 not checked. [2025-03-16 15:06:38,155 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-16 15:06:38,155 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [968190616] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 15:06:38,156 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-16 15:06:38,156 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [4] total 6 [2025-03-16 15:06:38,156 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1207843675] [2025-03-16 15:06:38,156 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 15:06:38,156 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-16 15:06:38,156 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 15:06:38,157 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-16 15:06:38,157 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2025-03-16 15:06:38,157 INFO L87 Difference]: Start difference. First operand 4097 states and 4332 transitions. Second operand has 3 states, 3 states have (on average 79.66666666666667) internal successors, (239), 3 states have internal predecessors, (239), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 15:06:38,441 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 15:06:38,442 INFO L93 Difference]: Finished difference Result 5167 states and 5437 transitions. [2025-03-16 15:06:38,442 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-16 15:06:38,442 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 79.66666666666667) internal successors, (239), 3 states have internal predecessors, (239), 0 states have call successors, (0), 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 883 [2025-03-16 15:06:38,443 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 15:06:38,449 INFO L225 Difference]: With dead ends: 5167 [2025-03-16 15:06:38,449 INFO L226 Difference]: Without dead ends: 5165 [2025-03-16 15:06:38,450 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 886 GetRequests, 882 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2025-03-16 15:06:38,450 INFO L435 NwaCegarLoop]: 6 mSDtfsCounter, 143 mSDsluCounter, 4 mSDsCounter, 0 mSdLazyCounter, 431 mSolverCounterSat, 26 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 143 SdHoareTripleChecker+Valid, 10 SdHoareTripleChecker+Invalid, 457 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 26 IncrementalHoareTripleChecker+Valid, 431 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-03-16 15:06:38,450 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [143 Valid, 10 Invalid, 457 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [26 Valid, 431 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-16 15:06:38,453 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5165 states. [2025-03-16 15:06:38,475 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5165 to 4097. [2025-03-16 15:06:38,478 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4097 states, 4096 states have (on average 1.0576171875) internal successors, (4332), 4096 states have internal predecessors, (4332), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 15:06:38,481 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4097 states to 4097 states and 4332 transitions. [2025-03-16 15:06:38,482 INFO L78 Accepts]: Start accepts. Automaton has 4097 states and 4332 transitions. Word has length 883 [2025-03-16 15:06:38,482 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 15:06:38,483 INFO L471 AbstractCegarLoop]: Abstraction has 4097 states and 4332 transitions. [2025-03-16 15:06:38,483 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 79.66666666666667) internal successors, (239), 3 states have internal predecessors, (239), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 15:06:38,483 INFO L276 IsEmpty]: Start isEmpty. Operand 4097 states and 4332 transitions. [2025-03-16 15:06:38,488 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 902 [2025-03-16 15:06:38,489 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 15:06:38,489 INFO L218 NwaCegarLoop]: trace histogram [8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 4, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 15:06:38,496 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2025-03-16 15:06:38,689 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable14 [2025-03-16 15:06:38,690 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 15:06:38,690 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 15:06:38,690 INFO L85 PathProgramCache]: Analyzing trace with hash -330988100, now seen corresponding path program 1 times [2025-03-16 15:06:38,690 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 15:06:38,690 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1481787112] [2025-03-16 15:06:38,691 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 15:06:38,691 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 15:06:38,727 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 901 statements into 1 equivalence classes. [2025-03-16 15:06:38,745 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 901 of 901 statements. [2025-03-16 15:06:38,745 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 15:06:38,745 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 15:06:39,216 INFO L134 CoverageAnalysis]: Checked inductivity of 2454 backedges. 1635 proven. 93 refuted. 0 times theorem prover too weak. 726 trivial. 0 not checked. [2025-03-16 15:06:39,216 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 15:06:39,216 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1481787112] [2025-03-16 15:06:39,216 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1481787112] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-16 15:06:39,216 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [897425077] [2025-03-16 15:06:39,216 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 15:06:39,216 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-16 15:06:39,217 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-16 15:06:39,218 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-16 15:06:39,220 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2025-03-16 15:06:39,287 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 901 statements into 1 equivalence classes. [2025-03-16 15:06:39,405 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 901 of 901 statements. [2025-03-16 15:06:39,406 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 15:06:39,406 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 15:06:39,408 INFO L256 TraceCheckSpWp]: Trace formula consists of 1104 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-03-16 15:06:39,413 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-16 15:06:39,471 INFO L134 CoverageAnalysis]: Checked inductivity of 2454 backedges. 391 proven. 0 refuted. 0 times theorem prover too weak. 2063 trivial. 0 not checked. [2025-03-16 15:06:39,472 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-16 15:06:39,472 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [897425077] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 15:06:39,472 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-16 15:06:39,472 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [4] total 6 [2025-03-16 15:06:39,472 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [634814095] [2025-03-16 15:06:39,472 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 15:06:39,473 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-16 15:06:39,473 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 15:06:39,474 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-16 15:06:39,474 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2025-03-16 15:06:39,474 INFO L87 Difference]: Start difference. First operand 4097 states and 4332 transitions. Second operand has 3 states, 3 states have (on average 79.66666666666667) internal successors, (239), 3 states have internal predecessors, (239), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 15:06:39,750 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 15:06:39,750 INFO L93 Difference]: Finished difference Result 9437 states and 9941 transitions. [2025-03-16 15:06:39,750 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-16 15:06:39,750 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 79.66666666666667) internal successors, (239), 3 states have internal predecessors, (239), 0 states have call successors, (0), 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 901 [2025-03-16 15:06:39,751 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 15:06:39,751 INFO L225 Difference]: With dead ends: 9437 [2025-03-16 15:06:39,751 INFO L226 Difference]: Without dead ends: 0 [2025-03-16 15:06:39,756 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 904 GetRequests, 900 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2025-03-16 15:06:39,756 INFO L435 NwaCegarLoop]: 239 mSDtfsCounter, 123 mSDsluCounter, 3 mSDsCounter, 0 mSdLazyCounter, 402 mSolverCounterSat, 24 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 123 SdHoareTripleChecker+Valid, 242 SdHoareTripleChecker+Invalid, 426 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 24 IncrementalHoareTripleChecker+Valid, 402 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-03-16 15:06:39,756 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [123 Valid, 242 Invalid, 426 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [24 Valid, 402 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-16 15:06:39,757 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2025-03-16 15:06:39,757 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2025-03-16 15:06:39,757 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-16 15:06:39,757 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2025-03-16 15:06:39,757 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 901 [2025-03-16 15:06:39,757 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 15:06:39,757 INFO L471 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2025-03-16 15:06:39,757 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 79.66666666666667) internal successors, (239), 3 states have internal predecessors, (239), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 15:06:39,758 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2025-03-16 15:06:39,758 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2025-03-16 15:06:39,760 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2025-03-16 15:06:39,767 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Ended with exit code 0 [2025-03-16 15:06:39,960 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable15 [2025-03-16 15:06:39,963 INFO L422 BasicCegarLoop]: Path program histogram: [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 15:06:39,964 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2025-03-16 15:06:40,451 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2025-03-16 15:06:40,464 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 16.03 03:06:40 BoogieIcfgContainer [2025-03-16 15:06:40,464 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2025-03-16 15:06:40,465 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2025-03-16 15:06:40,465 INFO L270 PluginConnector]: Initializing Witness Printer... [2025-03-16 15:06:40,465 INFO L274 PluginConnector]: Witness Printer initialized [2025-03-16 15:06:40,466 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 16.03 03:06:20" (3/4) ... [2025-03-16 15:06:40,468 INFO L146 WitnessPrinter]: Generating witness for correct program [2025-03-16 15:06:40,484 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 11 nodes and edges [2025-03-16 15:06:40,486 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 4 nodes and edges [2025-03-16 15:06:40,487 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 3 nodes and edges [2025-03-16 15:06:40,487 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2025-03-16 15:06:40,593 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2025-03-16 15:06:40,593 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.yml [2025-03-16 15:06:40,593 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2025-03-16 15:06:40,594 INFO L158 Benchmark]: Toolchain (without parser) took 21600.76ms. Allocated memory was 201.3MB in the beginning and 637.5MB in the end (delta: 436.2MB). Free memory was 158.0MB in the beginning and 566.7MB in the end (delta: -408.7MB). Peak memory consumption was 27.6MB. Max. memory is 16.1GB. [2025-03-16 15:06:40,594 INFO L158 Benchmark]: CDTParser took 0.22ms. Allocated memory is still 201.3MB. Free memory is still 117.0MB. There was no memory consumed. Max. memory is 16.1GB. [2025-03-16 15:06:40,594 INFO L158 Benchmark]: CACSL2BoogieTranslator took 365.12ms. Allocated memory is still 201.3MB. Free memory was 157.6MB in the beginning and 125.7MB in the end (delta: 31.9MB). Peak memory consumption was 33.6MB. Max. memory is 16.1GB. [2025-03-16 15:06:40,595 INFO L158 Benchmark]: Boogie Procedure Inliner took 61.31ms. Allocated memory is still 201.3MB. Free memory was 125.7MB in the beginning and 116.3MB in the end (delta: 9.4MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-03-16 15:06:40,595 INFO L158 Benchmark]: Boogie Preprocessor took 86.60ms. Allocated memory is still 201.3MB. Free memory was 116.3MB in the beginning and 105.3MB in the end (delta: 11.0MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-03-16 15:06:40,595 INFO L158 Benchmark]: IcfgBuilder took 1023.26ms. Allocated memory is still 201.3MB. Free memory was 105.3MB in the beginning and 94.6MB in the end (delta: 10.6MB). Peak memory consumption was 70.0MB. Max. memory is 16.1GB. [2025-03-16 15:06:40,596 INFO L158 Benchmark]: TraceAbstraction took 19930.20ms. Allocated memory was 201.3MB in the beginning and 637.5MB in the end (delta: 436.2MB). Free memory was 93.6MB in the beginning and 579.3MB in the end (delta: -485.7MB). Peak memory consumption was 312.0MB. Max. memory is 16.1GB. [2025-03-16 15:06:40,596 INFO L158 Benchmark]: Witness Printer took 128.24ms. Allocated memory is still 637.5MB. Free memory was 579.3MB in the beginning and 566.7MB in the end (delta: 12.6MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2025-03-16 15:06:40,597 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.22ms. Allocated memory is still 201.3MB. Free memory is still 117.0MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 365.12ms. Allocated memory is still 201.3MB. Free memory was 157.6MB in the beginning and 125.7MB in the end (delta: 31.9MB). Peak memory consumption was 33.6MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 61.31ms. Allocated memory is still 201.3MB. Free memory was 125.7MB in the beginning and 116.3MB in the end (delta: 9.4MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Boogie Preprocessor took 86.60ms. Allocated memory is still 201.3MB. Free memory was 116.3MB in the beginning and 105.3MB in the end (delta: 11.0MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * IcfgBuilder took 1023.26ms. Allocated memory is still 201.3MB. Free memory was 105.3MB in the beginning and 94.6MB in the end (delta: 10.6MB). Peak memory consumption was 70.0MB. Max. memory is 16.1GB. * TraceAbstraction took 19930.20ms. Allocated memory was 201.3MB in the beginning and 637.5MB in the end (delta: 436.2MB). Free memory was 93.6MB in the beginning and 579.3MB in the end (delta: -485.7MB). Peak memory consumption was 312.0MB. Max. memory is 16.1GB. * Witness Printer took 128.24ms. Allocated memory is still 637.5MB. Free memory was 579.3MB in the beginning and 566.7MB in the end (delta: 12.6MB). Peak memory consumption was 16.8MB. 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: 188]: 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, 184 locations, 360 edges, 1 error locations. Started 1 CEGAR loops. OverallTime: 19.4s, OverallIterations: 16, TraceHistogramMax: 8, PathProgramHistogramMax: 2, EmptinessCheckTime: 0.1s, AutomataDifference: 8.3s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 3610 SdHoareTripleChecker+Valid, 7.6s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 3610 mSDsluCounter, 1561 SdHoareTripleChecker+Invalid, 6.2s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 100 mSDsCounter, 1353 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 9605 IncrementalHoareTripleChecker+Invalid, 10958 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 1353 mSolverCounterUnsat, 1461 mSDtfsCounter, 9605 mSolverCounterSat, 0.1s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 4045 GetRequests, 4000 SyntacticMatches, 0 SemanticMatches, 45 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 35 ImplicationChecksByTransitivity, 0.2s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=4097occurred in iteration=14, InterpolantAutomatonStates: 59, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.6s AutomataMinimizationTime, 16 MinimizatonAttempts, 4686 StatesRemovedByMinimization, 7 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.2s SsaConstructionTime, 0.8s SatisfiabilityAnalysisTime, 7.7s InterpolantComputationTime, 10532 NumberOfCodeBlocks, 10532 NumberOfCodeBlocksAsserted, 23 NumberOfCheckSat, 11270 ConstructedInterpolants, 0 QuantifiedInterpolants, 39398 SizeOfPredicates, 3 NumberOfNonLiveVariables, 4051 ConjunctsInSsa, 18 ConjunctsInUnsatCore, 22 InterpolantComputations, 15 PerfectInterpolantSequences, 23103/24136 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: 890]: Location Invariant Derived location invariant: ((((((((((a24 == 1) && (a21 <= 8)) && (0 < ((long long) a12 + 43))) || ((a24 == 1) && (81 <= a12))) || (((7 <= a15) && (a24 == 1)) && (a15 <= 8))) || (((a12 <= 11) && (a24 == 1)) && ((a15 != 9) || (0 < ((long long) a12 + 43))))) || (((((long long) a12 + 43) <= 0) && (a24 == 1)) && (a21 != 6))) || (((a21 <= 9) && (a24 == 1)) && (a15 <= 8))) || ((a24 == 1) && (a15 <= 5))) || (((a21 <= 7) && (((long long) 49 + a12) <= 0)) && (a15 <= 5))) RESULT: Ultimate proved your program to be correct! [2025-03-16 15:06:40,613 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