./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/eca-rers2012/Problem01_label30.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/Problem01_label30.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 6b291da6da115062c14f66e51226c64b32b538a6c3d52e3544b8930bfb203253 --- Real Ultimate output --- This is Ultimate 0.3.0-?-798a7b3-m [2025-03-03 09:48:09,603 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-03 09:48:09,655 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2025-03-03 09:48:09,660 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-03 09:48:09,661 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-03 09:48:09,680 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-03 09:48:09,682 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-03 09:48:09,682 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-03 09:48:09,682 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-03 09:48:09,682 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-03 09:48:09,683 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-03 09:48:09,683 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-03 09:48:09,683 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-03 09:48:09,683 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-03 09:48:09,684 INFO L153 SettingsManager]: * Use SBE=true [2025-03-03 09:48:09,684 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-03 09:48:09,684 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-03 09:48:09,684 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-03 09:48:09,684 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-03 09:48:09,684 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-03 09:48:09,684 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-03 09:48:09,685 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-03 09:48:09,685 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-03 09:48:09,685 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-03 09:48:09,685 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-03 09:48:09,685 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-03 09:48:09,685 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-03 09:48:09,685 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-03 09:48:09,685 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-03 09:48:09,685 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-03 09:48:09,685 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-03 09:48:09,685 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-03 09:48:09,685 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-03 09:48:09,686 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-03 09:48:09,686 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-03 09:48:09,686 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-03 09:48:09,686 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-03 09:48:09,686 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-03 09:48:09,686 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-03 09:48:09,686 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-03 09:48:09,686 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-03 09:48:09,686 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-03 09:48:09,687 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-03 09:48:09,687 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 -> 6b291da6da115062c14f66e51226c64b32b538a6c3d52e3544b8930bfb203253 [2025-03-03 09:48:09,897 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-03 09:48:09,905 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-03 09:48:09,907 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-03 09:48:09,908 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-03 09:48:09,909 INFO L274 PluginConnector]: CDTParser initialized [2025-03-03 09:48:09,909 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/eca-rers2012/Problem01_label30.c [2025-03-03 09:48:11,007 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/581aa05f2/2d691af202d3444299c55b09ae1a0d0c/FLAG8125bf90d [2025-03-03 09:48:11,253 INFO L384 CDTParser]: Found 1 translation units. [2025-03-03 09:48:11,254 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/eca-rers2012/Problem01_label30.c [2025-03-03 09:48:11,263 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/581aa05f2/2d691af202d3444299c55b09ae1a0d0c/FLAG8125bf90d [2025-03-03 09:48:11,286 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/581aa05f2/2d691af202d3444299c55b09ae1a0d0c [2025-03-03 09:48:11,287 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-03 09:48:11,288 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-03 09:48:11,289 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-03 09:48:11,290 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-03 09:48:11,293 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-03 09:48:11,293 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 03.03 09:48:11" (1/1) ... [2025-03-03 09:48:11,295 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@471a0bcf and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 09:48:11, skipping insertion in model container [2025-03-03 09:48:11,295 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 03.03 09:48:11" (1/1) ... [2025-03-03 09:48:11,322 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-03 09:48:11,550 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/Problem01_label30.c[21088,21101] [2025-03-03 09:48:11,570 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-03 09:48:11,581 INFO L200 MainTranslator]: Completed pre-run [2025-03-03 09:48:11,649 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/Problem01_label30.c[21088,21101] [2025-03-03 09:48:11,652 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-03 09:48:11,661 INFO L204 MainTranslator]: Completed translation [2025-03-03 09:48:11,662 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 09:48:11 WrapperNode [2025-03-03 09:48:11,663 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-03 09:48:11,664 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-03 09:48:11,664 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-03 09:48:11,664 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-03 09:48:11,669 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 09:48:11" (1/1) ... [2025-03-03 09:48:11,682 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 09:48:11" (1/1) ... [2025-03-03 09:48:11,713 INFO L138 Inliner]: procedures = 14, calls = 8, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 655 [2025-03-03 09:48:11,713 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-03 09:48:11,714 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-03 09:48:11,714 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-03 09:48:11,714 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-03 09:48:11,720 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 09:48:11" (1/1) ... [2025-03-03 09:48:11,720 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 09:48:11" (1/1) ... [2025-03-03 09:48:11,727 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 09:48:11" (1/1) ... [2025-03-03 09:48:11,746 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 09:48:11,747 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 09:48:11" (1/1) ... [2025-03-03 09:48:11,747 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 09:48:11" (1/1) ... [2025-03-03 09:48:11,760 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 09:48:11" (1/1) ... [2025-03-03 09:48:11,762 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 09:48:11" (1/1) ... [2025-03-03 09:48:11,763 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 09:48:11" (1/1) ... [2025-03-03 09:48:11,765 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 09:48:11" (1/1) ... [2025-03-03 09:48:11,768 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-03 09:48:11,769 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-03 09:48:11,769 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-03 09:48:11,769 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-03 09:48:11,770 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 09:48:11" (1/1) ... [2025-03-03 09:48:11,778 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-03 09:48:11,787 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 09:48:11,799 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 09:48:11,802 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 09:48:11,819 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-03 09:48:11,820 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-03-03 09:48:11,820 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-03 09:48:11,820 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-03 09:48:11,875 INFO L256 CfgBuilder]: Building ICFG [2025-03-03 09:48:11,876 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-03 09:48:12,556 INFO L? ?]: Removed 75 outVars from TransFormulas that were not future-live. [2025-03-03 09:48:12,556 INFO L307 CfgBuilder]: Performing block encoding [2025-03-03 09:48:12,569 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-03 09:48:12,569 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-03 09:48:12,569 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 03.03 09:48:12 BoogieIcfgContainer [2025-03-03 09:48:12,569 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-03 09:48:12,571 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-03 09:48:12,571 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-03 09:48:12,574 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-03 09:48:12,575 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 03.03 09:48:11" (1/3) ... [2025-03-03 09:48:12,575 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6d05ace8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 03.03 09:48:12, skipping insertion in model container [2025-03-03 09:48:12,575 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 09:48:11" (2/3) ... [2025-03-03 09:48:12,576 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6d05ace8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 03.03 09:48:12, skipping insertion in model container [2025-03-03 09:48:12,576 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 03.03 09:48:12" (3/3) ... [2025-03-03 09:48:12,577 INFO L128 eAbstractionObserver]: Analyzing ICFG Problem01_label30.c [2025-03-03 09:48:12,587 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-03 09:48:12,589 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG Problem01_label30.c that has 1 procedures, 198 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-03-03 09:48:12,636 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-03 09:48:12,646 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;@207b98b7, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-03 09:48:12,646 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-03-03 09:48:12,650 INFO L276 IsEmpty]: Start isEmpty. Operand has 198 states, 196 states have (on average 1.663265306122449) internal successors, (326), 197 states have internal predecessors, (326), 0 states have call successors, (0), 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 09:48:12,656 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 126 [2025-03-03 09:48:12,656 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 09:48:12,657 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 09:48:12,657 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 09:48:12,660 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 09:48:12,661 INFO L85 PathProgramCache]: Analyzing trace with hash 665177902, now seen corresponding path program 1 times [2025-03-03 09:48:12,665 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 09:48:12,666 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [949426937] [2025-03-03 09:48:12,666 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 09:48:12,667 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 09:48:12,762 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 125 statements into 1 equivalence classes. [2025-03-03 09:48:12,834 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 125 of 125 statements. [2025-03-03 09:48:12,838 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 09:48:12,839 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 09:48:13,427 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 09:48:13,428 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 09:48:13,428 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [949426937] [2025-03-03 09:48:13,428 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [949426937] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 09:48:13,428 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 09:48:13,429 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-03 09:48:13,429 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1660366320] [2025-03-03 09:48:13,430 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 09:48:13,432 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-03 09:48:13,432 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 09:48:13,446 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-03 09:48:13,447 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-03 09:48:13,450 INFO L87 Difference]: Start difference. First operand has 198 states, 196 states have (on average 1.663265306122449) internal successors, (326), 197 states have internal predecessors, (326), 0 states have call successors, (0), 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 4 states, 4 states have (on average 31.25) internal successors, (125), 3 states have internal predecessors, (125), 0 states have call successors, (0), 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 09:48:14,334 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 09:48:14,335 INFO L93 Difference]: Finished difference Result 662 states and 1174 transitions. [2025-03-03 09:48:14,336 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-03 09:48:14,337 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 31.25) internal successors, (125), 3 states have internal predecessors, (125), 0 states have call successors, (0), 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 125 [2025-03-03 09:48:14,337 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 09:48:14,345 INFO L225 Difference]: With dead ends: 662 [2025-03-03 09:48:14,345 INFO L226 Difference]: Without dead ends: 397 [2025-03-03 09:48:14,351 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 09:48:14,355 INFO L435 NwaCegarLoop]: 65 mSDtfsCounter, 305 mSDsluCounter, 16 mSDsCounter, 0 mSdLazyCounter, 648 mSolverCounterSat, 237 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 305 SdHoareTripleChecker+Valid, 81 SdHoareTripleChecker+Invalid, 885 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 237 IncrementalHoareTripleChecker+Valid, 648 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2025-03-03 09:48:14,356 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [305 Valid, 81 Invalid, 885 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [237 Valid, 648 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2025-03-03 09:48:14,368 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 397 states. [2025-03-03 09:48:14,400 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 397 to 397. [2025-03-03 09:48:14,401 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 397 states, 396 states have (on average 1.3055555555555556) internal successors, (517), 396 states have internal predecessors, (517), 0 states have call successors, (0), 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 09:48:14,407 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 397 states to 397 states and 517 transitions. [2025-03-03 09:48:14,408 INFO L78 Accepts]: Start accepts. Automaton has 397 states and 517 transitions. Word has length 125 [2025-03-03 09:48:14,409 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 09:48:14,410 INFO L471 AbstractCegarLoop]: Abstraction has 397 states and 517 transitions. [2025-03-03 09:48:14,410 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 31.25) internal successors, (125), 3 states have internal predecessors, (125), 0 states have call successors, (0), 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 09:48:14,411 INFO L276 IsEmpty]: Start isEmpty. Operand 397 states and 517 transitions. [2025-03-03 09:48:14,414 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 133 [2025-03-03 09:48:14,414 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 09:48:14,414 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 09:48:14,414 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-03-03 09:48:14,415 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 09:48:14,417 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 09:48:14,417 INFO L85 PathProgramCache]: Analyzing trace with hash -1649636753, now seen corresponding path program 1 times [2025-03-03 09:48:14,417 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 09:48:14,417 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1374761975] [2025-03-03 09:48:14,417 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 09:48:14,418 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 09:48:14,446 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 132 statements into 1 equivalence classes. [2025-03-03 09:48:14,465 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 132 of 132 statements. [2025-03-03 09:48:14,466 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 09:48:14,466 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 09:48:14,795 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 09:48:14,797 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 09:48:14,797 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1374761975] [2025-03-03 09:48:14,797 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1374761975] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 09:48:14,797 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 09:48:14,797 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-03 09:48:14,797 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1097060477] [2025-03-03 09:48:14,797 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 09:48:14,798 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-03 09:48:14,798 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 09:48:14,799 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-03 09:48:14,800 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-03-03 09:48:14,800 INFO L87 Difference]: Start difference. First operand 397 states and 517 transitions. Second operand has 4 states, 4 states have (on average 33.0) internal successors, (132), 3 states have internal predecessors, (132), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 09:48:15,283 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 09:48:15,284 INFO L93 Difference]: Finished difference Result 887 states and 1235 transitions. [2025-03-03 09:48:15,284 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-03 09:48:15,284 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 33.0) internal successors, (132), 3 states have internal predecessors, (132), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 132 [2025-03-03 09:48:15,285 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 09:48:15,287 INFO L225 Difference]: With dead ends: 887 [2025-03-03 09:48:15,287 INFO L226 Difference]: Without dead ends: 528 [2025-03-03 09:48:15,287 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 09:48:15,288 INFO L435 NwaCegarLoop]: 71 mSDtfsCounter, 128 mSDsluCounter, 10 mSDsCounter, 0 mSdLazyCounter, 526 mSolverCounterSat, 153 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 128 SdHoareTripleChecker+Valid, 81 SdHoareTripleChecker+Invalid, 679 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 153 IncrementalHoareTripleChecker+Valid, 526 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-03-03 09:48:15,288 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [128 Valid, 81 Invalid, 679 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [153 Valid, 526 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-03-03 09:48:15,288 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 528 states. [2025-03-03 09:48:15,305 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 528 to 397. [2025-03-03 09:48:15,306 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 397 states, 396 states have (on average 1.196969696969697) internal successors, (474), 396 states have internal predecessors, (474), 0 states have call successors, (0), 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 09:48:15,307 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 397 states to 397 states and 474 transitions. [2025-03-03 09:48:15,309 INFO L78 Accepts]: Start accepts. Automaton has 397 states and 474 transitions. Word has length 132 [2025-03-03 09:48:15,309 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 09:48:15,309 INFO L471 AbstractCegarLoop]: Abstraction has 397 states and 474 transitions. [2025-03-03 09:48:15,309 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 33.0) internal successors, (132), 3 states have internal predecessors, (132), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 09:48:15,309 INFO L276 IsEmpty]: Start isEmpty. Operand 397 states and 474 transitions. [2025-03-03 09:48:15,311 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 141 [2025-03-03 09:48:15,311 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 09:48:15,311 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 09:48:15,311 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-03-03 09:48:15,311 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 09:48:15,311 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 09:48:15,312 INFO L85 PathProgramCache]: Analyzing trace with hash 1320536572, now seen corresponding path program 1 times [2025-03-03 09:48:15,312 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 09:48:15,312 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [392000864] [2025-03-03 09:48:15,312 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 09:48:15,312 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 09:48:15,330 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 140 statements into 1 equivalence classes. [2025-03-03 09:48:15,336 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 140 of 140 statements. [2025-03-03 09:48:15,337 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 09:48:15,337 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 09:48:15,434 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 17 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 09:48:15,435 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 09:48:15,436 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [392000864] [2025-03-03 09:48:15,436 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [392000864] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 09:48:15,436 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 09:48:15,436 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-03 09:48:15,436 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1592978888] [2025-03-03 09:48:15,436 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 09:48:15,436 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-03 09:48:15,436 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 09:48:15,437 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-03 09:48:15,437 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-03-03 09:48:15,438 INFO L87 Difference]: Start difference. First operand 397 states and 474 transitions. Second operand has 4 states, 4 states have (on average 35.0) internal successors, (140), 3 states have internal predecessors, (140), 0 states have call successors, (0), 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 09:48:15,866 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 09:48:15,866 INFO L93 Difference]: Finished difference Result 1054 states and 1283 transitions. [2025-03-03 09:48:15,867 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-03 09:48:15,867 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 35.0) internal successors, (140), 3 states have internal predecessors, (140), 0 states have call successors, (0), 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 140 [2025-03-03 09:48:15,867 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 09:48:15,869 INFO L225 Difference]: With dead ends: 1054 [2025-03-03 09:48:15,869 INFO L226 Difference]: Without dead ends: 659 [2025-03-03 09:48:15,869 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 09:48:15,870 INFO L435 NwaCegarLoop]: 23 mSDtfsCounter, 382 mSDsluCounter, 9 mSDsCounter, 0 mSdLazyCounter, 454 mSolverCounterSat, 76 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 382 SdHoareTripleChecker+Valid, 32 SdHoareTripleChecker+Invalid, 530 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 76 IncrementalHoareTripleChecker+Valid, 454 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-03-03 09:48:15,870 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [382 Valid, 32 Invalid, 530 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [76 Valid, 454 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-03-03 09:48:15,871 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 659 states. [2025-03-03 09:48:15,880 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 659 to 659. [2025-03-03 09:48:15,881 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 659 states, 658 states have (on average 1.1930091185410334) internal successors, (785), 658 states have internal predecessors, (785), 0 states have call successors, (0), 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 09:48:15,882 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 659 states to 659 states and 785 transitions. [2025-03-03 09:48:15,883 INFO L78 Accepts]: Start accepts. Automaton has 659 states and 785 transitions. Word has length 140 [2025-03-03 09:48:15,883 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 09:48:15,883 INFO L471 AbstractCegarLoop]: Abstraction has 659 states and 785 transitions. [2025-03-03 09:48:15,883 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 35.0) internal successors, (140), 3 states have internal predecessors, (140), 0 states have call successors, (0), 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 09:48:15,883 INFO L276 IsEmpty]: Start isEmpty. Operand 659 states and 785 transitions. [2025-03-03 09:48:15,884 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 150 [2025-03-03 09:48:15,884 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 09:48:15,885 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 3, 3, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 09:48:15,885 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-03-03 09:48:15,885 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 09:48:15,885 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 09:48:15,885 INFO L85 PathProgramCache]: Analyzing trace with hash 242377712, now seen corresponding path program 1 times [2025-03-03 09:48:15,885 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 09:48:15,885 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [902366933] [2025-03-03 09:48:15,885 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 09:48:15,886 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 09:48:15,901 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 149 statements into 1 equivalence classes. [2025-03-03 09:48:15,904 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 149 of 149 statements. [2025-03-03 09:48:15,904 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 09:48:15,904 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 09:48:15,960 INFO L134 CoverageAnalysis]: Checked inductivity of 38 backedges. 27 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2025-03-03 09:48:15,961 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 09:48:15,961 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [902366933] [2025-03-03 09:48:15,961 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [902366933] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 09:48:15,961 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 09:48:15,961 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-03 09:48:15,961 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1945159725] [2025-03-03 09:48:15,961 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 09:48:15,961 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-03 09:48:15,961 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 09:48:15,962 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-03 09:48:15,962 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 09:48:15,962 INFO L87 Difference]: Start difference. First operand 659 states and 785 transitions. Second operand has 3 states, 3 states have (on average 46.333333333333336) internal successors, (139), 3 states have internal predecessors, (139), 0 states have call successors, (0), 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 09:48:16,273 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 09:48:16,273 INFO L93 Difference]: Finished difference Result 1840 states and 2182 transitions. [2025-03-03 09:48:16,274 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-03 09:48:16,274 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 46.333333333333336) internal successors, (139), 3 states have internal predecessors, (139), 0 states have call successors, (0), 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 149 [2025-03-03 09:48:16,274 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 09:48:16,279 INFO L225 Difference]: With dead ends: 1840 [2025-03-03 09:48:16,279 INFO L226 Difference]: Without dead ends: 1183 [2025-03-03 09:48:16,280 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 09:48:16,281 INFO L435 NwaCegarLoop]: 24 mSDtfsCounter, 132 mSDsluCounter, 4 mSDsCounter, 0 mSdLazyCounter, 316 mSolverCounterSat, 47 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 132 SdHoareTripleChecker+Valid, 28 SdHoareTripleChecker+Invalid, 363 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 47 IncrementalHoareTripleChecker+Valid, 316 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-03-03 09:48:16,282 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [132 Valid, 28 Invalid, 363 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [47 Valid, 316 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-03 09:48:16,283 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1183 states. [2025-03-03 09:48:16,305 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1183 to 1052. [2025-03-03 09:48:16,307 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1052 states, 1051 states have (on average 1.1998097050428163) internal successors, (1261), 1051 states have internal predecessors, (1261), 0 states have call successors, (0), 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 09:48:16,311 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1052 states to 1052 states and 1261 transitions. [2025-03-03 09:48:16,312 INFO L78 Accepts]: Start accepts. Automaton has 1052 states and 1261 transitions. Word has length 149 [2025-03-03 09:48:16,312 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 09:48:16,312 INFO L471 AbstractCegarLoop]: Abstraction has 1052 states and 1261 transitions. [2025-03-03 09:48:16,312 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 46.333333333333336) internal successors, (139), 3 states have internal predecessors, (139), 0 states have call successors, (0), 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 09:48:16,313 INFO L276 IsEmpty]: Start isEmpty. Operand 1052 states and 1261 transitions. [2025-03-03 09:48:16,315 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 156 [2025-03-03 09:48:16,315 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 09:48:16,315 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 09:48:16,316 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-03-03 09:48:16,316 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 09:48:16,316 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 09:48:16,316 INFO L85 PathProgramCache]: Analyzing trace with hash 112540193, now seen corresponding path program 1 times [2025-03-03 09:48:16,316 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 09:48:16,317 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [558315330] [2025-03-03 09:48:16,317 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 09:48:16,317 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 09:48:16,346 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 155 statements into 1 equivalence classes. [2025-03-03 09:48:16,351 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 155 of 155 statements. [2025-03-03 09:48:16,354 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 09:48:16,354 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 09:48:16,501 INFO L134 CoverageAnalysis]: Checked inductivity of 46 backedges. 43 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-03-03 09:48:16,501 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 09:48:16,501 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [558315330] [2025-03-03 09:48:16,501 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [558315330] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 09:48:16,501 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 09:48:16,501 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-03 09:48:16,501 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [540591511] [2025-03-03 09:48:16,501 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 09:48:16,502 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-03 09:48:16,502 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 09:48:16,502 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-03 09:48:16,503 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 09:48:16,503 INFO L87 Difference]: Start difference. First operand 1052 states and 1261 transitions. Second operand has 3 states, 3 states have (on average 51.0) internal successors, (153), 3 states have internal predecessors, (153), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 09:48:16,805 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 09:48:16,805 INFO L93 Difference]: Finished difference Result 2364 states and 2813 transitions. [2025-03-03 09:48:16,805 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-03 09:48:16,806 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 51.0) internal successors, (153), 3 states have internal predecessors, (153), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 155 [2025-03-03 09:48:16,806 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 09:48:16,809 INFO L225 Difference]: With dead ends: 2364 [2025-03-03 09:48:16,809 INFO L226 Difference]: Without dead ends: 1314 [2025-03-03 09:48:16,811 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 09:48:16,812 INFO L435 NwaCegarLoop]: 185 mSDtfsCounter, 121 mSDsluCounter, 6 mSDsCounter, 0 mSdLazyCounter, 331 mSolverCounterSat, 32 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 121 SdHoareTripleChecker+Valid, 191 SdHoareTripleChecker+Invalid, 363 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 32 IncrementalHoareTripleChecker+Valid, 331 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-03-03 09:48:16,812 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [121 Valid, 191 Invalid, 363 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [32 Valid, 331 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-03 09:48:16,813 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1314 states. [2025-03-03 09:48:16,825 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1314 to 1183. [2025-03-03 09:48:16,827 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1183 states, 1182 states have (on average 1.1598984771573604) internal successors, (1371), 1182 states have internal predecessors, (1371), 0 states have call successors, (0), 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 09:48:16,829 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1183 states to 1183 states and 1371 transitions. [2025-03-03 09:48:16,830 INFO L78 Accepts]: Start accepts. Automaton has 1183 states and 1371 transitions. Word has length 155 [2025-03-03 09:48:16,830 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 09:48:16,830 INFO L471 AbstractCegarLoop]: Abstraction has 1183 states and 1371 transitions. [2025-03-03 09:48:16,830 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 51.0) internal successors, (153), 3 states have internal predecessors, (153), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 09:48:16,830 INFO L276 IsEmpty]: Start isEmpty. Operand 1183 states and 1371 transitions. [2025-03-03 09:48:16,832 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 170 [2025-03-03 09:48:16,832 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 09:48:16,832 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 09:48:16,832 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-03-03 09:48:16,832 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 09:48:16,833 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 09:48:16,833 INFO L85 PathProgramCache]: Analyzing trace with hash -1598044354, now seen corresponding path program 1 times [2025-03-03 09:48:16,833 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 09:48:16,833 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [342004006] [2025-03-03 09:48:16,833 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 09:48:16,833 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 09:48:16,848 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 169 statements into 1 equivalence classes. [2025-03-03 09:48:16,852 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 169 of 169 statements. [2025-03-03 09:48:16,853 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 09:48:16,853 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 09:48:16,978 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 09:48:16,979 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 09:48:16,979 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [342004006] [2025-03-03 09:48:16,979 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [342004006] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 09:48:16,979 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 09:48:16,979 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-03 09:48:16,979 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [699251122] [2025-03-03 09:48:16,979 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 09:48:16,982 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-03 09:48:16,982 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 09:48:16,983 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-03 09:48:16,983 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-03-03 09:48:16,983 INFO L87 Difference]: Start difference. First operand 1183 states and 1371 transitions. Second operand has 4 states, 4 states have (on average 42.25) internal successors, (169), 4 states have internal predecessors, (169), 0 states have call successors, (0), 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 09:48:17,456 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 09:48:17,457 INFO L93 Difference]: Finished difference Result 2757 states and 3174 transitions. [2025-03-03 09:48:17,457 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-03 09:48:17,457 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 42.25) internal successors, (169), 4 states have internal predecessors, (169), 0 states have call successors, (0), 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 169 [2025-03-03 09:48:17,457 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 09:48:17,461 INFO L225 Difference]: With dead ends: 2757 [2025-03-03 09:48:17,461 INFO L226 Difference]: Without dead ends: 1445 [2025-03-03 09:48:17,462 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-03-03 09:48:17,463 INFO L435 NwaCegarLoop]: 30 mSDtfsCounter, 250 mSDsluCounter, 10 mSDsCounter, 0 mSdLazyCounter, 580 mSolverCounterSat, 70 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 250 SdHoareTripleChecker+Valid, 40 SdHoareTripleChecker+Invalid, 650 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 70 IncrementalHoareTripleChecker+Valid, 580 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-03-03 09:48:17,463 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [250 Valid, 40 Invalid, 650 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [70 Valid, 580 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-03-03 09:48:17,465 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1445 states. [2025-03-03 09:48:17,479 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1445 to 1445. [2025-03-03 09:48:17,480 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1445 states, 1444 states have (on average 1.1350415512465375) internal successors, (1639), 1444 states have internal predecessors, (1639), 0 states have call successors, (0), 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 09:48:17,483 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1445 states to 1445 states and 1639 transitions. [2025-03-03 09:48:17,483 INFO L78 Accepts]: Start accepts. Automaton has 1445 states and 1639 transitions. Word has length 169 [2025-03-03 09:48:17,483 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 09:48:17,483 INFO L471 AbstractCegarLoop]: Abstraction has 1445 states and 1639 transitions. [2025-03-03 09:48:17,483 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 42.25) internal successors, (169), 4 states have internal predecessors, (169), 0 states have call successors, (0), 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 09:48:17,484 INFO L276 IsEmpty]: Start isEmpty. Operand 1445 states and 1639 transitions. [2025-03-03 09:48:17,486 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 173 [2025-03-03 09:48:17,486 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 09:48:17,486 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 09:48:17,486 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-03-03 09:48:17,486 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 09:48:17,487 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 09:48:17,487 INFO L85 PathProgramCache]: Analyzing trace with hash 347919289, now seen corresponding path program 1 times [2025-03-03 09:48:17,487 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 09:48:17,487 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [801224637] [2025-03-03 09:48:17,488 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 09:48:17,488 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 09:48:17,503 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 172 statements into 1 equivalence classes. [2025-03-03 09:48:17,508 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 172 of 172 statements. [2025-03-03 09:48:17,508 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 09:48:17,508 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 09:48:17,616 INFO L134 CoverageAnalysis]: Checked inductivity of 63 backedges. 60 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-03-03 09:48:17,616 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 09:48:17,616 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [801224637] [2025-03-03 09:48:17,616 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [801224637] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 09:48:17,617 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 09:48:17,617 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-03 09:48:17,617 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1880240591] [2025-03-03 09:48:17,617 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 09:48:17,617 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-03 09:48:17,617 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 09:48:17,618 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-03 09:48:17,618 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 09:48:17,618 INFO L87 Difference]: Start difference. First operand 1445 states and 1639 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 09:48:17,890 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 09:48:17,890 INFO L93 Difference]: Finished difference Result 3281 states and 3750 transitions. [2025-03-03 09:48:17,890 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-03 09:48:17,891 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 172 [2025-03-03 09:48:17,891 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 09:48:17,896 INFO L225 Difference]: With dead ends: 3281 [2025-03-03 09:48:17,896 INFO L226 Difference]: Without dead ends: 1838 [2025-03-03 09:48:17,897 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 09:48:17,898 INFO L435 NwaCegarLoop]: 24 mSDtfsCounter, 133 mSDsluCounter, 4 mSDsCounter, 0 mSdLazyCounter, 310 mSolverCounterSat, 33 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 133 SdHoareTripleChecker+Valid, 28 SdHoareTripleChecker+Invalid, 343 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 33 IncrementalHoareTripleChecker+Valid, 310 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-03 09:48:17,898 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [133 Valid, 28 Invalid, 343 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [33 Valid, 310 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-03 09:48:17,901 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1838 states. [2025-03-03 09:48:17,917 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1838 to 1707. [2025-03-03 09:48:17,919 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1707 states, 1706 states have (on average 1.1383352872215708) internal successors, (1942), 1706 states have internal predecessors, (1942), 0 states have call successors, (0), 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 09:48:17,922 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1707 states to 1707 states and 1942 transitions. [2025-03-03 09:48:17,923 INFO L78 Accepts]: Start accepts. Automaton has 1707 states and 1942 transitions. Word has length 172 [2025-03-03 09:48:17,924 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 09:48:17,924 INFO L471 AbstractCegarLoop]: Abstraction has 1707 states and 1942 transitions. [2025-03-03 09:48:17,924 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 09:48:17,924 INFO L276 IsEmpty]: Start isEmpty. Operand 1707 states and 1942 transitions. [2025-03-03 09:48:17,926 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 226 [2025-03-03 09:48:17,926 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 09:48:17,927 INFO L218 NwaCegarLoop]: trace histogram [6, 6, 5, 5, 5, 5, 5, 5, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 09:48:17,927 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-03-03 09:48:17,927 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 09:48:17,928 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 09:48:17,928 INFO L85 PathProgramCache]: Analyzing trace with hash -1819814147, now seen corresponding path program 1 times [2025-03-03 09:48:17,928 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 09:48:17,928 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1344782779] [2025-03-03 09:48:17,928 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 09:48:17,928 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 09:48:17,949 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 225 statements into 1 equivalence classes. [2025-03-03 09:48:17,954 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 225 of 225 statements. [2025-03-03 09:48:17,954 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 09:48:17,954 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 09:48:18,128 INFO L134 CoverageAnalysis]: Checked inductivity of 189 backedges. 93 proven. 0 refuted. 0 times theorem prover too weak. 96 trivial. 0 not checked. [2025-03-03 09:48:18,128 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 09:48:18,128 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1344782779] [2025-03-03 09:48:18,128 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1344782779] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 09:48:18,128 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 09:48:18,128 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-03 09:48:18,128 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1240791960] [2025-03-03 09:48:18,129 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 09:48:18,129 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-03 09:48:18,129 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 09:48:18,129 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-03 09:48:18,129 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-03-03 09:48:18,130 INFO L87 Difference]: Start difference. First operand 1707 states and 1942 transitions. Second operand has 4 states, 4 states have (on average 40.25) internal successors, (161), 3 states have internal predecessors, (161), 0 states have call successors, (0), 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 09:48:18,577 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 09:48:18,577 INFO L93 Difference]: Finished difference Result 3412 states and 3882 transitions. [2025-03-03 09:48:18,577 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-03 09:48:18,578 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 40.25) internal successors, (161), 3 states have internal predecessors, (161), 0 states have call successors, (0), 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 225 [2025-03-03 09:48:18,578 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 09:48:18,581 INFO L225 Difference]: With dead ends: 3412 [2025-03-03 09:48:18,581 INFO L226 Difference]: Without dead ends: 1707 [2025-03-03 09:48:18,583 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 09:48:18,583 INFO L435 NwaCegarLoop]: 32 mSDtfsCounter, 239 mSDsluCounter, 12 mSDsCounter, 0 mSdLazyCounter, 623 mSolverCounterSat, 27 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 239 SdHoareTripleChecker+Valid, 44 SdHoareTripleChecker+Invalid, 650 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 27 IncrementalHoareTripleChecker+Valid, 623 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-03-03 09:48:18,584 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [239 Valid, 44 Invalid, 650 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [27 Valid, 623 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-03-03 09:48:18,585 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1707 states. [2025-03-03 09:48:18,600 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1707 to 1707. [2025-03-03 09:48:18,602 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1707 states, 1706 states have (on average 1.1313012895662369) internal successors, (1930), 1706 states have internal predecessors, (1930), 0 states have call successors, (0), 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 09:48:18,605 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1707 states to 1707 states and 1930 transitions. [2025-03-03 09:48:18,605 INFO L78 Accepts]: Start accepts. Automaton has 1707 states and 1930 transitions. Word has length 225 [2025-03-03 09:48:18,605 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 09:48:18,605 INFO L471 AbstractCegarLoop]: Abstraction has 1707 states and 1930 transitions. [2025-03-03 09:48:18,606 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 40.25) internal successors, (161), 3 states have internal predecessors, (161), 0 states have call successors, (0), 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 09:48:18,606 INFO L276 IsEmpty]: Start isEmpty. Operand 1707 states and 1930 transitions. [2025-03-03 09:48:18,608 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 252 [2025-03-03 09:48:18,608 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 09:48:18,608 INFO L218 NwaCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 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, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 09:48:18,608 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-03-03 09:48:18,609 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 09:48:18,609 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 09:48:18,609 INFO L85 PathProgramCache]: Analyzing trace with hash 943546773, now seen corresponding path program 1 times [2025-03-03 09:48:18,609 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 09:48:18,609 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [240420254] [2025-03-03 09:48:18,609 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 09:48:18,609 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 09:48:18,628 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 251 statements into 1 equivalence classes. [2025-03-03 09:48:18,661 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 251 of 251 statements. [2025-03-03 09:48:18,661 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 09:48:18,661 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 09:48:18,754 INFO L134 CoverageAnalysis]: Checked inductivity of 218 backedges. 125 proven. 0 refuted. 0 times theorem prover too weak. 93 trivial. 0 not checked. [2025-03-03 09:48:18,754 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 09:48:18,754 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [240420254] [2025-03-03 09:48:18,754 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [240420254] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 09:48:18,754 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 09:48:18,755 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-03 09:48:18,755 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [455381496] [2025-03-03 09:48:18,755 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 09:48:18,755 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-03 09:48:18,755 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 09:48:18,756 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-03 09:48:18,756 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 09:48:18,756 INFO L87 Difference]: Start difference. First operand 1707 states and 1930 transitions. Second operand has 3 states, 3 states have (on average 62.666666666666664) internal successors, (188), 3 states have internal predecessors, (188), 0 states have call successors, (0), 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 09:48:19,055 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 09:48:19,055 INFO L93 Difference]: Finished difference Result 3805 states and 4307 transitions. [2025-03-03 09:48:19,055 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-03 09:48:19,056 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 62.666666666666664) internal successors, (188), 3 states have internal predecessors, (188), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 251 [2025-03-03 09:48:19,056 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 09:48:19,060 INFO L225 Difference]: With dead ends: 3805 [2025-03-03 09:48:19,060 INFO L226 Difference]: Without dead ends: 1838 [2025-03-03 09:48:19,062 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 09:48:19,063 INFO L435 NwaCegarLoop]: 172 mSDtfsCounter, 12 mSDsluCounter, 6 mSDsCounter, 0 mSdLazyCounter, 317 mSolverCounterSat, 30 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 12 SdHoareTripleChecker+Valid, 178 SdHoareTripleChecker+Invalid, 347 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 30 IncrementalHoareTripleChecker+Valid, 317 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-03-03 09:48:19,064 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [12 Valid, 178 Invalid, 347 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [30 Valid, 317 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-03 09:48:19,065 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1838 states. [2025-03-03 09:48:19,083 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1838 to 1707. [2025-03-03 09:48:19,084 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1707 states, 1706 states have (on average 1.1090269636576788) internal successors, (1892), 1706 states have internal predecessors, (1892), 0 states have call successors, (0), 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 09:48:19,088 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1707 states to 1707 states and 1892 transitions. [2025-03-03 09:48:19,088 INFO L78 Accepts]: Start accepts. Automaton has 1707 states and 1892 transitions. Word has length 251 [2025-03-03 09:48:19,089 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 09:48:19,089 INFO L471 AbstractCegarLoop]: Abstraction has 1707 states and 1892 transitions. [2025-03-03 09:48:19,089 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 62.666666666666664) internal successors, (188), 3 states have internal predecessors, (188), 0 states have call successors, (0), 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 09:48:19,089 INFO L276 IsEmpty]: Start isEmpty. Operand 1707 states and 1892 transitions. [2025-03-03 09:48:19,092 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 268 [2025-03-03 09:48:19,092 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 09:48:19,092 INFO L218 NwaCegarLoop]: trace histogram [6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 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, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 09:48:19,092 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-03-03 09:48:19,092 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 09:48:19,093 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 09:48:19,093 INFO L85 PathProgramCache]: Analyzing trace with hash -566087216, now seen corresponding path program 1 times [2025-03-03 09:48:19,093 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 09:48:19,093 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1782083330] [2025-03-03 09:48:19,093 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 09:48:19,093 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 09:48:19,119 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 267 statements into 1 equivalence classes. [2025-03-03 09:48:19,130 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 267 of 267 statements. [2025-03-03 09:48:19,130 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 09:48:19,130 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 09:48:19,515 INFO L134 CoverageAnalysis]: Checked inductivity of 285 backedges. 175 proven. 83 refuted. 0 times theorem prover too weak. 27 trivial. 0 not checked. [2025-03-03 09:48:19,516 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 09:48:19,516 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1782083330] [2025-03-03 09:48:19,516 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1782083330] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-03 09:48:19,516 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1524963002] [2025-03-03 09:48:19,516 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 09:48:19,517 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 09:48:19,517 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 09:48:19,518 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 09:48:19,520 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 09:48:19,575 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 267 statements into 1 equivalence classes. [2025-03-03 09:48:19,626 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 267 of 267 statements. [2025-03-03 09:48:19,627 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 09:48:19,627 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 09:48:19,630 INFO L256 TraceCheckSpWp]: Trace formula consists of 482 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-03-03 09:48:19,638 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 09:48:19,777 INFO L134 CoverageAnalysis]: Checked inductivity of 285 backedges. 141 proven. 0 refuted. 0 times theorem prover too weak. 144 trivial. 0 not checked. [2025-03-03 09:48:19,778 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-03 09:48:19,778 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1524963002] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 09:48:19,778 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-03 09:48:19,778 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [5] total 7 [2025-03-03 09:48:19,778 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1545643785] [2025-03-03 09:48:19,778 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 09:48:19,779 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-03 09:48:19,779 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 09:48:19,779 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-03 09:48:19,779 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=26, Unknown=0, NotChecked=0, Total=42 [2025-03-03 09:48:19,779 INFO L87 Difference]: Start difference. First operand 1707 states and 1892 transitions. Second operand has 3 states, 3 states have (on average 63.0) internal successors, (189), 3 states have internal predecessors, (189), 0 states have call successors, (0), 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 09:48:20,075 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 09:48:20,075 INFO L93 Difference]: Finished difference Result 3410 states and 3798 transitions. [2025-03-03 09:48:20,075 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-03 09:48:20,076 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 63.0) internal successors, (189), 3 states have internal predecessors, (189), 0 states have call successors, (0), 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 267 [2025-03-03 09:48:20,076 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 09:48:20,076 INFO L225 Difference]: With dead ends: 3410 [2025-03-03 09:48:20,076 INFO L226 Difference]: Without dead ends: 0 [2025-03-03 09:48:20,078 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 272 GetRequests, 267 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=16, Invalid=26, Unknown=0, NotChecked=0, Total=42 [2025-03-03 09:48:20,079 INFO L435 NwaCegarLoop]: 155 mSDtfsCounter, 12 mSDsluCounter, 5 mSDsCounter, 0 mSdLazyCounter, 303 mSolverCounterSat, 41 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 12 SdHoareTripleChecker+Valid, 160 SdHoareTripleChecker+Invalid, 344 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 41 IncrementalHoareTripleChecker+Valid, 303 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-03-03 09:48:20,079 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [12 Valid, 160 Invalid, 344 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [41 Valid, 303 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-03 09:48:20,079 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2025-03-03 09:48:20,079 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2025-03-03 09:48:20,079 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 09:48:20,080 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2025-03-03 09:48:20,080 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 267 [2025-03-03 09:48:20,080 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 09:48:20,080 INFO L471 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2025-03-03 09:48:20,080 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 63.0) internal successors, (189), 3 states have internal predecessors, (189), 0 states have call successors, (0), 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 09:48:20,080 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2025-03-03 09:48:20,080 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2025-03-03 09:48:20,082 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2025-03-03 09:48:20,089 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 09:48:20,287 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable9 [2025-03-03 09:48:20,290 INFO L422 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 09:48:20,291 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2025-03-03 09:48:20,426 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2025-03-03 09:48:20,436 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 03.03 09:48:20 BoogieIcfgContainer [2025-03-03 09:48:20,436 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2025-03-03 09:48:20,437 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2025-03-03 09:48:20,437 INFO L270 PluginConnector]: Initializing Witness Printer... [2025-03-03 09:48:20,437 INFO L274 PluginConnector]: Witness Printer initialized [2025-03-03 09:48:20,438 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 03.03 09:48:12" (3/4) ... [2025-03-03 09:48:20,439 INFO L146 WitnessPrinter]: Generating witness for correct program [2025-03-03 09:48:20,455 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 11 nodes and edges [2025-03-03 09:48:20,456 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 4 nodes and edges [2025-03-03 09:48:20,457 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 3 nodes and edges [2025-03-03 09:48:20,457 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2025-03-03 09:48:20,552 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2025-03-03 09:48:20,552 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.yml [2025-03-03 09:48:20,552 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2025-03-03 09:48:20,553 INFO L158 Benchmark]: Toolchain (without parser) took 9264.21ms. Allocated memory was 142.6MB in the beginning and 385.9MB in the end (delta: 243.3MB). Free memory was 104.2MB in the beginning and 198.3MB in the end (delta: -94.1MB). Peak memory consumption was 147.1MB. Max. memory is 16.1GB. [2025-03-03 09:48:20,553 INFO L158 Benchmark]: CDTParser took 1.03ms. Allocated memory is still 201.3MB. Free memory is still 127.3MB. There was no memory consumed. Max. memory is 16.1GB. [2025-03-03 09:48:20,553 INFO L158 Benchmark]: CACSL2BoogieTranslator took 374.49ms. Allocated memory is still 142.6MB. Free memory was 104.2MB in the beginning and 78.0MB in the end (delta: 26.2MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB. [2025-03-03 09:48:20,553 INFO L158 Benchmark]: Boogie Procedure Inliner took 49.15ms. Allocated memory is still 142.6MB. Free memory was 78.0MB in the beginning and 72.7MB in the end (delta: 5.3MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-03-03 09:48:20,553 INFO L158 Benchmark]: Boogie Preprocessor took 54.27ms. Allocated memory is still 142.6MB. Free memory was 72.7MB in the beginning and 68.6MB in the end (delta: 4.1MB). There was no memory consumed. Max. memory is 16.1GB. [2025-03-03 09:48:20,554 INFO L158 Benchmark]: IcfgBuilder took 800.91ms. Allocated memory is still 142.6MB. Free memory was 68.6MB in the beginning and 52.2MB in the end (delta: 16.5MB). Peak memory consumption was 50.0MB. Max. memory is 16.1GB. [2025-03-03 09:48:20,554 INFO L158 Benchmark]: TraceAbstraction took 7865.37ms. Allocated memory was 142.6MB in the beginning and 385.9MB in the end (delta: 243.3MB). Free memory was 52.0MB in the beginning and 210.6MB in the end (delta: -158.6MB). Peak memory consumption was 88.7MB. Max. memory is 16.1GB. [2025-03-03 09:48:20,555 INFO L158 Benchmark]: Witness Printer took 115.09ms. Allocated memory is still 385.9MB. Free memory was 210.6MB in the beginning and 198.3MB in the end (delta: 12.3MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-03-03 09:48:20,556 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 1.03ms. Allocated memory is still 201.3MB. Free memory is still 127.3MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 374.49ms. Allocated memory is still 142.6MB. Free memory was 104.2MB in the beginning and 78.0MB in the end (delta: 26.2MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 49.15ms. Allocated memory is still 142.6MB. Free memory was 78.0MB in the beginning and 72.7MB in the end (delta: 5.3MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Boogie Preprocessor took 54.27ms. Allocated memory is still 142.6MB. Free memory was 72.7MB in the beginning and 68.6MB in the end (delta: 4.1MB). There was no memory consumed. Max. memory is 16.1GB. * IcfgBuilder took 800.91ms. Allocated memory is still 142.6MB. Free memory was 68.6MB in the beginning and 52.2MB in the end (delta: 16.5MB). Peak memory consumption was 50.0MB. Max. memory is 16.1GB. * TraceAbstraction took 7865.37ms. Allocated memory was 142.6MB in the beginning and 385.9MB in the end (delta: 243.3MB). Free memory was 52.0MB in the beginning and 210.6MB in the end (delta: -158.6MB). Peak memory consumption was 88.7MB. Max. memory is 16.1GB. * Witness Printer took 115.09ms. Allocated memory is still 385.9MB. Free memory was 210.6MB in the beginning and 198.3MB in the end (delta: 12.3MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - PositiveResult [Line: 561]: 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, 198 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 7.7s, OverallIterations: 10, TraceHistogramMax: 6, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 4.3s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 1714 SdHoareTripleChecker+Valid, 3.9s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 1714 mSDsluCounter, 863 SdHoareTripleChecker+Invalid, 3.2s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 82 mSDsCounter, 746 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 4408 IncrementalHoareTripleChecker+Invalid, 5154 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 746 mSolverCounterUnsat, 781 mSDtfsCounter, 4408 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 301 GetRequests, 281 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=1707occurred in iteration=7, InterpolantAutomatonStates: 36, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.2s AutomataMinimizationTime, 10 MinimizatonAttempts, 655 StatesRemovedByMinimization, 5 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 2.2s InterpolantComputationTime, 2052 NumberOfCodeBlocks, 2052 NumberOfCodeBlocksAsserted, 11 NumberOfCheckSat, 2041 ConstructedInterpolants, 0 QuantifiedInterpolants, 9267 SizeOfPredicates, 0 NumberOfNonLiveVariables, 482 ConjunctsInSsa, 2 ConjunctsInUnsatCore, 11 InterpolantComputations, 10 PerfectInterpolantSequences, 1124/1207 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: 593]: Location Invariant Derived location invariant: ((((((a7 != 1) && (a17 <= 0)) || ((a8 <= 13) && (a16 <= 5))) || ((a17 <= 0) && (a16 <= 5))) || (((a8 <= 13) && (a17 <= 0)) && (a20 == 1))) || ((a7 != 1) && (a17 == 1))) RESULT: Ultimate proved your program to be correct! [2025-03-03 09:48:20,569 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Result: TRUE