./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/eca-rers2012/Problem11_label03.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 023d838f Calling Ultimate with: /root/.sdkman/candidates/java/11.0.12-open/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/eca-rers2012/Problem11_label03.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 17c92e2f7b920672487a7c33b9216e5136ad737688964579812bc0c782959b18 --- Real Ultimate output --- This is Ultimate 0.2.5-tmp.fs.icfgbuilder-eval-023d838-m [2024-11-09 19:20:53,488 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-09 19:20:53,558 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-11-09 19:20:53,562 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-09 19:20:53,563 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-09 19:20:53,587 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-09 19:20:53,588 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-09 19:20:53,588 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-09 19:20:53,589 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-09 19:20:53,592 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-09 19:20:53,592 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-09 19:20:53,592 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-09 19:20:53,593 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-09 19:20:53,594 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-09 19:20:53,594 INFO L153 SettingsManager]: * Use SBE=true [2024-11-09 19:20:53,595 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-09 19:20:53,595 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-09 19:20:53,595 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-09 19:20:53,595 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-09 19:20:53,595 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-09 19:20:53,595 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-09 19:20:53,597 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-09 19:20:53,597 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-09 19:20:53,597 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-09 19:20:53,597 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-09 19:20:53,598 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-09 19:20:53,598 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-09 19:20:53,598 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-09 19:20:53,598 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2024-11-09 19:20:53,598 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-09 19:20:53,599 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-09 19:20:53,599 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-09 19:20:53,599 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-09 19:20:53,599 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-09 19:20:53,600 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-09 19:20:53,600 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-09 19:20:53,601 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-09 19:20:53,601 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-09 19:20:53,601 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-09 19:20:53,601 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-09 19:20:53,602 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-09 19:20:53,602 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-09 19:20:53,602 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 -> 17c92e2f7b920672487a7c33b9216e5136ad737688964579812bc0c782959b18 [2024-11-09 19:20:53,809 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-09 19:20:53,826 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-09 19:20:53,828 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-09 19:20:53,829 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-09 19:20:53,829 INFO L274 PluginConnector]: CDTParser initialized [2024-11-09 19:20:53,830 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/eca-rers2012/Problem11_label03.c [2024-11-09 19:20:55,037 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-09 19:20:55,271 INFO L384 CDTParser]: Found 1 translation units. [2024-11-09 19:20:55,271 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/eca-rers2012/Problem11_label03.c [2024-11-09 19:20:55,285 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/2b7ffa9e8/caa946a730da4704a7543e84c0a6c2b7/FLAG960e60abd [2024-11-09 19:20:55,602 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/2b7ffa9e8/caa946a730da4704a7543e84c0a6c2b7 [2024-11-09 19:20:55,604 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-09 19:20:55,605 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-09 19:20:55,606 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-09 19:20:55,606 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-09 19:20:55,611 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-09 19:20:55,612 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.11 07:20:55" (1/1) ... [2024-11-09 19:20:55,612 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@1ff1d10c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 07:20:55, skipping insertion in model container [2024-11-09 19:20:55,612 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.11 07:20:55" (1/1) ... [2024-11-09 19:20:55,647 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-09 19:20:55,809 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/Problem11_label03.c[4398,4411] [2024-11-09 19:20:55,992 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-09 19:20:56,000 INFO L200 MainTranslator]: Completed pre-run [2024-11-09 19:20:56,035 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/Problem11_label03.c[4398,4411] [2024-11-09 19:20:56,139 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-09 19:20:56,154 INFO L204 MainTranslator]: Completed translation [2024-11-09 19:20:56,155 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 07:20:56 WrapperNode [2024-11-09 19:20:56,155 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-09 19:20:56,156 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-09 19:20:56,156 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-09 19:20:56,156 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-09 19:20:56,161 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 07:20:56" (1/1) ... [2024-11-09 19:20:56,187 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 07:20:56" (1/1) ... [2024-11-09 19:20:56,275 INFO L138 Inliner]: procedures = 14, calls = 8, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 999 [2024-11-09 19:20:56,276 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-09 19:20:56,277 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-09 19:20:56,277 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-09 19:20:56,277 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-09 19:20:56,285 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 07:20:56" (1/1) ... [2024-11-09 19:20:56,285 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 07:20:56" (1/1) ... [2024-11-09 19:20:56,303 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 07:20:56" (1/1) ... [2024-11-09 19:20:56,348 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-09 19:20:56,349 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 07:20:56" (1/1) ... [2024-11-09 19:20:56,349 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 07:20:56" (1/1) ... [2024-11-09 19:20:56,386 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 07:20:56" (1/1) ... [2024-11-09 19:20:56,393 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 07:20:56" (1/1) ... [2024-11-09 19:20:56,403 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 07:20:56" (1/1) ... [2024-11-09 19:20:56,409 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 07:20:56" (1/1) ... [2024-11-09 19:20:56,421 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-09 19:20:56,422 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2024-11-09 19:20:56,423 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2024-11-09 19:20:56,423 INFO L274 PluginConnector]: IcfgBuilder initialized [2024-11-09 19:20:56,423 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 07:20:56" (1/1) ... [2024-11-09 19:20:56,428 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-09 19:20:56,438 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 19:20:56,451 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-09 19:20:56,454 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-09 19:20:56,489 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-09 19:20:56,489 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-11-09 19:20:56,489 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-09 19:20:56,489 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-09 19:20:56,548 INFO L256 CfgBuilder]: Building ICFG [2024-11-09 19:20:56,550 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-09 19:20:57,853 INFO L? ?]: Removed 248 outVars from TransFormulas that were not future-live. [2024-11-09 19:20:57,853 INFO L307 CfgBuilder]: Performing block encoding [2024-11-09 19:20:57,874 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-09 19:20:57,874 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2024-11-09 19:20:57,874 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 09.11 07:20:57 BoogieIcfgContainer [2024-11-09 19:20:57,874 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2024-11-09 19:20:57,876 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-09 19:20:57,876 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-09 19:20:57,881 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-09 19:20:57,881 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 09.11 07:20:55" (1/3) ... [2024-11-09 19:20:57,882 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@15100c54 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.11 07:20:57, skipping insertion in model container [2024-11-09 19:20:57,882 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 07:20:56" (2/3) ... [2024-11-09 19:20:57,882 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@15100c54 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.11 07:20:57, skipping insertion in model container [2024-11-09 19:20:57,883 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 09.11 07:20:57" (3/3) ... [2024-11-09 19:20:57,884 INFO L112 eAbstractionObserver]: Analyzing ICFG Problem11_label03.c [2024-11-09 19:20:57,895 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-09 19:20:57,895 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-11-09 19:20:57,943 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-09 19:20:57,947 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;@4061b76b, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-09 19:20:57,948 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-09 19:20:57,953 INFO L276 IsEmpty]: Start isEmpty. Operand has 286 states, 284 states have (on average 2.1267605633802815) internal successors, (604), 285 states have internal predecessors, (604), 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-09 19:20:57,959 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2024-11-09 19:20:57,959 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 19:20:57,960 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, 1] [2024-11-09 19:20:57,960 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 19:20:57,964 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 19:20:57,964 INFO L85 PathProgramCache]: Analyzing trace with hash 2140977236, now seen corresponding path program 1 times [2024-11-09 19:20:57,970 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 19:20:57,970 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [914192391] [2024-11-09 19:20:57,971 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 19:20:57,971 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 19:20:58,067 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 19:20:58,211 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-09 19:20:58,212 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 19:20:58,212 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [914192391] [2024-11-09 19:20:58,213 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [914192391] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 19:20:58,213 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 19:20:58,213 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-09 19:20:58,215 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1591875585] [2024-11-09 19:20:58,215 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 19:20:58,218 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-09 19:20:58,218 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 19:20:58,232 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-09 19:20:58,233 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-09 19:20:58,235 INFO L87 Difference]: Start difference. First operand has 286 states, 284 states have (on average 2.1267605633802815) internal successors, (604), 285 states have internal predecessors, (604), 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.666666666666666) internal successors, (32), 2 states have internal predecessors, (32), 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-09 19:20:59,255 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 19:20:59,255 INFO L93 Difference]: Finished difference Result 767 states and 1708 transitions. [2024-11-09 19:20:59,256 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-09 19:20:59,258 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 10.666666666666666) internal successors, (32), 2 states have internal predecessors, (32), 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 32 [2024-11-09 19:20:59,258 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 19:20:59,275 INFO L225 Difference]: With dead ends: 767 [2024-11-09 19:20:59,275 INFO L226 Difference]: Without dead ends: 416 [2024-11-09 19:20:59,278 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-09 19:20:59,280 INFO L432 NwaCegarLoop]: 193 mSDtfsCounter, 317 mSDsluCounter, 34 mSDsCounter, 0 mSdLazyCounter, 834 mSolverCounterSat, 157 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 317 SdHoareTripleChecker+Valid, 227 SdHoareTripleChecker+Invalid, 991 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 157 IncrementalHoareTripleChecker+Valid, 834 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2024-11-09 19:20:59,284 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [317 Valid, 227 Invalid, 991 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [157 Valid, 834 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2024-11-09 19:20:59,297 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 416 states. [2024-11-09 19:20:59,324 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 416 to 416. [2024-11-09 19:20:59,326 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 416 states, 415 states have (on average 2.0240963855421685) internal successors, (840), 415 states have internal predecessors, (840), 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-09 19:20:59,327 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 416 states to 416 states and 840 transitions. [2024-11-09 19:20:59,328 INFO L78 Accepts]: Start accepts. Automaton has 416 states and 840 transitions. Word has length 32 [2024-11-09 19:20:59,328 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 19:20:59,328 INFO L471 AbstractCegarLoop]: Abstraction has 416 states and 840 transitions. [2024-11-09 19:20:59,328 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 10.666666666666666) internal successors, (32), 2 states have internal predecessors, (32), 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-09 19:20:59,328 INFO L276 IsEmpty]: Start isEmpty. Operand 416 states and 840 transitions. [2024-11-09 19:20:59,330 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 102 [2024-11-09 19:20:59,330 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 19:20:59,331 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-09 19:20:59,331 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-09 19:20:59,331 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 19:20:59,332 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 19:20:59,332 INFO L85 PathProgramCache]: Analyzing trace with hash 1979193338, now seen corresponding path program 1 times [2024-11-09 19:20:59,332 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 19:20:59,332 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [756950182] [2024-11-09 19:20:59,332 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 19:20:59,332 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 19:20:59,368 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 19:20:59,504 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-09 19:20:59,505 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 19:20:59,505 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [756950182] [2024-11-09 19:20:59,506 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [756950182] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 19:20:59,506 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 19:20:59,506 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-09 19:20:59,506 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1238456833] [2024-11-09 19:20:59,507 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 19:20:59,508 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-09 19:20:59,509 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 19:20:59,510 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-09 19:20:59,510 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-09 19:20:59,511 INFO L87 Difference]: Start difference. First operand 416 states and 840 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-09 19:21:00,301 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 19:21:00,302 INFO L93 Difference]: Finished difference Result 1219 states and 2485 transitions. [2024-11-09 19:21:00,302 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-09 19:21:00,302 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-09 19:21:00,303 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 19:21:00,305 INFO L225 Difference]: With dead ends: 1219 [2024-11-09 19:21:00,305 INFO L226 Difference]: Without dead ends: 805 [2024-11-09 19:21:00,307 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-09 19:21:00,308 INFO L432 NwaCegarLoop]: 104 mSDtfsCounter, 261 mSDsluCounter, 21 mSDsCounter, 0 mSdLazyCounter, 761 mSolverCounterSat, 148 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 261 SdHoareTripleChecker+Valid, 125 SdHoareTripleChecker+Invalid, 909 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 148 IncrementalHoareTripleChecker+Valid, 761 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2024-11-09 19:21:00,308 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [261 Valid, 125 Invalid, 909 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [148 Valid, 761 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2024-11-09 19:21:00,309 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 805 states. [2024-11-09 19:21:00,330 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 805 to 794. [2024-11-09 19:21:00,332 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 794 states, 793 states have (on average 1.9722572509457756) internal successors, (1564), 793 states have internal predecessors, (1564), 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-09 19:21:00,333 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 794 states to 794 states and 1564 transitions. [2024-11-09 19:21:00,334 INFO L78 Accepts]: Start accepts. Automaton has 794 states and 1564 transitions. Word has length 101 [2024-11-09 19:21:00,334 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 19:21:00,334 INFO L471 AbstractCegarLoop]: Abstraction has 794 states and 1564 transitions. [2024-11-09 19:21:00,334 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-09 19:21:00,334 INFO L276 IsEmpty]: Start isEmpty. Operand 794 states and 1564 transitions. [2024-11-09 19:21:00,336 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 104 [2024-11-09 19:21:00,336 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 19:21:00,337 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] [2024-11-09 19:21:00,337 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-09 19:21:00,337 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 19:21:00,337 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 19:21:00,338 INFO L85 PathProgramCache]: Analyzing trace with hash -1585107724, now seen corresponding path program 1 times [2024-11-09 19:21:00,338 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 19:21:00,338 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1893263787] [2024-11-09 19:21:00,338 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 19:21:00,338 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 19:21:00,364 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 19:21:00,573 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-09 19:21:00,574 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 19:21:00,574 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1893263787] [2024-11-09 19:21:00,574 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1893263787] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 19:21:00,575 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 19:21:00,575 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-09 19:21:00,575 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1914943627] [2024-11-09 19:21:00,575 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 19:21:00,576 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-09 19:21:00,576 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 19:21:00,577 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-09 19:21:00,577 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-09 19:21:00,577 INFO L87 Difference]: Start difference. First operand 794 states and 1564 transitions. Second operand has 3 states, 3 states have (on average 34.333333333333336) internal successors, (103), 2 states have internal predecessors, (103), 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-09 19:21:01,388 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 19:21:01,388 INFO L93 Difference]: Finished difference Result 2331 states and 4625 transitions. [2024-11-09 19:21:01,388 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-09 19:21:01,389 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 34.333333333333336) internal successors, (103), 2 states have internal predecessors, (103), 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 103 [2024-11-09 19:21:01,389 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 19:21:01,393 INFO L225 Difference]: With dead ends: 2331 [2024-11-09 19:21:01,393 INFO L226 Difference]: Without dead ends: 1539 [2024-11-09 19:21:01,394 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-09 19:21:01,395 INFO L432 NwaCegarLoop]: 173 mSDtfsCounter, 241 mSDsluCounter, 26 mSDsCounter, 0 mSdLazyCounter, 761 mSolverCounterSat, 115 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 241 SdHoareTripleChecker+Valid, 199 SdHoareTripleChecker+Invalid, 876 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 115 IncrementalHoareTripleChecker+Valid, 761 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2024-11-09 19:21:01,395 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [241 Valid, 199 Invalid, 876 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [115 Valid, 761 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2024-11-09 19:21:01,397 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1539 states. [2024-11-09 19:21:01,416 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1539 to 1535. [2024-11-09 19:21:01,418 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1535 states, 1534 states have (on average 1.8370273794002607) internal successors, (2818), 1534 states have internal predecessors, (2818), 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-09 19:21:01,421 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1535 states to 1535 states and 2818 transitions. [2024-11-09 19:21:01,421 INFO L78 Accepts]: Start accepts. Automaton has 1535 states and 2818 transitions. Word has length 103 [2024-11-09 19:21:01,421 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 19:21:01,421 INFO L471 AbstractCegarLoop]: Abstraction has 1535 states and 2818 transitions. [2024-11-09 19:21:01,422 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 34.333333333333336) internal successors, (103), 2 states have internal predecessors, (103), 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-09 19:21:01,425 INFO L276 IsEmpty]: Start isEmpty. Operand 1535 states and 2818 transitions. [2024-11-09 19:21:01,428 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 161 [2024-11-09 19:21:01,428 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 19:21:01,428 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-09 19:21:01,428 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-11-09 19:21:01,428 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 19:21:01,429 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 19:21:01,432 INFO L85 PathProgramCache]: Analyzing trace with hash 2026339, now seen corresponding path program 1 times [2024-11-09 19:21:01,432 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 19:21:01,432 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1981075611] [2024-11-09 19:21:01,432 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 19:21:01,433 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 19:21:01,476 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 19:21:01,638 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-09 19:21:01,640 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 19:21:01,640 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1981075611] [2024-11-09 19:21:01,640 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1981075611] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 19:21:01,640 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 19:21:01,641 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-09 19:21:01,641 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [655574933] [2024-11-09 19:21:01,641 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 19:21:01,641 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-09 19:21:01,642 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 19:21:01,643 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-09 19:21:01,643 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-09 19:21:01,643 INFO L87 Difference]: Start difference. First operand 1535 states and 2818 transitions. Second operand has 3 states, 3 states have (on average 53.333333333333336) internal successors, (160), 3 states have internal predecessors, (160), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 19:21:02,408 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 19:21:02,409 INFO L93 Difference]: Finished difference Result 3276 states and 6167 transitions. [2024-11-09 19:21:02,409 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-09 19:21:02,410 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 53.333333333333336) internal successors, (160), 3 states have internal predecessors, (160), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 160 [2024-11-09 19:21:02,410 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 19:21:02,416 INFO L225 Difference]: With dead ends: 3276 [2024-11-09 19:21:02,416 INFO L226 Difference]: Without dead ends: 1928 [2024-11-09 19:21:02,420 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-09 19:21:02,421 INFO L432 NwaCegarLoop]: 412 mSDtfsCounter, 324 mSDsluCounter, 34 mSDsCounter, 0 mSdLazyCounter, 821 mSolverCounterSat, 51 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 324 SdHoareTripleChecker+Valid, 446 SdHoareTripleChecker+Invalid, 872 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 51 IncrementalHoareTripleChecker+Valid, 821 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2024-11-09 19:21:02,422 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [324 Valid, 446 Invalid, 872 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [51 Valid, 821 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2024-11-09 19:21:02,424 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1928 states. [2024-11-09 19:21:02,444 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1928 to 1925. [2024-11-09 19:21:02,446 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1925 states, 1924 states have (on average 1.863825363825364) internal successors, (3586), 1924 states have internal predecessors, (3586), 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-09 19:21:02,450 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1925 states to 1925 states and 3586 transitions. [2024-11-09 19:21:02,450 INFO L78 Accepts]: Start accepts. Automaton has 1925 states and 3586 transitions. Word has length 160 [2024-11-09 19:21:02,450 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 19:21:02,450 INFO L471 AbstractCegarLoop]: Abstraction has 1925 states and 3586 transitions. [2024-11-09 19:21:02,451 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 53.333333333333336) internal successors, (160), 3 states have internal predecessors, (160), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 19:21:02,451 INFO L276 IsEmpty]: Start isEmpty. Operand 1925 states and 3586 transitions. [2024-11-09 19:21:02,453 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 217 [2024-11-09 19:21:02,453 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 19:21:02,453 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, 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-09 19:21:02,454 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-11-09 19:21:02,454 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 19:21:02,454 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 19:21:02,454 INFO L85 PathProgramCache]: Analyzing trace with hash 261631260, now seen corresponding path program 1 times [2024-11-09 19:21:02,454 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 19:21:02,455 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [678613194] [2024-11-09 19:21:02,455 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 19:21:02,455 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 19:21:02,515 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 19:21:02,646 INFO L134 CoverageAnalysis]: Checked inductivity of 127 backedges. 57 proven. 0 refuted. 0 times theorem prover too weak. 70 trivial. 0 not checked. [2024-11-09 19:21:02,647 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 19:21:02,647 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [678613194] [2024-11-09 19:21:02,647 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [678613194] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 19:21:02,647 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 19:21:02,647 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-09 19:21:02,647 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1171314794] [2024-11-09 19:21:02,647 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 19:21:02,648 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-09 19:21:02,648 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 19:21:02,648 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-09 19:21:02,649 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-09 19:21:02,649 INFO L87 Difference]: Start difference. First operand 1925 states and 3586 transitions. Second operand has 3 states, 3 states have (on average 49.0) internal successors, (147), 3 states have internal predecessors, (147), 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-09 19:21:03,473 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 19:21:03,473 INFO L93 Difference]: Finished difference Result 4414 states and 8354 transitions. [2024-11-09 19:21:03,474 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-09 19:21:03,474 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 49.0) internal successors, (147), 3 states have internal predecessors, (147), 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 216 [2024-11-09 19:21:03,474 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 19:21:03,482 INFO L225 Difference]: With dead ends: 4414 [2024-11-09 19:21:03,482 INFO L226 Difference]: Without dead ends: 2676 [2024-11-09 19:21:03,484 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-09 19:21:03,484 INFO L432 NwaCegarLoop]: 493 mSDtfsCounter, 286 mSDsluCounter, 23 mSDsCounter, 0 mSdLazyCounter, 834 mSolverCounterSat, 86 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 286 SdHoareTripleChecker+Valid, 516 SdHoareTripleChecker+Invalid, 920 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 86 IncrementalHoareTripleChecker+Valid, 834 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2024-11-09 19:21:03,485 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [286 Valid, 516 Invalid, 920 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [86 Valid, 834 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2024-11-09 19:21:03,487 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2676 states. [2024-11-09 19:21:03,519 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2676 to 2481. [2024-11-09 19:21:03,522 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2481 states, 2480 states have (on average 1.8576612903225806) internal successors, (4607), 2480 states have internal predecessors, (4607), 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-09 19:21:03,528 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2481 states to 2481 states and 4607 transitions. [2024-11-09 19:21:03,528 INFO L78 Accepts]: Start accepts. Automaton has 2481 states and 4607 transitions. Word has length 216 [2024-11-09 19:21:03,528 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 19:21:03,529 INFO L471 AbstractCegarLoop]: Abstraction has 2481 states and 4607 transitions. [2024-11-09 19:21:03,529 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 49.0) internal successors, (147), 3 states have internal predecessors, (147), 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-09 19:21:03,529 INFO L276 IsEmpty]: Start isEmpty. Operand 2481 states and 4607 transitions. [2024-11-09 19:21:03,531 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 223 [2024-11-09 19:21:03,531 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 19:21:03,532 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, 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] [2024-11-09 19:21:03,532 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-11-09 19:21:03,532 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 19:21:03,532 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 19:21:03,532 INFO L85 PathProgramCache]: Analyzing trace with hash 1427127818, now seen corresponding path program 1 times [2024-11-09 19:21:03,533 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 19:21:03,533 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1754512714] [2024-11-09 19:21:03,533 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 19:21:03,533 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 19:21:03,578 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 19:21:03,864 INFO L134 CoverageAnalysis]: Checked inductivity of 133 backedges. 27 proven. 30 refuted. 0 times theorem prover too weak. 76 trivial. 0 not checked. [2024-11-09 19:21:03,864 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 19:21:03,864 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1754512714] [2024-11-09 19:21:03,864 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1754512714] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-09 19:21:03,865 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [919665250] [2024-11-09 19:21:03,865 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 19:21:03,865 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 19:21:03,865 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 19:21:03,867 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-09 19:21:03,868 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-09 19:21:03,957 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 19:21:03,959 INFO L255 TraceCheckSpWp]: Trace formula consists of 330 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-11-09 19:21:03,965 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 19:21:04,015 INFO L134 CoverageAnalysis]: Checked inductivity of 133 backedges. 57 proven. 0 refuted. 0 times theorem prover too weak. 76 trivial. 0 not checked. [2024-11-09 19:21:04,016 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-09 19:21:04,016 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [919665250] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 19:21:04,016 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-09 19:21:04,016 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [4] total 6 [2024-11-09 19:21:04,016 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [189749601] [2024-11-09 19:21:04,016 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 19:21:04,017 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-09 19:21:04,017 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 19:21:04,017 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-09 19:21:04,017 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2024-11-09 19:21:04,018 INFO L87 Difference]: Start difference. First operand 2481 states and 4607 transitions. Second operand has 3 states, 3 states have (on average 49.0) internal successors, (147), 3 states have internal predecessors, (147), 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-09 19:21:04,785 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 19:21:04,785 INFO L93 Difference]: Finished difference Result 6445 states and 12145 transitions. [2024-11-09 19:21:04,786 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-09 19:21:04,786 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 49.0) internal successors, (147), 3 states have internal predecessors, (147), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 222 [2024-11-09 19:21:04,786 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 19:21:04,797 INFO L225 Difference]: With dead ends: 6445 [2024-11-09 19:21:04,797 INFO L226 Difference]: Without dead ends: 3966 [2024-11-09 19:21:04,800 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 225 GetRequests, 221 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-09 19:21:04,801 INFO L432 NwaCegarLoop]: 379 mSDtfsCounter, 319 mSDsluCounter, 16 mSDsCounter, 0 mSdLazyCounter, 745 mSolverCounterSat, 188 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 319 SdHoareTripleChecker+Valid, 395 SdHoareTripleChecker+Invalid, 933 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 188 IncrementalHoareTripleChecker+Valid, 745 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2024-11-09 19:21:04,801 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [319 Valid, 395 Invalid, 933 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [188 Valid, 745 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2024-11-09 19:21:04,804 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3966 states. [2024-11-09 19:21:04,863 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3966 to 3963. [2024-11-09 19:21:04,868 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3963 states, 3962 states have (on average 1.861686017163049) internal successors, (7376), 3962 states have internal predecessors, (7376), 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-09 19:21:04,875 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3963 states to 3963 states and 7376 transitions. [2024-11-09 19:21:04,875 INFO L78 Accepts]: Start accepts. Automaton has 3963 states and 7376 transitions. Word has length 222 [2024-11-09 19:21:04,875 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 19:21:04,875 INFO L471 AbstractCegarLoop]: Abstraction has 3963 states and 7376 transitions. [2024-11-09 19:21:04,876 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 49.0) internal successors, (147), 3 states have internal predecessors, (147), 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-09 19:21:04,876 INFO L276 IsEmpty]: Start isEmpty. Operand 3963 states and 7376 transitions. [2024-11-09 19:21:04,878 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 262 [2024-11-09 19:21:04,878 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 19:21:04,878 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, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2024-11-09 19:21:04,892 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2024-11-09 19:21:05,079 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable5 [2024-11-09 19:21:05,080 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 19:21:05,080 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 19:21:05,080 INFO L85 PathProgramCache]: Analyzing trace with hash -1283540536, now seen corresponding path program 1 times [2024-11-09 19:21:05,080 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 19:21:05,080 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [920937604] [2024-11-09 19:21:05,080 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 19:21:05,081 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 19:21:05,127 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 19:21:05,311 INFO L134 CoverageAnalysis]: Checked inductivity of 157 backedges. 157 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 19:21:05,311 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 19:21:05,311 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [920937604] [2024-11-09 19:21:05,312 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [920937604] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 19:21:05,312 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 19:21:05,312 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-09 19:21:05,312 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1364999225] [2024-11-09 19:21:05,312 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 19:21:05,312 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-09 19:21:05,312 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 19:21:05,313 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-09 19:21:05,313 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-11-09 19:21:05,313 INFO L87 Difference]: Start difference. First operand 3963 states and 7376 transitions. Second operand has 4 states, 4 states have (on average 65.25) internal successors, (261), 3 states have internal predecessors, (261), 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-09 19:21:06,486 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 19:21:06,486 INFO L93 Difference]: Finished difference Result 12222 states and 23165 transitions. [2024-11-09 19:21:06,486 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-09 19:21:06,487 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 65.25) internal successors, (261), 3 states have internal predecessors, (261), 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 261 [2024-11-09 19:21:06,487 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 19:21:06,510 INFO L225 Difference]: With dead ends: 12222 [2024-11-09 19:21:06,510 INFO L226 Difference]: Without dead ends: 8446 [2024-11-09 19:21:06,516 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-11-09 19:21:06,516 INFO L432 NwaCegarLoop]: 49 mSDtfsCounter, 530 mSDsluCounter, 48 mSDsCounter, 0 mSdLazyCounter, 1555 mSolverCounterSat, 171 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 530 SdHoareTripleChecker+Valid, 97 SdHoareTripleChecker+Invalid, 1726 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 171 IncrementalHoareTripleChecker+Valid, 1555 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2024-11-09 19:21:06,516 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [530 Valid, 97 Invalid, 1726 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [171 Valid, 1555 Invalid, 0 Unknown, 0 Unchecked, 1.1s Time] [2024-11-09 19:21:06,522 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8446 states. [2024-11-09 19:21:06,607 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8446 to 8441. [2024-11-09 19:21:06,619 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8441 states, 8440 states have (on average 1.8778436018957345) internal successors, (15849), 8440 states have internal predecessors, (15849), 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-09 19:21:06,633 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8441 states to 8441 states and 15849 transitions. [2024-11-09 19:21:06,634 INFO L78 Accepts]: Start accepts. Automaton has 8441 states and 15849 transitions. Word has length 261 [2024-11-09 19:21:06,634 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 19:21:06,634 INFO L471 AbstractCegarLoop]: Abstraction has 8441 states and 15849 transitions. [2024-11-09 19:21:06,634 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 65.25) internal successors, (261), 3 states have internal predecessors, (261), 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-09 19:21:06,634 INFO L276 IsEmpty]: Start isEmpty. Operand 8441 states and 15849 transitions. [2024-11-09 19:21:06,638 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 271 [2024-11-09 19:21:06,638 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 19:21:06,639 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, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2024-11-09 19:21:06,639 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-11-09 19:21:06,640 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 19:21:06,640 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 19:21:06,640 INFO L85 PathProgramCache]: Analyzing trace with hash -1917645441, now seen corresponding path program 1 times [2024-11-09 19:21:06,641 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 19:21:06,641 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [786003042] [2024-11-09 19:21:06,641 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 19:21:06,641 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 19:21:06,724 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 19:21:06,905 INFO L134 CoverageAnalysis]: Checked inductivity of 164 backedges. 57 proven. 0 refuted. 0 times theorem prover too weak. 107 trivial. 0 not checked. [2024-11-09 19:21:06,905 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 19:21:06,905 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [786003042] [2024-11-09 19:21:06,906 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [786003042] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 19:21:06,906 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 19:21:06,906 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-09 19:21:06,906 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1860090964] [2024-11-09 19:21:06,906 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 19:21:06,906 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-09 19:21:06,906 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 19:21:06,907 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-09 19:21:06,907 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-09 19:21:06,907 INFO L87 Difference]: Start difference. First operand 8441 states and 15849 transitions. Second operand has 3 states, 3 states have (on average 54.666666666666664) internal successors, (164), 3 states have internal predecessors, (164), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 19:21:07,693 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 19:21:07,693 INFO L93 Difference]: Finished difference Result 17429 states and 33064 transitions. [2024-11-09 19:21:07,693 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-09 19:21:07,693 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 54.666666666666664) internal successors, (164), 3 states have internal predecessors, (164), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 270 [2024-11-09 19:21:07,694 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 19:21:07,713 INFO L225 Difference]: With dead ends: 17429 [2024-11-09 19:21:07,713 INFO L226 Difference]: Without dead ends: 10291 [2024-11-09 19:21:07,722 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-09 19:21:07,723 INFO L432 NwaCegarLoop]: 127 mSDtfsCounter, 312 mSDsluCounter, 29 mSDsCounter, 0 mSdLazyCounter, 738 mSolverCounterSat, 131 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 312 SdHoareTripleChecker+Valid, 156 SdHoareTripleChecker+Invalid, 869 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 131 IncrementalHoareTripleChecker+Valid, 738 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2024-11-09 19:21:07,723 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [312 Valid, 156 Invalid, 869 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [131 Valid, 738 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2024-11-09 19:21:07,730 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10291 states. [2024-11-09 19:21:07,812 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10291 to 10291. [2024-11-09 19:21:07,830 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10291 states, 10290 states have (on average 1.8553935860058308) internal successors, (19092), 10290 states have internal predecessors, (19092), 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-09 19:21:07,848 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10291 states to 10291 states and 19092 transitions. [2024-11-09 19:21:07,849 INFO L78 Accepts]: Start accepts. Automaton has 10291 states and 19092 transitions. Word has length 270 [2024-11-09 19:21:07,849 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 19:21:07,849 INFO L471 AbstractCegarLoop]: Abstraction has 10291 states and 19092 transitions. [2024-11-09 19:21:07,850 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 54.666666666666664) internal successors, (164), 3 states have internal predecessors, (164), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 19:21:07,850 INFO L276 IsEmpty]: Start isEmpty. Operand 10291 states and 19092 transitions. [2024-11-09 19:21:07,853 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 273 [2024-11-09 19:21:07,853 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 19:21:07,853 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, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 19:21:07,853 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-11-09 19:21:07,854 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 19:21:07,854 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 19:21:07,854 INFO L85 PathProgramCache]: Analyzing trace with hash -1962430586, now seen corresponding path program 1 times [2024-11-09 19:21:07,855 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 19:21:07,855 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1024460810] [2024-11-09 19:21:07,855 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 19:21:07,855 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 19:21:07,900 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 19:21:08,159 INFO L134 CoverageAnalysis]: Checked inductivity of 169 backedges. 0 proven. 57 refuted. 0 times theorem prover too weak. 112 trivial. 0 not checked. [2024-11-09 19:21:08,160 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 19:21:08,160 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1024460810] [2024-11-09 19:21:08,160 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1024460810] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-09 19:21:08,160 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [771651739] [2024-11-09 19:21:08,160 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 19:21:08,161 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 19:21:08,161 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 19:21:08,162 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-09 19:21:08,164 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-09 19:21:08,251 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 19:21:08,253 INFO L255 TraceCheckSpWp]: Trace formula consists of 382 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-11-09 19:21:08,261 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 19:21:08,575 INFO L134 CoverageAnalysis]: Checked inductivity of 169 backedges. 0 proven. 57 refuted. 0 times theorem prover too weak. 112 trivial. 0 not checked. [2024-11-09 19:21:08,576 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-09 19:21:08,638 INFO L134 CoverageAnalysis]: Checked inductivity of 169 backedges. 57 proven. 0 refuted. 0 times theorem prover too weak. 112 trivial. 0 not checked. [2024-11-09 19:21:08,638 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [771651739] provided 1 perfect and 1 imperfect interpolant sequences [2024-11-09 19:21:08,638 INFO L185 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2024-11-09 19:21:08,639 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [3, 3] total 5 [2024-11-09 19:21:08,639 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1302745150] [2024-11-09 19:21:08,639 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 19:21:08,639 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-09 19:21:08,639 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 19:21:08,640 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-09 19:21:08,640 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2024-11-09 19:21:08,640 INFO L87 Difference]: Start difference. First operand 10291 states and 19092 transitions. Second operand has 3 states, 3 states have (on average 53.666666666666664) internal successors, (161), 3 states have internal predecessors, (161), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 19:21:09,463 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 19:21:09,464 INFO L93 Difference]: Finished difference Result 21315 states and 39927 transitions. [2024-11-09 19:21:09,464 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-09 19:21:09,464 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 53.666666666666664) internal successors, (161), 3 states have internal predecessors, (161), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 272 [2024-11-09 19:21:09,465 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 19:21:09,484 INFO L225 Difference]: With dead ends: 21315 [2024-11-09 19:21:09,484 INFO L226 Difference]: Without dead ends: 12327 [2024-11-09 19:21:09,491 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 545 GetRequests, 542 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2024-11-09 19:21:09,493 INFO L432 NwaCegarLoop]: 114 mSDtfsCounter, 325 mSDsluCounter, 25 mSDsCounter, 0 mSdLazyCounter, 733 mSolverCounterSat, 154 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 325 SdHoareTripleChecker+Valid, 139 SdHoareTripleChecker+Invalid, 887 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 154 IncrementalHoareTripleChecker+Valid, 733 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2024-11-09 19:21:09,494 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [325 Valid, 139 Invalid, 887 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [154 Valid, 733 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2024-11-09 19:21:09,502 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12327 states. [2024-11-09 19:21:09,588 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12327 to 11772. [2024-11-09 19:21:09,606 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 11772 states, 11771 states have (on average 1.8551524934160224) internal successors, (21837), 11771 states have internal predecessors, (21837), 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-09 19:21:09,621 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11772 states to 11772 states and 21837 transitions. [2024-11-09 19:21:09,621 INFO L78 Accepts]: Start accepts. Automaton has 11772 states and 21837 transitions. Word has length 272 [2024-11-09 19:21:09,621 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 19:21:09,622 INFO L471 AbstractCegarLoop]: Abstraction has 11772 states and 21837 transitions. [2024-11-09 19:21:09,622 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 53.666666666666664) internal successors, (161), 3 states have internal predecessors, (161), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 19:21:09,622 INFO L276 IsEmpty]: Start isEmpty. Operand 11772 states and 21837 transitions. [2024-11-09 19:21:09,627 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 298 [2024-11-09 19:21:09,627 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 19:21:09,627 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, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 19:21:09,640 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-09 19:21:09,831 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,SelfDestructingSolverStorable8 [2024-11-09 19:21:09,832 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 19:21:09,832 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 19:21:09,832 INFO L85 PathProgramCache]: Analyzing trace with hash -1905607822, now seen corresponding path program 1 times [2024-11-09 19:21:09,832 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 19:21:09,832 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1449598867] [2024-11-09 19:21:09,832 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 19:21:09,832 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 19:21:09,868 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 19:21:10,289 INFO L134 CoverageAnalysis]: Checked inductivity of 311 backedges. 113 proven. 122 refuted. 0 times theorem prover too weak. 76 trivial. 0 not checked. [2024-11-09 19:21:10,289 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 19:21:10,289 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1449598867] [2024-11-09 19:21:10,290 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1449598867] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-09 19:21:10,290 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2109677948] [2024-11-09 19:21:10,290 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 19:21:10,290 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 19:21:10,290 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 19:21:10,292 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-09 19:21:10,293 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-09 19:21:10,385 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 19:21:10,387 INFO L255 TraceCheckSpWp]: Trace formula consists of 427 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-11-09 19:21:10,391 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 19:21:10,476 INFO L134 CoverageAnalysis]: Checked inductivity of 311 backedges. 235 proven. 0 refuted. 0 times theorem prover too weak. 76 trivial. 0 not checked. [2024-11-09 19:21:10,476 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-09 19:21:10,476 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2109677948] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 19:21:10,476 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-09 19:21:10,477 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [4] total 6 [2024-11-09 19:21:10,477 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1820727923] [2024-11-09 19:21:10,477 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 19:21:10,477 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-09 19:21:10,477 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 19:21:10,478 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-09 19:21:10,478 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2024-11-09 19:21:10,478 INFO L87 Difference]: Start difference. First operand 11772 states and 21837 transitions. Second operand has 3 states, 3 states have (on average 74.0) internal successors, (222), 3 states have internal predecessors, (222), 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-09 19:21:11,211 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 19:21:11,212 INFO L93 Difference]: Finished difference Result 29645 states and 55237 transitions. [2024-11-09 19:21:11,212 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-09 19:21:11,212 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 74.0) internal successors, (222), 3 states have internal predecessors, (222), 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 297 [2024-11-09 19:21:11,212 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 19:21:11,239 INFO L225 Difference]: With dead ends: 29645 [2024-11-09 19:21:11,239 INFO L226 Difference]: Without dead ends: 18617 [2024-11-09 19:21:11,249 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 300 GetRequests, 296 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-09 19:21:11,250 INFO L432 NwaCegarLoop]: 117 mSDtfsCounter, 264 mSDsluCounter, 16 mSDsCounter, 0 mSdLazyCounter, 807 mSolverCounterSat, 102 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 264 SdHoareTripleChecker+Valid, 133 SdHoareTripleChecker+Invalid, 909 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 102 IncrementalHoareTripleChecker+Valid, 807 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2024-11-09 19:21:11,250 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [264 Valid, 133 Invalid, 909 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [102 Valid, 807 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2024-11-09 19:21:11,260 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18617 states. [2024-11-09 19:21:11,394 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18617 to 18617. [2024-11-09 19:21:11,410 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 18617 states, 18616 states have (on average 1.8329931241942414) internal successors, (34123), 18616 states have internal predecessors, (34123), 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-09 19:21:11,431 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18617 states to 18617 states and 34123 transitions. [2024-11-09 19:21:11,432 INFO L78 Accepts]: Start accepts. Automaton has 18617 states and 34123 transitions. Word has length 297 [2024-11-09 19:21:11,432 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 19:21:11,432 INFO L471 AbstractCegarLoop]: Abstraction has 18617 states and 34123 transitions. [2024-11-09 19:21:11,432 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 74.0) internal successors, (222), 3 states have internal predecessors, (222), 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-09 19:21:11,432 INFO L276 IsEmpty]: Start isEmpty. Operand 18617 states and 34123 transitions. [2024-11-09 19:21:11,439 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 317 [2024-11-09 19:21:11,440 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 19:21:11,440 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, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 19:21:11,453 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-09 19:21:11,644 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 19:21:11,645 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 19:21:11,645 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 19:21:11,645 INFO L85 PathProgramCache]: Analyzing trace with hash -1846109745, now seen corresponding path program 1 times [2024-11-09 19:21:11,645 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 19:21:11,645 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1934154659] [2024-11-09 19:21:11,645 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 19:21:11,645 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 19:21:11,687 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 19:21:11,822 INFO L134 CoverageAnalysis]: Checked inductivity of 325 backedges. 256 proven. 0 refuted. 0 times theorem prover too weak. 69 trivial. 0 not checked. [2024-11-09 19:21:11,823 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 19:21:11,823 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1934154659] [2024-11-09 19:21:11,823 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1934154659] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 19:21:11,823 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 19:21:11,823 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-09 19:21:11,823 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1904636817] [2024-11-09 19:21:11,823 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 19:21:11,824 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-09 19:21:11,824 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 19:21:11,824 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-09 19:21:11,824 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-09 19:21:11,824 INFO L87 Difference]: Start difference. First operand 18617 states and 34123 transitions. Second operand has 3 states, 3 states have (on average 82.66666666666667) internal successors, (248), 3 states have internal predecessors, (248), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 19:21:12,437 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 19:21:12,437 INFO L93 Difference]: Finished difference Result 34233 states and 62645 transitions. [2024-11-09 19:21:12,437 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-09 19:21:12,437 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 82.66666666666667) internal successors, (248), 3 states have internal predecessors, (248), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 316 [2024-11-09 19:21:12,438 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 19:21:12,455 INFO L225 Difference]: With dead ends: 34233 [2024-11-09 19:21:12,455 INFO L226 Difference]: Without dead ends: 16544 [2024-11-09 19:21:12,469 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-09 19:21:12,469 INFO L432 NwaCegarLoop]: 127 mSDtfsCounter, 260 mSDsluCounter, 25 mSDsCounter, 0 mSdLazyCounter, 686 mSolverCounterSat, 135 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 260 SdHoareTripleChecker+Valid, 152 SdHoareTripleChecker+Invalid, 821 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 135 IncrementalHoareTripleChecker+Valid, 686 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-11-09 19:21:12,470 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [260 Valid, 152 Invalid, 821 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [135 Valid, 686 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2024-11-09 19:21:12,478 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16544 states. [2024-11-09 19:21:12,654 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16544 to 13025. [2024-11-09 19:21:12,666 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 13025 states, 13024 states have (on average 1.7946867321867321) internal successors, (23374), 13024 states have internal predecessors, (23374), 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-09 19:21:12,681 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13025 states to 13025 states and 23374 transitions. [2024-11-09 19:21:12,682 INFO L78 Accepts]: Start accepts. Automaton has 13025 states and 23374 transitions. Word has length 316 [2024-11-09 19:21:12,682 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 19:21:12,682 INFO L471 AbstractCegarLoop]: Abstraction has 13025 states and 23374 transitions. [2024-11-09 19:21:12,682 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 82.66666666666667) internal successors, (248), 3 states have internal predecessors, (248), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 19:21:12,682 INFO L276 IsEmpty]: Start isEmpty. Operand 13025 states and 23374 transitions. [2024-11-09 19:21:12,691 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 340 [2024-11-09 19:21:12,691 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 19:21:12,691 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, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 19:21:12,691 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2024-11-09 19:21:12,691 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 19:21:12,692 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 19:21:12,692 INFO L85 PathProgramCache]: Analyzing trace with hash -1163783627, now seen corresponding path program 1 times [2024-11-09 19:21:12,692 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 19:21:12,692 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2004784322] [2024-11-09 19:21:12,692 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 19:21:12,692 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 19:21:12,732 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 19:21:12,916 INFO L134 CoverageAnalysis]: Checked inductivity of 351 backedges. 86 proven. 0 refuted. 0 times theorem prover too weak. 265 trivial. 0 not checked. [2024-11-09 19:21:12,917 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 19:21:12,917 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2004784322] [2024-11-09 19:21:12,917 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2004784322] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 19:21:12,917 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 19:21:12,917 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-09 19:21:12,917 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [424223970] [2024-11-09 19:21:12,917 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 19:21:12,918 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-09 19:21:12,918 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 19:21:12,918 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-09 19:21:12,919 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-09 19:21:12,919 INFO L87 Difference]: Start difference. First operand 13025 states and 23374 transitions. Second operand has 3 states, 3 states have (on average 52.666666666666664) internal successors, (158), 3 states have internal predecessors, (158), 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-09 19:21:13,694 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 19:21:13,694 INFO L93 Difference]: Finished difference Result 27720 states and 49855 transitions. [2024-11-09 19:21:13,695 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-09 19:21:13,695 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 52.666666666666664) internal successors, (158), 3 states have internal predecessors, (158), 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 339 [2024-11-09 19:21:13,696 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 19:21:13,696 INFO L225 Difference]: With dead ends: 27720 [2024-11-09 19:21:13,696 INFO L226 Difference]: Without dead ends: 0 [2024-11-09 19:21:13,708 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-09 19:21:13,709 INFO L432 NwaCegarLoop]: 429 mSDtfsCounter, 294 mSDsluCounter, 19 mSDsCounter, 0 mSdLazyCounter, 781 mSolverCounterSat, 97 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 294 SdHoareTripleChecker+Valid, 448 SdHoareTripleChecker+Invalid, 878 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 97 IncrementalHoareTripleChecker+Valid, 781 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2024-11-09 19:21:13,709 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [294 Valid, 448 Invalid, 878 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [97 Valid, 781 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2024-11-09 19:21:13,709 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2024-11-09 19:21:13,709 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2024-11-09 19:21:13,709 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-09 19:21:13,710 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2024-11-09 19:21:13,710 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 339 [2024-11-09 19:21:13,710 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 19:21:13,710 INFO L471 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2024-11-09 19:21:13,710 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 52.666666666666664) internal successors, (158), 3 states have internal predecessors, (158), 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-09 19:21:13,710 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2024-11-09 19:21:13,711 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2024-11-09 19:21:13,712 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2024-11-09 19:21:13,713 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2024-11-09 19:21:13,715 INFO L407 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 19:21:13,717 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2024-11-09 19:21:14,550 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2024-11-09 19:21:14,565 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 09.11 07:21:14 BoogieIcfgContainer [2024-11-09 19:21:14,566 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-11-09 19:21:14,566 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-11-09 19:21:14,566 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-11-09 19:21:14,566 INFO L274 PluginConnector]: Witness Printer initialized [2024-11-09 19:21:14,567 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 09.11 07:20:57" (3/4) ... [2024-11-09 19:21:14,568 INFO L143 WitnessPrinter]: Generating witness for correct program [2024-11-09 19:21:14,589 INFO L925 BoogieBacktranslator]: Reduced CFG by removing 15 nodes and edges [2024-11-09 19:21:14,590 INFO L925 BoogieBacktranslator]: Reduced CFG by removing 4 nodes and edges [2024-11-09 19:21:14,591 INFO L925 BoogieBacktranslator]: Reduced CFG by removing 3 nodes and edges [2024-11-09 19:21:14,592 INFO L925 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2024-11-09 19:21:14,735 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2024-11-09 19:21:14,736 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.yml [2024-11-09 19:21:14,736 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-11-09 19:21:14,736 INFO L158 Benchmark]: Toolchain (without parser) took 19131.46ms. Allocated memory was 151.0MB in the beginning and 876.6MB in the end (delta: 725.6MB). Free memory was 91.9MB in the beginning and 460.9MB in the end (delta: -369.0MB). Peak memory consumption was 359.8MB. Max. memory is 16.1GB. [2024-11-09 19:21:14,737 INFO L158 Benchmark]: CDTParser took 0.14ms. Allocated memory is still 151.0MB. Free memory was 111.5MB in the beginning and 111.3MB in the end (delta: 167.8kB). There was no memory consumed. Max. memory is 16.1GB. [2024-11-09 19:21:14,737 INFO L158 Benchmark]: CACSL2BoogieTranslator took 549.31ms. Allocated memory was 151.0MB in the beginning and 211.8MB in the end (delta: 60.8MB). Free memory was 91.5MB in the beginning and 164.2MB in the end (delta: -72.6MB). Peak memory consumption was 41.0MB. Max. memory is 16.1GB. [2024-11-09 19:21:14,737 INFO L158 Benchmark]: Boogie Procedure Inliner took 120.53ms. Allocated memory is still 211.8MB. Free memory was 164.2MB in the beginning and 146.3MB in the end (delta: 17.8MB). Peak memory consumption was 18.9MB. Max. memory is 16.1GB. [2024-11-09 19:21:14,737 INFO L158 Benchmark]: Boogie Preprocessor took 144.83ms. Allocated memory is still 211.8MB. Free memory was 146.3MB in the beginning and 122.2MB in the end (delta: 24.1MB). Peak memory consumption was 23.1MB. Max. memory is 16.1GB. [2024-11-09 19:21:14,737 INFO L158 Benchmark]: IcfgBuilder took 1452.15ms. Allocated memory is still 211.8MB. Free memory was 122.2MB in the beginning and 112.0MB in the end (delta: 10.2MB). Peak memory consumption was 97.2MB. Max. memory is 16.1GB. [2024-11-09 19:21:14,738 INFO L158 Benchmark]: TraceAbstraction took 16689.92ms. Allocated memory was 211.8MB in the beginning and 876.6MB in the end (delta: 664.8MB). Free memory was 111.0MB in the beginning and 480.9MB in the end (delta: -369.9MB). Peak memory consumption was 479.5MB. Max. memory is 16.1GB. [2024-11-09 19:21:14,738 INFO L158 Benchmark]: Witness Printer took 170.03ms. Allocated memory is still 876.6MB. Free memory was 480.9MB in the beginning and 460.9MB in the end (delta: 19.9MB). Peak memory consumption was 21.0MB. Max. memory is 16.1GB. [2024-11-09 19:21:14,739 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.14ms. Allocated memory is still 151.0MB. Free memory was 111.5MB in the beginning and 111.3MB in the end (delta: 167.8kB). There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 549.31ms. Allocated memory was 151.0MB in the beginning and 211.8MB in the end (delta: 60.8MB). Free memory was 91.5MB in the beginning and 164.2MB in the end (delta: -72.6MB). Peak memory consumption was 41.0MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 120.53ms. Allocated memory is still 211.8MB. Free memory was 164.2MB in the beginning and 146.3MB in the end (delta: 17.8MB). Peak memory consumption was 18.9MB. Max. memory is 16.1GB. * Boogie Preprocessor took 144.83ms. Allocated memory is still 211.8MB. Free memory was 146.3MB in the beginning and 122.2MB in the end (delta: 24.1MB). Peak memory consumption was 23.1MB. Max. memory is 16.1GB. * IcfgBuilder took 1452.15ms. Allocated memory is still 211.8MB. Free memory was 122.2MB in the beginning and 112.0MB in the end (delta: 10.2MB). Peak memory consumption was 97.2MB. Max. memory is 16.1GB. * TraceAbstraction took 16689.92ms. Allocated memory was 211.8MB in the beginning and 876.6MB in the end (delta: 664.8MB). Free memory was 111.0MB in the beginning and 480.9MB in the end (delta: -369.9MB). Peak memory consumption was 479.5MB. Max. memory is 16.1GB. * Witness Printer took 170.03ms. Allocated memory is still 876.6MB. Free memory was 480.9MB in the beginning and 460.9MB in the end (delta: 19.9MB). Peak memory consumption was 21.0MB. 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: 106]: 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, 286 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 15.8s, OverallIterations: 12, TraceHistogramMax: 4, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.1s, AutomataDifference: 10.2s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 3733 SdHoareTripleChecker+Valid, 9.2s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 3733 mSDsluCounter, 3033 SdHoareTripleChecker+Invalid, 7.5s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 316 mSDsCounter, 1535 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 10056 IncrementalHoareTripleChecker+Invalid, 11591 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 1535 mSolverCounterUnsat, 2717 mSDtfsCounter, 10056 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 1094 GetRequests, 1073 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=18617occurred in iteration=10, InterpolantAutomatonStates: 37, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 1.0s AutomataMinimizationTime, 12 MinimizatonAttempts, 4295 StatesRemovedByMinimization, 8 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.4s SatisfiabilityAnalysisTime, 3.0s InterpolantComputationTime, 3380 NumberOfCodeBlocks, 3380 NumberOfCodeBlocksAsserted, 15 NumberOfCheckSat, 3636 ConstructedInterpolants, 0 QuantifiedInterpolants, 10986 SizeOfPredicates, 0 NumberOfNonLiveVariables, 1139 ConjunctsInSsa, 7 ConjunctsInUnsatCore, 16 InterpolantComputations, 12 PerfectInterpolantSequences, 2337/2603 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: 1044]: Location Invariant Derived location invariant: null RESULT: Ultimate proved your program to be correct! [2024-11-09 19:21:14,765 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Ended with exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Result: TRUE