./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/eca-rers2012/Problem10_label21.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 3289d67d Calling Ultimate with: /root/.sdkman/candidates/java/11.0.12-open/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/eca-rers2012/Problem10_label21.c -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash d5ae1d248ac328ae194d38c847eaaf19b85e7124a7cd6c7e1aa145a759bc08e1 --- Real Ultimate output --- This is Ultimate 0.2.5-tmp.fs.icfgbuilder-eval-3289d67-m [2024-11-16 03:47:46,445 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-16 03:47:46,511 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-11-16 03:47:46,522 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-16 03:47:46,522 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-16 03:47:46,544 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-16 03:47:46,544 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-16 03:47:46,545 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-16 03:47:46,545 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-16 03:47:46,548 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-16 03:47:46,548 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-16 03:47:46,548 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-16 03:47:46,548 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-16 03:47:46,549 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-16 03:47:46,549 INFO L153 SettingsManager]: * Use SBE=true [2024-11-16 03:47:46,549 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-16 03:47:46,549 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-16 03:47:46,549 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-16 03:47:46,549 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-16 03:47:46,550 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-16 03:47:46,550 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-16 03:47:46,551 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-16 03:47:46,551 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-16 03:47:46,551 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-16 03:47:46,551 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-16 03:47:46,552 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-16 03:47:46,552 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-16 03:47:46,552 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-16 03:47:46,552 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2024-11-16 03:47:46,552 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-16 03:47:46,552 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-16 03:47:46,552 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-16 03:47:46,552 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-16 03:47:46,553 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-16 03:47:46,553 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-16 03:47:46,553 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-16 03:47:46,553 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-16 03:47:46,553 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-16 03:47:46,553 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-16 03:47:46,553 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-16 03:47:46,554 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-16 03:47:46,555 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-16 03:47:46,555 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(reach_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> d5ae1d248ac328ae194d38c847eaaf19b85e7124a7cd6c7e1aa145a759bc08e1 [2024-11-16 03:47:46,744 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-16 03:47:46,762 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-16 03:47:46,764 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-16 03:47:46,765 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-16 03:47:46,766 INFO L274 PluginConnector]: CDTParser initialized [2024-11-16 03:47:46,766 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/eca-rers2012/Problem10_label21.c [2024-11-16 03:47:47,998 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-16 03:47:48,186 INFO L384 CDTParser]: Found 1 translation units. [2024-11-16 03:47:48,187 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/eca-rers2012/Problem10_label21.c [2024-11-16 03:47:48,198 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/56830bc2f/ec3baf35bce14868a69b0ed7282c0ca1/FLAG4475c9e45 [2024-11-16 03:47:48,210 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/56830bc2f/ec3baf35bce14868a69b0ed7282c0ca1 [2024-11-16 03:47:48,213 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-16 03:47:48,214 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-16 03:47:48,215 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-16 03:47:48,216 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-16 03:47:48,220 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-16 03:47:48,220 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.11 03:47:48" (1/1) ... [2024-11-16 03:47:48,221 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@a67e9a4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 03:47:48, skipping insertion in model container [2024-11-16 03:47:48,221 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.11 03:47:48" (1/1) ... [2024-11-16 03:47:48,251 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-16 03:47:48,410 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/eca-rers2012/Problem10_label21.c[3267,3280] [2024-11-16 03:47:48,535 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-16 03:47:48,545 INFO L200 MainTranslator]: Completed pre-run [2024-11-16 03:47:48,564 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/eca-rers2012/Problem10_label21.c[3267,3280] [2024-11-16 03:47:48,615 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-16 03:47:48,635 INFO L204 MainTranslator]: Completed translation [2024-11-16 03:47:48,636 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 03:47:48 WrapperNode [2024-11-16 03:47:48,636 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-16 03:47:48,637 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-16 03:47:48,637 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-16 03:47:48,637 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-16 03:47:48,642 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 03:47:48" (1/1) ... [2024-11-16 03:47:48,657 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 03:47:48" (1/1) ... [2024-11-16 03:47:48,731 INFO L138 Inliner]: procedures = 14, calls = 8, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 597 [2024-11-16 03:47:48,731 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-16 03:47:48,731 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-16 03:47:48,731 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-16 03:47:48,732 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-16 03:47:48,760 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 03:47:48" (1/1) ... [2024-11-16 03:47:48,761 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 03:47:48" (1/1) ... [2024-11-16 03:47:48,765 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 03:47:48" (1/1) ... [2024-11-16 03:47:48,791 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]. [2024-11-16 03:47:48,792 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 03:47:48" (1/1) ... [2024-11-16 03:47:48,792 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 03:47:48" (1/1) ... [2024-11-16 03:47:48,815 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 03:47:48" (1/1) ... [2024-11-16 03:47:48,821 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 03:47:48" (1/1) ... [2024-11-16 03:47:48,827 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 03:47:48" (1/1) ... [2024-11-16 03:47:48,830 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 03:47:48" (1/1) ... [2024-11-16 03:47:48,837 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-16 03:47:48,838 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2024-11-16 03:47:48,838 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2024-11-16 03:47:48,838 INFO L274 PluginConnector]: IcfgBuilder initialized [2024-11-16 03:47:48,839 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 03:47:48" (1/1) ... [2024-11-16 03:47:48,844 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-16 03:47:48,851 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-16 03:47:48,864 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-11-16 03:47:48,866 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-11-16 03:47:48,900 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-16 03:47:48,901 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-11-16 03:47:48,901 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-16 03:47:48,901 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-16 03:47:48,961 INFO L256 CfgBuilder]: Building ICFG [2024-11-16 03:47:48,963 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-16 03:47:49,676 INFO L? ?]: Removed 84 outVars from TransFormulas that were not future-live. [2024-11-16 03:47:49,676 INFO L307 CfgBuilder]: Performing block encoding [2024-11-16 03:47:49,687 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-16 03:47:49,687 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2024-11-16 03:47:49,687 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 16.11 03:47:49 BoogieIcfgContainer [2024-11-16 03:47:49,687 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2024-11-16 03:47:49,689 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-16 03:47:49,689 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-16 03:47:49,691 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-16 03:47:49,691 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 16.11 03:47:48" (1/3) ... [2024-11-16 03:47:49,692 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@54a6787f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.11 03:47:49, skipping insertion in model container [2024-11-16 03:47:49,692 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 03:47:48" (2/3) ... [2024-11-16 03:47:49,692 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@54a6787f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.11 03:47:49, skipping insertion in model container [2024-11-16 03:47:49,692 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 16.11 03:47:49" (3/3) ... [2024-11-16 03:47:49,693 INFO L112 eAbstractionObserver]: Analyzing ICFG Problem10_label21.c [2024-11-16 03:47:49,704 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-16 03:47:49,704 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-11-16 03:47:49,753 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-16 03:47:49,759 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;@2728e706, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-16 03:47:49,759 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-16 03:47:49,762 INFO L276 IsEmpty]: Start isEmpty. Operand has 209 states, 207 states have (on average 1.6763285024154588) internal successors, (347), 208 states have internal predecessors, (347), 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) [2024-11-16 03:47:49,768 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2024-11-16 03:47:49,768 INFO L207 NwaCegarLoop]: Found error trace [2024-11-16 03:47:49,770 INFO L215 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] [2024-11-16 03:47:49,770 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-16 03:47:49,774 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 03:47:49,774 INFO L85 PathProgramCache]: Analyzing trace with hash -575851806, now seen corresponding path program 1 times [2024-11-16 03:47:49,782 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-16 03:47:49,782 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [261398429] [2024-11-16 03:47:49,782 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 03:47:49,782 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-16 03:47:49,883 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 03:47:50,013 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-16 03:47:50,016 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-16 03:47:50,016 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [261398429] [2024-11-16 03:47:50,016 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [261398429] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-16 03:47:50,017 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-16 03:47:50,017 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-16 03:47:50,018 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1392334264] [2024-11-16 03:47:50,019 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-16 03:47:50,022 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-16 03:47:50,024 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-16 03:47:50,042 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-16 03:47:50,043 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-16 03:47:50,046 INFO L87 Difference]: Start difference. First operand has 209 states, 207 states have (on average 1.6763285024154588) internal successors, (347), 208 states have internal predecessors, (347), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 3 states, 3 states have (on average 9.666666666666666) internal successors, (29), 2 states have internal predecessors, (29), 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) [2024-11-16 03:47:50,618 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-16 03:47:50,618 INFO L93 Difference]: Finished difference Result 558 states and 972 transitions. [2024-11-16 03:47:50,619 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-16 03:47:50,620 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 9.666666666666666) internal successors, (29), 2 states have internal predecessors, (29), 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 29 [2024-11-16 03:47:50,621 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-16 03:47:50,631 INFO L225 Difference]: With dead ends: 558 [2024-11-16 03:47:50,631 INFO L226 Difference]: Without dead ends: 285 [2024-11-16 03:47:50,634 INFO L431 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 [2024-11-16 03:47:50,637 INFO L432 NwaCegarLoop]: 71 mSDtfsCounter, 161 mSDsluCounter, 9 mSDsCounter, 0 mSdLazyCounter, 424 mSolverCounterSat, 137 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 161 SdHoareTripleChecker+Valid, 80 SdHoareTripleChecker+Invalid, 561 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 137 IncrementalHoareTripleChecker+Valid, 424 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-11-16 03:47:50,638 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [161 Valid, 80 Invalid, 561 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [137 Valid, 424 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2024-11-16 03:47:50,651 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 285 states. [2024-11-16 03:47:50,676 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 285 to 285. [2024-11-16 03:47:50,679 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 285 states, 284 states have (on average 1.5316901408450705) internal successors, (435), 284 states have internal predecessors, (435), 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) [2024-11-16 03:47:50,681 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 285 states to 285 states and 435 transitions. [2024-11-16 03:47:50,682 INFO L78 Accepts]: Start accepts. Automaton has 285 states and 435 transitions. Word has length 29 [2024-11-16 03:47:50,682 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-16 03:47:50,682 INFO L471 AbstractCegarLoop]: Abstraction has 285 states and 435 transitions. [2024-11-16 03:47:50,682 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 9.666666666666666) internal successors, (29), 2 states have internal predecessors, (29), 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) [2024-11-16 03:47:50,683 INFO L276 IsEmpty]: Start isEmpty. Operand 285 states and 435 transitions. [2024-11-16 03:47:50,686 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2024-11-16 03:47:50,686 INFO L207 NwaCegarLoop]: Found error trace [2024-11-16 03:47:50,686 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-16 03:47:50,686 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-16 03:47:50,686 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-16 03:47:50,687 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 03:47:50,687 INFO L85 PathProgramCache]: Analyzing trace with hash -1572432493, now seen corresponding path program 1 times [2024-11-16 03:47:50,687 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-16 03:47:50,687 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1969379655] [2024-11-16 03:47:50,687 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 03:47:50,687 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-16 03:47:50,739 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 03:47:50,842 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 25 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-16 03:47:50,842 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-16 03:47:50,842 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1969379655] [2024-11-16 03:47:50,842 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1969379655] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-16 03:47:50,842 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-16 03:47:50,843 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-16 03:47:50,843 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [992712696] [2024-11-16 03:47:50,843 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-16 03:47:50,844 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-16 03:47:50,844 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-16 03:47:50,844 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-16 03:47:50,845 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-16 03:47:50,845 INFO L87 Difference]: Start difference. First operand 285 states and 435 transitions. Second operand has 3 states, 3 states have (on average 33.0) internal successors, (99), 2 states have internal predecessors, (99), 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) [2024-11-16 03:47:51,222 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-16 03:47:51,223 INFO L93 Difference]: Finished difference Result 708 states and 1083 transitions. [2024-11-16 03:47:51,223 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-16 03:47:51,224 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 33.0) internal successors, (99), 2 states have internal predecessors, (99), 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 99 [2024-11-16 03:47:51,224 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-16 03:47:51,226 INFO L225 Difference]: With dead ends: 708 [2024-11-16 03:47:51,226 INFO L226 Difference]: Without dead ends: 425 [2024-11-16 03:47:51,227 INFO L431 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 [2024-11-16 03:47:51,228 INFO L432 NwaCegarLoop]: 33 mSDtfsCounter, 110 mSDsluCounter, 4 mSDsCounter, 0 mSdLazyCounter, 334 mSolverCounterSat, 98 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 110 SdHoareTripleChecker+Valid, 37 SdHoareTripleChecker+Invalid, 432 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 98 IncrementalHoareTripleChecker+Valid, 334 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-11-16 03:47:51,228 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [110 Valid, 37 Invalid, 432 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [98 Valid, 334 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-11-16 03:47:51,230 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 425 states. [2024-11-16 03:47:51,244 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 425 to 425. [2024-11-16 03:47:51,245 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 425 states, 424 states have (on average 1.4150943396226414) internal successors, (600), 424 states have internal predecessors, (600), 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) [2024-11-16 03:47:51,245 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 425 states to 425 states and 600 transitions. [2024-11-16 03:47:51,245 INFO L78 Accepts]: Start accepts. Automaton has 425 states and 600 transitions. Word has length 99 [2024-11-16 03:47:51,246 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-16 03:47:51,246 INFO L471 AbstractCegarLoop]: Abstraction has 425 states and 600 transitions. [2024-11-16 03:47:51,246 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 33.0) internal successors, (99), 2 states have internal predecessors, (99), 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) [2024-11-16 03:47:51,246 INFO L276 IsEmpty]: Start isEmpty. Operand 425 states and 600 transitions. [2024-11-16 03:47:51,248 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2024-11-16 03:47:51,248 INFO L207 NwaCegarLoop]: Found error trace [2024-11-16 03:47:51,248 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-16 03:47:51,249 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-16 03:47:51,249 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-16 03:47:51,249 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 03:47:51,249 INFO L85 PathProgramCache]: Analyzing trace with hash 1533643010, now seen corresponding path program 1 times [2024-11-16 03:47:51,249 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-16 03:47:51,250 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1609685655] [2024-11-16 03:47:51,250 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 03:47:51,250 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-16 03:47:51,299 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 03:47:51,412 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 25 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-16 03:47:51,413 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-16 03:47:51,413 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1609685655] [2024-11-16 03:47:51,413 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1609685655] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-16 03:47:51,414 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-16 03:47:51,414 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-16 03:47:51,414 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1846189196] [2024-11-16 03:47:51,414 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-16 03:47:51,415 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-16 03:47:51,415 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-16 03:47:51,415 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-16 03:47:51,416 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-16 03:47:51,417 INFO L87 Difference]: Start difference. First operand 425 states and 600 transitions. Second operand has 3 states, 3 states have (on average 35.0) internal successors, (105), 3 states have internal predecessors, (105), 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) [2024-11-16 03:47:51,797 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-16 03:47:51,797 INFO L93 Difference]: Finished difference Result 568 states and 793 transitions. [2024-11-16 03:47:51,797 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-16 03:47:51,797 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 35.0) internal successors, (105), 3 states have internal predecessors, (105), 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 105 [2024-11-16 03:47:51,798 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-16 03:47:51,799 INFO L225 Difference]: With dead ends: 568 [2024-11-16 03:47:51,799 INFO L226 Difference]: Without dead ends: 565 [2024-11-16 03:47:51,800 INFO L431 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 [2024-11-16 03:47:51,801 INFO L432 NwaCegarLoop]: 9 mSDtfsCounter, 157 mSDsluCounter, 6 mSDsCounter, 0 mSdLazyCounter, 355 mSolverCounterSat, 73 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 157 SdHoareTripleChecker+Valid, 15 SdHoareTripleChecker+Invalid, 428 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 73 IncrementalHoareTripleChecker+Valid, 355 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-11-16 03:47:51,801 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [157 Valid, 15 Invalid, 428 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [73 Valid, 355 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-11-16 03:47:51,805 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 565 states. [2024-11-16 03:47:51,816 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 565 to 425. [2024-11-16 03:47:51,822 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 425 states, 424 states have (on average 1.4150943396226414) internal successors, (600), 424 states have internal predecessors, (600), 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) [2024-11-16 03:47:51,823 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 425 states to 425 states and 600 transitions. [2024-11-16 03:47:51,823 INFO L78 Accepts]: Start accepts. Automaton has 425 states and 600 transitions. Word has length 105 [2024-11-16 03:47:51,824 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-16 03:47:51,824 INFO L471 AbstractCegarLoop]: Abstraction has 425 states and 600 transitions. [2024-11-16 03:47:51,824 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 35.0) internal successors, (105), 3 states have internal predecessors, (105), 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) [2024-11-16 03:47:51,824 INFO L276 IsEmpty]: Start isEmpty. Operand 425 states and 600 transitions. [2024-11-16 03:47:51,826 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 109 [2024-11-16 03:47:51,826 INFO L207 NwaCegarLoop]: Found error trace [2024-11-16 03:47:51,826 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-16 03:47:51,826 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-11-16 03:47:51,827 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-16 03:47:51,827 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 03:47:51,827 INFO L85 PathProgramCache]: Analyzing trace with hash 24236639, now seen corresponding path program 1 times [2024-11-16 03:47:51,827 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-16 03:47:51,827 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [418020591] [2024-11-16 03:47:51,827 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 03:47:51,827 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-16 03:47:51,849 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 03:47:51,935 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 25 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-16 03:47:51,935 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-16 03:47:51,935 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [418020591] [2024-11-16 03:47:51,935 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [418020591] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-16 03:47:51,935 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-16 03:47:51,935 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-16 03:47:51,935 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1258075010] [2024-11-16 03:47:51,935 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-16 03:47:51,936 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-16 03:47:51,936 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-16 03:47:51,936 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-16 03:47:51,936 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-16 03:47:51,937 INFO L87 Difference]: Start difference. First operand 425 states and 600 transitions. Second operand has 3 states, 3 states have (on average 36.0) internal successors, (108), 2 states have internal predecessors, (108), 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) [2024-11-16 03:47:52,359 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-16 03:47:52,360 INFO L93 Difference]: Finished difference Result 1268 states and 1794 transitions. [2024-11-16 03:47:52,360 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-16 03:47:52,360 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 36.0) internal successors, (108), 2 states have internal predecessors, (108), 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 108 [2024-11-16 03:47:52,361 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-16 03:47:52,363 INFO L225 Difference]: With dead ends: 1268 [2024-11-16 03:47:52,365 INFO L226 Difference]: Without dead ends: 845 [2024-11-16 03:47:52,367 INFO L431 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 [2024-11-16 03:47:52,367 INFO L432 NwaCegarLoop]: 29 mSDtfsCounter, 64 mSDsluCounter, 6 mSDsCounter, 0 mSdLazyCounter, 376 mSolverCounterSat, 72 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 64 SdHoareTripleChecker+Valid, 35 SdHoareTripleChecker+Invalid, 448 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 72 IncrementalHoareTripleChecker+Valid, 376 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-11-16 03:47:52,368 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [64 Valid, 35 Invalid, 448 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [72 Valid, 376 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-11-16 03:47:52,369 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 845 states. [2024-11-16 03:47:52,375 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 845 to 705. [2024-11-16 03:47:52,376 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 705 states, 704 states have (on average 1.3849431818181819) internal successors, (975), 704 states have internal predecessors, (975), 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) [2024-11-16 03:47:52,381 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 705 states to 705 states and 975 transitions. [2024-11-16 03:47:52,381 INFO L78 Accepts]: Start accepts. Automaton has 705 states and 975 transitions. Word has length 108 [2024-11-16 03:47:52,382 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-16 03:47:52,382 INFO L471 AbstractCegarLoop]: Abstraction has 705 states and 975 transitions. [2024-11-16 03:47:52,382 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 36.0) internal successors, (108), 2 states have internal predecessors, (108), 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) [2024-11-16 03:47:52,382 INFO L276 IsEmpty]: Start isEmpty. Operand 705 states and 975 transitions. [2024-11-16 03:47:52,384 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 125 [2024-11-16 03:47:52,384 INFO L207 NwaCegarLoop]: Found error trace [2024-11-16 03:47:52,384 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-16 03:47:52,384 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-11-16 03:47:52,384 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-16 03:47:52,385 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 03:47:52,385 INFO L85 PathProgramCache]: Analyzing trace with hash 128696455, now seen corresponding path program 1 times [2024-11-16 03:47:52,385 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-16 03:47:52,385 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [924758739] [2024-11-16 03:47:52,385 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 03:47:52,385 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-16 03:47:52,408 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 03:47:52,484 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 25 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-16 03:47:52,484 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-16 03:47:52,484 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [924758739] [2024-11-16 03:47:52,484 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [924758739] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-16 03:47:52,484 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-16 03:47:52,485 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-16 03:47:52,485 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [610098345] [2024-11-16 03:47:52,485 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-16 03:47:52,485 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-16 03:47:52,485 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-16 03:47:52,486 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-16 03:47:52,486 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-16 03:47:52,486 INFO L87 Difference]: Start difference. First operand 705 states and 975 transitions. Second operand has 3 states, 3 states have (on average 41.333333333333336) internal successors, (124), 2 states have internal predecessors, (124), 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) [2024-11-16 03:47:52,848 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-16 03:47:52,848 INFO L93 Difference]: Finished difference Result 1968 states and 2728 transitions. [2024-11-16 03:47:52,848 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-16 03:47:52,849 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 41.333333333333336) internal successors, (124), 2 states have internal predecessors, (124), 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 124 [2024-11-16 03:47:52,849 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-16 03:47:52,854 INFO L225 Difference]: With dead ends: 1968 [2024-11-16 03:47:52,854 INFO L226 Difference]: Without dead ends: 1265 [2024-11-16 03:47:52,855 INFO L431 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 [2024-11-16 03:47:52,857 INFO L432 NwaCegarLoop]: 75 mSDtfsCounter, 50 mSDsluCounter, 4 mSDsCounter, 0 mSdLazyCounter, 360 mSolverCounterSat, 70 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 50 SdHoareTripleChecker+Valid, 79 SdHoareTripleChecker+Invalid, 430 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 70 IncrementalHoareTripleChecker+Valid, 360 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-11-16 03:47:52,857 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [50 Valid, 79 Invalid, 430 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [70 Valid, 360 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-11-16 03:47:52,858 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1265 states. [2024-11-16 03:47:52,873 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1265 to 1125. [2024-11-16 03:47:52,874 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1125 states, 1124 states have (on average 1.2855871886120998) internal successors, (1445), 1124 states have internal predecessors, (1445), 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) [2024-11-16 03:47:52,876 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1125 states to 1125 states and 1445 transitions. [2024-11-16 03:47:52,877 INFO L78 Accepts]: Start accepts. Automaton has 1125 states and 1445 transitions. Word has length 124 [2024-11-16 03:47:52,877 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-16 03:47:52,877 INFO L471 AbstractCegarLoop]: Abstraction has 1125 states and 1445 transitions. [2024-11-16 03:47:52,877 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 41.333333333333336) internal successors, (124), 2 states have internal predecessors, (124), 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) [2024-11-16 03:47:52,878 INFO L276 IsEmpty]: Start isEmpty. Operand 1125 states and 1445 transitions. [2024-11-16 03:47:52,880 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 185 [2024-11-16 03:47:52,880 INFO L207 NwaCegarLoop]: Found error trace [2024-11-16 03:47:52,880 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-16 03:47:52,880 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-11-16 03:47:52,880 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-16 03:47:52,881 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 03:47:52,881 INFO L85 PathProgramCache]: Analyzing trace with hash 920352831, now seen corresponding path program 1 times [2024-11-16 03:47:52,881 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-16 03:47:52,881 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [864321617] [2024-11-16 03:47:52,882 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 03:47:52,882 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-16 03:47:52,917 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 03:47:53,241 INFO L134 CoverageAnalysis]: Checked inductivity of 126 backedges. 126 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-16 03:47:53,241 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-16 03:47:53,241 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [864321617] [2024-11-16 03:47:53,241 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [864321617] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-16 03:47:53,241 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-16 03:47:53,241 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-16 03:47:53,242 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1946938923] [2024-11-16 03:47:53,242 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-16 03:47:53,242 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-16 03:47:53,242 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-16 03:47:53,242 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-16 03:47:53,243 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2024-11-16 03:47:53,243 INFO L87 Difference]: Start difference. First operand 1125 states and 1445 transitions. Second operand has 7 states, 7 states have (on average 26.285714285714285) internal successors, (184), 6 states have internal predecessors, (184), 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) [2024-11-16 03:47:53,760 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-16 03:47:53,761 INFO L93 Difference]: Finished difference Result 2304 states and 2944 transitions. [2024-11-16 03:47:53,761 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-16 03:47:53,762 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 26.285714285714285) internal successors, (184), 6 states have internal predecessors, (184), 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 184 [2024-11-16 03:47:53,762 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-16 03:47:53,765 INFO L225 Difference]: With dead ends: 2304 [2024-11-16 03:47:53,767 INFO L226 Difference]: Without dead ends: 1125 [2024-11-16 03:47:53,768 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2024-11-16 03:47:53,770 INFO L432 NwaCegarLoop]: 12 mSDtfsCounter, 143 mSDsluCounter, 29 mSDsCounter, 0 mSdLazyCounter, 962 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 143 SdHoareTripleChecker+Valid, 41 SdHoareTripleChecker+Invalid, 962 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 962 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-11-16 03:47:53,772 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [143 Valid, 41 Invalid, 962 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 962 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2024-11-16 03:47:53,773 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1125 states. [2024-11-16 03:47:53,784 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1125 to 1125. [2024-11-16 03:47:53,785 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1125 states, 1124 states have (on average 1.2784697508896796) internal successors, (1437), 1124 states have internal predecessors, (1437), 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) [2024-11-16 03:47:53,788 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1125 states to 1125 states and 1437 transitions. [2024-11-16 03:47:53,788 INFO L78 Accepts]: Start accepts. Automaton has 1125 states and 1437 transitions. Word has length 184 [2024-11-16 03:47:53,789 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-16 03:47:53,789 INFO L471 AbstractCegarLoop]: Abstraction has 1125 states and 1437 transitions. [2024-11-16 03:47:53,789 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 26.285714285714285) internal successors, (184), 6 states have internal predecessors, (184), 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) [2024-11-16 03:47:53,789 INFO L276 IsEmpty]: Start isEmpty. Operand 1125 states and 1437 transitions. [2024-11-16 03:47:53,790 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 192 [2024-11-16 03:47:53,790 INFO L207 NwaCegarLoop]: Found error trace [2024-11-16 03:47:53,791 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2024-11-16 03:47:53,791 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-11-16 03:47:53,791 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-16 03:47:53,791 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 03:47:53,791 INFO L85 PathProgramCache]: Analyzing trace with hash -1888028728, now seen corresponding path program 1 times [2024-11-16 03:47:53,792 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-16 03:47:53,792 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [349327432] [2024-11-16 03:47:53,792 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 03:47:53,792 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-16 03:47:53,817 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 03:47:53,923 INFO L134 CoverageAnalysis]: Checked inductivity of 117 backedges. 117 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-16 03:47:53,924 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-16 03:47:53,924 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [349327432] [2024-11-16 03:47:53,924 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [349327432] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-16 03:47:53,924 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-16 03:47:53,924 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-16 03:47:53,924 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1573410598] [2024-11-16 03:47:53,925 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-16 03:47:53,925 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-16 03:47:53,925 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-16 03:47:53,925 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-16 03:47:53,925 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-16 03:47:53,926 INFO L87 Difference]: Start difference. First operand 1125 states and 1437 transitions. Second operand has 3 states, 3 states have (on average 63.666666666666664) internal successors, (191), 3 states have internal predecessors, (191), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-16 03:47:54,286 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-16 03:47:54,287 INFO L93 Difference]: Finished difference Result 2668 states and 3430 transitions. [2024-11-16 03:47:54,287 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-16 03:47:54,287 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 63.666666666666664) internal successors, (191), 3 states have internal predecessors, (191), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 191 [2024-11-16 03:47:54,288 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-16 03:47:54,291 INFO L225 Difference]: With dead ends: 2668 [2024-11-16 03:47:54,291 INFO L226 Difference]: Without dead ends: 1545 [2024-11-16 03:47:54,293 INFO L431 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 [2024-11-16 03:47:54,294 INFO L432 NwaCegarLoop]: 212 mSDtfsCounter, 50 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 339 mSolverCounterSat, 59 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 50 SdHoareTripleChecker+Valid, 219 SdHoareTripleChecker+Invalid, 398 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 59 IncrementalHoareTripleChecker+Valid, 339 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-11-16 03:47:54,294 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [50 Valid, 219 Invalid, 398 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [59 Valid, 339 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-11-16 03:47:54,296 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1545 states. [2024-11-16 03:47:54,310 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1545 to 1125. [2024-11-16 03:47:54,311 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1125 states, 1124 states have (on average 1.2704626334519573) internal successors, (1428), 1124 states have internal predecessors, (1428), 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) [2024-11-16 03:47:54,314 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1125 states to 1125 states and 1428 transitions. [2024-11-16 03:47:54,314 INFO L78 Accepts]: Start accepts. Automaton has 1125 states and 1428 transitions. Word has length 191 [2024-11-16 03:47:54,314 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-16 03:47:54,314 INFO L471 AbstractCegarLoop]: Abstraction has 1125 states and 1428 transitions. [2024-11-16 03:47:54,314 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 63.666666666666664) internal successors, (191), 3 states have internal predecessors, (191), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-16 03:47:54,315 INFO L276 IsEmpty]: Start isEmpty. Operand 1125 states and 1428 transitions. [2024-11-16 03:47:54,316 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 202 [2024-11-16 03:47:54,316 INFO L207 NwaCegarLoop]: Found error trace [2024-11-16 03:47:54,316 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2024-11-16 03:47:54,317 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-11-16 03:47:54,317 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-16 03:47:54,317 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 03:47:54,317 INFO L85 PathProgramCache]: Analyzing trace with hash -1799102337, now seen corresponding path program 1 times [2024-11-16 03:47:54,317 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-16 03:47:54,318 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1296304155] [2024-11-16 03:47:54,318 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 03:47:54,319 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-16 03:47:54,349 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 03:47:54,495 INFO L134 CoverageAnalysis]: Checked inductivity of 129 backedges. 103 proven. 0 refuted. 0 times theorem prover too weak. 26 trivial. 0 not checked. [2024-11-16 03:47:54,495 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-16 03:47:54,496 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1296304155] [2024-11-16 03:47:54,496 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1296304155] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-16 03:47:54,496 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-16 03:47:54,496 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-16 03:47:54,497 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [583938632] [2024-11-16 03:47:54,497 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-16 03:47:54,498 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-16 03:47:54,498 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-16 03:47:54,498 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-16 03:47:54,498 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-16 03:47:54,498 INFO L87 Difference]: Start difference. First operand 1125 states and 1428 transitions. Second operand has 3 states, 3 states have (on average 58.666666666666664) internal successors, (176), 2 states have internal predecessors, (176), 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) [2024-11-16 03:47:54,808 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-16 03:47:54,808 INFO L93 Difference]: Finished difference Result 2388 states and 3003 transitions. [2024-11-16 03:47:54,808 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-16 03:47:54,808 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 58.666666666666664) internal successors, (176), 2 states have internal predecessors, (176), 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 201 [2024-11-16 03:47:54,809 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-16 03:47:54,812 INFO L225 Difference]: With dead ends: 2388 [2024-11-16 03:47:54,812 INFO L226 Difference]: Without dead ends: 1265 [2024-11-16 03:47:54,813 INFO L431 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 [2024-11-16 03:47:54,813 INFO L432 NwaCegarLoop]: 80 mSDtfsCounter, 49 mSDsluCounter, 6 mSDsCounter, 0 mSdLazyCounter, 351 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 49 SdHoareTripleChecker+Valid, 86 SdHoareTripleChecker+Invalid, 355 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 351 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-11-16 03:47:54,814 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [49 Valid, 86 Invalid, 355 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 351 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-11-16 03:47:54,816 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1265 states. [2024-11-16 03:47:54,827 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1265 to 1265. [2024-11-16 03:47:54,828 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1265 states, 1264 states have (on average 1.2436708860759493) internal successors, (1572), 1264 states have internal predecessors, (1572), 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) [2024-11-16 03:47:54,830 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1265 states to 1265 states and 1572 transitions. [2024-11-16 03:47:54,830 INFO L78 Accepts]: Start accepts. Automaton has 1265 states and 1572 transitions. Word has length 201 [2024-11-16 03:47:54,830 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-16 03:47:54,830 INFO L471 AbstractCegarLoop]: Abstraction has 1265 states and 1572 transitions. [2024-11-16 03:47:54,831 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 58.666666666666664) internal successors, (176), 2 states have internal predecessors, (176), 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) [2024-11-16 03:47:54,831 INFO L276 IsEmpty]: Start isEmpty. Operand 1265 states and 1572 transitions. [2024-11-16 03:47:54,832 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 221 [2024-11-16 03:47:54,832 INFO L207 NwaCegarLoop]: Found error trace [2024-11-16 03:47:54,832 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2024-11-16 03:47:54,833 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-11-16 03:47:54,833 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-16 03:47:54,833 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 03:47:54,833 INFO L85 PathProgramCache]: Analyzing trace with hash -1307932571, now seen corresponding path program 1 times [2024-11-16 03:47:54,833 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-16 03:47:54,833 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1555425472] [2024-11-16 03:47:54,833 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 03:47:54,834 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-16 03:47:54,874 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 03:47:54,991 INFO L134 CoverageAnalysis]: Checked inductivity of 129 backedges. 129 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-16 03:47:54,991 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-16 03:47:54,992 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1555425472] [2024-11-16 03:47:54,992 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1555425472] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-16 03:47:54,992 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-16 03:47:54,992 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-16 03:47:54,992 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1581814544] [2024-11-16 03:47:54,992 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-16 03:47:54,993 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-16 03:47:54,993 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-16 03:47:54,993 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-16 03:47:54,993 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-16 03:47:54,994 INFO L87 Difference]: Start difference. First operand 1265 states and 1572 transitions. Second operand has 3 states, 3 states have (on average 73.33333333333333) internal successors, (220), 3 states have internal predecessors, (220), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-16 03:47:55,335 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-16 03:47:55,336 INFO L93 Difference]: Finished difference Result 2808 states and 3556 transitions. [2024-11-16 03:47:55,337 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-16 03:47:55,337 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 73.33333333333333) internal successors, (220), 3 states have internal predecessors, (220), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 220 [2024-11-16 03:47:55,337 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-16 03:47:55,341 INFO L225 Difference]: With dead ends: 2808 [2024-11-16 03:47:55,341 INFO L226 Difference]: Without dead ends: 1685 [2024-11-16 03:47:55,342 INFO L431 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 [2024-11-16 03:47:55,343 INFO L432 NwaCegarLoop]: 188 mSDtfsCounter, 75 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 362 mSolverCounterSat, 52 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 75 SdHoareTripleChecker+Valid, 195 SdHoareTripleChecker+Invalid, 414 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 52 IncrementalHoareTripleChecker+Valid, 362 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-11-16 03:47:55,344 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [75 Valid, 195 Invalid, 414 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [52 Valid, 362 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-11-16 03:47:55,347 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1685 states. [2024-11-16 03:47:55,360 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1685 to 1545. [2024-11-16 03:47:55,362 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1545 states, 1544 states have (on average 1.1683937823834196) internal successors, (1804), 1544 states have internal predecessors, (1804), 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) [2024-11-16 03:47:55,363 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1545 states to 1545 states and 1804 transitions. [2024-11-16 03:47:55,364 INFO L78 Accepts]: Start accepts. Automaton has 1545 states and 1804 transitions. Word has length 220 [2024-11-16 03:47:55,364 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-16 03:47:55,364 INFO L471 AbstractCegarLoop]: Abstraction has 1545 states and 1804 transitions. [2024-11-16 03:47:55,364 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 73.33333333333333) internal successors, (220), 3 states have internal predecessors, (220), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-16 03:47:55,364 INFO L276 IsEmpty]: Start isEmpty. Operand 1545 states and 1804 transitions. [2024-11-16 03:47:55,367 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 332 [2024-11-16 03:47:55,367 INFO L207 NwaCegarLoop]: Found error trace [2024-11-16 03:47:55,367 INFO L215 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2024-11-16 03:47:55,367 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-11-16 03:47:55,367 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-16 03:47:55,368 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 03:47:55,368 INFO L85 PathProgramCache]: Analyzing trace with hash 2092023451, now seen corresponding path program 1 times [2024-11-16 03:47:55,368 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-16 03:47:55,368 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1672581176] [2024-11-16 03:47:55,368 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 03:47:55,368 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-16 03:47:55,406 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 03:47:55,711 INFO L134 CoverageAnalysis]: Checked inductivity of 335 backedges. 77 proven. 0 refuted. 0 times theorem prover too weak. 258 trivial. 0 not checked. [2024-11-16 03:47:55,712 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-16 03:47:55,712 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1672581176] [2024-11-16 03:47:55,712 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1672581176] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-16 03:47:55,712 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-16 03:47:55,712 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-16 03:47:55,712 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [941703856] [2024-11-16 03:47:55,712 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-16 03:47:55,713 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-16 03:47:55,713 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-16 03:47:55,713 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-16 03:47:55,713 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-16 03:47:55,713 INFO L87 Difference]: Start difference. First operand 1545 states and 1804 transitions. Second operand has 3 states, 3 states have (on average 49.333333333333336) internal successors, (148), 3 states have internal predecessors, (148), 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) [2024-11-16 03:47:56,039 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-16 03:47:56,040 INFO L93 Difference]: Finished difference Result 1825 states and 2109 transitions. [2024-11-16 03:47:56,040 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-16 03:47:56,040 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 49.333333333333336) internal successors, (148), 3 states have internal predecessors, (148), 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 331 [2024-11-16 03:47:56,041 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-16 03:47:56,041 INFO L225 Difference]: With dead ends: 1825 [2024-11-16 03:47:56,041 INFO L226 Difference]: Without dead ends: 0 [2024-11-16 03:47:56,042 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-16 03:47:56,043 INFO L432 NwaCegarLoop]: 6 mSDtfsCounter, 157 mSDsluCounter, 4 mSDsCounter, 0 mSdLazyCounter, 350 mSolverCounterSat, 54 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 157 SdHoareTripleChecker+Valid, 10 SdHoareTripleChecker+Invalid, 404 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 54 IncrementalHoareTripleChecker+Valid, 350 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-11-16 03:47:56,043 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [157 Valid, 10 Invalid, 404 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [54 Valid, 350 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-11-16 03:47:56,043 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2024-11-16 03:47:56,043 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2024-11-16 03:47:56,043 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) [2024-11-16 03:47:56,044 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2024-11-16 03:47:56,044 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 331 [2024-11-16 03:47:56,044 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-16 03:47:56,044 INFO L471 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2024-11-16 03:47:56,044 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 49.333333333333336) internal successors, (148), 3 states have internal predecessors, (148), 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) [2024-11-16 03:47:56,044 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2024-11-16 03:47:56,047 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2024-11-16 03:47:56,049 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2024-11-16 03:47:56,049 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2024-11-16 03:47:56,053 INFO L407 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-16 03:47:56,055 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2024-11-16 03:47:56,210 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2024-11-16 03:47:56,223 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 16.11 03:47:56 BoogieIcfgContainer [2024-11-16 03:47:56,223 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-11-16 03:47:56,223 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-11-16 03:47:56,223 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-11-16 03:47:56,223 INFO L274 PluginConnector]: Witness Printer initialized [2024-11-16 03:47:56,224 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 16.11 03:47:49" (3/4) ... [2024-11-16 03:47:56,225 INFO L143 WitnessPrinter]: Generating witness for correct program [2024-11-16 03:47:56,238 INFO L925 BoogieBacktranslator]: Reduced CFG by removing 15 nodes and edges [2024-11-16 03:47:56,241 INFO L925 BoogieBacktranslator]: Reduced CFG by removing 4 nodes and edges [2024-11-16 03:47:56,242 INFO L925 BoogieBacktranslator]: Reduced CFG by removing 3 nodes and edges [2024-11-16 03:47:56,242 INFO L925 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2024-11-16 03:47:56,345 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2024-11-16 03:47:56,345 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.yml [2024-11-16 03:47:56,346 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-11-16 03:47:56,348 INFO L158 Benchmark]: Toolchain (without parser) took 8131.96ms. Allocated memory was 190.8MB in the beginning and 289.4MB in the end (delta: 98.6MB). Free memory was 119.6MB in the beginning and 117.9MB in the end (delta: 1.7MB). Peak memory consumption was 102.7MB. Max. memory is 16.1GB. [2024-11-16 03:47:56,348 INFO L158 Benchmark]: CDTParser took 0.11ms. Allocated memory is still 117.4MB. Free memory was 82.6MB in the beginning and 82.5MB in the end (delta: 159.5kB). There was no memory consumed. Max. memory is 16.1GB. [2024-11-16 03:47:56,349 INFO L158 Benchmark]: CACSL2BoogieTranslator took 421.11ms. Allocated memory is still 190.8MB. Free memory was 119.3MB in the beginning and 89.6MB in the end (delta: 29.7MB). Peak memory consumption was 29.4MB. Max. memory is 16.1GB. [2024-11-16 03:47:56,349 INFO L158 Benchmark]: Boogie Procedure Inliner took 94.25ms. Allocated memory is still 190.8MB. Free memory was 89.6MB in the beginning and 156.6MB in the end (delta: -67.0MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB. [2024-11-16 03:47:56,349 INFO L158 Benchmark]: Boogie Preprocessor took 105.95ms. Allocated memory is still 190.8MB. Free memory was 156.6MB in the beginning and 147.3MB in the end (delta: 9.3MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. [2024-11-16 03:47:56,349 INFO L158 Benchmark]: IcfgBuilder took 849.56ms. Allocated memory is still 190.8MB. Free memory was 147.3MB in the beginning and 137.9MB in the end (delta: 9.4MB). Peak memory consumption was 84.7MB. Max. memory is 16.1GB. [2024-11-16 03:47:56,350 INFO L158 Benchmark]: TraceAbstraction took 6534.07ms. Allocated memory was 190.8MB in the beginning and 289.4MB in the end (delta: 98.6MB). Free memory was 136.9MB in the beginning and 129.5MB in the end (delta: 7.4MB). Peak memory consumption was 105.9MB. Max. memory is 16.1GB. [2024-11-16 03:47:56,350 INFO L158 Benchmark]: Witness Printer took 122.62ms. Allocated memory is still 289.4MB. Free memory was 129.5MB in the beginning and 117.9MB in the end (delta: 11.5MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. [2024-11-16 03:47:56,351 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.11ms. Allocated memory is still 117.4MB. Free memory was 82.6MB in the beginning and 82.5MB in the end (delta: 159.5kB). There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 421.11ms. Allocated memory is still 190.8MB. Free memory was 119.3MB in the beginning and 89.6MB in the end (delta: 29.7MB). Peak memory consumption was 29.4MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 94.25ms. Allocated memory is still 190.8MB. Free memory was 89.6MB in the beginning and 156.6MB in the end (delta: -67.0MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB. * Boogie Preprocessor took 105.95ms. Allocated memory is still 190.8MB. Free memory was 156.6MB in the beginning and 147.3MB in the end (delta: 9.3MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. * IcfgBuilder took 849.56ms. Allocated memory is still 190.8MB. Free memory was 147.3MB in the beginning and 137.9MB in the end (delta: 9.4MB). Peak memory consumption was 84.7MB. Max. memory is 16.1GB. * TraceAbstraction took 6534.07ms. Allocated memory was 190.8MB in the beginning and 289.4MB in the end (delta: 98.6MB). Free memory was 136.9MB in the beginning and 129.5MB in the end (delta: 7.4MB). Peak memory consumption was 105.9MB. Max. memory is 16.1GB. * Witness Printer took 122.62ms. Allocated memory is still 289.4MB. Free memory was 129.5MB in the beginning and 117.9MB in the end (delta: 11.5MB). Peak memory consumption was 12.6MB. 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: 95]: 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, 209 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 6.3s, OverallIterations: 10, TraceHistogramMax: 4, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 4.1s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 1016 SdHoareTripleChecker+Valid, 3.8s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 1016 mSDsluCounter, 797 SdHoareTripleChecker+Invalid, 3.1s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 82 mSDsCounter, 619 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 4213 IncrementalHoareTripleChecker+Invalid, 4832 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 619 mSolverCounterUnsat, 715 mSDtfsCounter, 4213 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 31 GetRequests, 17 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=1545occurred in iteration=9, InterpolantAutomatonStates: 34, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.2s AutomataMinimizationTime, 10 MinimizatonAttempts, 980 StatesRemovedByMinimization, 5 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 1.5s InterpolantComputationTime, 1592 NumberOfCodeBlocks, 1592 NumberOfCodeBlocksAsserted, 10 NumberOfCheckSat, 1582 ConstructedInterpolants, 0 QuantifiedInterpolants, 4132 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 10 InterpolantComputations, 10 PerfectInterpolantSequences, 936/936 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 - AllSpecificationsHoldResult: All specifications hold 1 specifications checked. All of them hold - InvariantResult [Line: 592]: Location Invariant Derived location invariant: null RESULT: Ultimate proved your program to be correct! [2024-11-16 03:47:56,384 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Result: TRUE