./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/eca-rers2012/Problem10_label23.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version c00e63dc Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/eca-rers2012/Problem10_label23.c -s /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate-jdk21/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 f668bcf95cb3f7c5766f9dcc6b0650136e6fca9e506098f3960957e6cecfca84 --- Real Ultimate output --- This is Ultimate 0.3.0-?-c00e63d-m [2025-02-05 11:30:02,722 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-02-05 11:30:02,797 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2025-02-05 11:30:02,804 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-02-05 11:30:02,805 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-02-05 11:30:02,829 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-02-05 11:30:02,831 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-02-05 11:30:02,831 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-02-05 11:30:02,832 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-02-05 11:30:02,832 INFO L153 SettingsManager]: * Use memory slicer=true [2025-02-05 11:30:02,832 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-02-05 11:30:02,833 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-02-05 11:30:02,833 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-02-05 11:30:02,833 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-02-05 11:30:02,834 INFO L153 SettingsManager]: * Use SBE=true [2025-02-05 11:30:02,834 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-02-05 11:30:02,834 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-02-05 11:30:02,834 INFO L153 SettingsManager]: * sizeof long=4 [2025-02-05 11:30:02,834 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-02-05 11:30:02,834 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-02-05 11:30:02,834 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-02-05 11:30:02,834 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-02-05 11:30:02,834 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-02-05 11:30:02,834 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-02-05 11:30:02,834 INFO L153 SettingsManager]: * sizeof long double=12 [2025-02-05 11:30:02,834 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-02-05 11:30:02,834 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-02-05 11:30:02,834 INFO L153 SettingsManager]: * Use constant arrays=true [2025-02-05 11:30:02,835 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-02-05 11:30:02,835 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-02-05 11:30:02,835 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-02-05 11:30:02,835 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-02-05 11:30:02,835 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-05 11:30:02,835 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-02-05 11:30:02,835 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-02-05 11:30:02,835 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-02-05 11:30:02,835 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-02-05 11:30:02,835 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-02-05 11:30:02,835 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-02-05 11:30:02,835 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-02-05 11:30:02,835 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-02-05 11:30:02,835 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-02-05 11:30:02,835 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-02-05 11:30:02,835 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-jdk21/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 -> f668bcf95cb3f7c5766f9dcc6b0650136e6fca9e506098f3960957e6cecfca84 [2025-02-05 11:30:03,106 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-02-05 11:30:03,119 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-02-05 11:30:03,121 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-02-05 11:30:03,123 INFO L270 PluginConnector]: Initializing CDTParser... [2025-02-05 11:30:03,123 INFO L274 PluginConnector]: CDTParser initialized [2025-02-05 11:30:03,124 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/eca-rers2012/Problem10_label23.c [2025-02-05 11:30:04,433 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/5f50702f6/3974be3c1a644361b641254b2adb64fa/FLAGe54dc056e [2025-02-05 11:30:04,752 INFO L384 CDTParser]: Found 1 translation units. [2025-02-05 11:30:04,757 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/eca-rers2012/Problem10_label23.c [2025-02-05 11:30:04,782 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/5f50702f6/3974be3c1a644361b641254b2adb64fa/FLAGe54dc056e [2025-02-05 11:30:05,003 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/5f50702f6/3974be3c1a644361b641254b2adb64fa [2025-02-05 11:30:05,005 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-02-05 11:30:05,006 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-02-05 11:30:05,007 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-02-05 11:30:05,007 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-02-05 11:30:05,010 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-02-05 11:30:05,011 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 05.02 11:30:05" (1/1) ... [2025-02-05 11:30:05,011 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@1b96a6dc and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 11:30:05, skipping insertion in model container [2025-02-05 11:30:05,011 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 05.02 11:30:05" (1/1) ... [2025-02-05 11:30:05,054 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-02-05 11:30:05,216 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/eca-rers2012/Problem10_label23.c[5328,5341] [2025-02-05 11:30:05,315 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-05 11:30:05,330 INFO L200 MainTranslator]: Completed pre-run [2025-02-05 11:30:05,358 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/eca-rers2012/Problem10_label23.c[5328,5341] [2025-02-05 11:30:05,418 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-05 11:30:05,431 INFO L204 MainTranslator]: Completed translation [2025-02-05 11:30:05,433 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 11:30:05 WrapperNode [2025-02-05 11:30:05,433 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-02-05 11:30:05,434 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-02-05 11:30:05,434 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-02-05 11:30:05,434 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-02-05 11:30:05,439 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 11:30:05" (1/1) ... [2025-02-05 11:30:05,455 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 11:30:05" (1/1) ... [2025-02-05 11:30:05,526 INFO L138 Inliner]: procedures = 14, calls = 8, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 595 [2025-02-05 11:30:05,527 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-02-05 11:30:05,527 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-02-05 11:30:05,527 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-02-05 11:30:05,528 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-02-05 11:30:05,536 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 11:30:05" (1/1) ... [2025-02-05 11:30:05,536 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 11:30:05" (1/1) ... [2025-02-05 11:30:05,545 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 11:30:05" (1/1) ... [2025-02-05 11:30:05,588 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-02-05 11:30:05,589 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 11:30:05" (1/1) ... [2025-02-05 11:30:05,589 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 11:30:05" (1/1) ... [2025-02-05 11:30:05,615 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 11:30:05" (1/1) ... [2025-02-05 11:30:05,620 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 11:30:05" (1/1) ... [2025-02-05 11:30:05,630 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 11:30:05" (1/1) ... [2025-02-05 11:30:05,635 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 11:30:05" (1/1) ... [2025-02-05 11:30:05,646 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-02-05 11:30:05,647 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-02-05 11:30:05,648 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-02-05 11:30:05,648 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-02-05 11:30:05,649 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 11:30:05" (1/1) ... [2025-02-05 11:30:05,656 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-05 11:30:05,669 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-05 11:30:05,684 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-02-05 11:30:05,688 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-02-05 11:30:05,714 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-02-05 11:30:05,714 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-02-05 11:30:05,714 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-02-05 11:30:05,714 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-02-05 11:30:05,773 INFO L257 CfgBuilder]: Building ICFG [2025-02-05 11:30:05,775 INFO L287 CfgBuilder]: Building CFG for each procedure with an implementation [2025-02-05 11:30:06,882 INFO L? ?]: Removed 84 outVars from TransFormulas that were not future-live. [2025-02-05 11:30:06,882 INFO L308 CfgBuilder]: Performing block encoding [2025-02-05 11:30:06,900 INFO L332 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-02-05 11:30:06,901 INFO L337 CfgBuilder]: Removed 0 assume(true) statements. [2025-02-05 11:30:06,901 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 05.02 11:30:06 BoogieIcfgContainer [2025-02-05 11:30:06,901 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-02-05 11:30:06,903 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-02-05 11:30:06,903 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-02-05 11:30:06,907 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-02-05 11:30:06,908 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 05.02 11:30:05" (1/3) ... [2025-02-05 11:30:06,908 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@69c78ac0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 05.02 11:30:06, skipping insertion in model container [2025-02-05 11:30:06,908 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 11:30:05" (2/3) ... [2025-02-05 11:30:06,908 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@69c78ac0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 05.02 11:30:06, skipping insertion in model container [2025-02-05 11:30:06,909 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 05.02 11:30:06" (3/3) ... [2025-02-05 11:30:06,910 INFO L128 eAbstractionObserver]: Analyzing ICFG Problem10_label23.c [2025-02-05 11:30:06,925 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-02-05 11:30:06,926 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG Problem10_label23.c that has 1 procedures, 206 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-02-05 11:30:06,983 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-02-05 11:30:06,991 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;@1e18cd8d, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-02-05 11:30:06,992 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-02-05 11:30:06,995 INFO L276 IsEmpty]: Start isEmpty. Operand has 206 states, 204 states have (on average 1.6813725490196079) internal successors, (343), 205 states have internal predecessors, (343), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 11:30:07,000 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2025-02-05 11:30:07,000 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 11:30:07,001 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] [2025-02-05 11:30:07,001 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 11:30:07,005 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 11:30:07,005 INFO L85 PathProgramCache]: Analyzing trace with hash 323475938, now seen corresponding path program 1 times [2025-02-05 11:30:07,011 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 11:30:07,012 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1661907744] [2025-02-05 11:30:07,012 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 11:30:07,012 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 11:30:07,080 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 46 statements into 1 equivalence classes. [2025-02-05 11:30:07,130 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 46 of 46 statements. [2025-02-05 11:30:07,130 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 11:30:07,130 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 11:30:07,521 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 11:30:07,521 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 11:30:07,522 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1661907744] [2025-02-05 11:30:07,522 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1661907744] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 11:30:07,522 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 11:30:07,523 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-05 11:30:07,524 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1324011564] [2025-02-05 11:30:07,525 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 11:30:07,529 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-05 11:30:07,530 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 11:30:07,548 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-05 11:30:07,549 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-02-05 11:30:07,552 INFO L87 Difference]: Start difference. First operand has 206 states, 204 states have (on average 1.6813725490196079) internal successors, (343), 205 states have internal predecessors, (343), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 4 states, 4 states have (on average 11.5) internal successors, (46), 3 states have internal predecessors, (46), 0 states have call successors, (0), 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-02-05 11:30:08,768 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 11:30:08,769 INFO L93 Difference]: Finished difference Result 696 states and 1244 transitions. [2025-02-05 11:30:08,773 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-05 11:30:08,774 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 11.5) internal successors, (46), 3 states have internal predecessors, (46), 0 states have call successors, (0), 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 46 [2025-02-05 11:30:08,774 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 11:30:08,783 INFO L225 Difference]: With dead ends: 696 [2025-02-05 11:30:08,783 INFO L226 Difference]: Without dead ends: 421 [2025-02-05 11:30:08,786 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-02-05 11:30:08,788 INFO L435 NwaCegarLoop]: 30 mSDtfsCounter, 460 mSDsluCounter, 14 mSDsCounter, 0 mSdLazyCounter, 684 mSolverCounterSat, 287 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 460 SdHoareTripleChecker+Valid, 44 SdHoareTripleChecker+Invalid, 971 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 287 IncrementalHoareTripleChecker+Valid, 684 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2025-02-05 11:30:08,789 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [460 Valid, 44 Invalid, 971 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [287 Valid, 684 Invalid, 0 Unknown, 0 Unchecked, 1.1s Time] [2025-02-05 11:30:08,801 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 421 states. [2025-02-05 11:30:08,849 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 421 to 421. [2025-02-05 11:30:08,850 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 421 states, 420 states have (on average 1.3833333333333333) internal successors, (581), 420 states have internal predecessors, (581), 0 states have call successors, (0), 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-02-05 11:30:08,858 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 421 states to 421 states and 581 transitions. [2025-02-05 11:30:08,860 INFO L78 Accepts]: Start accepts. Automaton has 421 states and 581 transitions. Word has length 46 [2025-02-05 11:30:08,861 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 11:30:08,861 INFO L471 AbstractCegarLoop]: Abstraction has 421 states and 581 transitions. [2025-02-05 11:30:08,861 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 11.5) internal successors, (46), 3 states have internal predecessors, (46), 0 states have call successors, (0), 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-02-05 11:30:08,861 INFO L276 IsEmpty]: Start isEmpty. Operand 421 states and 581 transitions. [2025-02-05 11:30:08,864 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 165 [2025-02-05 11:30:08,864 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 11:30:08,865 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-02-05 11:30:08,865 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-02-05 11:30:08,865 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 11:30:08,866 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 11:30:08,866 INFO L85 PathProgramCache]: Analyzing trace with hash -958073638, now seen corresponding path program 1 times [2025-02-05 11:30:08,866 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 11:30:08,866 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1937680749] [2025-02-05 11:30:08,866 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 11:30:08,866 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 11:30:08,912 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 164 statements into 1 equivalence classes. [2025-02-05 11:30:08,940 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 164 of 164 statements. [2025-02-05 11:30:08,940 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 11:30:08,940 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 11:30:09,480 INFO L134 CoverageAnalysis]: Checked inductivity of 43 backedges. 43 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 11:30:09,481 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 11:30:09,481 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1937680749] [2025-02-05 11:30:09,481 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1937680749] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 11:30:09,481 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 11:30:09,481 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-05 11:30:09,481 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1444637341] [2025-02-05 11:30:09,481 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 11:30:09,482 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-05 11:30:09,484 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 11:30:09,485 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-05 11:30:09,485 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-02-05 11:30:09,486 INFO L87 Difference]: Start difference. First operand 421 states and 581 transitions. Second operand has 4 states, 4 states have (on average 41.0) internal successors, (164), 3 states have internal predecessors, (164), 0 states have call successors, (0), 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-02-05 11:30:09,992 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 11:30:09,993 INFO L93 Difference]: Finished difference Result 701 states and 1011 transitions. [2025-02-05 11:30:09,994 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-05 11:30:09,994 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 41.0) internal successors, (164), 3 states have internal predecessors, (164), 0 states have call successors, (0), 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 164 [2025-02-05 11:30:09,994 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 11:30:09,996 INFO L225 Difference]: With dead ends: 701 [2025-02-05 11:30:09,996 INFO L226 Difference]: Without dead ends: 421 [2025-02-05 11:30:09,997 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-02-05 11:30:09,998 INFO L435 NwaCegarLoop]: 78 mSDtfsCounter, 87 mSDsluCounter, 9 mSDsCounter, 0 mSdLazyCounter, 567 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 87 SdHoareTripleChecker+Valid, 87 SdHoareTripleChecker+Invalid, 571 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 567 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-02-05 11:30:09,998 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [87 Valid, 87 Invalid, 571 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 567 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-02-05 11:30:09,999 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 421 states. [2025-02-05 11:30:10,013 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 421 to 421. [2025-02-05 11:30:10,014 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 421 states, 420 states have (on average 1.3714285714285714) internal successors, (576), 420 states have internal predecessors, (576), 0 states have call successors, (0), 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-02-05 11:30:10,015 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 421 states to 421 states and 576 transitions. [2025-02-05 11:30:10,015 INFO L78 Accepts]: Start accepts. Automaton has 421 states and 576 transitions. Word has length 164 [2025-02-05 11:30:10,016 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 11:30:10,016 INFO L471 AbstractCegarLoop]: Abstraction has 421 states and 576 transitions. [2025-02-05 11:30:10,016 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 41.0) internal successors, (164), 3 states have internal predecessors, (164), 0 states have call successors, (0), 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-02-05 11:30:10,016 INFO L276 IsEmpty]: Start isEmpty. Operand 421 states and 576 transitions. [2025-02-05 11:30:10,019 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 191 [2025-02-05 11:30:10,019 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 11:30:10,019 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 11:30:10,019 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-02-05 11:30:10,020 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 11:30:10,020 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 11:30:10,020 INFO L85 PathProgramCache]: Analyzing trace with hash -611794312, now seen corresponding path program 1 times [2025-02-05 11:30:10,020 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 11:30:10,021 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [865688733] [2025-02-05 11:30:10,021 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 11:30:10,021 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 11:30:10,053 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 190 statements into 1 equivalence classes. [2025-02-05 11:30:10,087 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 190 of 190 statements. [2025-02-05 11:30:10,088 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 11:30:10,088 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 11:30:10,524 INFO L134 CoverageAnalysis]: Checked inductivity of 152 backedges. 152 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 11:30:10,525 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 11:30:10,525 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [865688733] [2025-02-05 11:30:10,525 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [865688733] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 11:30:10,525 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 11:30:10,525 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-05 11:30:10,525 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [906601240] [2025-02-05 11:30:10,525 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 11:30:10,525 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-05 11:30:10,526 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 11:30:10,526 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-05 11:30:10,526 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-05 11:30:10,530 INFO L87 Difference]: Start difference. First operand 421 states and 576 transitions. Second operand has 3 states, 3 states have (on average 63.333333333333336) internal successors, (190), 3 states have internal predecessors, (190), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 11:30:11,038 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 11:30:11,039 INFO L93 Difference]: Finished difference Result 840 states and 1220 transitions. [2025-02-05 11:30:11,039 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-05 11:30:11,039 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 63.333333333333336) internal successors, (190), 3 states have internal predecessors, (190), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 190 [2025-02-05 11:30:11,040 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 11:30:11,042 INFO L225 Difference]: With dead ends: 840 [2025-02-05 11:30:11,042 INFO L226 Difference]: Without dead ends: 560 [2025-02-05 11:30:11,043 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 4 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-02-05 11:30:11,044 INFO L435 NwaCegarLoop]: 16 mSDtfsCounter, 87 mSDsluCounter, 3 mSDsCounter, 0 mSdLazyCounter, 351 mSolverCounterSat, 104 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 87 SdHoareTripleChecker+Valid, 19 SdHoareTripleChecker+Invalid, 455 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 104 IncrementalHoareTripleChecker+Valid, 351 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-02-05 11:30:11,044 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [87 Valid, 19 Invalid, 455 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [104 Valid, 351 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-02-05 11:30:11,045 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 560 states. [2025-02-05 11:30:11,059 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 560 to 560. [2025-02-05 11:30:11,060 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 560 states, 559 states have (on average 1.3774597495527727) internal successors, (770), 559 states have internal predecessors, (770), 0 states have call successors, (0), 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-02-05 11:30:11,062 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 560 states to 560 states and 770 transitions. [2025-02-05 11:30:11,063 INFO L78 Accepts]: Start accepts. Automaton has 560 states and 770 transitions. Word has length 190 [2025-02-05 11:30:11,063 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 11:30:11,063 INFO L471 AbstractCegarLoop]: Abstraction has 560 states and 770 transitions. [2025-02-05 11:30:11,063 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 63.333333333333336) internal successors, (190), 3 states have internal predecessors, (190), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 11:30:11,064 INFO L276 IsEmpty]: Start isEmpty. Operand 560 states and 770 transitions. [2025-02-05 11:30:11,067 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 207 [2025-02-05 11:30:11,067 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 11:30:11,067 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 11:30:11,067 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-02-05 11:30:11,067 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 11:30:11,068 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 11:30:11,068 INFO L85 PathProgramCache]: Analyzing trace with hash 367010640, now seen corresponding path program 1 times [2025-02-05 11:30:11,068 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 11:30:11,068 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [419944183] [2025-02-05 11:30:11,069 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 11:30:11,069 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 11:30:11,101 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 206 statements into 1 equivalence classes. [2025-02-05 11:30:11,121 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 206 of 206 statements. [2025-02-05 11:30:11,121 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 11:30:11,121 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 11:30:11,301 INFO L134 CoverageAnalysis]: Checked inductivity of 152 backedges. 152 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 11:30:11,301 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 11:30:11,301 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [419944183] [2025-02-05 11:30:11,301 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [419944183] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 11:30:11,301 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 11:30:11,301 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-05 11:30:11,301 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1575716387] [2025-02-05 11:30:11,301 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 11:30:11,302 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-05 11:30:11,302 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 11:30:11,303 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-05 11:30:11,303 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-05 11:30:11,303 INFO L87 Difference]: Start difference. First operand 560 states and 770 transitions. Second operand has 3 states, 3 states have (on average 68.66666666666667) internal successors, (206), 3 states have internal predecessors, (206), 0 states have call successors, (0), 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-02-05 11:30:11,764 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 11:30:11,765 INFO L93 Difference]: Finished difference Result 1257 states and 1803 transitions. [2025-02-05 11:30:11,765 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-05 11:30:11,766 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 68.66666666666667) internal successors, (206), 3 states have internal predecessors, (206), 0 states have call successors, (0), 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 206 [2025-02-05 11:30:11,766 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 11:30:11,770 INFO L225 Difference]: With dead ends: 1257 [2025-02-05 11:30:11,771 INFO L226 Difference]: Without dead ends: 838 [2025-02-05 11:30:11,771 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-05 11:30:11,774 INFO L435 NwaCegarLoop]: 210 mSDtfsCounter, 50 mSDsluCounter, 5 mSDsCounter, 0 mSdLazyCounter, 340 mSolverCounterSat, 75 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 50 SdHoareTripleChecker+Valid, 215 SdHoareTripleChecker+Invalid, 415 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 75 IncrementalHoareTripleChecker+Valid, 340 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-02-05 11:30:11,775 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [50 Valid, 215 Invalid, 415 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [75 Valid, 340 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-02-05 11:30:11,777 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 838 states. [2025-02-05 11:30:11,795 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 838 to 699. [2025-02-05 11:30:11,796 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 699 states, 698 states have (on average 1.316618911174785) internal successors, (919), 698 states have internal predecessors, (919), 0 states have call successors, (0), 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-02-05 11:30:11,798 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 699 states to 699 states and 919 transitions. [2025-02-05 11:30:11,798 INFO L78 Accepts]: Start accepts. Automaton has 699 states and 919 transitions. Word has length 206 [2025-02-05 11:30:11,799 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 11:30:11,799 INFO L471 AbstractCegarLoop]: Abstraction has 699 states and 919 transitions. [2025-02-05 11:30:11,799 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 68.66666666666667) internal successors, (206), 3 states have internal predecessors, (206), 0 states have call successors, (0), 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-02-05 11:30:11,799 INFO L276 IsEmpty]: Start isEmpty. Operand 699 states and 919 transitions. [2025-02-05 11:30:11,802 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 240 [2025-02-05 11:30:11,803 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 11:30:11,803 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 11:30:11,803 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-02-05 11:30:11,803 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 11:30:11,804 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 11:30:11,804 INFO L85 PathProgramCache]: Analyzing trace with hash 1505910497, now seen corresponding path program 1 times [2025-02-05 11:30:11,804 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 11:30:11,804 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1437913417] [2025-02-05 11:30:11,804 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 11:30:11,804 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 11:30:11,837 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 239 statements into 1 equivalence classes. [2025-02-05 11:30:11,855 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 239 of 239 statements. [2025-02-05 11:30:11,855 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 11:30:11,855 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 11:30:12,276 INFO L134 CoverageAnalysis]: Checked inductivity of 161 backedges. 161 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 11:30:12,278 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 11:30:12,278 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1437913417] [2025-02-05 11:30:12,278 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1437913417] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 11:30:12,278 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 11:30:12,278 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-02-05 11:30:12,278 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [567229217] [2025-02-05 11:30:12,278 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 11:30:12,279 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-02-05 11:30:12,279 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 11:30:12,280 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-02-05 11:30:12,280 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2025-02-05 11:30:12,280 INFO L87 Difference]: Start difference. First operand 699 states and 919 transitions. Second operand has 7 states, 7 states have (on average 34.142857142857146) internal successors, (239), 6 states have internal predecessors, (239), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 11:30:12,812 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 11:30:12,813 INFO L93 Difference]: Finished difference Result 1312 states and 1747 transitions. [2025-02-05 11:30:12,813 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-02-05 11:30:12,813 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 34.142857142857146) internal successors, (239), 6 states have internal predecessors, (239), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 239 [2025-02-05 11:30:12,814 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 11:30:12,817 INFO L225 Difference]: With dead ends: 1312 [2025-02-05 11:30:12,817 INFO L226 Difference]: Without dead ends: 699 [2025-02-05 11:30:12,818 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2025-02-05 11:30:12,819 INFO L435 NwaCegarLoop]: 9 mSDtfsCounter, 142 mSDsluCounter, 16 mSDsCounter, 0 mSdLazyCounter, 736 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 142 SdHoareTripleChecker+Valid, 25 SdHoareTripleChecker+Invalid, 736 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 736 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-02-05 11:30:12,820 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [142 Valid, 25 Invalid, 736 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 736 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-02-05 11:30:12,821 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 699 states. [2025-02-05 11:30:12,834 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 699 to 699. [2025-02-05 11:30:12,838 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 699 states, 698 states have (on average 1.310888252148997) internal successors, (915), 698 states have internal predecessors, (915), 0 states have call successors, (0), 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-02-05 11:30:12,840 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 699 states to 699 states and 915 transitions. [2025-02-05 11:30:12,841 INFO L78 Accepts]: Start accepts. Automaton has 699 states and 915 transitions. Word has length 239 [2025-02-05 11:30:12,841 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 11:30:12,841 INFO L471 AbstractCegarLoop]: Abstraction has 699 states and 915 transitions. [2025-02-05 11:30:12,842 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 34.142857142857146) internal successors, (239), 6 states have internal predecessors, (239), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 11:30:12,842 INFO L276 IsEmpty]: Start isEmpty. Operand 699 states and 915 transitions. [2025-02-05 11:30:12,845 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 276 [2025-02-05 11:30:12,846 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 11:30:12,846 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 11:30:12,847 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-02-05 11:30:12,847 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 11:30:12,847 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 11:30:12,848 INFO L85 PathProgramCache]: Analyzing trace with hash -600613497, now seen corresponding path program 1 times [2025-02-05 11:30:12,848 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 11:30:12,848 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [897768409] [2025-02-05 11:30:12,848 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 11:30:12,848 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 11:30:12,884 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 275 statements into 1 equivalence classes. [2025-02-05 11:30:12,901 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 275 of 275 statements. [2025-02-05 11:30:12,902 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 11:30:12,905 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 11:30:13,107 INFO L134 CoverageAnalysis]: Checked inductivity of 197 backedges. 197 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 11:30:13,107 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 11:30:13,107 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [897768409] [2025-02-05 11:30:13,107 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [897768409] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 11:30:13,107 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 11:30:13,108 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-05 11:30:13,108 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1911588595] [2025-02-05 11:30:13,108 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 11:30:13,108 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-05 11:30:13,108 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 11:30:13,109 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-05 11:30:13,109 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-05 11:30:13,109 INFO L87 Difference]: Start difference. First operand 699 states and 915 transitions. Second operand has 3 states, 3 states have (on average 91.66666666666667) internal successors, (275), 3 states have internal predecessors, (275), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 11:30:13,549 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 11:30:13,549 INFO L93 Difference]: Finished difference Result 1396 states and 1888 transitions. [2025-02-05 11:30:13,549 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-05 11:30:13,550 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 91.66666666666667) internal successors, (275), 3 states have internal predecessors, (275), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 275 [2025-02-05 11:30:13,550 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 11:30:13,553 INFO L225 Difference]: With dead ends: 1396 [2025-02-05 11:30:13,554 INFO L226 Difference]: Without dead ends: 838 [2025-02-05 11:30:13,555 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-02-05 11:30:13,555 INFO L435 NwaCegarLoop]: 184 mSDtfsCounter, 37 mSDsluCounter, 4 mSDsCounter, 0 mSdLazyCounter, 362 mSolverCounterSat, 48 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 37 SdHoareTripleChecker+Valid, 188 SdHoareTripleChecker+Invalid, 410 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 48 IncrementalHoareTripleChecker+Valid, 362 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-02-05 11:30:13,555 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [37 Valid, 188 Invalid, 410 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [48 Valid, 362 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-02-05 11:30:13,557 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 838 states. [2025-02-05 11:30:13,569 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 838 to 838. [2025-02-05 11:30:13,572 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 838 states, 837 states have (on average 1.2664277180406214) internal successors, (1060), 837 states have internal predecessors, (1060), 0 states have call successors, (0), 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-02-05 11:30:13,575 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 838 states to 838 states and 1060 transitions. [2025-02-05 11:30:13,575 INFO L78 Accepts]: Start accepts. Automaton has 838 states and 1060 transitions. Word has length 275 [2025-02-05 11:30:13,575 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 11:30:13,575 INFO L471 AbstractCegarLoop]: Abstraction has 838 states and 1060 transitions. [2025-02-05 11:30:13,576 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 91.66666666666667) internal successors, (275), 3 states have internal predecessors, (275), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 11:30:13,576 INFO L276 IsEmpty]: Start isEmpty. Operand 838 states and 1060 transitions. [2025-02-05 11:30:13,579 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 295 [2025-02-05 11:30:13,579 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 11:30:13,579 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 11:30:13,580 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-02-05 11:30:13,580 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 11:30:13,581 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 11:30:13,581 INFO L85 PathProgramCache]: Analyzing trace with hash -1646190604, now seen corresponding path program 1 times [2025-02-05 11:30:13,582 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 11:30:13,582 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [805785906] [2025-02-05 11:30:13,582 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 11:30:13,582 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 11:30:13,622 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 294 statements into 1 equivalence classes. [2025-02-05 11:30:13,637 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 294 of 294 statements. [2025-02-05 11:30:13,637 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 11:30:13,638 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 11:30:13,824 INFO L134 CoverageAnalysis]: Checked inductivity of 204 backedges. 87 proven. 0 refuted. 0 times theorem prover too weak. 117 trivial. 0 not checked. [2025-02-05 11:30:13,824 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 11:30:13,824 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [805785906] [2025-02-05 11:30:13,824 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [805785906] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 11:30:13,824 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 11:30:13,825 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-05 11:30:13,825 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1982027982] [2025-02-05 11:30:13,825 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 11:30:13,825 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-05 11:30:13,825 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 11:30:13,826 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-05 11:30:13,826 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-05 11:30:13,827 INFO L87 Difference]: Start difference. First operand 838 states and 1060 transitions. Second operand has 3 states, 3 states have (on average 59.333333333333336) internal successors, (178), 2 states have internal predecessors, (178), 0 states have call successors, (0), 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-02-05 11:30:14,285 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 11:30:14,285 INFO L93 Difference]: Finished difference Result 1813 states and 2352 transitions. [2025-02-05 11:30:14,286 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-05 11:30:14,286 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 59.333333333333336) internal successors, (178), 2 states have internal predecessors, (178), 0 states have call successors, (0), 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 294 [2025-02-05 11:30:14,288 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 11:30:14,293 INFO L225 Difference]: With dead ends: 1813 [2025-02-05 11:30:14,294 INFO L226 Difference]: Without dead ends: 1116 [2025-02-05 11:30:14,295 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-05 11:30:14,296 INFO L435 NwaCegarLoop]: 31 mSDtfsCounter, 46 mSDsluCounter, 3 mSDsCounter, 0 mSdLazyCounter, 333 mSolverCounterSat, 86 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 46 SdHoareTripleChecker+Valid, 34 SdHoareTripleChecker+Invalid, 419 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 86 IncrementalHoareTripleChecker+Valid, 333 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-02-05 11:30:14,297 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [46 Valid, 34 Invalid, 419 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [86 Valid, 333 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-02-05 11:30:14,299 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1116 states. [2025-02-05 11:30:14,315 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1116 to 1116. [2025-02-05 11:30:14,317 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1116 states, 1115 states have (on average 1.2080717488789237) internal successors, (1347), 1115 states have internal predecessors, (1347), 0 states have call successors, (0), 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-02-05 11:30:14,320 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1116 states to 1116 states and 1347 transitions. [2025-02-05 11:30:14,321 INFO L78 Accepts]: Start accepts. Automaton has 1116 states and 1347 transitions. Word has length 294 [2025-02-05 11:30:14,322 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 11:30:14,322 INFO L471 AbstractCegarLoop]: Abstraction has 1116 states and 1347 transitions. [2025-02-05 11:30:14,322 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 59.333333333333336) internal successors, (178), 2 states have internal predecessors, (178), 0 states have call successors, (0), 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-02-05 11:30:14,323 INFO L276 IsEmpty]: Start isEmpty. Operand 1116 states and 1347 transitions. [2025-02-05 11:30:14,330 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 319 [2025-02-05 11:30:14,330 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 11:30:14,330 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-02-05 11:30:14,330 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-02-05 11:30:14,331 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 11:30:14,331 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 11:30:14,331 INFO L85 PathProgramCache]: Analyzing trace with hash -2135440156, now seen corresponding path program 1 times [2025-02-05 11:30:14,331 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 11:30:14,331 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [215772218] [2025-02-05 11:30:14,331 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 11:30:14,331 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 11:30:14,375 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 318 statements into 1 equivalence classes. [2025-02-05 11:30:14,399 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 318 of 318 statements. [2025-02-05 11:30:14,400 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 11:30:14,400 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 11:30:14,638 INFO L134 CoverageAnalysis]: Checked inductivity of 368 backedges. 131 proven. 0 refuted. 0 times theorem prover too weak. 237 trivial. 0 not checked. [2025-02-05 11:30:14,638 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 11:30:14,638 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [215772218] [2025-02-05 11:30:14,638 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [215772218] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 11:30:14,638 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 11:30:14,639 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-05 11:30:14,639 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1466715641] [2025-02-05 11:30:14,639 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 11:30:14,639 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-05 11:30:14,639 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 11:30:14,640 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-05 11:30:14,640 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-05 11:30:14,640 INFO L87 Difference]: Start difference. First operand 1116 states and 1347 transitions. Second operand has 3 states, 3 states have (on average 53.333333333333336) internal successors, (160), 3 states have internal predecessors, (160), 0 states have call successors, (0), 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-02-05 11:30:15,204 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 11:30:15,205 INFO L93 Difference]: Finished difference Result 1950 states and 2393 transitions. [2025-02-05 11:30:15,205 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-05 11:30:15,205 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 53.333333333333336) internal successors, (160), 3 states have internal predecessors, (160), 0 states have call successors, (0), 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 318 [2025-02-05 11:30:15,206 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 11:30:15,206 INFO L225 Difference]: With dead ends: 1950 [2025-02-05 11:30:15,206 INFO L226 Difference]: Without dead ends: 0 [2025-02-05 11:30:15,208 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-02-05 11:30:15,209 INFO L435 NwaCegarLoop]: 31 mSDtfsCounter, 102 mSDsluCounter, 3 mSDsCounter, 0 mSdLazyCounter, 374 mSolverCounterSat, 76 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 102 SdHoareTripleChecker+Valid, 34 SdHoareTripleChecker+Invalid, 450 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 76 IncrementalHoareTripleChecker+Valid, 374 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-02-05 11:30:15,209 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [102 Valid, 34 Invalid, 450 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [76 Valid, 374 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-02-05 11:30:15,210 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2025-02-05 11:30:15,210 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2025-02-05 11:30:15,210 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-02-05 11:30:15,210 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2025-02-05 11:30:15,210 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 318 [2025-02-05 11:30:15,211 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 11:30:15,211 INFO L471 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2025-02-05 11:30:15,211 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 53.333333333333336) internal successors, (160), 3 states have internal predecessors, (160), 0 states have call successors, (0), 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-02-05 11:30:15,211 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2025-02-05 11:30:15,211 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2025-02-05 11:30:15,214 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2025-02-05 11:30:15,215 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-02-05 11:30:15,218 INFO L422 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 11:30:15,220 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2025-02-05 11:30:15,356 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2025-02-05 11:30:15,371 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 05.02 11:30:15 BoogieIcfgContainer [2025-02-05 11:30:15,372 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2025-02-05 11:30:15,372 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2025-02-05 11:30:15,372 INFO L270 PluginConnector]: Initializing Witness Printer... [2025-02-05 11:30:15,374 INFO L274 PluginConnector]: Witness Printer initialized [2025-02-05 11:30:15,375 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 05.02 11:30:06" (3/4) ... [2025-02-05 11:30:15,379 INFO L146 WitnessPrinter]: Generating witness for correct program [2025-02-05 11:30:15,401 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 11 nodes and edges [2025-02-05 11:30:15,403 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 4 nodes and edges [2025-02-05 11:30:15,404 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 3 nodes and edges [2025-02-05 11:30:15,404 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2025-02-05 11:30:15,540 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/witness.graphml [2025-02-05 11:30:15,540 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/witness.yml [2025-02-05 11:30:15,540 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2025-02-05 11:30:15,541 INFO L158 Benchmark]: Toolchain (without parser) took 10535.11ms. Allocated memory was 142.6MB in the beginning and 377.5MB in the end (delta: 234.9MB). Free memory was 104.2MB in the beginning and 242.7MB in the end (delta: -138.6MB). Peak memory consumption was 94.5MB. Max. memory is 16.1GB. [2025-02-05 11:30:15,541 INFO L158 Benchmark]: CDTParser took 0.20ms. Allocated memory is still 201.3MB. Free memory is still 124.8MB. There was no memory consumed. Max. memory is 16.1GB. [2025-02-05 11:30:15,542 INFO L158 Benchmark]: CACSL2BoogieTranslator took 426.43ms. Allocated memory is still 142.6MB. Free memory was 104.2MB in the beginning and 75.8MB in the end (delta: 28.4MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2025-02-05 11:30:15,542 INFO L158 Benchmark]: Boogie Procedure Inliner took 92.96ms. Allocated memory is still 142.6MB. Free memory was 75.8MB in the beginning and 68.5MB in the end (delta: 7.3MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-02-05 11:30:15,543 INFO L158 Benchmark]: Boogie Preprocessor took 119.09ms. Allocated memory is still 142.6MB. Free memory was 68.5MB in the beginning and 60.0MB in the end (delta: 8.4MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-02-05 11:30:15,543 INFO L158 Benchmark]: IcfgBuilder took 1253.94ms. Allocated memory is still 142.6MB. Free memory was 60.0MB in the beginning and 96.3MB in the end (delta: -36.3MB). Peak memory consumption was 46.4MB. Max. memory is 16.1GB. [2025-02-05 11:30:15,543 INFO L158 Benchmark]: TraceAbstraction took 8468.69ms. Allocated memory was 142.6MB in the beginning and 377.5MB in the end (delta: 234.9MB). Free memory was 95.4MB in the beginning and 254.5MB in the end (delta: -159.1MB). Peak memory consumption was 79.8MB. Max. memory is 16.1GB. [2025-02-05 11:30:15,544 INFO L158 Benchmark]: Witness Printer took 167.93ms. Allocated memory is still 377.5MB. Free memory was 254.5MB in the beginning and 242.7MB in the end (delta: 11.7MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-02-05 11:30:15,545 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.20ms. Allocated memory is still 201.3MB. Free memory is still 124.8MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 426.43ms. Allocated memory is still 142.6MB. Free memory was 104.2MB in the beginning and 75.8MB in the end (delta: 28.4MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 92.96ms. Allocated memory is still 142.6MB. Free memory was 75.8MB in the beginning and 68.5MB in the end (delta: 7.3MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Boogie Preprocessor took 119.09ms. Allocated memory is still 142.6MB. Free memory was 68.5MB in the beginning and 60.0MB in the end (delta: 8.4MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * IcfgBuilder took 1253.94ms. Allocated memory is still 142.6MB. Free memory was 60.0MB in the beginning and 96.3MB in the end (delta: -36.3MB). Peak memory consumption was 46.4MB. Max. memory is 16.1GB. * TraceAbstraction took 8468.69ms. Allocated memory was 142.6MB in the beginning and 377.5MB in the end (delta: 234.9MB). Free memory was 95.4MB in the beginning and 254.5MB in the end (delta: -159.1MB). Peak memory consumption was 79.8MB. Max. memory is 16.1GB. * Witness Printer took 167.93ms. Allocated memory is still 377.5MB. Free memory was 254.5MB in the beginning and 242.7MB in the end (delta: 11.7MB). 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: 152]: a call to reach_error is unreachable For all program executions holds that a call to reach_error is unreachable at this location - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 206 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 8.3s, OverallIterations: 8, TraceHistogramMax: 4, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 4.8s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 1011 SdHoareTripleChecker+Valid, 4.4s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 1011 mSDsluCounter, 646 SdHoareTripleChecker+Invalid, 3.6s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 57 mSDsCounter, 680 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 3747 IncrementalHoareTripleChecker+Invalid, 4427 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 680 mSolverCounterUnsat, 589 mSDtfsCounter, 3747 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 30 GetRequests, 14 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=1116occurred in iteration=7, InterpolantAutomatonStates: 30, 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, 8 MinimizatonAttempts, 139 StatesRemovedByMinimization, 1 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 2.6s InterpolantComputationTime, 1732 NumberOfCodeBlocks, 1732 NumberOfCodeBlocksAsserted, 8 NumberOfCheckSat, 1724 ConstructedInterpolants, 0 QuantifiedInterpolants, 6002 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 8 InterpolantComputations, 8 PerfectInterpolantSequences, 1277/1277 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available, ConComCheckerStatistics: No data available - AllSpecificationsHoldResult: All specifications hold 1 specifications checked. All of them hold - InvariantResult [Line: 592]: Location Invariant Derived location invariant: (((((((a10 != 4) && (14 == a4)) && (7 != a19)) && (a12 == 0)) || (((14 == a4) && (a10 == 2)) && (a12 == 0))) || ((((a19 <= 9) && (14 == a4)) && (7 != a19)) && (a12 == 0))) || ((((0 <= ((long long) a1 + 12)) && (a10 == 1)) && (14 == a4)) && (a12 == 0))) RESULT: Ultimate proved your program to be correct! [2025-02-05 11:30:15,567 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Ended with exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Result: TRUE