./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/eca-rers2012/Problem14_label05.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 798a7b37 Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/eca-rers2012/Problem14_label05.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 e02cb01095391f043ac338e051aad38ada321e317716e1cbc4cb781d100f4706 --- Real Ultimate output --- This is Ultimate 0.3.0-?-798a7b3-m [2025-03-03 10:46:33,131 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-03 10:46:33,185 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2025-03-03 10:46:33,188 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-03 10:46:33,188 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-03 10:46:33,215 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-03 10:46:33,216 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-03 10:46:33,216 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-03 10:46:33,217 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-03 10:46:33,217 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-03 10:46:33,217 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-03 10:46:33,217 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-03 10:46:33,217 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-03 10:46:33,218 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-03 10:46:33,218 INFO L153 SettingsManager]: * Use SBE=true [2025-03-03 10:46:33,218 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-03 10:46:33,218 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-03 10:46:33,218 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-03 10:46:33,218 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-03 10:46:33,219 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-03 10:46:33,219 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-03 10:46:33,219 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-03 10:46:33,219 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-03 10:46:33,219 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-03 10:46:33,219 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-03 10:46:33,219 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-03 10:46:33,219 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-03 10:46:33,220 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-03 10:46:33,220 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-03 10:46:33,220 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-03 10:46:33,220 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-03 10:46:33,220 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-03 10:46:33,220 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-03 10:46:33,220 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-03 10:46:33,220 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-03 10:46:33,221 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-03 10:46:33,221 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-03 10:46:33,221 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-03 10:46:33,221 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-03 10:46:33,221 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-03 10:46:33,221 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-03 10:46:33,221 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-03 10:46:33,221 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-03 10:46:33,221 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 -> e02cb01095391f043ac338e051aad38ada321e317716e1cbc4cb781d100f4706 [2025-03-03 10:46:33,443 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-03 10:46:33,449 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-03 10:46:33,451 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-03 10:46:33,452 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-03 10:46:33,452 INFO L274 PluginConnector]: CDTParser initialized [2025-03-03 10:46:33,453 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/eca-rers2012/Problem14_label05.c [2025-03-03 10:46:34,607 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/fa684812a/21dce6f200ee4e13b647884f982c73e1/FLAG0b81a0cc4 [2025-03-03 10:46:34,892 INFO L384 CDTParser]: Found 1 translation units. [2025-03-03 10:46:34,892 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/eca-rers2012/Problem14_label05.c [2025-03-03 10:46:34,903 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/fa684812a/21dce6f200ee4e13b647884f982c73e1/FLAG0b81a0cc4 [2025-03-03 10:46:35,180 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/fa684812a/21dce6f200ee4e13b647884f982c73e1 [2025-03-03 10:46:35,182 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-03 10:46:35,184 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-03 10:46:35,185 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-03 10:46:35,185 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-03 10:46:35,188 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-03 10:46:35,188 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 03.03 10:46:35" (1/1) ... [2025-03-03 10:46:35,189 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@12f1f91a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 10:46:35, skipping insertion in model container [2025-03-03 10:46:35,189 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 03.03 10:46:35" (1/1) ... [2025-03-03 10:46:35,218 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-03 10:46:35,365 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_label05.c[6428,6441] [2025-03-03 10:46:35,518 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-03 10:46:35,525 INFO L200 MainTranslator]: Completed pre-run [2025-03-03 10:46:35,548 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_label05.c[6428,6441] [2025-03-03 10:46:35,609 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-03 10:46:35,621 INFO L204 MainTranslator]: Completed translation [2025-03-03 10:46:35,622 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 10:46:35 WrapperNode [2025-03-03 10:46:35,622 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-03 10:46:35,623 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-03 10:46:35,623 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-03 10:46:35,623 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-03 10:46:35,627 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 10:46:35" (1/1) ... [2025-03-03 10:46:35,641 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 10:46:35" (1/1) ... [2025-03-03 10:46:35,686 INFO L138 Inliner]: procedures = 14, calls = 8, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 856 [2025-03-03 10:46:35,687 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-03 10:46:35,687 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-03 10:46:35,687 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-03 10:46:35,687 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-03 10:46:35,693 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 10:46:35" (1/1) ... [2025-03-03 10:46:35,694 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 10:46:35" (1/1) ... [2025-03-03 10:46:35,699 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 10:46:35" (1/1) ... [2025-03-03 10:46:35,734 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2025-03-03 10:46:35,735 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 10:46:35" (1/1) ... [2025-03-03 10:46:35,735 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 10:46:35" (1/1) ... [2025-03-03 10:46:35,752 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 10:46:35" (1/1) ... [2025-03-03 10:46:35,758 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 10:46:35" (1/1) ... [2025-03-03 10:46:35,767 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 10:46:35" (1/1) ... [2025-03-03 10:46:35,770 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 10:46:35" (1/1) ... [2025-03-03 10:46:35,781 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-03 10:46:35,782 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-03 10:46:35,782 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-03 10:46:35,782 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-03 10:46:35,782 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 10:46:35" (1/1) ... [2025-03-03 10:46:35,787 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-03 10:46:35,796 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 10:46:35,806 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-03-03 10:46:35,810 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-03-03 10:46:35,825 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-03 10:46:35,826 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-03-03 10:46:35,826 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-03 10:46:35,826 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-03 10:46:35,879 INFO L256 CfgBuilder]: Building ICFG [2025-03-03 10:46:35,881 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-03 10:46:36,745 INFO L? ?]: Removed 123 outVars from TransFormulas that were not future-live. [2025-03-03 10:46:36,745 INFO L307 CfgBuilder]: Performing block encoding [2025-03-03 10:46:36,757 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-03 10:46:36,759 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-03 10:46:36,759 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 03.03 10:46:36 BoogieIcfgContainer [2025-03-03 10:46:36,759 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-03 10:46:36,761 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-03 10:46:36,761 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-03 10:46:36,764 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-03 10:46:36,764 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 03.03 10:46:35" (1/3) ... [2025-03-03 10:46:36,764 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1b3e3115 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 03.03 10:46:36, skipping insertion in model container [2025-03-03 10:46:36,764 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 10:46:35" (2/3) ... [2025-03-03 10:46:36,765 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1b3e3115 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 03.03 10:46:36, skipping insertion in model container [2025-03-03 10:46:36,765 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 03.03 10:46:36" (3/3) ... [2025-03-03 10:46:36,766 INFO L128 eAbstractionObserver]: Analyzing ICFG Problem14_label05.c [2025-03-03 10:46:36,776 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-03 10:46:36,777 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG Problem14_label05.c that has 1 procedures, 245 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-03-03 10:46:36,826 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-03 10:46:36,835 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;@4353664e, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-03 10:46:36,836 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-03-03 10:46:36,839 INFO L276 IsEmpty]: Start isEmpty. Operand has 245 states, 243 states have (on average 1.7325102880658436) internal successors, (421), 244 states have internal predecessors, (421), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 10:46:36,846 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2025-03-03 10:46:36,846 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 10:46:36,847 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 10:46:36,847 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 10:46:36,851 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 10:46:36,851 INFO L85 PathProgramCache]: Analyzing trace with hash 1723606014, now seen corresponding path program 1 times [2025-03-03 10:46:36,856 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 10:46:36,857 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [597159768] [2025-03-03 10:46:36,857 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 10:46:36,859 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 10:46:36,915 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 63 statements into 1 equivalence classes. [2025-03-03 10:46:36,949 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 63 of 63 statements. [2025-03-03 10:46:36,950 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 10:46:36,950 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 10:46:37,167 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 10:46:37,168 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 10:46:37,168 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [597159768] [2025-03-03 10:46:37,168 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [597159768] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 10:46:37,168 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 10:46:37,168 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-03 10:46:37,170 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [13080370] [2025-03-03 10:46:37,170 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 10:46:37,172 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-03 10:46:37,173 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 10:46:37,187 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-03 10:46:37,188 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 10:46:37,190 INFO L87 Difference]: Start difference. First operand has 245 states, 243 states have (on average 1.7325102880658436) internal successors, (421), 244 states have internal predecessors, (421), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 3 states, 3 states have (on average 21.0) internal successors, (63), 2 states have internal predecessors, (63), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 10:46:38,003 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 10:46:38,004 INFO L93 Difference]: Finished difference Result 685 states and 1213 transitions. [2025-03-03 10:46:38,005 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-03 10:46:38,006 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 21.0) internal successors, (63), 2 states have internal predecessors, (63), 0 states have call successors, (0), 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 63 [2025-03-03 10:46:38,006 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 10:46:38,014 INFO L225 Difference]: With dead ends: 685 [2025-03-03 10:46:38,015 INFO L226 Difference]: Without dead ends: 360 [2025-03-03 10:46:38,019 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 10:46:38,021 INFO L435 NwaCegarLoop]: 132 mSDtfsCounter, 155 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 535 mSolverCounterSat, 176 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 155 SdHoareTripleChecker+Valid, 139 SdHoareTripleChecker+Invalid, 711 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 176 IncrementalHoareTripleChecker+Valid, 535 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2025-03-03 10:46:38,022 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [155 Valid, 139 Invalid, 711 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [176 Valid, 535 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2025-03-03 10:46:38,034 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 360 states. [2025-03-03 10:46:38,056 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 360 to 360. [2025-03-03 10:46:38,057 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 360 states, 359 states have (on average 1.4206128133704736) internal successors, (510), 359 states have internal predecessors, (510), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 10:46:38,062 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 360 states to 360 states and 510 transitions. [2025-03-03 10:46:38,063 INFO L78 Accepts]: Start accepts. Automaton has 360 states and 510 transitions. Word has length 63 [2025-03-03 10:46:38,063 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 10:46:38,063 INFO L471 AbstractCegarLoop]: Abstraction has 360 states and 510 transitions. [2025-03-03 10:46:38,063 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 21.0) internal successors, (63), 2 states have internal predecessors, (63), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 10:46:38,063 INFO L276 IsEmpty]: Start isEmpty. Operand 360 states and 510 transitions. [2025-03-03 10:46:38,066 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 143 [2025-03-03 10:46:38,066 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 10:46:38,066 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, 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-03 10:46:38,067 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-03-03 10:46:38,067 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 10:46:38,067 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 10:46:38,067 INFO L85 PathProgramCache]: Analyzing trace with hash 1949451213, now seen corresponding path program 1 times [2025-03-03 10:46:38,068 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 10:46:38,068 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [892767153] [2025-03-03 10:46:38,068 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 10:46:38,068 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 10:46:38,088 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 142 statements into 1 equivalence classes. [2025-03-03 10:46:38,105 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 142 of 142 statements. [2025-03-03 10:46:38,106 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 10:46:38,106 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 10:46:38,436 INFO L134 CoverageAnalysis]: Checked inductivity of 60 backedges. 60 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 10:46:38,437 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 10:46:38,437 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [892767153] [2025-03-03 10:46:38,437 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [892767153] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 10:46:38,438 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 10:46:38,438 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-03 10:46:38,438 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [466314060] [2025-03-03 10:46:38,438 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 10:46:38,439 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-03 10:46:38,439 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 10:46:38,440 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-03 10:46:38,441 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-03 10:46:38,441 INFO L87 Difference]: Start difference. First operand 360 states and 510 transitions. Second operand has 4 states, 4 states have (on average 35.5) internal successors, (142), 3 states have internal predecessors, (142), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 10:46:39,196 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 10:46:39,196 INFO L93 Difference]: Finished difference Result 1074 states and 1446 transitions. [2025-03-03 10:46:39,196 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-03 10:46:39,197 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 35.5) internal successors, (142), 3 states have internal predecessors, (142), 0 states have call successors, (0), 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 142 [2025-03-03 10:46:39,197 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 10:46:39,199 INFO L225 Difference]: With dead ends: 1074 [2025-03-03 10:46:39,200 INFO L226 Difference]: Without dead ends: 716 [2025-03-03 10:46:39,200 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-03 10:46:39,201 INFO L435 NwaCegarLoop]: 110 mSDtfsCounter, 419 mSDsluCounter, 11 mSDsCounter, 0 mSdLazyCounter, 976 mSolverCounterSat, 40 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 419 SdHoareTripleChecker+Valid, 121 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-03 10:46:39,201 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [419 Valid, 121 Invalid, 1016 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [40 Valid, 976 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2025-03-03 10:46:39,202 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 716 states. [2025-03-03 10:46:39,238 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 716 to 716. [2025-03-03 10:46:39,243 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 716 states, 715 states have (on average 1.2615384615384615) internal successors, (902), 715 states have internal predecessors, (902), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 10:46:39,245 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 716 states to 716 states and 902 transitions. [2025-03-03 10:46:39,246 INFO L78 Accepts]: Start accepts. Automaton has 716 states and 902 transitions. Word has length 142 [2025-03-03 10:46:39,247 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 10:46:39,247 INFO L471 AbstractCegarLoop]: Abstraction has 716 states and 902 transitions. [2025-03-03 10:46:39,247 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 35.5) internal successors, (142), 3 states have internal predecessors, (142), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 10:46:39,247 INFO L276 IsEmpty]: Start isEmpty. Operand 716 states and 902 transitions. [2025-03-03 10:46:39,251 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 169 [2025-03-03 10:46:39,251 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 10:46:39,251 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, 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] [2025-03-03 10:46:39,251 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-03-03 10:46:39,251 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 10:46:39,252 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 10:46:39,254 INFO L85 PathProgramCache]: Analyzing trace with hash -1836674034, now seen corresponding path program 1 times [2025-03-03 10:46:39,254 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 10:46:39,254 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1784737786] [2025-03-03 10:46:39,254 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 10:46:39,255 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 10:46:39,270 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 168 statements into 1 equivalence classes. [2025-03-03 10:46:39,288 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 168 of 168 statements. [2025-03-03 10:46:39,288 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 10:46:39,288 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 10:46:39,513 INFO L134 CoverageAnalysis]: Checked inductivity of 60 backedges. 0 proven. 50 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2025-03-03 10:46:39,514 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 10:46:39,514 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1784737786] [2025-03-03 10:46:39,514 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1784737786] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-03 10:46:39,514 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1314476182] [2025-03-03 10:46:39,515 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 10:46:39,515 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 10:46:39,515 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 10:46:39,517 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-03 10:46:39,518 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2025-03-03 10:46:39,554 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 168 statements into 1 equivalence classes. [2025-03-03 10:46:39,580 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 168 of 168 statements. [2025-03-03 10:46:39,580 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 10:46:39,580 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 10:46:39,582 INFO L256 TraceCheckSpWp]: Trace formula consists of 242 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-03-03 10:46:39,587 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 10:46:39,794 INFO L134 CoverageAnalysis]: Checked inductivity of 60 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 60 trivial. 0 not checked. [2025-03-03 10:46:39,795 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-03 10:46:39,795 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1314476182] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 10:46:39,795 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-03 10:46:39,795 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [3] total 4 [2025-03-03 10:46:39,795 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2127720159] [2025-03-03 10:46:39,796 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 10:46:39,796 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-03 10:46:39,796 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 10:46:39,797 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-03 10:46:39,797 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-03-03 10:46:39,797 INFO L87 Difference]: Start difference. First operand 716 states and 902 transitions. Second operand has 3 states, 3 states have (on average 36.333333333333336) internal successors, (109), 2 states have internal predecessors, (109), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 10:46:40,289 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 10:46:40,289 INFO L93 Difference]: Finished difference Result 1252 states and 1612 transitions. [2025-03-03 10:46:40,290 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-03 10:46:40,290 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 36.333333333333336) internal successors, (109), 2 states have internal predecessors, (109), 0 states have call successors, (0), 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 168 [2025-03-03 10:46:40,290 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 10:46:40,294 INFO L225 Difference]: With dead ends: 1252 [2025-03-03 10:46:40,295 INFO L226 Difference]: Without dead ends: 1250 [2025-03-03 10:46:40,295 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 170 GetRequests, 167 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-03-03 10:46:40,298 INFO L435 NwaCegarLoop]: 32 mSDtfsCounter, 91 mSDsluCounter, 4 mSDsCounter, 0 mSdLazyCounter, 574 mSolverCounterSat, 25 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 91 SdHoareTripleChecker+Valid, 36 SdHoareTripleChecker+Invalid, 599 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 25 IncrementalHoareTripleChecker+Valid, 574 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-03-03 10:46:40,298 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [91 Valid, 36 Invalid, 599 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [25 Valid, 574 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-03-03 10:46:40,299 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1250 states. [2025-03-03 10:46:40,315 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1250 to 894. [2025-03-03 10:46:40,318 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 894 states, 893 states have (on average 1.3370660694288914) internal successors, (1194), 893 states have internal predecessors, (1194), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 10:46:40,320 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 894 states to 894 states and 1194 transitions. [2025-03-03 10:46:40,320 INFO L78 Accepts]: Start accepts. Automaton has 894 states and 1194 transitions. Word has length 168 [2025-03-03 10:46:40,321 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 10:46:40,321 INFO L471 AbstractCegarLoop]: Abstraction has 894 states and 1194 transitions. [2025-03-03 10:46:40,321 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 36.333333333333336) internal successors, (109), 2 states have internal predecessors, (109), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 10:46:40,321 INFO L276 IsEmpty]: Start isEmpty. Operand 894 states and 1194 transitions. [2025-03-03 10:46:40,326 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 223 [2025-03-03 10:46:40,326 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 10:46:40,326 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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-03 10:46:40,333 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2025-03-03 10:46:40,527 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 10:46:40,527 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 10:46:40,528 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 10:46:40,528 INFO L85 PathProgramCache]: Analyzing trace with hash 327979173, now seen corresponding path program 1 times [2025-03-03 10:46:40,528 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 10:46:40,528 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [287460787] [2025-03-03 10:46:40,528 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 10:46:40,528 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 10:46:40,543 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 222 statements into 1 equivalence classes. [2025-03-03 10:46:40,552 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 222 of 222 statements. [2025-03-03 10:46:40,552 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 10:46:40,553 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 10:46:40,747 INFO L134 CoverageAnalysis]: Checked inductivity of 199 backedges. 167 proven. 0 refuted. 0 times theorem prover too weak. 32 trivial. 0 not checked. [2025-03-03 10:46:40,748 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 10:46:40,748 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [287460787] [2025-03-03 10:46:40,748 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [287460787] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 10:46:40,748 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 10:46:40,748 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-03 10:46:40,748 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1911854607] [2025-03-03 10:46:40,749 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 10:46:40,749 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-03 10:46:40,749 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 10:46:40,750 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-03 10:46:40,750 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-03-03 10:46:40,750 INFO L87 Difference]: Start difference. First operand 894 states and 1194 transitions. Second operand has 4 states, 4 states have (on average 47.75) internal successors, (191), 3 states have internal predecessors, (191), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 10:46:41,341 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 10:46:41,342 INFO L93 Difference]: Finished difference Result 1993 states and 2629 transitions. [2025-03-03 10:46:41,342 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-03 10:46:41,342 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 47.75) internal successors, (191), 3 states have internal predecessors, (191), 0 states have call successors, (0), 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 222 [2025-03-03 10:46:41,343 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 10:46:41,346 INFO L225 Difference]: With dead ends: 1993 [2025-03-03 10:46:41,346 INFO L226 Difference]: Without dead ends: 1072 [2025-03-03 10:46:41,347 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-03 10:46:41,348 INFO L435 NwaCegarLoop]: 111 mSDtfsCounter, 102 mSDsluCounter, 10 mSDsCounter, 0 mSdLazyCounter, 736 mSolverCounterSat, 66 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 102 SdHoareTripleChecker+Valid, 121 SdHoareTripleChecker+Invalid, 802 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 66 IncrementalHoareTripleChecker+Valid, 736 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-03-03 10:46:41,348 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [102 Valid, 121 Invalid, 802 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [66 Valid, 736 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-03-03 10:46:41,349 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1072 states. [2025-03-03 10:46:41,360 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1072 to 1072. [2025-03-03 10:46:41,361 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1072 states, 1071 states have (on average 1.1802054154995332) internal successors, (1264), 1071 states have internal predecessors, (1264), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 10:46:41,364 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1072 states to 1072 states and 1264 transitions. [2025-03-03 10:46:41,364 INFO L78 Accepts]: Start accepts. Automaton has 1072 states and 1264 transitions. Word has length 222 [2025-03-03 10:46:41,364 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 10:46:41,364 INFO L471 AbstractCegarLoop]: Abstraction has 1072 states and 1264 transitions. [2025-03-03 10:46:41,365 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 47.75) internal successors, (191), 3 states have internal predecessors, (191), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 10:46:41,365 INFO L276 IsEmpty]: Start isEmpty. Operand 1072 states and 1264 transitions. [2025-03-03 10:46:41,366 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 235 [2025-03-03 10:46:41,366 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 10:46:41,366 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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] [2025-03-03 10:46:41,367 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-03-03 10:46:41,367 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 10:46:41,367 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 10:46:41,367 INFO L85 PathProgramCache]: Analyzing trace with hash -1185579661, now seen corresponding path program 1 times [2025-03-03 10:46:41,367 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 10:46:41,367 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1544219929] [2025-03-03 10:46:41,367 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 10:46:41,368 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 10:46:41,381 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 234 statements into 1 equivalence classes. [2025-03-03 10:46:41,391 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 234 of 234 statements. [2025-03-03 10:46:41,392 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 10:46:41,392 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 10:46:41,623 INFO L134 CoverageAnalysis]: Checked inductivity of 186 backedges. 121 proven. 65 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 10:46:41,623 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 10:46:41,623 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1544219929] [2025-03-03 10:46:41,623 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1544219929] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-03 10:46:41,623 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [323613740] [2025-03-03 10:46:41,623 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 10:46:41,623 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 10:46:41,624 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 10:46:41,625 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-03 10:46:41,627 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2025-03-03 10:46:41,663 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 234 statements into 1 equivalence classes. [2025-03-03 10:46:41,708 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 234 of 234 statements. [2025-03-03 10:46:41,708 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 10:46:41,708 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 10:46:41,710 INFO L256 TraceCheckSpWp]: Trace formula consists of 329 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-03-03 10:46:41,713 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 10:46:41,797 INFO L134 CoverageAnalysis]: Checked inductivity of 186 backedges. 121 proven. 0 refuted. 0 times theorem prover too weak. 65 trivial. 0 not checked. [2025-03-03 10:46:41,798 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-03 10:46:41,798 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [323613740] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 10:46:41,798 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-03 10:46:41,798 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [5] total 7 [2025-03-03 10:46:41,798 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1378430485] [2025-03-03 10:46:41,798 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 10:46:41,799 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-03 10:46:41,799 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 10:46:41,799 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-03 10:46:41,799 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2025-03-03 10:46:41,799 INFO L87 Difference]: Start difference. First operand 1072 states and 1264 transitions. Second operand has 3 states, 3 states have (on average 56.666666666666664) internal successors, (170), 3 states have internal predecessors, (170), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 10:46:42,248 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 10:46:42,249 INFO L93 Difference]: Finished difference Result 2498 states and 3033 transitions. [2025-03-03 10:46:42,250 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-03 10:46:42,251 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 56.666666666666664) internal successors, (170), 3 states have internal predecessors, (170), 0 states have call successors, (0), 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 234 [2025-03-03 10:46:42,251 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 10:46:42,256 INFO L225 Difference]: With dead ends: 2498 [2025-03-03 10:46:42,256 INFO L226 Difference]: Without dead ends: 1428 [2025-03-03 10:46:42,257 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 238 GetRequests, 233 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2025-03-03 10:46:42,258 INFO L435 NwaCegarLoop]: 81 mSDtfsCounter, 120 mSDsluCounter, 4 mSDsCounter, 0 mSdLazyCounter, 439 mSolverCounterSat, 71 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 120 SdHoareTripleChecker+Valid, 85 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-03 10:46:42,258 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [120 Valid, 85 Invalid, 510 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [71 Valid, 439 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-03-03 10:46:42,259 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1428 states. [2025-03-03 10:46:42,271 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1428 to 1072. [2025-03-03 10:46:42,272 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1072 states, 1071 states have (on average 1.1802054154995332) internal successors, (1264), 1071 states have internal predecessors, (1264), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 10:46:42,274 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1072 states to 1072 states and 1264 transitions. [2025-03-03 10:46:42,275 INFO L78 Accepts]: Start accepts. Automaton has 1072 states and 1264 transitions. Word has length 234 [2025-03-03 10:46:42,275 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 10:46:42,275 INFO L471 AbstractCegarLoop]: Abstraction has 1072 states and 1264 transitions. [2025-03-03 10:46:42,275 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 56.666666666666664) internal successors, (170), 3 states have internal predecessors, (170), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 10:46:42,275 INFO L276 IsEmpty]: Start isEmpty. Operand 1072 states and 1264 transitions. [2025-03-03 10:46:42,277 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 238 [2025-03-03 10:46:42,277 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 10:46:42,277 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 10:46:42,283 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2025-03-03 10:46:42,481 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 10:46:42,481 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 10:46:42,481 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 10:46:42,481 INFO L85 PathProgramCache]: Analyzing trace with hash -232691292, now seen corresponding path program 1 times [2025-03-03 10:46:42,481 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 10:46:42,481 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [337089842] [2025-03-03 10:46:42,481 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 10:46:42,481 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 10:46:42,496 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 237 statements into 1 equivalence classes. [2025-03-03 10:46:42,508 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 237 of 237 statements. [2025-03-03 10:46:42,508 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 10:46:42,508 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 10:46:42,667 INFO L134 CoverageAnalysis]: Checked inductivity of 189 backedges. 189 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 10:46:42,667 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 10:46:42,667 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [337089842] [2025-03-03 10:46:42,667 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [337089842] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 10:46:42,667 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 10:46:42,667 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-03 10:46:42,667 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [215558727] [2025-03-03 10:46:42,667 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 10:46:42,668 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-03 10:46:42,668 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 10:46:42,668 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-03 10:46:42,668 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 10:46:42,668 INFO L87 Difference]: Start difference. First operand 1072 states and 1264 transitions. Second operand has 3 states, 3 states have (on average 79.0) internal successors, (237), 3 states have internal predecessors, (237), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 10:46:43,071 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 10:46:43,072 INFO L93 Difference]: Finished difference Result 2676 states and 3213 transitions. [2025-03-03 10:46:43,072 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-03 10:46:43,072 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 79.0) internal successors, (237), 3 states have internal predecessors, (237), 0 states have call successors, (0), 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 237 [2025-03-03 10:46:43,072 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 10:46:43,076 INFO L225 Difference]: With dead ends: 2676 [2025-03-03 10:46:43,076 INFO L226 Difference]: Without dead ends: 1606 [2025-03-03 10:46:43,077 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 10:46:43,078 INFO L435 NwaCegarLoop]: 54 mSDtfsCounter, 112 mSDsluCounter, 3 mSDsCounter, 0 mSdLazyCounter, 450 mSolverCounterSat, 51 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 112 SdHoareTripleChecker+Valid, 57 SdHoareTripleChecker+Invalid, 501 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 51 IncrementalHoareTripleChecker+Valid, 450 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-03-03 10:46:43,078 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [112 Valid, 57 Invalid, 501 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [51 Valid, 450 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-03-03 10:46:43,079 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1606 states. [2025-03-03 10:46:43,096 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1606 to 1606. [2025-03-03 10:46:43,098 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1606 states, 1605 states have (on average 1.1576323987538941) internal successors, (1858), 1605 states have internal predecessors, (1858), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 10:46:43,101 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1606 states to 1606 states and 1858 transitions. [2025-03-03 10:46:43,101 INFO L78 Accepts]: Start accepts. Automaton has 1606 states and 1858 transitions. Word has length 237 [2025-03-03 10:46:43,102 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 10:46:43,102 INFO L471 AbstractCegarLoop]: Abstraction has 1606 states and 1858 transitions. [2025-03-03 10:46:43,102 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 79.0) internal successors, (237), 3 states have internal predecessors, (237), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 10:46:43,102 INFO L276 IsEmpty]: Start isEmpty. Operand 1606 states and 1858 transitions. [2025-03-03 10:46:43,107 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 357 [2025-03-03 10:46:43,107 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 10:46:43,108 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 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, 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] [2025-03-03 10:46:43,108 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-03-03 10:46:43,108 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 10:46:43,108 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 10:46:43,108 INFO L85 PathProgramCache]: Analyzing trace with hash -1470797390, now seen corresponding path program 1 times [2025-03-03 10:46:43,108 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 10:46:43,108 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [752154777] [2025-03-03 10:46:43,108 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 10:46:43,109 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 10:46:43,149 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 356 statements into 1 equivalence classes. [2025-03-03 10:46:43,165 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 356 of 356 statements. [2025-03-03 10:46:43,165 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 10:46:43,165 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 10:46:43,484 INFO L134 CoverageAnalysis]: Checked inductivity of 449 backedges. 237 proven. 130 refuted. 0 times theorem prover too weak. 82 trivial. 0 not checked. [2025-03-03 10:46:43,484 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 10:46:43,484 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [752154777] [2025-03-03 10:46:43,484 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [752154777] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-03 10:46:43,484 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1748845785] [2025-03-03 10:46:43,484 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 10:46:43,484 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 10:46:43,484 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 10:46:43,487 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-03 10:46:43,488 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2025-03-03 10:46:43,536 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 356 statements into 1 equivalence classes. [2025-03-03 10:46:43,584 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 356 of 356 statements. [2025-03-03 10:46:43,585 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 10:46:43,585 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 10:46:43,587 INFO L256 TraceCheckSpWp]: Trace formula consists of 473 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-03-03 10:46:43,591 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 10:46:43,898 INFO L134 CoverageAnalysis]: Checked inductivity of 449 backedges. 182 proven. 0 refuted. 0 times theorem prover too weak. 267 trivial. 0 not checked. [2025-03-03 10:46:43,898 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-03 10:46:43,898 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1748845785] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 10:46:43,898 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-03 10:46:43,898 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [4] total 5 [2025-03-03 10:46:43,902 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1488903043] [2025-03-03 10:46:43,903 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 10:46:43,903 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-03 10:46:43,903 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 10:46:43,904 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-03 10:46:43,904 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2025-03-03 10:46:43,904 INFO L87 Difference]: Start difference. First operand 1606 states and 1858 transitions. Second operand has 3 states, 3 states have (on average 57.333333333333336) internal successors, (172), 2 states have internal predecessors, (172), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 10:46:44,329 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 10:46:44,329 INFO L93 Difference]: Finished difference Result 3566 states and 4204 transitions. [2025-03-03 10:46:44,329 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-03 10:46:44,330 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 57.333333333333336) internal successors, (172), 2 states have internal predecessors, (172), 0 states have call successors, (0), 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 356 [2025-03-03 10:46:44,330 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 10:46:44,335 INFO L225 Difference]: With dead ends: 3566 [2025-03-03 10:46:44,336 INFO L226 Difference]: Without dead ends: 2140 [2025-03-03 10:46:44,338 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 359 GetRequests, 355 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2025-03-03 10:46:44,340 INFO L435 NwaCegarLoop]: 44 mSDtfsCounter, 82 mSDsluCounter, 3 mSDsCounter, 0 mSdLazyCounter, 402 mSolverCounterSat, 123 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 82 SdHoareTripleChecker+Valid, 47 SdHoareTripleChecker+Invalid, 525 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 123 IncrementalHoareTripleChecker+Valid, 402 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-03-03 10:46:44,340 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [82 Valid, 47 Invalid, 525 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [123 Valid, 402 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-03-03 10:46:44,342 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2140 states. [2025-03-03 10:46:44,362 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2140 to 1962. [2025-03-03 10:46:44,364 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1962 states, 1961 states have (on average 1.1330953595104538) internal successors, (2222), 1961 states have internal predecessors, (2222), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 10:46:44,367 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1962 states to 1962 states and 2222 transitions. [2025-03-03 10:46:44,367 INFO L78 Accepts]: Start accepts. Automaton has 1962 states and 2222 transitions. Word has length 356 [2025-03-03 10:46:44,367 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 10:46:44,368 INFO L471 AbstractCegarLoop]: Abstraction has 1962 states and 2222 transitions. [2025-03-03 10:46:44,368 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 57.333333333333336) internal successors, (172), 2 states have internal predecessors, (172), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 10:46:44,368 INFO L276 IsEmpty]: Start isEmpty. Operand 1962 states and 2222 transitions. [2025-03-03 10:46:44,372 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 434 [2025-03-03 10:46:44,372 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 10:46:44,372 INFO L218 NwaCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 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, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 10:46:44,379 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2025-03-03 10:46:44,573 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 10:46:44,574 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 10:46:44,574 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 10:46:44,574 INFO L85 PathProgramCache]: Analyzing trace with hash 1303374558, now seen corresponding path program 1 times [2025-03-03 10:46:44,575 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 10:46:44,575 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [964493757] [2025-03-03 10:46:44,575 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 10:46:44,575 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 10:46:44,602 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 433 statements into 1 equivalence classes. [2025-03-03 10:46:44,618 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 433 of 433 statements. [2025-03-03 10:46:44,619 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 10:46:44,619 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 10:46:44,922 INFO L134 CoverageAnalysis]: Checked inductivity of 742 backedges. 447 proven. 0 refuted. 0 times theorem prover too weak. 295 trivial. 0 not checked. [2025-03-03 10:46:44,923 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 10:46:44,923 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [964493757] [2025-03-03 10:46:44,924 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [964493757] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 10:46:44,924 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 10:46:44,924 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-03 10:46:44,924 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [663005197] [2025-03-03 10:46:44,924 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 10:46:44,924 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-03 10:46:44,925 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 10:46:44,925 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-03 10:46:44,925 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-03-03 10:46:44,925 INFO L87 Difference]: Start difference. First operand 1962 states and 2222 transitions. Second operand has 4 states, 4 states have (on average 55.0) internal successors, (220), 3 states have internal predecessors, (220), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 10:46:45,406 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 10:46:45,407 INFO L93 Difference]: Finished difference Result 3951 states and 4494 transitions. [2025-03-03 10:46:45,407 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-03 10:46:45,407 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 55.0) internal successors, (220), 3 states have internal predecessors, (220), 0 states have call successors, (0), 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 433 [2025-03-03 10:46:45,408 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 10:46:45,413 INFO L225 Difference]: With dead ends: 3951 [2025-03-03 10:46:45,413 INFO L226 Difference]: Without dead ends: 2140 [2025-03-03 10:46:45,415 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-03 10:46:45,415 INFO L435 NwaCegarLoop]: 9 mSDtfsCounter, 124 mSDsluCounter, 8 mSDsCounter, 0 mSdLazyCounter, 686 mSolverCounterSat, 45 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 124 SdHoareTripleChecker+Valid, 17 SdHoareTripleChecker+Invalid, 731 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 45 IncrementalHoareTripleChecker+Valid, 686 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-03-03 10:46:45,415 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [124 Valid, 17 Invalid, 731 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [45 Valid, 686 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-03-03 10:46:45,417 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2140 states. [2025-03-03 10:46:45,437 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2140 to 1962. [2025-03-03 10:46:45,439 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1962 states, 1961 states have (on average 1.084140744518103) internal successors, (2126), 1961 states have internal predecessors, (2126), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 10:46:45,442 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1962 states to 1962 states and 2126 transitions. [2025-03-03 10:46:45,442 INFO L78 Accepts]: Start accepts. Automaton has 1962 states and 2126 transitions. Word has length 433 [2025-03-03 10:46:45,442 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 10:46:45,442 INFO L471 AbstractCegarLoop]: Abstraction has 1962 states and 2126 transitions. [2025-03-03 10:46:45,443 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 55.0) internal successors, (220), 3 states have internal predecessors, (220), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 10:46:45,443 INFO L276 IsEmpty]: Start isEmpty. Operand 1962 states and 2126 transitions. [2025-03-03 10:46:45,445 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 457 [2025-03-03 10:46:45,445 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 10:46:45,445 INFO L218 NwaCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 10:46:45,446 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-03-03 10:46:45,446 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 10:46:45,446 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 10:46:45,447 INFO L85 PathProgramCache]: Analyzing trace with hash -1384393801, now seen corresponding path program 1 times [2025-03-03 10:46:45,447 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 10:46:45,447 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1505637543] [2025-03-03 10:46:45,447 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 10:46:45,447 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 10:46:45,469 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 456 statements into 1 equivalence classes. [2025-03-03 10:46:45,487 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 456 of 456 statements. [2025-03-03 10:46:45,488 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 10:46:45,488 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 10:46:45,719 INFO L134 CoverageAnalysis]: Checked inductivity of 763 backedges. 449 proven. 0 refuted. 0 times theorem prover too weak. 314 trivial. 0 not checked. [2025-03-03 10:46:45,720 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 10:46:45,720 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1505637543] [2025-03-03 10:46:45,720 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1505637543] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 10:46:45,720 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 10:46:45,720 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-03 10:46:45,720 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2120313113] [2025-03-03 10:46:45,720 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 10:46:45,721 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-03 10:46:45,721 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 10:46:45,721 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-03 10:46:45,721 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 10:46:45,721 INFO L87 Difference]: Start difference. First operand 1962 states and 2126 transitions. Second operand has 3 states, 3 states have (on average 82.66666666666667) internal successors, (248), 3 states have internal predecessors, (248), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 10:46:46,137 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 10:46:46,137 INFO L93 Difference]: Finished difference Result 4634 states and 5081 transitions. [2025-03-03 10:46:46,137 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-03 10:46:46,138 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 82.66666666666667) internal successors, (248), 3 states have internal predecessors, (248), 0 states have call successors, (0), 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 456 [2025-03-03 10:46:46,138 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 10:46:46,145 INFO L225 Difference]: With dead ends: 4634 [2025-03-03 10:46:46,146 INFO L226 Difference]: Without dead ends: 2852 [2025-03-03 10:46:46,148 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 10:46:46,149 INFO L435 NwaCegarLoop]: 215 mSDtfsCounter, 113 mSDsluCounter, 5 mSDsCounter, 0 mSdLazyCounter, 425 mSolverCounterSat, 44 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 113 SdHoareTripleChecker+Valid, 220 SdHoareTripleChecker+Invalid, 469 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 44 IncrementalHoareTripleChecker+Valid, 425 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-03-03 10:46:46,149 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [113 Valid, 220 Invalid, 469 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [44 Valid, 425 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-03-03 10:46:46,151 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2852 states. [2025-03-03 10:46:46,186 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2852 to 2496. [2025-03-03 10:46:46,189 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2496 states, 2495 states have (on average 1.0813627254509017) internal successors, (2698), 2495 states have internal predecessors, (2698), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 10:46:46,194 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2496 states to 2496 states and 2698 transitions. [2025-03-03 10:46:46,194 INFO L78 Accepts]: Start accepts. Automaton has 2496 states and 2698 transitions. Word has length 456 [2025-03-03 10:46:46,194 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 10:46:46,195 INFO L471 AbstractCegarLoop]: Abstraction has 2496 states and 2698 transitions. [2025-03-03 10:46:46,195 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 82.66666666666667) internal successors, (248), 3 states have internal predecessors, (248), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 10:46:46,195 INFO L276 IsEmpty]: Start isEmpty. Operand 2496 states and 2698 transitions. [2025-03-03 10:46:46,197 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 460 [2025-03-03 10:46:46,197 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 10:46:46,198 INFO L218 NwaCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1] [2025-03-03 10:46:46,198 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-03-03 10:46:46,198 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 10:46:46,198 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 10:46:46,198 INFO L85 PathProgramCache]: Analyzing trace with hash 1976565853, now seen corresponding path program 1 times [2025-03-03 10:46:46,198 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 10:46:46,199 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1536926314] [2025-03-03 10:46:46,199 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 10:46:46,199 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 10:46:46,220 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 459 statements into 1 equivalence classes. [2025-03-03 10:46:46,234 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 459 of 459 statements. [2025-03-03 10:46:46,235 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 10:46:46,235 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 10:46:46,608 INFO L134 CoverageAnalysis]: Checked inductivity of 793 backedges. 493 proven. 195 refuted. 0 times theorem prover too weak. 105 trivial. 0 not checked. [2025-03-03 10:46:46,609 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 10:46:46,609 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1536926314] [2025-03-03 10:46:46,609 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1536926314] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-03 10:46:46,609 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [756731565] [2025-03-03 10:46:46,609 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 10:46:46,609 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 10:46:46,609 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 10:46:46,611 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-03 10:46:46,613 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2025-03-03 10:46:46,657 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 459 statements into 1 equivalence classes. [2025-03-03 10:46:46,712 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 459 of 459 statements. [2025-03-03 10:46:46,712 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 10:46:46,712 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 10:46:46,714 INFO L256 TraceCheckSpWp]: Trace formula consists of 593 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-03-03 10:46:46,718 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 10:46:46,787 INFO L134 CoverageAnalysis]: Checked inductivity of 793 backedges. 243 proven. 0 refuted. 0 times theorem prover too weak. 550 trivial. 0 not checked. [2025-03-03 10:46:46,787 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-03 10:46:46,787 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [756731565] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 10:46:46,787 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-03 10:46:46,787 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [5] total 7 [2025-03-03 10:46:46,787 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2002667922] [2025-03-03 10:46:46,788 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 10:46:46,788 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-03 10:46:46,788 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 10:46:46,789 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-03 10:46:46,789 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2025-03-03 10:46:46,789 INFO L87 Difference]: Start difference. First operand 2496 states and 2698 transitions. Second operand has 3 states, 3 states have (on average 57.333333333333336) internal successors, (172), 3 states have internal predecessors, (172), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 10:46:47,134 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 10:46:47,134 INFO L93 Difference]: Finished difference Result 3388 states and 3641 transitions. [2025-03-03 10:46:47,134 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-03 10:46:47,135 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 57.333333333333336) internal successors, (172), 3 states have internal predecessors, (172), 0 states have call successors, (0), 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 459 [2025-03-03 10:46:47,135 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 10:46:47,143 INFO L225 Difference]: With dead ends: 3388 [2025-03-03 10:46:47,143 INFO L226 Difference]: Without dead ends: 3386 [2025-03-03 10:46:47,144 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 463 GetRequests, 458 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2025-03-03 10:46:47,144 INFO L435 NwaCegarLoop]: 7 mSDtfsCounter, 139 mSDsluCounter, 4 mSDsCounter, 0 mSdLazyCounter, 424 mSolverCounterSat, 35 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 139 SdHoareTripleChecker+Valid, 11 SdHoareTripleChecker+Invalid, 459 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 35 IncrementalHoareTripleChecker+Valid, 424 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-03-03 10:46:47,145 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [139 Valid, 11 Invalid, 459 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [35 Valid, 424 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-03 10:46:47,147 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3386 states. [2025-03-03 10:46:47,174 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3386 to 2496. [2025-03-03 10:46:47,177 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2496 states, 2495 states have (on average 1.0813627254509017) internal successors, (2698), 2495 states have internal predecessors, (2698), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 10:46:47,180 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2496 states to 2496 states and 2698 transitions. [2025-03-03 10:46:47,181 INFO L78 Accepts]: Start accepts. Automaton has 2496 states and 2698 transitions. Word has length 459 [2025-03-03 10:46:47,182 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 10:46:47,182 INFO L471 AbstractCegarLoop]: Abstraction has 2496 states and 2698 transitions. [2025-03-03 10:46:47,182 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 57.333333333333336) internal successors, (172), 3 states have internal predecessors, (172), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 10:46:47,182 INFO L276 IsEmpty]: Start isEmpty. Operand 2496 states and 2698 transitions. [2025-03-03 10:46:47,185 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 498 [2025-03-03 10:46:47,185 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 10:46:47,185 INFO L218 NwaCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 10:46:47,207 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2025-03-03 10:46:47,385 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 10:46:47,386 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 10:46:47,388 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 10:46:47,388 INFO L85 PathProgramCache]: Analyzing trace with hash -576297618, now seen corresponding path program 1 times [2025-03-03 10:46:47,388 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 10:46:47,388 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2101282155] [2025-03-03 10:46:47,388 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 10:46:47,388 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 10:46:47,411 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 497 statements into 1 equivalence classes. [2025-03-03 10:46:47,426 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 497 of 497 statements. [2025-03-03 10:46:47,427 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 10:46:47,427 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 10:46:47,537 INFO L134 CoverageAnalysis]: Checked inductivity of 877 backedges. 563 proven. 0 refuted. 0 times theorem prover too weak. 314 trivial. 0 not checked. [2025-03-03 10:46:47,537 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 10:46:47,537 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2101282155] [2025-03-03 10:46:47,537 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2101282155] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 10:46:47,537 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 10:46:47,537 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-03 10:46:47,538 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1670770574] [2025-03-03 10:46:47,538 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 10:46:47,538 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-03 10:46:47,538 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 10:46:47,538 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-03 10:46:47,538 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 10:46:47,539 INFO L87 Difference]: Start difference. First operand 2496 states and 2698 transitions. Second operand has 3 states, 3 states have (on average 96.33333333333333) internal successors, (289), 3 states have internal predecessors, (289), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 10:46:47,921 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 10:46:47,922 INFO L93 Difference]: Finished difference Result 5524 states and 6044 transitions. [2025-03-03 10:46:47,922 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-03 10:46:47,922 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 96.33333333333333) internal successors, (289), 3 states have internal predecessors, (289), 0 states have call successors, (0), 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 497 [2025-03-03 10:46:47,923 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 10:46:47,930 INFO L225 Difference]: With dead ends: 5524 [2025-03-03 10:46:47,931 INFO L226 Difference]: Without dead ends: 3386 [2025-03-03 10:46:47,933 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 10:46:47,934 INFO L435 NwaCegarLoop]: 47 mSDtfsCounter, 74 mSDsluCounter, 3 mSDsCounter, 0 mSdLazyCounter, 423 mSolverCounterSat, 55 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 74 SdHoareTripleChecker+Valid, 50 SdHoareTripleChecker+Invalid, 478 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 55 IncrementalHoareTripleChecker+Valid, 423 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-03-03 10:46:47,934 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [74 Valid, 50 Invalid, 478 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [55 Valid, 423 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-03-03 10:46:47,937 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3386 states. [2025-03-03 10:46:47,966 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3386 to 3386. [2025-03-03 10:46:47,970 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3386 states, 3385 states have (on average 1.0785819793205318) internal successors, (3651), 3385 states have internal predecessors, (3651), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 10:46:47,974 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3386 states to 3386 states and 3651 transitions. [2025-03-03 10:46:47,974 INFO L78 Accepts]: Start accepts. Automaton has 3386 states and 3651 transitions. Word has length 497 [2025-03-03 10:46:47,975 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 10:46:47,975 INFO L471 AbstractCegarLoop]: Abstraction has 3386 states and 3651 transitions. [2025-03-03 10:46:47,975 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 96.33333333333333) internal successors, (289), 3 states have internal predecessors, (289), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 10:46:47,975 INFO L276 IsEmpty]: Start isEmpty. Operand 3386 states and 3651 transitions. [2025-03-03 10:46:47,978 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 529 [2025-03-03 10:46:47,978 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 10:46:47,978 INFO L218 NwaCegarLoop]: trace histogram [6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 10:46:47,978 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-03-03 10:46:47,978 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 10:46:47,979 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 10:46:47,979 INFO L85 PathProgramCache]: Analyzing trace with hash -1300672843, now seen corresponding path program 1 times [2025-03-03 10:46:47,979 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 10:46:47,979 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1515294900] [2025-03-03 10:46:47,979 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 10:46:47,979 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 10:46:48,002 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 528 statements into 1 equivalence classes. [2025-03-03 10:46:48,016 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 528 of 528 statements. [2025-03-03 10:46:48,016 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 10:46:48,016 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 10:46:48,415 INFO L134 CoverageAnalysis]: Checked inductivity of 1129 backedges. 768 proven. 195 refuted. 0 times theorem prover too weak. 166 trivial. 0 not checked. [2025-03-03 10:46:48,416 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 10:46:48,416 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1515294900] [2025-03-03 10:46:48,416 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1515294900] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-03 10:46:48,416 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [883520373] [2025-03-03 10:46:48,416 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 10:46:48,416 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 10:46:48,416 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 10:46:48,418 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-03 10:46:48,419 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2025-03-03 10:46:48,477 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 528 statements into 1 equivalence classes. [2025-03-03 10:46:48,553 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 528 of 528 statements. [2025-03-03 10:46:48,554 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 10:46:48,554 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 10:46:48,556 INFO L256 TraceCheckSpWp]: Trace formula consists of 682 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-03-03 10:46:48,563 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 10:46:48,639 INFO L134 CoverageAnalysis]: Checked inductivity of 1129 backedges. 304 proven. 0 refuted. 0 times theorem prover too weak. 825 trivial. 0 not checked. [2025-03-03 10:46:48,639 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-03 10:46:48,639 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [883520373] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 10:46:48,639 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-03 10:46:48,639 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [5] total 7 [2025-03-03 10:46:48,640 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [772696274] [2025-03-03 10:46:48,640 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 10:46:48,641 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-03 10:46:48,641 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 10:46:48,642 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-03 10:46:48,642 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2025-03-03 10:46:48,642 INFO L87 Difference]: Start difference. First operand 3386 states and 3651 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-03 10:46:49,072 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 10:46:49,073 INFO L93 Difference]: Finished difference Result 7482 states and 8160 transitions. [2025-03-03 10:46:49,073 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-03 10:46:49,073 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 528 [2025-03-03 10:46:49,074 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 10:46:49,083 INFO L225 Difference]: With dead ends: 7482 [2025-03-03 10:46:49,083 INFO L226 Difference]: Without dead ends: 4454 [2025-03-03 10:46:49,086 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 532 GetRequests, 527 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2025-03-03 10:46:49,086 INFO L435 NwaCegarLoop]: 242 mSDtfsCounter, 118 mSDsluCounter, 5 mSDsCounter, 0 mSdLazyCounter, 437 mSolverCounterSat, 46 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 118 SdHoareTripleChecker+Valid, 247 SdHoareTripleChecker+Invalid, 483 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 46 IncrementalHoareTripleChecker+Valid, 437 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-03-03 10:46:49,087 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [118 Valid, 247 Invalid, 483 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [46 Valid, 437 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-03-03 10:46:49,090 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4454 states. [2025-03-03 10:46:49,125 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4454 to 4098. [2025-03-03 10:46:49,129 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4098 states, 4097 states have (on average 1.079326336343666) internal successors, (4422), 4097 states have internal predecessors, (4422), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 10:46:49,138 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4098 states to 4098 states and 4422 transitions. [2025-03-03 10:46:49,138 INFO L78 Accepts]: Start accepts. Automaton has 4098 states and 4422 transitions. Word has length 528 [2025-03-03 10:46:49,138 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 10:46:49,139 INFO L471 AbstractCegarLoop]: Abstraction has 4098 states and 4422 transitions. [2025-03-03 10:46:49,139 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-03 10:46:49,139 INFO L276 IsEmpty]: Start isEmpty. Operand 4098 states and 4422 transitions. [2025-03-03 10:46:49,143 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 602 [2025-03-03 10:46:49,143 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 10:46:49,144 INFO L218 NwaCegarLoop]: trace histogram [6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 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] [2025-03-03 10:46:49,151 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2025-03-03 10:46:49,344 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,SelfDestructingSolverStorable11 [2025-03-03 10:46:49,344 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 10:46:49,345 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 10:46:49,345 INFO L85 PathProgramCache]: Analyzing trace with hash -1452901398, now seen corresponding path program 1 times [2025-03-03 10:46:49,345 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 10:46:49,345 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1101316544] [2025-03-03 10:46:49,345 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 10:46:49,345 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 10:46:49,371 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 601 statements into 1 equivalence classes. [2025-03-03 10:46:49,386 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 601 of 601 statements. [2025-03-03 10:46:49,387 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 10:46:49,387 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 10:46:49,692 INFO L134 CoverageAnalysis]: Checked inductivity of 1313 backedges. 936 proven. 2 refuted. 0 times theorem prover too weak. 375 trivial. 0 not checked. [2025-03-03 10:46:49,692 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 10:46:49,692 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1101316544] [2025-03-03 10:46:49,692 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1101316544] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-03 10:46:49,692 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [549825561] [2025-03-03 10:46:49,692 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 10:46:49,692 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 10:46:49,692 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 10:46:49,695 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-03 10:46:49,698 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2025-03-03 10:46:49,752 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 601 statements into 1 equivalence classes. [2025-03-03 10:46:49,832 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 601 of 601 statements. [2025-03-03 10:46:49,833 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 10:46:49,833 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 10:46:49,836 INFO L256 TraceCheckSpWp]: Trace formula consists of 757 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-03-03 10:46:49,844 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 10:46:49,913 INFO L134 CoverageAnalysis]: Checked inductivity of 1313 backedges. 304 proven. 0 refuted. 0 times theorem prover too weak. 1009 trivial. 0 not checked. [2025-03-03 10:46:49,913 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-03 10:46:49,913 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [549825561] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 10:46:49,913 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-03 10:46:49,913 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [5] total 7 [2025-03-03 10:46:49,913 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2108456409] [2025-03-03 10:46:49,913 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 10:46:49,914 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-03 10:46:49,914 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 10:46:49,914 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-03 10:46:49,914 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2025-03-03 10:46:49,915 INFO L87 Difference]: Start difference. First operand 4098 states and 4422 transitions. Second operand has 3 states, 3 states have (on average 64.33333333333333) internal successors, (193), 3 states have internal predecessors, (193), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 10:46:50,303 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 10:46:50,304 INFO L93 Difference]: Finished difference Result 8372 states and 9111 transitions. [2025-03-03 10:46:50,304 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-03 10:46:50,304 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 64.33333333333333) internal successors, (193), 3 states have internal predecessors, (193), 0 states have call successors, (0), 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 601 [2025-03-03 10:46:50,305 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 10:46:50,319 INFO L225 Difference]: With dead ends: 8372 [2025-03-03 10:46:50,319 INFO L226 Difference]: Without dead ends: 4632 [2025-03-03 10:46:50,322 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 605 GetRequests, 600 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2025-03-03 10:46:50,323 INFO L435 NwaCegarLoop]: 210 mSDtfsCounter, 128 mSDsluCounter, 5 mSDsCounter, 0 mSdLazyCounter, 428 mSolverCounterSat, 54 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 128 SdHoareTripleChecker+Valid, 215 SdHoareTripleChecker+Invalid, 482 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 54 IncrementalHoareTripleChecker+Valid, 428 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-03-03 10:46:50,323 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [128 Valid, 215 Invalid, 482 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [54 Valid, 428 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-03-03 10:46:50,325 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4632 states. [2025-03-03 10:46:50,361 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4632 to 4454. [2025-03-03 10:46:50,366 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4454 states, 4453 states have (on average 1.0790478329216258) internal successors, (4805), 4453 states have internal predecessors, (4805), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 10:46:50,370 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4454 states to 4454 states and 4805 transitions. [2025-03-03 10:46:50,371 INFO L78 Accepts]: Start accepts. Automaton has 4454 states and 4805 transitions. Word has length 601 [2025-03-03 10:46:50,371 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 10:46:50,372 INFO L471 AbstractCegarLoop]: Abstraction has 4454 states and 4805 transitions. [2025-03-03 10:46:50,372 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 64.33333333333333) internal successors, (193), 3 states have internal predecessors, (193), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 10:46:50,372 INFO L276 IsEmpty]: Start isEmpty. Operand 4454 states and 4805 transitions. [2025-03-03 10:46:50,377 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 632 [2025-03-03 10:46:50,377 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 10:46:50,377 INFO L218 NwaCegarLoop]: trace histogram [6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 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] [2025-03-03 10:46:50,383 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0 [2025-03-03 10:46:50,577 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12,7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 10:46:50,578 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 10:46:50,578 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 10:46:50,578 INFO L85 PathProgramCache]: Analyzing trace with hash 1802462581, now seen corresponding path program 1 times [2025-03-03 10:46:50,578 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 10:46:50,578 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1004535549] [2025-03-03 10:46:50,578 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 10:46:50,578 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 10:46:50,605 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 631 statements into 1 equivalence classes. [2025-03-03 10:46:50,618 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 631 of 631 statements. [2025-03-03 10:46:50,618 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 10:46:50,618 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 10:46:50,931 INFO L134 CoverageAnalysis]: Checked inductivity of 1375 backedges. 998 proven. 2 refuted. 0 times theorem prover too weak. 375 trivial. 0 not checked. [2025-03-03 10:46:50,932 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 10:46:50,932 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1004535549] [2025-03-03 10:46:50,932 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1004535549] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-03 10:46:50,932 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [675008403] [2025-03-03 10:46:50,932 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 10:46:50,932 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 10:46:50,932 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 10:46:50,934 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-03 10:46:50,936 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2025-03-03 10:46:50,985 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 631 statements into 1 equivalence classes. [2025-03-03 10:46:51,063 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 631 of 631 statements. [2025-03-03 10:46:51,063 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 10:46:51,063 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 10:46:51,066 INFO L256 TraceCheckSpWp]: Trace formula consists of 788 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-03-03 10:46:51,070 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 10:46:51,132 INFO L134 CoverageAnalysis]: Checked inductivity of 1375 backedges. 304 proven. 0 refuted. 0 times theorem prover too weak. 1071 trivial. 0 not checked. [2025-03-03 10:46:51,132 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-03 10:46:51,132 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [675008403] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 10:46:51,132 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-03 10:46:51,132 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [5] total 7 [2025-03-03 10:46:51,132 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [63686309] [2025-03-03 10:46:51,132 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 10:46:51,133 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-03 10:46:51,133 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 10:46:51,133 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-03 10:46:51,133 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2025-03-03 10:46:51,134 INFO L87 Difference]: Start difference. First operand 4454 states and 4805 transitions. Second operand has 3 states, 3 states have (on average 64.33333333333333) internal successors, (193), 3 states have internal predecessors, (193), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 10:46:51,505 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 10:46:51,505 INFO L93 Difference]: Finished difference Result 9438 states and 10251 transitions. [2025-03-03 10:46:51,505 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-03 10:46:51,506 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 64.33333333333333) internal successors, (193), 3 states have internal predecessors, (193), 0 states have call successors, (0), 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 631 [2025-03-03 10:46:51,506 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 10:46:51,506 INFO L225 Difference]: With dead ends: 9438 [2025-03-03 10:46:51,506 INFO L226 Difference]: Without dead ends: 0 [2025-03-03 10:46:51,511 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 635 GetRequests, 630 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2025-03-03 10:46:51,512 INFO L435 NwaCegarLoop]: 227 mSDtfsCounter, 118 mSDsluCounter, 4 mSDsCounter, 0 mSdLazyCounter, 433 mSolverCounterSat, 45 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 118 SdHoareTripleChecker+Valid, 231 SdHoareTripleChecker+Invalid, 478 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 45 IncrementalHoareTripleChecker+Valid, 433 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-03-03 10:46:51,512 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [118 Valid, 231 Invalid, 478 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [45 Valid, 433 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-03 10:46:51,512 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2025-03-03 10:46:51,512 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2025-03-03 10:46:51,512 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 10:46:51,512 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2025-03-03 10:46:51,512 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 631 [2025-03-03 10:46:51,512 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 10:46:51,512 INFO L471 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2025-03-03 10:46:51,513 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 64.33333333333333) internal successors, (193), 3 states have internal predecessors, (193), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 10:46:51,513 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2025-03-03 10:46:51,513 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2025-03-03 10:46:51,515 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2025-03-03 10:46:51,522 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Ended with exit code 0 [2025-03-03 10:46:51,715 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 10:46:51,718 INFO L422 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 10:46:51,720 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2025-03-03 10:46:52,039 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2025-03-03 10:46:52,052 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 03.03 10:46:52 BoogieIcfgContainer [2025-03-03 10:46:52,052 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2025-03-03 10:46:52,052 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2025-03-03 10:46:52,052 INFO L270 PluginConnector]: Initializing Witness Printer... [2025-03-03 10:46:52,053 INFO L274 PluginConnector]: Witness Printer initialized [2025-03-03 10:46:52,053 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 03.03 10:46:36" (3/4) ... [2025-03-03 10:46:52,055 INFO L146 WitnessPrinter]: Generating witness for correct program [2025-03-03 10:46:52,076 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 11 nodes and edges [2025-03-03 10:46:52,077 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 4 nodes and edges [2025-03-03 10:46:52,077 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 3 nodes and edges [2025-03-03 10:46:52,078 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2025-03-03 10:46:52,168 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2025-03-03 10:46:52,168 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.yml [2025-03-03 10:46:52,168 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2025-03-03 10:46:52,169 INFO L158 Benchmark]: Toolchain (without parser) took 16984.84ms. Allocated memory was 142.6MB in the beginning and 629.1MB in the end (delta: 486.5MB). Free memory was 110.3MB in the beginning and 404.1MB in the end (delta: -293.8MB). Peak memory consumption was 194.0MB. Max. memory is 16.1GB. [2025-03-03 10:46:52,170 INFO L158 Benchmark]: CDTParser took 0.21ms. Allocated memory is still 201.3MB. Free memory is still 123.8MB. There was no memory consumed. Max. memory is 16.1GB. [2025-03-03 10:46:52,170 INFO L158 Benchmark]: CACSL2BoogieTranslator took 437.52ms. Allocated memory is still 142.6MB. Free memory was 110.3MB in the beginning and 78.7MB in the end (delta: 31.6MB). Peak memory consumption was 33.6MB. Max. memory is 16.1GB. [2025-03-03 10:46:52,170 INFO L158 Benchmark]: Boogie Procedure Inliner took 64.08ms. Allocated memory is still 142.6MB. Free memory was 78.7MB in the beginning and 69.3MB in the end (delta: 9.4MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-03-03 10:46:52,170 INFO L158 Benchmark]: Boogie Preprocessor took 93.85ms. Allocated memory is still 142.6MB. Free memory was 69.3MB in the beginning and 58.2MB in the end (delta: 11.0MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-03-03 10:46:52,170 INFO L158 Benchmark]: IcfgBuilder took 977.61ms. Allocated memory is still 142.6MB. Free memory was 58.2MB in the beginning and 70.4MB in the end (delta: -12.1MB). Peak memory consumption was 41.4MB. Max. memory is 16.1GB. [2025-03-03 10:46:52,171 INFO L158 Benchmark]: TraceAbstraction took 15291.15ms. Allocated memory was 142.6MB in the beginning and 629.1MB in the end (delta: 486.5MB). Free memory was 70.4MB in the beginning and 420.5MB in the end (delta: -350.1MB). Peak memory consumption was 135.4MB. Max. memory is 16.1GB. [2025-03-03 10:46:52,171 INFO L158 Benchmark]: Witness Printer took 115.74ms. Allocated memory is still 629.1MB. Free memory was 420.5MB in the beginning and 404.1MB in the end (delta: 16.4MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2025-03-03 10:46:52,174 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.21ms. Allocated memory is still 201.3MB. Free memory is still 123.8MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 437.52ms. Allocated memory is still 142.6MB. Free memory was 110.3MB in the beginning and 78.7MB in the end (delta: 31.6MB). Peak memory consumption was 33.6MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 64.08ms. Allocated memory is still 142.6MB. Free memory was 78.7MB in the beginning and 69.3MB in the end (delta: 9.4MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Boogie Preprocessor took 93.85ms. Allocated memory is still 142.6MB. Free memory was 69.3MB in the beginning and 58.2MB in the end (delta: 11.0MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * IcfgBuilder took 977.61ms. Allocated memory is still 142.6MB. Free memory was 58.2MB in the beginning and 70.4MB in the end (delta: -12.1MB). Peak memory consumption was 41.4MB. Max. memory is 16.1GB. * TraceAbstraction took 15291.15ms. Allocated memory was 142.6MB in the beginning and 629.1MB in the end (delta: 486.5MB). Free memory was 70.4MB in the beginning and 420.5MB in the end (delta: -350.1MB). Peak memory consumption was 135.4MB. Max. memory is 16.1GB. * Witness Printer took 115.74ms. Allocated memory is still 629.1MB. Free memory was 420.5MB in the beginning and 404.1MB in the end (delta: 16.4MB). 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: 203]: 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, 245 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 14.9s, OverallIterations: 14, TraceHistogramMax: 6, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.1s, AutomataDifference: 6.9s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 1895 SdHoareTripleChecker+Valid, 6.3s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 1895 mSDsluCounter, 1597 SdHoareTripleChecker+Invalid, 5.2s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 76 mSDsCounter, 876 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 7368 IncrementalHoareTripleChecker+Invalid, 8244 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 876 mSolverCounterUnsat, 1521 mSDtfsCounter, 7368 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 3023 GetRequests, 2980 SyntacticMatches, 0 SemanticMatches, 43 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 18 ImplicationChecksByTransitivity, 0.2s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=4454occurred in iteration=13, InterpolantAutomatonStates: 45, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.4s AutomataMinimizationTime, 14 MinimizatonAttempts, 2848 StatesRemovedByMinimization, 8 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.2s SsaConstructionTime, 0.7s SatisfiabilityAnalysisTime, 4.6s InterpolantComputationTime, 8004 NumberOfCodeBlocks, 8004 NumberOfCodeBlocksAsserted, 21 NumberOfCheckSat, 7983 ConstructedInterpolants, 0 QuantifiedInterpolants, 28930 SizeOfPredicates, 0 NumberOfNonLiveVariables, 3864 ConjunctsInSsa, 14 ConjunctsInUnsatCore, 21 InterpolantComputations, 14 PerfectInterpolantSequences, 12801/13440 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) && (10 <= a21)) || (((((long long) a12 + 43) <= 0) && (a15 <= 8)) && (10 <= a21))) || ((a24 == 1) && (12 <= a12))) || (((((long long) a12 + 43) <= 0) && (a15 <= 8)) && (a21 == 9))) || ((6 <= a15) && (a24 == 1))) || ((a24 == 1) && (a21 <= 6))) || (((((long long) a12 + 43) <= 0) && (a15 <= 8)) && (a21 <= 6))) || ((a24 == 1) && (a21 == 9))) RESULT: Ultimate proved your program to be correct! [2025-03-03 10:46:52,187 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