./Ultimate.py --spec /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/properties/unreach-call.prp --file /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/eca-rers2012/Problem10_label14.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version fca748b1 Calling Ultimate with: /root/.sdkman/candidates/java/current/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 /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/eca-rers2012/Problem10_label14.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 44291f101ed3e7fb4c7970a4074f60b073a885b55c43de2ec3cb5a39e62e8317 --- Real Ultimate output --- This is Ultimate 0.2.5-wip.dd.update-z3-fca748b-m [2024-11-19 18:00:16,329 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-19 18:00:16,395 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-11-19 18:00:16,399 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-19 18:00:16,400 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-19 18:00:16,436 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-19 18:00:16,437 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-19 18:00:16,437 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-19 18:00:16,438 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-19 18:00:16,443 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-19 18:00:16,443 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-19 18:00:16,444 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-19 18:00:16,444 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-19 18:00:16,445 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-19 18:00:16,445 INFO L153 SettingsManager]: * Use SBE=true [2024-11-19 18:00:16,445 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-19 18:00:16,445 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-19 18:00:16,446 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-19 18:00:16,446 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-19 18:00:16,446 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-19 18:00:16,446 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-19 18:00:16,448 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-19 18:00:16,449 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-19 18:00:16,449 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-19 18:00:16,449 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-19 18:00:16,450 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-19 18:00:16,450 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-19 18:00:16,450 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-19 18:00:16,450 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-19 18:00:16,451 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-19 18:00:16,451 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-19 18:00:16,451 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-19 18:00:16,451 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-19 18:00:16,451 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-19 18:00:16,452 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-19 18:00:16,452 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-19 18:00:16,452 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-19 18:00:16,453 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-19 18:00:16,453 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-19 18:00:16,454 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-19 18:00:16,454 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-19 18:00:16,455 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-19 18:00:16,455 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 -> 44291f101ed3e7fb4c7970a4074f60b073a885b55c43de2ec3cb5a39e62e8317 [2024-11-19 18:00:16,740 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-19 18:00:16,767 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-19 18:00:16,770 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-19 18:00:16,771 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-19 18:00:16,772 INFO L274 PluginConnector]: CDTParser initialized [2024-11-19 18:00:16,773 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/eca-rers2012/Problem10_label14.c [2024-11-19 18:00:18,317 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-19 18:00:18,589 INFO L384 CDTParser]: Found 1 translation units. [2024-11-19 18:00:18,590 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/eca-rers2012/Problem10_label14.c [2024-11-19 18:00:18,606 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/403543e3a/0fdf2d3627b14ff3b6a74eb2f0c95448/FLAG1c5ca1460 [2024-11-19 18:00:18,621 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/403543e3a/0fdf2d3627b14ff3b6a74eb2f0c95448 [2024-11-19 18:00:18,623 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-19 18:00:18,624 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-19 18:00:18,625 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-19 18:00:18,625 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-19 18:00:18,629 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-19 18:00:18,630 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 19.11 06:00:18" (1/1) ... [2024-11-19 18:00:18,631 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6be7b08d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 06:00:18, skipping insertion in model container [2024-11-19 18:00:18,631 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 19.11 06:00:18" (1/1) ... [2024-11-19 18:00:18,682 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-19 18:00:18,894 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_label14.c[3703,3716] [2024-11-19 18:00:19,059 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-19 18:00:19,076 INFO L200 MainTranslator]: Completed pre-run [2024-11-19 18:00:19,101 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_label14.c[3703,3716] [2024-11-19 18:00:19,171 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-19 18:00:19,187 INFO L204 MainTranslator]: Completed translation [2024-11-19 18:00:19,188 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 06:00:19 WrapperNode [2024-11-19 18:00:19,188 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-19 18:00:19,189 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-19 18:00:19,189 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-19 18:00:19,189 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-19 18:00:19,196 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 06:00:19" (1/1) ... [2024-11-19 18:00:19,214 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 06:00:19" (1/1) ... [2024-11-19 18:00:19,266 INFO L138 Inliner]: procedures = 14, calls = 8, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 598 [2024-11-19 18:00:19,267 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-19 18:00:19,267 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-19 18:00:19,267 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-19 18:00:19,268 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-19 18:00:19,278 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 06:00:19" (1/1) ... [2024-11-19 18:00:19,279 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 06:00:19" (1/1) ... [2024-11-19 18:00:19,288 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 06:00:19" (1/1) ... [2024-11-19 18:00:19,331 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-19 18:00:19,332 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 06:00:19" (1/1) ... [2024-11-19 18:00:19,332 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 06:00:19" (1/1) ... [2024-11-19 18:00:19,359 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 06:00:19" (1/1) ... [2024-11-19 18:00:19,366 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 06:00:19" (1/1) ... [2024-11-19 18:00:19,374 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 06:00:19" (1/1) ... [2024-11-19 18:00:19,381 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 06:00:19" (1/1) ... [2024-11-19 18:00:19,388 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-19 18:00:19,389 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-19 18:00:19,390 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-19 18:00:19,390 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-19 18:00:19,391 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 06:00:19" (1/1) ... [2024-11-19 18:00:19,396 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-19 18:00:19,406 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-19 18:00:19,422 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-19 18:00:19,425 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-19 18:00:19,471 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-19 18:00:19,471 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-11-19 18:00:19,472 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-19 18:00:19,472 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-19 18:00:19,537 INFO L238 CfgBuilder]: Building ICFG [2024-11-19 18:00:19,539 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-19 18:00:20,605 INFO L? ?]: Removed 84 outVars from TransFormulas that were not future-live. [2024-11-19 18:00:20,606 INFO L287 CfgBuilder]: Performing block encoding [2024-11-19 18:00:20,632 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-19 18:00:20,633 INFO L316 CfgBuilder]: Removed 1 assume(true) statements. [2024-11-19 18:00:20,635 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.11 06:00:20 BoogieIcfgContainer [2024-11-19 18:00:20,635 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-19 18:00:20,637 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-19 18:00:20,637 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-19 18:00:20,640 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-19 18:00:20,641 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 19.11 06:00:18" (1/3) ... [2024-11-19 18:00:20,642 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@134659d4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 19.11 06:00:20, skipping insertion in model container [2024-11-19 18:00:20,642 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 06:00:19" (2/3) ... [2024-11-19 18:00:20,643 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@134659d4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 19.11 06:00:20, skipping insertion in model container [2024-11-19 18:00:20,643 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.11 06:00:20" (3/3) ... [2024-11-19 18:00:20,645 INFO L112 eAbstractionObserver]: Analyzing ICFG Problem10_label14.c [2024-11-19 18:00:20,663 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-19 18:00:20,663 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-11-19 18:00:20,744 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-19 18:00:20,751 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;@386d8ea5, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-19 18:00:20,752 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-19 18:00:20,758 INFO L276 IsEmpty]: Start isEmpty. Operand has 206 states, 204 states have (on average 1.6862745098039216) internal successors, (344), 205 states have internal predecessors, (344), 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-19 18:00:20,766 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2024-11-19 18:00:20,767 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 18:00:20,768 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, 1, 1] [2024-11-19 18:00:20,769 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-19 18:00:20,775 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 18:00:20,776 INFO L85 PathProgramCache]: Analyzing trace with hash -1843609039, now seen corresponding path program 1 times [2024-11-19 18:00:20,785 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 18:00:20,786 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2073698082] [2024-11-19 18:00:20,786 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 18:00:20,786 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 18:00:20,922 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 18:00:21,148 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-19 18:00:21,149 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 18:00:21,149 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2073698082] [2024-11-19 18:00:21,150 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2073698082] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 18:00:21,150 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 18:00:21,150 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-19 18:00:21,152 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1063458531] [2024-11-19 18:00:21,153 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 18:00:21,157 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-19 18:00:21,157 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 18:00:21,185 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-19 18:00:21,186 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-19 18:00:21,190 INFO L87 Difference]: Start difference. First operand has 206 states, 204 states have (on average 1.6862745098039216) internal successors, (344), 205 states have internal predecessors, (344), 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 10.333333333333334) internal successors, (31), 2 states have internal predecessors, (31), 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-19 18:00:22,075 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 18:00:22,075 INFO L93 Difference]: Finished difference Result 567 states and 981 transitions. [2024-11-19 18:00:22,077 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-19 18:00:22,079 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 10.333333333333334) internal successors, (31), 2 states have internal predecessors, (31), 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 31 [2024-11-19 18:00:22,079 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 18:00:22,092 INFO L225 Difference]: With dead ends: 567 [2024-11-19 18:00:22,092 INFO L226 Difference]: Without dead ends: 282 [2024-11-19 18:00:22,097 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-19 18:00:22,102 INFO L432 NwaCegarLoop]: 59 mSDtfsCounter, 147 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 451 mSolverCounterSat, 117 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 147 SdHoareTripleChecker+Valid, 66 SdHoareTripleChecker+Invalid, 568 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 117 IncrementalHoareTripleChecker+Valid, 451 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2024-11-19 18:00:22,104 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [147 Valid, 66 Invalid, 568 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [117 Valid, 451 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2024-11-19 18:00:22,124 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 282 states. [2024-11-19 18:00:22,173 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 282 to 282. [2024-11-19 18:00:22,176 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 282 states, 281 states have (on average 1.4661921708185053) internal successors, (412), 281 states have internal predecessors, (412), 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-19 18:00:22,177 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 282 states to 282 states and 412 transitions. [2024-11-19 18:00:22,180 INFO L78 Accepts]: Start accepts. Automaton has 282 states and 412 transitions. Word has length 31 [2024-11-19 18:00:22,180 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 18:00:22,181 INFO L471 AbstractCegarLoop]: Abstraction has 282 states and 412 transitions. [2024-11-19 18:00:22,181 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 10.333333333333334) internal successors, (31), 2 states have internal predecessors, (31), 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-19 18:00:22,181 INFO L276 IsEmpty]: Start isEmpty. Operand 282 states and 412 transitions. [2024-11-19 18:00:22,186 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 102 [2024-11-19 18:00:22,186 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 18:00:22,186 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, 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] [2024-11-19 18:00:22,187 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-19 18:00:22,187 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-19 18:00:22,189 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 18:00:22,189 INFO L85 PathProgramCache]: Analyzing trace with hash -1808415858, now seen corresponding path program 1 times [2024-11-19 18:00:22,189 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 18:00:22,190 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1705493858] [2024-11-19 18:00:22,191 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 18:00:22,191 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 18:00:22,268 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 18:00:22,433 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 28 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-19 18:00:22,433 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 18:00:22,434 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1705493858] [2024-11-19 18:00:22,434 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1705493858] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 18:00:22,434 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 18:00:22,434 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-19 18:00:22,435 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1912326861] [2024-11-19 18:00:22,435 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 18:00:22,437 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-19 18:00:22,438 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 18:00:22,439 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-19 18:00:22,440 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-19 18:00:22,440 INFO L87 Difference]: Start difference. First operand 282 states and 412 transitions. Second operand has 3 states, 3 states have (on average 33.666666666666664) internal successors, (101), 2 states have internal predecessors, (101), 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-19 18:00:22,882 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 18:00:22,883 INFO L93 Difference]: Finished difference Result 840 states and 1231 transitions. [2024-11-19 18:00:22,883 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-19 18:00:22,883 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 33.666666666666664) internal successors, (101), 2 states have internal predecessors, (101), 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 101 [2024-11-19 18:00:22,884 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 18:00:22,890 INFO L225 Difference]: With dead ends: 840 [2024-11-19 18:00:22,893 INFO L226 Difference]: Without dead ends: 560 [2024-11-19 18:00:22,894 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-19 18:00:22,897 INFO L432 NwaCegarLoop]: 63 mSDtfsCounter, 75 mSDsluCounter, 4 mSDsCounter, 0 mSdLazyCounter, 354 mSolverCounterSat, 70 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 75 SdHoareTripleChecker+Valid, 67 SdHoareTripleChecker+Invalid, 424 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 70 IncrementalHoareTripleChecker+Valid, 354 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-11-19 18:00:22,898 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [75 Valid, 67 Invalid, 424 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [70 Valid, 354 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-11-19 18:00:22,900 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 560 states. [2024-11-19 18:00:22,920 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 560 to 560. [2024-11-19 18:00:22,922 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 560 states, 559 states have (on average 1.3059033989266546) internal successors, (730), 559 states have internal predecessors, (730), 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-19 18:00:22,936 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 560 states to 560 states and 730 transitions. [2024-11-19 18:00:22,937 INFO L78 Accepts]: Start accepts. Automaton has 560 states and 730 transitions. Word has length 101 [2024-11-19 18:00:22,937 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 18:00:22,938 INFO L471 AbstractCegarLoop]: Abstraction has 560 states and 730 transitions. [2024-11-19 18:00:22,938 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 33.666666666666664) internal successors, (101), 2 states have internal predecessors, (101), 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-19 18:00:22,938 INFO L276 IsEmpty]: Start isEmpty. Operand 560 states and 730 transitions. [2024-11-19 18:00:22,941 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 107 [2024-11-19 18:00:22,941 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 18:00:22,942 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, 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] [2024-11-19 18:00:22,942 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-19 18:00:22,942 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-19 18:00:22,943 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 18:00:22,943 INFO L85 PathProgramCache]: Analyzing trace with hash -890125352, now seen corresponding path program 1 times [2024-11-19 18:00:22,943 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 18:00:22,944 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [855072474] [2024-11-19 18:00:22,944 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 18:00:22,944 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 18:00:22,983 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 18:00:23,258 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 18 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-19 18:00:23,259 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 18:00:23,259 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [855072474] [2024-11-19 18:00:23,259 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [855072474] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-19 18:00:23,259 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2044350258] [2024-11-19 18:00:23,259 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 18:00:23,259 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-19 18:00:23,260 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-19 18:00:23,263 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-19 18:00:23,266 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2024-11-19 18:00:23,344 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 18:00:23,348 INFO L255 TraceCheckSpWp]: Trace formula consists of 186 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-11-19 18:00:23,354 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-19 18:00:23,451 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 28 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-19 18:00:23,451 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-19 18:00:23,452 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2044350258] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 18:00:23,452 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-19 18:00:23,452 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [4] total 6 [2024-11-19 18:00:23,452 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1225357700] [2024-11-19 18:00:23,452 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 18:00:23,453 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-19 18:00:23,453 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 18:00:23,457 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-19 18:00:23,457 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2024-11-19 18:00:23,458 INFO L87 Difference]: Start difference. First operand 560 states and 730 transitions. Second operand has 3 states, 3 states have (on average 35.333333333333336) internal successors, (106), 3 states have internal predecessors, (106), 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-19 18:00:24,017 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 18:00:24,017 INFO L93 Difference]: Finished difference Result 1396 states and 1867 transitions. [2024-11-19 18:00:24,018 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-19 18:00:24,019 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 35.333333333333336) internal successors, (106), 3 states have internal predecessors, (106), 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 106 [2024-11-19 18:00:24,019 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 18:00:24,024 INFO L225 Difference]: With dead ends: 1396 [2024-11-19 18:00:24,025 INFO L226 Difference]: Without dead ends: 838 [2024-11-19 18:00:24,026 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 109 GetRequests, 105 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2024-11-19 18:00:24,027 INFO L432 NwaCegarLoop]: 48 mSDtfsCounter, 124 mSDsluCounter, 4 mSDsCounter, 0 mSdLazyCounter, 360 mSolverCounterSat, 71 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 124 SdHoareTripleChecker+Valid, 52 SdHoareTripleChecker+Invalid, 431 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 71 IncrementalHoareTripleChecker+Valid, 360 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-11-19 18:00:24,027 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [124 Valid, 52 Invalid, 431 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [71 Valid, 360 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2024-11-19 18:00:24,029 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 838 states. [2024-11-19 18:00:24,058 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 838 to 838. [2024-11-19 18:00:24,063 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 838 states, 837 states have (on average 1.2939068100358424) internal successors, (1083), 837 states have internal predecessors, (1083), 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-19 18:00:24,066 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 838 states to 838 states and 1083 transitions. [2024-11-19 18:00:24,066 INFO L78 Accepts]: Start accepts. Automaton has 838 states and 1083 transitions. Word has length 106 [2024-11-19 18:00:24,067 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 18:00:24,067 INFO L471 AbstractCegarLoop]: Abstraction has 838 states and 1083 transitions. [2024-11-19 18:00:24,067 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 35.333333333333336) internal successors, (106), 3 states have internal predecessors, (106), 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-19 18:00:24,067 INFO L276 IsEmpty]: Start isEmpty. Operand 838 states and 1083 transitions. [2024-11-19 18:00:24,071 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 123 [2024-11-19 18:00:24,071 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 18:00:24,071 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, 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] [2024-11-19 18:00:24,082 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2024-11-19 18:00:24,274 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-19 18:00:24,275 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-19 18:00:24,276 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 18:00:24,276 INFO L85 PathProgramCache]: Analyzing trace with hash -1622121728, now seen corresponding path program 1 times [2024-11-19 18:00:24,276 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 18:00:24,276 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1189251168] [2024-11-19 18:00:24,277 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 18:00:24,277 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 18:00:24,322 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 18:00:24,453 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 28 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-19 18:00:24,453 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 18:00:24,453 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1189251168] [2024-11-19 18:00:24,454 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1189251168] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 18:00:24,454 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 18:00:24,454 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-19 18:00:24,454 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1693230724] [2024-11-19 18:00:24,454 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 18:00:24,454 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-19 18:00:24,455 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 18:00:24,455 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-19 18:00:24,455 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-19 18:00:24,456 INFO L87 Difference]: Start difference. First operand 838 states and 1083 transitions. Second operand has 3 states, 3 states have (on average 40.666666666666664) internal successors, (122), 2 states have internal predecessors, (122), 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-19 18:00:24,916 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 18:00:24,916 INFO L93 Difference]: Finished difference Result 2230 states and 2835 transitions. [2024-11-19 18:00:24,917 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-19 18:00:24,917 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 40.666666666666664) internal successors, (122), 2 states have internal predecessors, (122), 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 122 [2024-11-19 18:00:24,920 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 18:00:24,924 INFO L225 Difference]: With dead ends: 2230 [2024-11-19 18:00:24,925 INFO L226 Difference]: Without dead ends: 1394 [2024-11-19 18:00:24,927 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-19 18:00:24,939 INFO L432 NwaCegarLoop]: 31 mSDtfsCounter, 87 mSDsluCounter, 3 mSDsCounter, 0 mSdLazyCounter, 334 mSolverCounterSat, 68 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 87 SdHoareTripleChecker+Valid, 34 SdHoareTripleChecker+Invalid, 402 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 68 IncrementalHoareTripleChecker+Valid, 334 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-11-19 18:00:24,942 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [87 Valid, 34 Invalid, 402 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [68 Valid, 334 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-11-19 18:00:24,944 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1394 states. [2024-11-19 18:00:24,962 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1394 to 1255. [2024-11-19 18:00:24,963 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1255 states, 1254 states have (on average 1.2001594896331738) internal successors, (1505), 1254 states have internal predecessors, (1505), 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-19 18:00:24,967 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1255 states to 1255 states and 1505 transitions. [2024-11-19 18:00:24,967 INFO L78 Accepts]: Start accepts. Automaton has 1255 states and 1505 transitions. Word has length 122 [2024-11-19 18:00:24,968 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 18:00:24,968 INFO L471 AbstractCegarLoop]: Abstraction has 1255 states and 1505 transitions. [2024-11-19 18:00:24,968 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 40.666666666666664) internal successors, (122), 2 states have internal predecessors, (122), 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-19 18:00:24,969 INFO L276 IsEmpty]: Start isEmpty. Operand 1255 states and 1505 transitions. [2024-11-19 18:00:24,970 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 124 [2024-11-19 18:00:24,974 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 18:00:24,974 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, 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] [2024-11-19 18:00:24,975 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-11-19 18:00:24,975 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-19 18:00:24,975 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 18:00:24,975 INFO L85 PathProgramCache]: Analyzing trace with hash 661767557, now seen corresponding path program 1 times [2024-11-19 18:00:24,975 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 18:00:24,976 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [715137873] [2024-11-19 18:00:24,976 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 18:00:24,976 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 18:00:25,016 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 18:00:25,168 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 28 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-19 18:00:25,169 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 18:00:25,169 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [715137873] [2024-11-19 18:00:25,169 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [715137873] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 18:00:25,169 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 18:00:25,169 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-19 18:00:25,170 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1216770930] [2024-11-19 18:00:25,170 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 18:00:25,170 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-19 18:00:25,170 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 18:00:25,171 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-19 18:00:25,171 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-19 18:00:25,172 INFO L87 Difference]: Start difference. First operand 1255 states and 1505 transitions. Second operand has 3 states, 3 states have (on average 41.0) internal successors, (123), 2 states have internal predecessors, (123), 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-19 18:00:25,599 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 18:00:25,599 INFO L93 Difference]: Finished difference Result 2647 states and 3157 transitions. [2024-11-19 18:00:25,599 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-19 18:00:25,600 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 41.0) internal successors, (123), 2 states have internal predecessors, (123), 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 123 [2024-11-19 18:00:25,600 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 18:00:25,604 INFO L225 Difference]: With dead ends: 2647 [2024-11-19 18:00:25,605 INFO L226 Difference]: Without dead ends: 1394 [2024-11-19 18:00:25,606 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-19 18:00:25,607 INFO L432 NwaCegarLoop]: 78 mSDtfsCounter, 49 mSDsluCounter, 4 mSDsCounter, 0 mSdLazyCounter, 353 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 49 SdHoareTripleChecker+Valid, 82 SdHoareTripleChecker+Invalid, 357 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 353 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-11-19 18:00:25,608 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [49 Valid, 82 Invalid, 357 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 353 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-11-19 18:00:25,609 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1394 states. [2024-11-19 18:00:25,627 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1394 to 1394. [2024-11-19 18:00:25,629 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1394 states, 1393 states have (on average 1.183776022972003) internal successors, (1649), 1393 states have internal predecessors, (1649), 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-19 18:00:25,633 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1394 states to 1394 states and 1649 transitions. [2024-11-19 18:00:25,634 INFO L78 Accepts]: Start accepts. Automaton has 1394 states and 1649 transitions. Word has length 123 [2024-11-19 18:00:25,634 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 18:00:25,634 INFO L471 AbstractCegarLoop]: Abstraction has 1394 states and 1649 transitions. [2024-11-19 18:00:25,635 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 41.0) internal successors, (123), 2 states have internal predecessors, (123), 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-19 18:00:25,635 INFO L276 IsEmpty]: Start isEmpty. Operand 1394 states and 1649 transitions. [2024-11-19 18:00:25,637 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 190 [2024-11-19 18:00:25,637 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 18:00:25,638 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, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 18:00:25,638 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-11-19 18:00:25,638 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-19 18:00:25,639 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 18:00:25,639 INFO L85 PathProgramCache]: Analyzing trace with hash -1652535848, now seen corresponding path program 1 times [2024-11-19 18:00:25,639 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 18:00:25,639 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [851737201] [2024-11-19 18:00:25,639 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 18:00:25,640 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 18:00:25,684 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 18:00:25,956 INFO L134 CoverageAnalysis]: Checked inductivity of 122 backedges. 0 proven. 72 refuted. 0 times theorem prover too weak. 50 trivial. 0 not checked. [2024-11-19 18:00:25,957 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 18:00:25,957 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [851737201] [2024-11-19 18:00:25,957 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [851737201] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-19 18:00:25,957 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1457107606] [2024-11-19 18:00:25,959 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 18:00:25,960 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-19 18:00:25,960 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-19 18:00:25,962 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-19 18:00:25,965 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2024-11-19 18:00:26,049 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 18:00:26,052 INFO L255 TraceCheckSpWp]: Trace formula consists of 289 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-11-19 18:00:26,059 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-19 18:00:26,114 INFO L134 CoverageAnalysis]: Checked inductivity of 122 backedges. 57 proven. 0 refuted. 0 times theorem prover too weak. 65 trivial. 0 not checked. [2024-11-19 18:00:26,114 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-19 18:00:26,115 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1457107606] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 18:00:26,115 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-19 18:00:26,115 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [3] total 5 [2024-11-19 18:00:26,115 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1103310117] [2024-11-19 18:00:26,115 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 18:00:26,116 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-19 18:00:26,116 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 18:00:26,117 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-19 18:00:26,117 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-19 18:00:26,117 INFO L87 Difference]: Start difference. First operand 1394 states and 1649 transitions. Second operand has 3 states, 3 states have (on average 41.666666666666664) internal successors, (125), 3 states have internal predecessors, (125), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 18:00:26,556 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 18:00:26,557 INFO L93 Difference]: Finished difference Result 2925 states and 3521 transitions. [2024-11-19 18:00:26,557 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-19 18:00:26,558 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 41.666666666666664) internal successors, (125), 3 states have internal predecessors, (125), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 189 [2024-11-19 18:00:26,558 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 18:00:26,563 INFO L225 Difference]: With dead ends: 2925 [2024-11-19 18:00:26,563 INFO L226 Difference]: Without dead ends: 1672 [2024-11-19 18:00:26,565 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 191 GetRequests, 188 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-19 18:00:26,565 INFO L432 NwaCegarLoop]: 216 mSDtfsCounter, 113 mSDsluCounter, 5 mSDsCounter, 0 mSdLazyCounter, 358 mSolverCounterSat, 47 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 113 SdHoareTripleChecker+Valid, 221 SdHoareTripleChecker+Invalid, 405 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 47 IncrementalHoareTripleChecker+Valid, 358 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-11-19 18:00:26,566 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [113 Valid, 221 Invalid, 405 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [47 Valid, 358 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-11-19 18:00:26,568 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1672 states. [2024-11-19 18:00:26,587 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1672 to 1672. [2024-11-19 18:00:26,590 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1672 states, 1671 states have (on average 1.168162776780371) internal successors, (1952), 1671 states have internal predecessors, (1952), 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-19 18:00:26,594 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1672 states to 1672 states and 1952 transitions. [2024-11-19 18:00:26,594 INFO L78 Accepts]: Start accepts. Automaton has 1672 states and 1952 transitions. Word has length 189 [2024-11-19 18:00:26,594 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 18:00:26,595 INFO L471 AbstractCegarLoop]: Abstraction has 1672 states and 1952 transitions. [2024-11-19 18:00:26,595 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 41.666666666666664) internal successors, (125), 3 states have internal predecessors, (125), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 18:00:26,595 INFO L276 IsEmpty]: Start isEmpty. Operand 1672 states and 1952 transitions. [2024-11-19 18:00:26,597 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 191 [2024-11-19 18:00:26,597 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 18:00:26,597 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, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 18:00:26,607 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2024-11-19 18:00:26,801 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable5 [2024-11-19 18:00:26,803 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-19 18:00:26,803 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 18:00:26,804 INFO L85 PathProgramCache]: Analyzing trace with hash 1472929522, now seen corresponding path program 1 times [2024-11-19 18:00:26,804 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 18:00:26,804 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [868712932] [2024-11-19 18:00:26,804 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 18:00:26,806 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 18:00:26,839 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 18:00:27,178 INFO L134 CoverageAnalysis]: Checked inductivity of 122 backedges. 0 proven. 72 refuted. 0 times theorem prover too weak. 50 trivial. 0 not checked. [2024-11-19 18:00:27,178 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 18:00:27,178 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [868712932] [2024-11-19 18:00:27,178 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [868712932] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-19 18:00:27,178 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1736904277] [2024-11-19 18:00:27,179 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 18:00:27,179 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-19 18:00:27,179 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-19 18:00:27,181 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-19 18:00:27,184 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2024-11-19 18:00:27,275 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 18:00:27,277 INFO L255 TraceCheckSpWp]: Trace formula consists of 290 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-11-19 18:00:27,284 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-19 18:00:27,359 INFO L134 CoverageAnalysis]: Checked inductivity of 122 backedges. 57 proven. 0 refuted. 0 times theorem prover too weak. 65 trivial. 0 not checked. [2024-11-19 18:00:27,360 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-19 18:00:27,360 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1736904277] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 18:00:27,360 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-19 18:00:27,361 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [3] total 5 [2024-11-19 18:00:27,361 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [855206498] [2024-11-19 18:00:27,361 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 18:00:27,361 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-19 18:00:27,362 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 18:00:27,363 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-19 18:00:27,363 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-11-19 18:00:27,363 INFO L87 Difference]: Start difference. First operand 1672 states and 1952 transitions. Second operand has 3 states, 3 states have (on average 42.0) internal successors, (126), 3 states have internal predecessors, (126), 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-19 18:00:27,826 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 18:00:27,827 INFO L93 Difference]: Finished difference Result 3481 states and 4127 transitions. [2024-11-19 18:00:27,827 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-19 18:00:27,827 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 42.0) internal successors, (126), 3 states have internal predecessors, (126), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 190 [2024-11-19 18:00:27,828 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 18:00:27,834 INFO L225 Difference]: With dead ends: 3481 [2024-11-19 18:00:27,834 INFO L226 Difference]: Without dead ends: 1950 [2024-11-19 18:00:27,836 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 192 GetRequests, 189 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-11-19 18:00:27,837 INFO L432 NwaCegarLoop]: 27 mSDtfsCounter, 133 mSDsluCounter, 4 mSDsCounter, 0 mSdLazyCounter, 348 mSolverCounterSat, 78 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 133 SdHoareTripleChecker+Valid, 31 SdHoareTripleChecker+Invalid, 426 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 78 IncrementalHoareTripleChecker+Valid, 348 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-11-19 18:00:27,837 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [133 Valid, 31 Invalid, 426 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [78 Valid, 348 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-11-19 18:00:27,839 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1950 states. [2024-11-19 18:00:27,865 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1950 to 1950. [2024-11-19 18:00:27,868 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1950 states, 1949 states have (on average 1.172396100564392) internal successors, (2285), 1949 states have internal predecessors, (2285), 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-19 18:00:27,873 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1950 states to 1950 states and 2285 transitions. [2024-11-19 18:00:27,874 INFO L78 Accepts]: Start accepts. Automaton has 1950 states and 2285 transitions. Word has length 190 [2024-11-19 18:00:27,874 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 18:00:27,874 INFO L471 AbstractCegarLoop]: Abstraction has 1950 states and 2285 transitions. [2024-11-19 18:00:27,875 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 42.0) internal successors, (126), 3 states have internal predecessors, (126), 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-19 18:00:27,875 INFO L276 IsEmpty]: Start isEmpty. Operand 1950 states and 2285 transitions. [2024-11-19 18:00:27,879 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 273 [2024-11-19 18:00:27,879 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 18:00:27,880 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, 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, 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] [2024-11-19 18:00:27,889 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2024-11-19 18:00:28,083 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-19 18:00:28,084 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-19 18:00:28,084 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 18:00:28,085 INFO L85 PathProgramCache]: Analyzing trace with hash -895259923, now seen corresponding path program 1 times [2024-11-19 18:00:28,085 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 18:00:28,085 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [511715181] [2024-11-19 18:00:28,085 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 18:00:28,085 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 18:00:28,136 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 18:00:28,505 INFO L134 CoverageAnalysis]: Checked inductivity of 289 backedges. 0 proven. 116 refuted. 0 times theorem prover too weak. 173 trivial. 0 not checked. [2024-11-19 18:00:28,505 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 18:00:28,505 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [511715181] [2024-11-19 18:00:28,506 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [511715181] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-19 18:00:28,506 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1850382132] [2024-11-19 18:00:28,506 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 18:00:28,506 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-19 18:00:28,506 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-19 18:00:28,509 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-19 18:00:28,510 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2024-11-19 18:00:28,616 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 18:00:28,619 INFO L255 TraceCheckSpWp]: Trace formula consists of 394 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-11-19 18:00:28,626 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-19 18:00:28,994 INFO L134 CoverageAnalysis]: Checked inductivity of 289 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 289 trivial. 0 not checked. [2024-11-19 18:00:28,994 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-19 18:00:28,994 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1850382132] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 18:00:28,995 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-19 18:00:28,995 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [3] total 4 [2024-11-19 18:00:28,995 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [82712606] [2024-11-19 18:00:28,996 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 18:00:28,997 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-19 18:00:28,997 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 18:00:28,998 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-19 18:00:28,998 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-11-19 18:00:28,998 INFO L87 Difference]: Start difference. First operand 1950 states and 2285 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-19 18:00:29,445 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 18:00:29,446 INFO L93 Difference]: Finished difference Result 2925 states and 3420 transitions. [2024-11-19 18:00:29,446 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-19 18:00:29,448 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 272 [2024-11-19 18:00:29,449 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 18:00:29,457 INFO L225 Difference]: With dead ends: 2925 [2024-11-19 18:00:29,458 INFO L226 Difference]: Without dead ends: 2923 [2024-11-19 18:00:29,459 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 274 GetRequests, 271 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-11-19 18:00:29,460 INFO L432 NwaCegarLoop]: 12 mSDtfsCounter, 74 mSDsluCounter, 4 mSDsCounter, 0 mSdLazyCounter, 365 mSolverCounterSat, 56 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 74 SdHoareTripleChecker+Valid, 16 SdHoareTripleChecker+Invalid, 421 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 56 IncrementalHoareTripleChecker+Valid, 365 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-11-19 18:00:29,460 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [74 Valid, 16 Invalid, 421 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [56 Valid, 365 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-11-19 18:00:29,462 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2923 states. [2024-11-19 18:00:29,496 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2923 to 2089. [2024-11-19 18:00:29,499 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2089 states, 2088 states have (on average 1.1848659003831417) internal successors, (2474), 2088 states have internal predecessors, (2474), 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-19 18:00:29,504 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2089 states to 2089 states and 2474 transitions. [2024-11-19 18:00:29,505 INFO L78 Accepts]: Start accepts. Automaton has 2089 states and 2474 transitions. Word has length 272 [2024-11-19 18:00:29,505 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 18:00:29,506 INFO L471 AbstractCegarLoop]: Abstraction has 2089 states and 2474 transitions. [2024-11-19 18:00:29,506 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-19 18:00:29,506 INFO L276 IsEmpty]: Start isEmpty. Operand 2089 states and 2474 transitions. [2024-11-19 18:00:29,510 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 286 [2024-11-19 18:00:29,511 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 18:00:29,511 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, 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, 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] [2024-11-19 18:00:29,520 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2024-11-19 18:00:29,715 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-19 18:00:29,715 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-19 18:00:29,715 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 18:00:29,715 INFO L85 PathProgramCache]: Analyzing trace with hash -499257587, now seen corresponding path program 1 times [2024-11-19 18:00:29,715 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 18:00:29,716 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [896349848] [2024-11-19 18:00:29,716 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 18:00:29,716 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 18:00:29,766 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 18:00:29,988 INFO L134 CoverageAnalysis]: Checked inductivity of 289 backedges. 86 proven. 0 refuted. 0 times theorem prover too weak. 203 trivial. 0 not checked. [2024-11-19 18:00:29,988 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 18:00:29,988 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [896349848] [2024-11-19 18:00:29,988 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [896349848] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 18:00:29,989 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 18:00:29,989 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-19 18:00:29,989 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1912529143] [2024-11-19 18:00:29,989 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 18:00:29,989 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-19 18:00:29,990 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 18:00:29,990 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-19 18:00:29,990 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-19 18:00:29,991 INFO L87 Difference]: Start difference. First operand 2089 states and 2474 transitions. Second operand has 3 states, 3 states have (on average 49.666666666666664) internal successors, (149), 3 states have internal predecessors, (149), 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-19 18:00:30,459 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 18:00:30,459 INFO L93 Difference]: Finished difference Result 4452 states and 5263 transitions. [2024-11-19 18:00:30,460 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-19 18:00:30,460 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 49.666666666666664) internal successors, (149), 3 states have internal predecessors, (149), 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 285 [2024-11-19 18:00:30,461 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 18:00:30,461 INFO L225 Difference]: With dead ends: 4452 [2024-11-19 18:00:30,461 INFO L226 Difference]: Without dead ends: 0 [2024-11-19 18:00:30,465 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-19 18:00:30,467 INFO L432 NwaCegarLoop]: 30 mSDtfsCounter, 113 mSDsluCounter, 3 mSDsCounter, 0 mSdLazyCounter, 374 mSolverCounterSat, 64 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 113 SdHoareTripleChecker+Valid, 33 SdHoareTripleChecker+Invalid, 438 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 64 IncrementalHoareTripleChecker+Valid, 374 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-11-19 18:00:30,467 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [113 Valid, 33 Invalid, 438 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [64 Valid, 374 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-11-19 18:00:30,467 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2024-11-19 18:00:30,468 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2024-11-19 18:00:30,469 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-19 18:00:30,469 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2024-11-19 18:00:30,469 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 285 [2024-11-19 18:00:30,469 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 18:00:30,469 INFO L471 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2024-11-19 18:00:30,469 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 49.666666666666664) internal successors, (149), 3 states have internal predecessors, (149), 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-19 18:00:30,469 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2024-11-19 18:00:30,469 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2024-11-19 18:00:30,472 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2024-11-19 18:00:30,473 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-11-19 18:00:30,476 INFO L407 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 18:00:30,478 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2024-11-19 18:00:30,600 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2024-11-19 18:00:30,619 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 19.11 06:00:30 BoogieIcfgContainer [2024-11-19 18:00:30,619 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-11-19 18:00:30,620 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-11-19 18:00:30,621 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-11-19 18:00:30,621 INFO L274 PluginConnector]: Witness Printer initialized [2024-11-19 18:00:30,622 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.11 06:00:20" (3/4) ... [2024-11-19 18:00:30,624 INFO L142 WitnessPrinter]: Generating witness for correct program [2024-11-19 18:00:30,642 INFO L925 BoogieBacktranslator]: Reduced CFG by removing 11 nodes and edges [2024-11-19 18:00:30,643 INFO L925 BoogieBacktranslator]: Reduced CFG by removing 4 nodes and edges [2024-11-19 18:00:30,644 INFO L925 BoogieBacktranslator]: Reduced CFG by removing 3 nodes and edges [2024-11-19 18:00:30,644 INFO L925 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2024-11-19 18:00:30,812 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2024-11-19 18:00:30,813 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.yml [2024-11-19 18:00:30,813 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-11-19 18:00:30,814 INFO L158 Benchmark]: Toolchain (without parser) took 12189.45ms. Allocated memory was 144.7MB in the beginning and 264.2MB in the end (delta: 119.5MB). Free memory was 105.7MB in the beginning and 225.7MB in the end (delta: -120.1MB). Peak memory consumption was 152.6MB. Max. memory is 16.1GB. [2024-11-19 18:00:30,814 INFO L158 Benchmark]: CDTParser took 0.16ms. Allocated memory is still 113.2MB. Free memory is still 86.1MB. There was no memory consumed. Max. memory is 16.1GB. [2024-11-19 18:00:30,814 INFO L158 Benchmark]: CACSL2BoogieTranslator took 563.48ms. Allocated memory is still 144.7MB. Free memory was 105.7MB in the beginning and 74.8MB in the end (delta: 30.9MB). Peak memory consumption was 31.5MB. Max. memory is 16.1GB. [2024-11-19 18:00:30,815 INFO L158 Benchmark]: Boogie Procedure Inliner took 77.61ms. Allocated memory is still 144.7MB. Free memory was 74.8MB in the beginning and 66.9MB in the end (delta: 7.9MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. [2024-11-19 18:00:30,815 INFO L158 Benchmark]: Boogie Preprocessor took 120.96ms. Allocated memory is still 144.7MB. Free memory was 66.9MB in the beginning and 56.4MB in the end (delta: 10.5MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. [2024-11-19 18:00:30,815 INFO L158 Benchmark]: RCFGBuilder took 1245.83ms. Allocated memory is still 144.7MB. Free memory was 56.4MB in the beginning and 88.9MB in the end (delta: -32.5MB). Peak memory consumption was 25.3MB. Max. memory is 16.1GB. [2024-11-19 18:00:30,816 INFO L158 Benchmark]: TraceAbstraction took 9983.14ms. Allocated memory was 144.7MB in the beginning and 264.2MB in the end (delta: 119.5MB). Free memory was 87.9MB in the beginning and 84.2MB in the end (delta: 3.7MB). Peak memory consumption was 123.1MB. Max. memory is 16.1GB. [2024-11-19 18:00:30,816 INFO L158 Benchmark]: Witness Printer took 192.61ms. Allocated memory is still 264.2MB. Free memory was 84.2MB in the beginning and 225.7MB in the end (delta: -141.6MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. [2024-11-19 18:00:30,817 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.16ms. Allocated memory is still 113.2MB. Free memory is still 86.1MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 563.48ms. Allocated memory is still 144.7MB. Free memory was 105.7MB in the beginning and 74.8MB in the end (delta: 30.9MB). Peak memory consumption was 31.5MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 77.61ms. Allocated memory is still 144.7MB. Free memory was 74.8MB in the beginning and 66.9MB in the end (delta: 7.9MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. * Boogie Preprocessor took 120.96ms. Allocated memory is still 144.7MB. Free memory was 66.9MB in the beginning and 56.4MB in the end (delta: 10.5MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. * RCFGBuilder took 1245.83ms. Allocated memory is still 144.7MB. Free memory was 56.4MB in the beginning and 88.9MB in the end (delta: -32.5MB). Peak memory consumption was 25.3MB. Max. memory is 16.1GB. * TraceAbstraction took 9983.14ms. Allocated memory was 144.7MB in the beginning and 264.2MB in the end (delta: 119.5MB). Free memory was 87.9MB in the beginning and 84.2MB in the end (delta: 3.7MB). Peak memory consumption was 123.1MB. Max. memory is 16.1GB. * Witness Printer took 192.61ms. Allocated memory is still 264.2MB. Free memory was 84.2MB in the beginning and 225.7MB in the end (delta: -141.6MB). 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: 107]: a call to reach_error is unreachable For all program executions holds that a call to reach_error is unreachable at this location - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 206 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 9.8s, OverallIterations: 9, TraceHistogramMax: 4, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 4.8s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 915 SdHoareTripleChecker+Valid, 4.3s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 915 mSDsluCounter, 602 SdHoareTripleChecker+Invalid, 3.5s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 38 mSDsCounter, 575 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 3297 IncrementalHoareTripleChecker+Invalid, 3872 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 575 mSolverCounterUnsat, 564 mSDtfsCounter, 3297 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 777 GetRequests, 759 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=2089occurred in iteration=8, InterpolantAutomatonStates: 27, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.3s AutomataMinimizationTime, 9 MinimizatonAttempts, 973 StatesRemovedByMinimization, 2 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.4s SatisfiabilityAnalysisTime, 2.8s InterpolantComputationTime, 2176 NumberOfCodeBlocks, 2176 NumberOfCodeBlocksAsserted, 13 NumberOfCheckSat, 2163 ConstructedInterpolants, 0 QuantifiedInterpolants, 7347 SizeOfPredicates, 0 NumberOfNonLiveVariables, 1159 ConjunctsInSsa, 8 ConjunctsInUnsatCore, 13 InterpolantComputations, 9 PerfectInterpolantSequences, 1225/1495 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]: Loop Invariant Derived loop invariant: (((((a10 <= 1) || ((a19 <= 9) && (4 <= a10))) || (a19 == 9)) || ((a19 <= 9) && (a1 <= 33))) || ((a19 <= 9) && (a10 <= 2))) RESULT: Ultimate proved your program to be correct! [2024-11-19 18:00:30,836 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