./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/eca-rers2012/Problem14_label26.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 8be7027f 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/Problem14_label26.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 36c4f398f3dd25e23888dcd464dc3e7bec605b7ae2926315db1bc9b1d50c18a1 --- Real Ultimate output --- This is Ultimate 0.2.5-wip.dk.perfect-tracechecks-8be7027-m [2024-11-11 17:04:26,628 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-11 17:04:26,682 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-11-11 17:04:26,686 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-11 17:04:26,686 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-11 17:04:26,705 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-11 17:04:26,706 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-11 17:04:26,706 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-11 17:04:26,707 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-11 17:04:26,710 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-11 17:04:26,710 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-11 17:04:26,710 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-11 17:04:26,711 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-11 17:04:26,711 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-11 17:04:26,711 INFO L153 SettingsManager]: * Use SBE=true [2024-11-11 17:04:26,712 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-11 17:04:26,712 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-11 17:04:26,713 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-11 17:04:26,713 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-11 17:04:26,713 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-11 17:04:26,713 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-11 17:04:26,714 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-11 17:04:26,714 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-11 17:04:26,714 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-11 17:04:26,714 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-11 17:04:26,715 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-11 17:04:26,716 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-11 17:04:26,716 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-11 17:04:26,716 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-11 17:04:26,716 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-11 17:04:26,716 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-11 17:04:26,717 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-11 17:04:26,717 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-11 17:04:26,717 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-11 17:04:26,717 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-11 17:04:26,718 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-11 17:04:26,718 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-11 17:04:26,719 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-11 17:04:26,719 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-11 17:04:26,719 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-11 17:04:26,719 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-11 17:04:26,720 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-11 17:04:26,720 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 -> 36c4f398f3dd25e23888dcd464dc3e7bec605b7ae2926315db1bc9b1d50c18a1 [2024-11-11 17:04:26,951 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-11 17:04:26,979 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-11 17:04:26,981 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-11 17:04:26,981 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-11 17:04:26,982 INFO L274 PluginConnector]: CDTParser initialized [2024-11-11 17:04:26,983 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/eca-rers2012/Problem14_label26.c [2024-11-11 17:04:28,424 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-11 17:04:28,641 INFO L384 CDTParser]: Found 1 translation units. [2024-11-11 17:04:28,642 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/eca-rers2012/Problem14_label26.c [2024-11-11 17:04:28,660 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/0dfce1e7b/67576085b2ca4e72ac5709971086030d/FLAGe6f4b1fb4 [2024-11-11 17:04:28,682 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/0dfce1e7b/67576085b2ca4e72ac5709971086030d [2024-11-11 17:04:28,684 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-11 17:04:28,685 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-11 17:04:28,690 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-11 17:04:28,690 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-11 17:04:28,694 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-11 17:04:28,695 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.11 05:04:28" (1/1) ... [2024-11-11 17:04:28,696 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@7244ed8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.11 05:04:28, skipping insertion in model container [2024-11-11 17:04:28,698 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.11 05:04:28" (1/1) ... [2024-11-11 17:04:28,746 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-11 17:04:28,985 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/Problem14_label26.c[6725,6738] [2024-11-11 17:04:29,129 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-11 17:04:29,144 INFO L200 MainTranslator]: Completed pre-run [2024-11-11 17:04:29,163 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/Problem14_label26.c[6725,6738] [2024-11-11 17:04:29,234 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-11 17:04:29,251 INFO L204 MainTranslator]: Completed translation [2024-11-11 17:04:29,252 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.11 05:04:29 WrapperNode [2024-11-11 17:04:29,252 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-11 17:04:29,253 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-11 17:04:29,253 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-11 17:04:29,253 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-11 17:04:29,260 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.11 05:04:29" (1/1) ... [2024-11-11 17:04:29,275 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.11 05:04:29" (1/1) ... [2024-11-11 17:04:29,330 INFO L138 Inliner]: procedures = 14, calls = 8, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 859 [2024-11-11 17:04:29,333 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-11 17:04:29,334 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-11 17:04:29,334 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-11 17:04:29,334 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-11 17:04:29,347 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.11 05:04:29" (1/1) ... [2024-11-11 17:04:29,347 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.11 05:04:29" (1/1) ... [2024-11-11 17:04:29,354 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.11 05:04:29" (1/1) ... [2024-11-11 17:04:29,387 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-11 17:04:29,391 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.11 05:04:29" (1/1) ... [2024-11-11 17:04:29,392 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.11 05:04:29" (1/1) ... [2024-11-11 17:04:29,416 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.11 05:04:29" (1/1) ... [2024-11-11 17:04:29,423 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.11 05:04:29" (1/1) ... [2024-11-11 17:04:29,430 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.11 05:04:29" (1/1) ... [2024-11-11 17:04:29,444 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.11 05:04:29" (1/1) ... [2024-11-11 17:04:29,450 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-11 17:04:29,451 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-11 17:04:29,451 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-11 17:04:29,451 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-11 17:04:29,452 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.11 05:04:29" (1/1) ... [2024-11-11 17:04:29,456 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-11 17:04:29,465 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-11 17:04:29,486 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-11 17:04:29,489 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-11 17:04:29,526 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-11 17:04:29,526 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-11-11 17:04:29,527 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-11 17:04:29,527 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-11 17:04:29,591 INFO L238 CfgBuilder]: Building ICFG [2024-11-11 17:04:29,592 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-11 17:04:30,405 INFO L? ?]: Removed 123 outVars from TransFormulas that were not future-live. [2024-11-11 17:04:30,406 INFO L287 CfgBuilder]: Performing block encoding [2024-11-11 17:04:30,425 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-11 17:04:30,428 INFO L316 CfgBuilder]: Removed 1 assume(true) statements. [2024-11-11 17:04:30,428 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.11 05:04:30 BoogieIcfgContainer [2024-11-11 17:04:30,429 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-11 17:04:30,430 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-11 17:04:30,430 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-11 17:04:30,432 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-11 17:04:30,433 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 11.11 05:04:28" (1/3) ... [2024-11-11 17:04:30,433 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5735dcfa and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.11 05:04:30, skipping insertion in model container [2024-11-11 17:04:30,433 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.11 05:04:29" (2/3) ... [2024-11-11 17:04:30,433 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5735dcfa and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.11 05:04:30, skipping insertion in model container [2024-11-11 17:04:30,433 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.11 05:04:30" (3/3) ... [2024-11-11 17:04:30,434 INFO L112 eAbstractionObserver]: Analyzing ICFG Problem14_label26.c [2024-11-11 17:04:30,448 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-11 17:04:30,448 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-11-11 17:04:30,533 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-11 17:04:30,539 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;@2d60261, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-11 17:04:30,539 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-11 17:04:30,543 INFO L276 IsEmpty]: Start isEmpty. Operand has 245 states, 243 states have (on average 1.7366255144032923) internal successors, (422), 244 states have internal predecessors, (422), 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-11 17:04:30,550 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2024-11-11 17:04:30,550 INFO L210 NwaCegarLoop]: Found error trace [2024-11-11 17:04:30,551 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-11 17:04:30,551 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-11 17:04:30,556 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-11 17:04:30,557 INFO L85 PathProgramCache]: Analyzing trace with hash -215114758, now seen corresponding path program 1 times [2024-11-11 17:04:30,572 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-11 17:04:30,572 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1185903416] [2024-11-11 17:04:30,572 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 17:04:30,573 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-11 17:04:30,755 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 17:04:31,001 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-11 17:04:31,003 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-11 17:04:31,003 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1185903416] [2024-11-11 17:04:31,004 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1185903416] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-11 17:04:31,004 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-11 17:04:31,004 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-11 17:04:31,005 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [976109293] [2024-11-11 17:04:31,006 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-11 17:04:31,022 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-11 17:04:31,026 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-11 17:04:31,050 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-11 17:04:31,051 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-11 17:04:31,053 INFO L87 Difference]: Start difference. First operand has 245 states, 243 states have (on average 1.7366255144032923) internal successors, (422), 244 states have internal predecessors, (422), 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 22.0) internal successors, (66), 2 states have internal predecessors, (66), 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-11 17:04:31,818 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-11 17:04:31,819 INFO L93 Difference]: Finished difference Result 669 states and 1200 transitions. [2024-11-11 17:04:31,820 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-11 17:04:31,821 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 22.0) internal successors, (66), 2 states have internal predecessors, (66), 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 66 [2024-11-11 17:04:31,822 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-11 17:04:31,831 INFO L225 Difference]: With dead ends: 669 [2024-11-11 17:04:31,831 INFO L226 Difference]: Without dead ends: 360 [2024-11-11 17:04:31,835 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-11 17:04:31,837 INFO L435 NwaCegarLoop]: 87 mSDtfsCounter, 144 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 519 mSolverCounterSat, 229 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 144 SdHoareTripleChecker+Valid, 94 SdHoareTripleChecker+Invalid, 748 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 229 IncrementalHoareTripleChecker+Valid, 519 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2024-11-11 17:04:31,838 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [144 Valid, 94 Invalid, 748 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [229 Valid, 519 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2024-11-11 17:04:31,853 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 360 states. [2024-11-11 17:04:31,883 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 360 to 360. [2024-11-11 17:04:31,884 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 360 states, 359 states have (on average 1.5208913649025069) internal successors, (546), 359 states have internal predecessors, (546), 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-11 17:04:31,885 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 360 states to 360 states and 546 transitions. [2024-11-11 17:04:31,887 INFO L78 Accepts]: Start accepts. Automaton has 360 states and 546 transitions. Word has length 66 [2024-11-11 17:04:31,887 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-11 17:04:31,887 INFO L471 AbstractCegarLoop]: Abstraction has 360 states and 546 transitions. [2024-11-11 17:04:31,888 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 22.0) internal successors, (66), 2 states have internal predecessors, (66), 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-11 17:04:31,888 INFO L276 IsEmpty]: Start isEmpty. Operand 360 states and 546 transitions. [2024-11-11 17:04:31,892 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 142 [2024-11-11 17:04:31,892 INFO L210 NwaCegarLoop]: Found error trace [2024-11-11 17:04:31,892 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2024-11-11 17:04:31,893 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-11 17:04:31,893 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-11 17:04:31,893 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-11 17:04:31,894 INFO L85 PathProgramCache]: Analyzing trace with hash -1364898313, now seen corresponding path program 1 times [2024-11-11 17:04:31,894 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-11 17:04:31,894 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [146706899] [2024-11-11 17:04:31,894 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 17:04:31,894 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-11 17:04:31,930 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 17:04:32,033 INFO L134 CoverageAnalysis]: Checked inductivity of 63 backedges. 63 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-11 17:04:32,034 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-11 17:04:32,034 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [146706899] [2024-11-11 17:04:32,034 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [146706899] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-11 17:04:32,034 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-11 17:04:32,035 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-11 17:04:32,035 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [336928085] [2024-11-11 17:04:32,035 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-11 17:04:32,036 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-11 17:04:32,036 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-11 17:04:32,037 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-11 17:04:32,037 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-11 17:04:32,037 INFO L87 Difference]: Start difference. First operand 360 states and 546 transitions. Second operand has 3 states, 3 states have (on average 47.0) internal successors, (141), 2 states have internal predecessors, (141), 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-11 17:04:32,695 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-11 17:04:32,695 INFO L93 Difference]: Finished difference Result 1074 states and 1633 transitions. [2024-11-11 17:04:32,695 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-11 17:04:32,696 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 47.0) internal successors, (141), 2 states have internal predecessors, (141), 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 141 [2024-11-11 17:04:32,696 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-11 17:04:32,699 INFO L225 Difference]: With dead ends: 1074 [2024-11-11 17:04:32,699 INFO L226 Difference]: Without dead ends: 716 [2024-11-11 17:04:32,700 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-11 17:04:32,701 INFO L435 NwaCegarLoop]: 91 mSDtfsCounter, 122 mSDsluCounter, 4 mSDsCounter, 0 mSdLazyCounter, 460 mSolverCounterSat, 132 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 122 SdHoareTripleChecker+Valid, 95 SdHoareTripleChecker+Invalid, 592 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 132 IncrementalHoareTripleChecker+Valid, 460 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2024-11-11 17:04:32,701 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [122 Valid, 95 Invalid, 592 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [132 Valid, 460 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2024-11-11 17:04:32,703 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 716 states. [2024-11-11 17:04:32,736 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 716 to 716. [2024-11-11 17:04:32,737 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 716 states, 715 states have (on average 1.353846153846154) internal successors, (968), 715 states have internal predecessors, (968), 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-11 17:04:32,742 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 716 states to 716 states and 968 transitions. [2024-11-11 17:04:32,742 INFO L78 Accepts]: Start accepts. Automaton has 716 states and 968 transitions. Word has length 141 [2024-11-11 17:04:32,743 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-11 17:04:32,743 INFO L471 AbstractCegarLoop]: Abstraction has 716 states and 968 transitions. [2024-11-11 17:04:32,743 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 47.0) internal successors, (141), 2 states have internal predecessors, (141), 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-11 17:04:32,743 INFO L276 IsEmpty]: Start isEmpty. Operand 716 states and 968 transitions. [2024-11-11 17:04:32,749 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 146 [2024-11-11 17:04:32,750 INFO L210 NwaCegarLoop]: Found error trace [2024-11-11 17:04:32,750 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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-11 17:04:32,750 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-11 17:04:32,750 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-11 17:04:32,751 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-11 17:04:32,751 INFO L85 PathProgramCache]: Analyzing trace with hash -1093648019, now seen corresponding path program 1 times [2024-11-11 17:04:32,751 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-11 17:04:32,751 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [337265676] [2024-11-11 17:04:32,751 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 17:04:32,752 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-11 17:04:32,777 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 17:04:33,053 INFO L134 CoverageAnalysis]: Checked inductivity of 63 backedges. 63 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-11 17:04:33,055 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-11 17:04:33,055 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [337265676] [2024-11-11 17:04:33,055 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [337265676] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-11 17:04:33,056 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-11 17:04:33,056 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-11 17:04:33,056 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [409719932] [2024-11-11 17:04:33,057 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-11 17:04:33,057 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-11 17:04:33,057 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-11 17:04:33,059 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-11 17:04:33,059 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-11 17:04:33,059 INFO L87 Difference]: Start difference. First operand 716 states and 968 transitions. Second operand has 4 states, 4 states have (on average 36.25) internal successors, (145), 3 states have internal predecessors, (145), 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-11 17:04:33,832 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-11 17:04:33,832 INFO L93 Difference]: Finished difference Result 1964 states and 2570 transitions. [2024-11-11 17:04:33,833 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-11 17:04:33,833 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 36.25) internal successors, (145), 3 states have internal predecessors, (145), 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 145 [2024-11-11 17:04:33,833 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-11 17:04:33,837 INFO L225 Difference]: With dead ends: 1964 [2024-11-11 17:04:33,837 INFO L226 Difference]: Without dead ends: 1250 [2024-11-11 17:04:33,838 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-11-11 17:04:33,839 INFO L435 NwaCegarLoop]: 110 mSDtfsCounter, 419 mSDsluCounter, 11 mSDsCounter, 0 mSdLazyCounter, 976 mSolverCounterSat, 40 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 419 SdHoareTripleChecker+Valid, 121 SdHoareTripleChecker+Invalid, 1016 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 40 IncrementalHoareTripleChecker+Valid, 976 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2024-11-11 17:04:33,840 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [419 Valid, 121 Invalid, 1016 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [40 Valid, 976 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2024-11-11 17:04:33,841 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1250 states. [2024-11-11 17:04:33,856 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1250 to 1250. [2024-11-11 17:04:33,857 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1250 states, 1249 states have (on average 1.2361889511609288) internal successors, (1544), 1249 states have internal predecessors, (1544), 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-11 17:04:33,859 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1250 states to 1250 states and 1544 transitions. [2024-11-11 17:04:33,860 INFO L78 Accepts]: Start accepts. Automaton has 1250 states and 1544 transitions. Word has length 145 [2024-11-11 17:04:33,860 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-11 17:04:33,860 INFO L471 AbstractCegarLoop]: Abstraction has 1250 states and 1544 transitions. [2024-11-11 17:04:33,860 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 36.25) internal successors, (145), 3 states have internal predecessors, (145), 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-11 17:04:33,860 INFO L276 IsEmpty]: Start isEmpty. Operand 1250 states and 1544 transitions. [2024-11-11 17:04:33,862 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 226 [2024-11-11 17:04:33,862 INFO L210 NwaCegarLoop]: Found error trace [2024-11-11 17:04:33,863 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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, 1, 1, 1, 1, 1, 1, 1] [2024-11-11 17:04:33,863 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-11-11 17:04:33,863 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-11 17:04:33,863 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-11 17:04:33,864 INFO L85 PathProgramCache]: Analyzing trace with hash -1032338879, now seen corresponding path program 1 times [2024-11-11 17:04:33,864 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-11 17:04:33,864 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1236811467] [2024-11-11 17:04:33,864 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 17:04:33,864 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-11 17:04:33,891 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 17:04:34,148 INFO L134 CoverageAnalysis]: Checked inductivity of 205 backedges. 170 proven. 0 refuted. 0 times theorem prover too weak. 35 trivial. 0 not checked. [2024-11-11 17:04:34,148 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-11 17:04:34,148 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1236811467] [2024-11-11 17:04:34,148 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1236811467] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-11 17:04:34,148 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-11 17:04:34,148 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-11 17:04:34,148 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [97261656] [2024-11-11 17:04:34,148 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-11 17:04:34,150 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-11 17:04:34,150 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-11 17:04:34,151 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-11 17:04:34,151 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-11-11 17:04:34,151 INFO L87 Difference]: Start difference. First operand 1250 states and 1544 transitions. Second operand has 4 states, 4 states have (on average 47.75) internal successors, (191), 3 states have internal predecessors, (191), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-11 17:04:34,717 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-11 17:04:34,717 INFO L93 Difference]: Finished difference Result 2705 states and 3353 transitions. [2024-11-11 17:04:34,718 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-11 17:04:34,718 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 47.75) internal successors, (191), 3 states have internal predecessors, (191), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 225 [2024-11-11 17:04:34,718 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-11 17:04:34,722 INFO L225 Difference]: With dead ends: 2705 [2024-11-11 17:04:34,722 INFO L226 Difference]: Without dead ends: 1606 [2024-11-11 17:04:34,724 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-11-11 17:04:34,724 INFO L435 NwaCegarLoop]: 111 mSDtfsCounter, 116 mSDsluCounter, 8 mSDsCounter, 0 mSdLazyCounter, 661 mSolverCounterSat, 110 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 116 SdHoareTripleChecker+Valid, 119 SdHoareTripleChecker+Invalid, 771 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 110 IncrementalHoareTripleChecker+Valid, 661 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-11-11 17:04:34,725 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [116 Valid, 119 Invalid, 771 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [110 Valid, 661 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2024-11-11 17:04:34,726 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1606 states. [2024-11-11 17:04:34,740 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1606 to 1606. [2024-11-11 17:04:34,742 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1606 states, 1605 states have (on average 1.1221183800623054) internal successors, (1801), 1605 states have internal predecessors, (1801), 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-11 17:04:34,744 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1606 states to 1606 states and 1801 transitions. [2024-11-11 17:04:34,745 INFO L78 Accepts]: Start accepts. Automaton has 1606 states and 1801 transitions. Word has length 225 [2024-11-11 17:04:34,745 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-11 17:04:34,745 INFO L471 AbstractCegarLoop]: Abstraction has 1606 states and 1801 transitions. [2024-11-11 17:04:34,745 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 47.75) internal successors, (191), 3 states have internal predecessors, (191), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-11 17:04:34,745 INFO L276 IsEmpty]: Start isEmpty. Operand 1606 states and 1801 transitions. [2024-11-11 17:04:34,748 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 353 [2024-11-11 17:04:34,748 INFO L210 NwaCegarLoop]: Found error trace [2024-11-11 17:04:34,748 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 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, 2, 2, 2, 2, 2, 2, 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] [2024-11-11 17:04:34,748 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-11-11 17:04:34,748 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-11 17:04:34,749 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-11 17:04:34,749 INFO L85 PathProgramCache]: Analyzing trace with hash 1767683600, now seen corresponding path program 1 times [2024-11-11 17:04:34,749 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-11 17:04:34,749 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [767572881] [2024-11-11 17:04:34,749 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 17:04:34,750 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-11 17:04:34,787 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 17:04:35,081 INFO L134 CoverageAnalysis]: Checked inductivity of 444 backedges. 239 proven. 130 refuted. 0 times theorem prover too weak. 75 trivial. 0 not checked. [2024-11-11 17:04:35,082 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-11 17:04:35,082 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [767572881] [2024-11-11 17:04:35,082 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [767572881] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-11 17:04:35,082 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [443602871] [2024-11-11 17:04:35,082 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 17:04:35,082 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-11 17:04:35,083 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-11 17:04:35,084 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-11 17:04:35,086 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-11 17:04:35,203 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 17:04:35,206 INFO L256 TraceCheckSpWp]: Trace formula consists of 465 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-11-11 17:04:35,213 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-11 17:04:35,495 INFO L134 CoverageAnalysis]: Checked inductivity of 444 backedges. 191 proven. 0 refuted. 0 times theorem prover too weak. 253 trivial. 0 not checked. [2024-11-11 17:04:35,496 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-11 17:04:35,496 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [443602871] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-11 17:04:35,496 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-11 17:04:35,496 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [4] total 5 [2024-11-11 17:04:35,496 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1998793019] [2024-11-11 17:04:35,497 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-11 17:04:35,497 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-11 17:04:35,497 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-11 17:04:35,498 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-11 17:04:35,498 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2024-11-11 17:04:35,498 INFO L87 Difference]: Start difference. First operand 1606 states and 1801 transitions. Second operand has 3 states, 3 states have (on average 58.333333333333336) internal successors, (175), 2 states have internal predecessors, (175), 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-11 17:04:35,957 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-11 17:04:35,958 INFO L93 Difference]: Finished difference Result 3388 states and 3901 transitions. [2024-11-11 17:04:35,958 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-11 17:04:35,959 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 58.333333333333336) internal successors, (175), 2 states have internal predecessors, (175), 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 352 [2024-11-11 17:04:35,959 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-11 17:04:35,963 INFO L225 Difference]: With dead ends: 3388 [2024-11-11 17:04:35,964 INFO L226 Difference]: Without dead ends: 1962 [2024-11-11 17:04:35,965 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 355 GetRequests, 351 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2024-11-11 17:04:35,966 INFO L435 NwaCegarLoop]: 44 mSDtfsCounter, 82 mSDsluCounter, 3 mSDsCounter, 0 mSdLazyCounter, 402 mSolverCounterSat, 124 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 82 SdHoareTripleChecker+Valid, 47 SdHoareTripleChecker+Invalid, 526 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 124 IncrementalHoareTripleChecker+Valid, 402 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-11-11 17:04:35,966 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [82 Valid, 47 Invalid, 526 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [124 Valid, 402 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-11-11 17:04:35,968 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1962 states. [2024-11-11 17:04:35,987 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1962 to 1784. [2024-11-11 17:04:35,989 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1784 states, 1783 states have (on average 1.1318003365114975) internal successors, (2018), 1783 states have internal predecessors, (2018), 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-11 17:04:35,991 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1784 states to 1784 states and 2018 transitions. [2024-11-11 17:04:35,992 INFO L78 Accepts]: Start accepts. Automaton has 1784 states and 2018 transitions. Word has length 352 [2024-11-11 17:04:35,992 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-11 17:04:35,992 INFO L471 AbstractCegarLoop]: Abstraction has 1784 states and 2018 transitions. [2024-11-11 17:04:35,992 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 58.333333333333336) internal successors, (175), 2 states have internal predecessors, (175), 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-11 17:04:35,992 INFO L276 IsEmpty]: Start isEmpty. Operand 1784 states and 2018 transitions. [2024-11-11 17:04:35,995 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 357 [2024-11-11 17:04:35,995 INFO L210 NwaCegarLoop]: Found error trace [2024-11-11 17:04:35,995 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 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, 2, 2, 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] [2024-11-11 17:04:36,011 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2024-11-11 17:04:36,196 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-11 17:04:36,199 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-11 17:04:36,200 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-11 17:04:36,200 INFO L85 PathProgramCache]: Analyzing trace with hash 15987974, now seen corresponding path program 1 times [2024-11-11 17:04:36,200 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-11 17:04:36,200 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1992623181] [2024-11-11 17:04:36,201 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 17:04:36,201 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-11 17:04:36,244 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 17:04:36,519 INFO L134 CoverageAnalysis]: Checked inductivity of 452 backedges. 348 proven. 0 refuted. 0 times theorem prover too weak. 104 trivial. 0 not checked. [2024-11-11 17:04:36,520 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-11 17:04:36,520 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1992623181] [2024-11-11 17:04:36,520 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1992623181] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-11 17:04:36,520 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-11 17:04:36,520 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-11 17:04:36,520 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1990070310] [2024-11-11 17:04:36,520 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-11 17:04:36,520 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-11 17:04:36,521 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-11 17:04:36,521 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-11 17:04:36,521 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-11 17:04:36,521 INFO L87 Difference]: Start difference. First operand 1784 states and 2018 transitions. Second operand has 3 states, 3 states have (on average 84.33333333333333) internal successors, (253), 3 states have internal predecessors, (253), 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-11 17:04:36,940 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-11 17:04:36,940 INFO L93 Difference]: Finished difference Result 3744 states and 4282 transitions. [2024-11-11 17:04:36,941 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-11 17:04:36,941 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 84.33333333333333) internal successors, (253), 3 states have internal predecessors, (253), 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 356 [2024-11-11 17:04:36,941 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-11 17:04:36,946 INFO L225 Difference]: With dead ends: 3744 [2024-11-11 17:04:36,946 INFO L226 Difference]: Without dead ends: 2140 [2024-11-11 17:04:36,948 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-11 17:04:36,949 INFO L435 NwaCegarLoop]: 73 mSDtfsCounter, 101 mSDsluCounter, 4 mSDsCounter, 0 mSdLazyCounter, 469 mSolverCounterSat, 23 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 101 SdHoareTripleChecker+Valid, 77 SdHoareTripleChecker+Invalid, 492 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 23 IncrementalHoareTripleChecker+Valid, 469 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-11-11 17:04:36,949 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [101 Valid, 77 Invalid, 492 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [23 Valid, 469 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-11-11 17:04:36,950 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2140 states. [2024-11-11 17:04:36,971 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2140 to 2140. [2024-11-11 17:04:36,973 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2140 states, 2139 states have (on average 1.1280972417017299) internal successors, (2413), 2139 states have internal predecessors, (2413), 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-11 17:04:36,977 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2140 states to 2140 states and 2413 transitions. [2024-11-11 17:04:36,977 INFO L78 Accepts]: Start accepts. Automaton has 2140 states and 2413 transitions. Word has length 356 [2024-11-11 17:04:36,977 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-11 17:04:36,977 INFO L471 AbstractCegarLoop]: Abstraction has 2140 states and 2413 transitions. [2024-11-11 17:04:36,978 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 84.33333333333333) internal successors, (253), 3 states have internal predecessors, (253), 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-11 17:04:36,978 INFO L276 IsEmpty]: Start isEmpty. Operand 2140 states and 2413 transitions. [2024-11-11 17:04:36,980 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 384 [2024-11-11 17:04:36,981 INFO L210 NwaCegarLoop]: Found error trace [2024-11-11 17:04:36,981 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 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, 1, 1, 1, 1, 1] [2024-11-11 17:04:36,981 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-11-11 17:04:36,981 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-11 17:04:36,981 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-11 17:04:36,982 INFO L85 PathProgramCache]: Analyzing trace with hash -1351643764, now seen corresponding path program 1 times [2024-11-11 17:04:36,982 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-11 17:04:36,982 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2056635647] [2024-11-11 17:04:36,982 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 17:04:36,982 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-11 17:04:37,046 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 17:04:37,223 INFO L134 CoverageAnalysis]: Checked inductivity of 505 backedges. 191 proven. 0 refuted. 0 times theorem prover too weak. 314 trivial. 0 not checked. [2024-11-11 17:04:37,224 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-11 17:04:37,224 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2056635647] [2024-11-11 17:04:37,224 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2056635647] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-11 17:04:37,224 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-11 17:04:37,224 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-11 17:04:37,224 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1313468865] [2024-11-11 17:04:37,224 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-11 17:04:37,224 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-11 17:04:37,224 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-11 17:04:37,225 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-11 17:04:37,225 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-11 17:04:37,225 INFO L87 Difference]: Start difference. First operand 2140 states and 2413 transitions. Second operand has 3 states, 3 states have (on average 58.333333333333336) internal successors, (175), 3 states have internal predecessors, (175), 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-11 17:04:37,699 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-11 17:04:37,699 INFO L93 Difference]: Finished difference Result 4634 states and 5295 transitions. [2024-11-11 17:04:37,699 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-11 17:04:37,700 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 58.333333333333336) internal successors, (175), 3 states have internal predecessors, (175), 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 383 [2024-11-11 17:04:37,700 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-11 17:04:37,706 INFO L225 Difference]: With dead ends: 4634 [2024-11-11 17:04:37,707 INFO L226 Difference]: Without dead ends: 2674 [2024-11-11 17:04:37,709 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-11 17:04:37,710 INFO L435 NwaCegarLoop]: 253 mSDtfsCounter, 115 mSDsluCounter, 5 mSDsCounter, 0 mSdLazyCounter, 472 mSolverCounterSat, 53 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 115 SdHoareTripleChecker+Valid, 258 SdHoareTripleChecker+Invalid, 525 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 53 IncrementalHoareTripleChecker+Valid, 472 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-11-11 17:04:37,710 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [115 Valid, 258 Invalid, 525 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [53 Valid, 472 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-11-11 17:04:37,712 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2674 states. [2024-11-11 17:04:37,736 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2674 to 2674. [2024-11-11 17:04:37,739 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2674 states, 2673 states have (on average 1.1208380097268986) internal successors, (2996), 2673 states have internal predecessors, (2996), 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-11 17:04:37,743 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2674 states to 2674 states and 2996 transitions. [2024-11-11 17:04:37,743 INFO L78 Accepts]: Start accepts. Automaton has 2674 states and 2996 transitions. Word has length 383 [2024-11-11 17:04:37,744 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-11 17:04:37,744 INFO L471 AbstractCegarLoop]: Abstraction has 2674 states and 2996 transitions. [2024-11-11 17:04:37,744 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 58.333333333333336) internal successors, (175), 3 states have internal predecessors, (175), 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-11 17:04:37,744 INFO L276 IsEmpty]: Start isEmpty. Operand 2674 states and 2996 transitions. [2024-11-11 17:04:37,747 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 391 [2024-11-11 17:04:37,747 INFO L210 NwaCegarLoop]: Found error trace [2024-11-11 17:04:37,747 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-11 17:04:37,748 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-11-11 17:04:37,748 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-11 17:04:37,748 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-11 17:04:37,748 INFO L85 PathProgramCache]: Analyzing trace with hash 1246435889, now seen corresponding path program 1 times [2024-11-11 17:04:37,748 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-11 17:04:37,748 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [840333091] [2024-11-11 17:04:37,749 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 17:04:37,749 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-11 17:04:37,788 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 17:04:37,924 INFO L134 CoverageAnalysis]: Checked inductivity of 505 backedges. 191 proven. 0 refuted. 0 times theorem prover too weak. 314 trivial. 0 not checked. [2024-11-11 17:04:37,924 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-11 17:04:37,924 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [840333091] [2024-11-11 17:04:37,925 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [840333091] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-11 17:04:37,925 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-11 17:04:37,925 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-11 17:04:37,925 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1504754551] [2024-11-11 17:04:37,925 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-11 17:04:37,925 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-11 17:04:37,925 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-11 17:04:37,926 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-11 17:04:37,926 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-11 17:04:37,926 INFO L87 Difference]: Start difference. First operand 2674 states and 2996 transitions. Second operand has 3 states, 3 states have (on average 60.666666666666664) internal successors, (182), 3 states have internal predecessors, (182), 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-11 17:04:38,350 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-11 17:04:38,351 INFO L93 Difference]: Finished difference Result 5524 states and 6281 transitions. [2024-11-11 17:04:38,351 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-11 17:04:38,351 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 60.666666666666664) internal successors, (182), 3 states have internal predecessors, (182), 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 390 [2024-11-11 17:04:38,352 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-11 17:04:38,359 INFO L225 Difference]: With dead ends: 5524 [2024-11-11 17:04:38,359 INFO L226 Difference]: Without dead ends: 3030 [2024-11-11 17:04:38,362 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-11 17:04:38,363 INFO L435 NwaCegarLoop]: 220 mSDtfsCounter, 118 mSDsluCounter, 5 mSDsCounter, 0 mSdLazyCounter, 464 mSolverCounterSat, 52 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 118 SdHoareTripleChecker+Valid, 225 SdHoareTripleChecker+Invalid, 516 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 52 IncrementalHoareTripleChecker+Valid, 464 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-11-11 17:04:38,363 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [118 Valid, 225 Invalid, 516 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [52 Valid, 464 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-11-11 17:04:38,366 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3030 states. [2024-11-11 17:04:38,393 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3030 to 2852. [2024-11-11 17:04:38,395 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2852 states, 2851 states have (on average 1.1417046650298142) internal successors, (3255), 2851 states have internal predecessors, (3255), 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-11 17:04:38,399 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2852 states to 2852 states and 3255 transitions. [2024-11-11 17:04:38,400 INFO L78 Accepts]: Start accepts. Automaton has 2852 states and 3255 transitions. Word has length 390 [2024-11-11 17:04:38,400 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-11 17:04:38,400 INFO L471 AbstractCegarLoop]: Abstraction has 2852 states and 3255 transitions. [2024-11-11 17:04:38,400 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 60.666666666666664) internal successors, (182), 3 states have internal predecessors, (182), 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-11 17:04:38,401 INFO L276 IsEmpty]: Start isEmpty. Operand 2852 states and 3255 transitions. [2024-11-11 17:04:38,405 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 463 [2024-11-11 17:04:38,405 INFO L210 NwaCegarLoop]: Found error trace [2024-11-11 17:04:38,405 INFO L218 NwaCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 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, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-11 17:04:38,406 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-11-11 17:04:38,406 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-11 17:04:38,406 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-11 17:04:38,406 INFO L85 PathProgramCache]: Analyzing trace with hash -654982799, now seen corresponding path program 1 times [2024-11-11 17:04:38,406 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-11 17:04:38,407 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [495903641] [2024-11-11 17:04:38,407 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 17:04:38,407 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-11 17:04:38,451 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 17:04:38,576 INFO L134 CoverageAnalysis]: Checked inductivity of 784 backedges. 470 proven. 0 refuted. 0 times theorem prover too weak. 314 trivial. 0 not checked. [2024-11-11 17:04:38,577 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-11 17:04:38,577 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [495903641] [2024-11-11 17:04:38,577 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [495903641] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-11 17:04:38,577 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-11 17:04:38,577 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-11 17:04:38,577 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1126065181] [2024-11-11 17:04:38,577 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-11 17:04:38,578 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-11 17:04:38,578 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-11 17:04:38,578 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-11 17:04:38,579 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-11 17:04:38,579 INFO L87 Difference]: Start difference. First operand 2852 states and 3255 transitions. Second operand has 3 states, 3 states have (on average 84.66666666666667) internal successors, (254), 3 states have internal predecessors, (254), 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-11 17:04:39,013 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-11 17:04:39,013 INFO L93 Difference]: Finished difference Result 6592 states and 7590 transitions. [2024-11-11 17:04:39,014 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-11 17:04:39,014 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 84.66666666666667) internal successors, (254), 3 states have internal predecessors, (254), 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 462 [2024-11-11 17:04:39,015 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-11 17:04:39,024 INFO L225 Difference]: With dead ends: 6592 [2024-11-11 17:04:39,024 INFO L226 Difference]: Without dead ends: 3920 [2024-11-11 17:04:39,027 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-11 17:04:39,028 INFO L435 NwaCegarLoop]: 54 mSDtfsCounter, 121 mSDsluCounter, 3 mSDsCounter, 0 mSdLazyCounter, 440 mSolverCounterSat, 76 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 121 SdHoareTripleChecker+Valid, 57 SdHoareTripleChecker+Invalid, 516 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 76 IncrementalHoareTripleChecker+Valid, 440 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-11-11 17:04:39,028 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [121 Valid, 57 Invalid, 516 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [76 Valid, 440 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-11-11 17:04:39,031 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3920 states. [2024-11-11 17:04:39,070 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3920 to 3920. [2024-11-11 17:04:39,074 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3920 states, 3919 states have (on average 1.137790252615463) internal successors, (4459), 3919 states have internal predecessors, (4459), 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-11 17:04:39,080 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3920 states to 3920 states and 4459 transitions. [2024-11-11 17:04:39,080 INFO L78 Accepts]: Start accepts. Automaton has 3920 states and 4459 transitions. Word has length 462 [2024-11-11 17:04:39,080 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-11 17:04:39,080 INFO L471 AbstractCegarLoop]: Abstraction has 3920 states and 4459 transitions. [2024-11-11 17:04:39,081 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 84.66666666666667) internal successors, (254), 3 states have internal predecessors, (254), 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-11 17:04:39,081 INFO L276 IsEmpty]: Start isEmpty. Operand 3920 states and 4459 transitions. [2024-11-11 17:04:39,084 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 538 [2024-11-11 17:04:39,084 INFO L210 NwaCegarLoop]: Found error trace [2024-11-11 17:04:39,085 INFO L218 NwaCegarLoop]: trace histogram [6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 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, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-11 17:04:39,085 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-11-11 17:04:39,085 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-11 17:04:39,085 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-11 17:04:39,085 INFO L85 PathProgramCache]: Analyzing trace with hash 1033800595, now seen corresponding path program 1 times [2024-11-11 17:04:39,085 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-11 17:04:39,086 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [224649192] [2024-11-11 17:04:39,086 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 17:04:39,086 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-11 17:04:39,144 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 17:04:39,432 INFO L134 CoverageAnalysis]: Checked inductivity of 1159 backedges. 754 proven. 0 refuted. 0 times theorem prover too weak. 405 trivial. 0 not checked. [2024-11-11 17:04:39,435 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-11 17:04:39,435 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [224649192] [2024-11-11 17:04:39,435 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [224649192] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-11 17:04:39,435 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-11 17:04:39,435 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-11 17:04:39,436 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1852269179] [2024-11-11 17:04:39,436 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-11 17:04:39,436 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-11 17:04:39,436 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-11 17:04:39,436 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-11 17:04:39,437 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-11-11 17:04:39,437 INFO L87 Difference]: Start difference. First operand 3920 states and 4459 transitions. Second operand has 4 states, 4 states have (on average 62.5) internal successors, (250), 3 states have internal predecessors, (250), 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-11 17:04:39,927 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-11 17:04:39,927 INFO L93 Difference]: Finished difference Result 7896 states and 8991 transitions. [2024-11-11 17:04:39,927 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-11 17:04:39,928 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 62.5) internal successors, (250), 3 states have internal predecessors, (250), 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 537 [2024-11-11 17:04:39,928 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-11 17:04:39,937 INFO L225 Difference]: With dead ends: 7896 [2024-11-11 17:04:39,937 INFO L226 Difference]: Without dead ends: 4098 [2024-11-11 17:04:39,940 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-11-11 17:04:39,940 INFO L435 NwaCegarLoop]: 9 mSDtfsCounter, 141 mSDsluCounter, 8 mSDsCounter, 0 mSdLazyCounter, 685 mSolverCounterSat, 46 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 141 SdHoareTripleChecker+Valid, 17 SdHoareTripleChecker+Invalid, 731 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 46 IncrementalHoareTripleChecker+Valid, 685 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-11-11 17:04:39,941 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [141 Valid, 17 Invalid, 731 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [46 Valid, 685 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2024-11-11 17:04:39,943 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4098 states. [2024-11-11 17:04:39,979 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4098 to 3920. [2024-11-11 17:04:39,982 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3920 states, 3919 states have (on average 1.0944118397550395) internal successors, (4289), 3919 states have internal predecessors, (4289), 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-11 17:04:39,987 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3920 states to 3920 states and 4289 transitions. [2024-11-11 17:04:39,987 INFO L78 Accepts]: Start accepts. Automaton has 3920 states and 4289 transitions. Word has length 537 [2024-11-11 17:04:39,987 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-11 17:04:39,987 INFO L471 AbstractCegarLoop]: Abstraction has 3920 states and 4289 transitions. [2024-11-11 17:04:39,988 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 62.5) internal successors, (250), 3 states have internal predecessors, (250), 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-11 17:04:39,988 INFO L276 IsEmpty]: Start isEmpty. Operand 3920 states and 4289 transitions. [2024-11-11 17:04:39,991 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 546 [2024-11-11 17:04:39,991 INFO L210 NwaCegarLoop]: Found error trace [2024-11-11 17:04:39,992 INFO L218 NwaCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 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] [2024-11-11 17:04:39,992 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2024-11-11 17:04:39,992 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-11 17:04:39,992 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-11 17:04:39,993 INFO L85 PathProgramCache]: Analyzing trace with hash 415759000, now seen corresponding path program 1 times [2024-11-11 17:04:39,993 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-11 17:04:39,993 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [879517985] [2024-11-11 17:04:39,993 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 17:04:39,993 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-11 17:04:40,119 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 17:04:40,369 INFO L134 CoverageAnalysis]: Checked inductivity of 892 backedges. 578 proven. 0 refuted. 0 times theorem prover too weak. 314 trivial. 0 not checked. [2024-11-11 17:04:40,369 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-11 17:04:40,370 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [879517985] [2024-11-11 17:04:40,370 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [879517985] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-11 17:04:40,370 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-11 17:04:40,370 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-11 17:04:40,370 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [524587479] [2024-11-11 17:04:40,370 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-11 17:04:40,370 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-11 17:04:40,370 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-11 17:04:40,371 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-11 17:04:40,371 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-11-11 17:04:40,371 INFO L87 Difference]: Start difference. First operand 3920 states and 4289 transitions. Second operand has 4 states, 4 states have (on average 84.25) internal successors, (337), 4 states have internal predecessors, (337), 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-11 17:04:41,090 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-11 17:04:41,091 INFO L93 Difference]: Finished difference Result 10152 states and 11194 transitions. [2024-11-11 17:04:41,091 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-11 17:04:41,091 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 84.25) internal successors, (337), 4 states have internal predecessors, (337), 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 545 [2024-11-11 17:04:41,092 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-11 17:04:41,141 INFO L225 Difference]: With dead ends: 10152 [2024-11-11 17:04:41,142 INFO L226 Difference]: Without dead ends: 6412 [2024-11-11 17:04:41,144 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-11-11 17:04:41,145 INFO L435 NwaCegarLoop]: 199 mSDtfsCounter, 152 mSDsluCounter, 12 mSDsCounter, 0 mSdLazyCounter, 1015 mSolverCounterSat, 72 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 152 SdHoareTripleChecker+Valid, 211 SdHoareTripleChecker+Invalid, 1087 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 72 IncrementalHoareTripleChecker+Valid, 1015 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2024-11-11 17:04:41,145 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [152 Valid, 211 Invalid, 1087 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [72 Valid, 1015 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2024-11-11 17:04:41,148 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6412 states. [2024-11-11 17:04:41,209 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6412 to 6234. [2024-11-11 17:04:41,215 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6234 states, 6233 states have (on average 1.0948179047007862) internal successors, (6824), 6233 states have internal predecessors, (6824), 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-11 17:04:41,221 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6234 states to 6234 states and 6824 transitions. [2024-11-11 17:04:41,222 INFO L78 Accepts]: Start accepts. Automaton has 6234 states and 6824 transitions. Word has length 545 [2024-11-11 17:04:41,222 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-11 17:04:41,222 INFO L471 AbstractCegarLoop]: Abstraction has 6234 states and 6824 transitions. [2024-11-11 17:04:41,223 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 84.25) internal successors, (337), 4 states have internal predecessors, (337), 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-11 17:04:41,223 INFO L276 IsEmpty]: Start isEmpty. Operand 6234 states and 6824 transitions. [2024-11-11 17:04:41,227 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 600 [2024-11-11 17:04:41,227 INFO L210 NwaCegarLoop]: Found error trace [2024-11-11 17:04:41,228 INFO L218 NwaCegarLoop]: trace histogram [6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-11 17:04:41,228 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2024-11-11 17:04:41,228 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-11 17:04:41,228 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-11 17:04:41,228 INFO L85 PathProgramCache]: Analyzing trace with hash 1651640121, now seen corresponding path program 1 times [2024-11-11 17:04:41,229 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-11 17:04:41,229 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [370041089] [2024-11-11 17:04:41,229 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 17:04:41,229 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-11 17:04:41,280 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 17:04:41,610 INFO L134 CoverageAnalysis]: Checked inductivity of 1354 backedges. 976 proven. 0 refuted. 0 times theorem prover too weak. 378 trivial. 0 not checked. [2024-11-11 17:04:41,610 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-11 17:04:41,610 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [370041089] [2024-11-11 17:04:41,610 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [370041089] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-11 17:04:41,611 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-11 17:04:41,611 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-11 17:04:41,611 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [948944755] [2024-11-11 17:04:41,611 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-11 17:04:41,612 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-11 17:04:41,612 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-11 17:04:41,612 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-11 17:04:41,612 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-11 17:04:41,613 INFO L87 Difference]: Start difference. First operand 6234 states and 6824 transitions. Second operand has 3 states, 3 states have (on average 109.33333333333333) internal successors, (328), 3 states have internal predecessors, (328), 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-11 17:04:42,026 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-11 17:04:42,026 INFO L93 Difference]: Finished difference Result 12288 states and 13467 transitions. [2024-11-11 17:04:42,026 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-11 17:04:42,027 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 109.33333333333333) internal successors, (328), 3 states have internal predecessors, (328), 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 599 [2024-11-11 17:04:42,028 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-11 17:04:42,039 INFO L225 Difference]: With dead ends: 12288 [2024-11-11 17:04:42,040 INFO L226 Difference]: Without dead ends: 6234 [2024-11-11 17:04:42,045 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-11 17:04:42,046 INFO L435 NwaCegarLoop]: 206 mSDtfsCounter, 74 mSDsluCounter, 4 mSDsCounter, 0 mSdLazyCounter, 424 mSolverCounterSat, 55 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 74 SdHoareTripleChecker+Valid, 210 SdHoareTripleChecker+Invalid, 479 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 55 IncrementalHoareTripleChecker+Valid, 424 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-11-11 17:04:42,046 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [74 Valid, 210 Invalid, 479 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [55 Valid, 424 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-11-11 17:04:42,051 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6234 states. [2024-11-11 17:04:42,105 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6234 to 6234. [2024-11-11 17:04:42,111 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6234 states, 6233 states have (on average 1.0739611743943527) internal successors, (6694), 6233 states have internal predecessors, (6694), 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-11 17:04:42,118 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6234 states to 6234 states and 6694 transitions. [2024-11-11 17:04:42,119 INFO L78 Accepts]: Start accepts. Automaton has 6234 states and 6694 transitions. Word has length 599 [2024-11-11 17:04:42,119 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-11 17:04:42,119 INFO L471 AbstractCegarLoop]: Abstraction has 6234 states and 6694 transitions. [2024-11-11 17:04:42,120 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 109.33333333333333) internal successors, (328), 3 states have internal predecessors, (328), 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-11 17:04:42,120 INFO L276 IsEmpty]: Start isEmpty. Operand 6234 states and 6694 transitions. [2024-11-11 17:04:42,125 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 677 [2024-11-11 17:04:42,125 INFO L210 NwaCegarLoop]: Found error trace [2024-11-11 17:04:42,126 INFO L218 NwaCegarLoop]: trace histogram [7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-11 17:04:42,126 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2024-11-11 17:04:42,126 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-11 17:04:42,128 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-11 17:04:42,128 INFO L85 PathProgramCache]: Analyzing trace with hash -1541670449, now seen corresponding path program 1 times [2024-11-11 17:04:42,128 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-11 17:04:42,128 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [570889706] [2024-11-11 17:04:42,128 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 17:04:42,128 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-11 17:04:42,182 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 17:04:42,981 INFO L134 CoverageAnalysis]: Checked inductivity of 1802 backedges. 1320 proven. 104 refuted. 0 times theorem prover too weak. 378 trivial. 0 not checked. [2024-11-11 17:04:42,982 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-11 17:04:42,982 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [570889706] [2024-11-11 17:04:42,982 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [570889706] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-11 17:04:42,982 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [708012826] [2024-11-11 17:04:42,982 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 17:04:42,982 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-11 17:04:42,982 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-11 17:04:42,984 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-11 17:04:42,985 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-11 17:04:43,168 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 17:04:43,171 INFO L256 TraceCheckSpWp]: Trace formula consists of 855 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-11-11 17:04:43,189 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-11 17:04:43,317 INFO L134 CoverageAnalysis]: Checked inductivity of 1802 backedges. 383 proven. 0 refuted. 0 times theorem prover too weak. 1419 trivial. 0 not checked. [2024-11-11 17:04:43,318 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-11 17:04:43,319 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [708012826] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-11 17:04:43,319 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-11 17:04:43,319 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [5] total 7 [2024-11-11 17:04:43,319 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [770656342] [2024-11-11 17:04:43,319 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-11 17:04:43,320 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-11 17:04:43,320 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-11 17:04:43,321 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-11 17:04:43,321 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2024-11-11 17:04:43,321 INFO L87 Difference]: Start difference. First operand 6234 states and 6694 transitions. Second operand has 3 states, 3 states have (on average 61.666666666666664) internal successors, (185), 3 states have internal predecessors, (185), 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-11 17:04:43,726 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-11 17:04:43,727 INFO L93 Difference]: Finished difference Result 7660 states and 8176 transitions. [2024-11-11 17:04:43,727 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-11 17:04:43,727 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 61.666666666666664) internal successors, (185), 3 states have internal predecessors, (185), 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 676 [2024-11-11 17:04:43,728 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-11 17:04:43,744 INFO L225 Difference]: With dead ends: 7660 [2024-11-11 17:04:43,745 INFO L226 Difference]: Without dead ends: 7658 [2024-11-11 17:04:43,747 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 680 GetRequests, 675 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2024-11-11 17:04:43,748 INFO L435 NwaCegarLoop]: 7 mSDtfsCounter, 136 mSDsluCounter, 4 mSDsCounter, 0 mSdLazyCounter, 431 mSolverCounterSat, 28 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 136 SdHoareTripleChecker+Valid, 11 SdHoareTripleChecker+Invalid, 459 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 28 IncrementalHoareTripleChecker+Valid, 431 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-11-11 17:04:43,748 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [136 Valid, 11 Invalid, 459 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [28 Valid, 431 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-11-11 17:04:43,754 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7658 states. [2024-11-11 17:04:43,816 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7658 to 6234. [2024-11-11 17:04:43,822 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6234 states, 6233 states have (on average 1.0733194288464625) internal successors, (6690), 6233 states have internal predecessors, (6690), 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-11 17:04:43,828 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6234 states to 6234 states and 6690 transitions. [2024-11-11 17:04:43,829 INFO L78 Accepts]: Start accepts. Automaton has 6234 states and 6690 transitions. Word has length 676 [2024-11-11 17:04:43,829 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-11 17:04:43,829 INFO L471 AbstractCegarLoop]: Abstraction has 6234 states and 6690 transitions. [2024-11-11 17:04:43,830 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 61.666666666666664) internal successors, (185), 3 states have internal predecessors, (185), 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-11 17:04:43,830 INFO L276 IsEmpty]: Start isEmpty. Operand 6234 states and 6690 transitions. [2024-11-11 17:04:43,838 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 811 [2024-11-11 17:04:43,838 INFO L210 NwaCegarLoop]: Found error trace [2024-11-11 17:04:43,839 INFO L218 NwaCegarLoop]: trace histogram [7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-11 17:04:43,853 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2024-11-11 17:04:44,039 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,SelfDestructingSolverStorable12 [2024-11-11 17:04:44,041 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-11 17:04:44,041 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-11 17:04:44,041 INFO L85 PathProgramCache]: Analyzing trace with hash 1361029074, now seen corresponding path program 1 times [2024-11-11 17:04:44,041 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-11 17:04:44,041 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [586213623] [2024-11-11 17:04:44,042 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 17:04:44,042 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-11 17:04:44,126 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 17:04:44,604 INFO L134 CoverageAnalysis]: Checked inductivity of 1947 backedges. 1414 proven. 155 refuted. 0 times theorem prover too weak. 378 trivial. 0 not checked. [2024-11-11 17:04:44,604 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-11 17:04:44,604 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [586213623] [2024-11-11 17:04:44,605 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [586213623] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-11 17:04:44,605 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [829682300] [2024-11-11 17:04:44,605 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 17:04:44,605 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-11 17:04:44,605 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-11 17:04:44,609 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-11 17:04:44,610 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-11 17:04:44,777 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 17:04:44,780 INFO L256 TraceCheckSpWp]: Trace formula consists of 992 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-11-11 17:04:44,787 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-11 17:04:44,854 INFO L134 CoverageAnalysis]: Checked inductivity of 1947 backedges. 383 proven. 0 refuted. 0 times theorem prover too weak. 1564 trivial. 0 not checked. [2024-11-11 17:04:44,854 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-11 17:04:44,854 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [829682300] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-11 17:04:44,854 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-11 17:04:44,855 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [4] total 5 [2024-11-11 17:04:44,855 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [298733028] [2024-11-11 17:04:44,855 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-11 17:04:44,855 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-11 17:04:44,856 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-11 17:04:44,856 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-11 17:04:44,856 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-11-11 17:04:44,856 INFO L87 Difference]: Start difference. First operand 6234 states and 6690 transitions. Second operand has 3 states, 3 states have (on average 82.33333333333333) internal successors, (247), 3 states have internal predecessors, (247), 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-11 17:04:45,255 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-11 17:04:45,255 INFO L93 Difference]: Finished difference Result 12286 states and 13198 transitions. [2024-11-11 17:04:45,256 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-11 17:04:45,256 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 82.33333333333333) internal successors, (247), 3 states have internal predecessors, (247), 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 810 [2024-11-11 17:04:45,257 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-11 17:04:45,257 INFO L225 Difference]: With dead ends: 12286 [2024-11-11 17:04:45,257 INFO L226 Difference]: Without dead ends: 0 [2024-11-11 17:04:45,264 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 813 GetRequests, 810 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-11-11 17:04:45,265 INFO L435 NwaCegarLoop]: 208 mSDtfsCounter, 125 mSDsluCounter, 4 mSDsCounter, 0 mSdLazyCounter, 427 mSolverCounterSat, 51 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 125 SdHoareTripleChecker+Valid, 212 SdHoareTripleChecker+Invalid, 478 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 51 IncrementalHoareTripleChecker+Valid, 427 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-11-11 17:04:45,265 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [125 Valid, 212 Invalid, 478 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [51 Valid, 427 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-11-11 17:04:45,265 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2024-11-11 17:04:45,265 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2024-11-11 17:04:45,266 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-11 17:04:45,266 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2024-11-11 17:04:45,266 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 810 [2024-11-11 17:04:45,266 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-11 17:04:45,266 INFO L471 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2024-11-11 17:04:45,266 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 82.33333333333333) internal successors, (247), 3 states have internal predecessors, (247), 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-11 17:04:45,266 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2024-11-11 17:04:45,266 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2024-11-11 17:04:45,269 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2024-11-11 17:04:45,283 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-11 17:04:45,469 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-11 17:04:45,472 INFO L421 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-11 17:04:45,474 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2024-11-11 17:04:45,741 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2024-11-11 17:04:45,759 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 11.11 05:04:45 BoogieIcfgContainer [2024-11-11 17:04:45,760 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-11-11 17:04:45,760 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-11-11 17:04:45,761 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-11-11 17:04:45,761 INFO L274 PluginConnector]: Witness Printer initialized [2024-11-11 17:04:45,761 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.11 05:04:30" (3/4) ... [2024-11-11 17:04:45,763 INFO L142 WitnessPrinter]: Generating witness for correct program [2024-11-11 17:04:45,782 INFO L925 BoogieBacktranslator]: Reduced CFG by removing 11 nodes and edges [2024-11-11 17:04:45,782 INFO L925 BoogieBacktranslator]: Reduced CFG by removing 4 nodes and edges [2024-11-11 17:04:45,783 INFO L925 BoogieBacktranslator]: Reduced CFG by removing 3 nodes and edges [2024-11-11 17:04:45,785 INFO L925 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2024-11-11 17:04:45,899 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2024-11-11 17:04:45,899 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.yml [2024-11-11 17:04:45,899 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-11-11 17:04:45,900 INFO L158 Benchmark]: Toolchain (without parser) took 17214.23ms. Allocated memory was 172.0MB in the beginning and 664.8MB in the end (delta: 492.8MB). Free memory was 99.2MB in the beginning and 528.5MB in the end (delta: -429.3MB). Peak memory consumption was 64.4MB. Max. memory is 16.1GB. [2024-11-11 17:04:45,900 INFO L158 Benchmark]: CDTParser took 0.14ms. Allocated memory is still 172.0MB. Free memory is still 127.4MB. There was no memory consumed. Max. memory is 16.1GB. [2024-11-11 17:04:45,900 INFO L158 Benchmark]: CACSL2BoogieTranslator took 562.38ms. Allocated memory is still 172.0MB. Free memory was 98.9MB in the beginning and 121.2MB in the end (delta: -22.3MB). Peak memory consumption was 19.5MB. Max. memory is 16.1GB. [2024-11-11 17:04:45,900 INFO L158 Benchmark]: Boogie Procedure Inliner took 80.88ms. Allocated memory is still 172.0MB. Free memory was 121.2MB in the beginning and 111.3MB in the end (delta: 9.8MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. [2024-11-11 17:04:45,900 INFO L158 Benchmark]: Boogie Preprocessor took 116.28ms. Allocated memory is still 172.0MB. Free memory was 111.3MB in the beginning and 98.6MB in the end (delta: 12.7MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. [2024-11-11 17:04:45,900 INFO L158 Benchmark]: RCFGBuilder took 977.58ms. Allocated memory is still 172.0MB. Free memory was 98.0MB in the beginning and 67.7MB in the end (delta: 30.3MB). Peak memory consumption was 56.8MB. Max. memory is 16.1GB. [2024-11-11 17:04:45,901 INFO L158 Benchmark]: TraceAbstraction took 15330.09ms. Allocated memory was 172.0MB in the beginning and 664.8MB in the end (delta: 492.8MB). Free memory was 66.9MB in the beginning and 542.1MB in the end (delta: -475.2MB). Peak memory consumption was 333.0MB. Max. memory is 16.1GB. [2024-11-11 17:04:45,901 INFO L158 Benchmark]: Witness Printer took 138.70ms. Allocated memory is still 664.8MB. Free memory was 542.1MB in the beginning and 528.5MB in the end (delta: 13.6MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. [2024-11-11 17:04:45,902 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 172.0MB. Free memory is still 127.4MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 562.38ms. Allocated memory is still 172.0MB. Free memory was 98.9MB in the beginning and 121.2MB in the end (delta: -22.3MB). Peak memory consumption was 19.5MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 80.88ms. Allocated memory is still 172.0MB. Free memory was 121.2MB in the beginning and 111.3MB in the end (delta: 9.8MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. * Boogie Preprocessor took 116.28ms. Allocated memory is still 172.0MB. Free memory was 111.3MB in the beginning and 98.6MB in the end (delta: 12.7MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. * RCFGBuilder took 977.58ms. Allocated memory is still 172.0MB. Free memory was 98.0MB in the beginning and 67.7MB in the end (delta: 30.3MB). Peak memory consumption was 56.8MB. Max. memory is 16.1GB. * TraceAbstraction took 15330.09ms. Allocated memory was 172.0MB in the beginning and 664.8MB in the end (delta: 492.8MB). Free memory was 66.9MB in the beginning and 542.1MB in the end (delta: -475.2MB). Peak memory consumption was 333.0MB. Max. memory is 16.1GB. * Witness Printer took 138.70ms. Allocated memory is still 664.8MB. Free memory was 542.1MB in the beginning and 528.5MB in the end (delta: 13.6MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - PositiveResult [Line: 212]: 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, 245 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 15.0s, OverallIterations: 14, TraceHistogramMax: 7, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.1s, AutomataDifference: 7.7s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 1966 SdHoareTripleChecker+Valid, 6.9s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 1966 mSDsluCounter, 1754 SdHoareTripleChecker+Invalid, 5.7s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 82 mSDsCounter, 1091 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 7845 IncrementalHoareTripleChecker+Invalid, 8936 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 1091 mSolverCounterUnsat, 1672 mSDtfsCounter, 7845 mSolverCounterSat, 0.1s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 1881 GetRequests, 1853 SyntacticMatches, 0 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=6234occurred in iteration=11, InterpolantAutomatonStates: 46, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.6s AutomataMinimizationTime, 14 MinimizatonAttempts, 2136 StatesRemovedByMinimization, 5 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.2s SsaConstructionTime, 0.6s SatisfiabilityAnalysisTime, 4.5s InterpolantComputationTime, 7525 NumberOfCodeBlocks, 7525 NumberOfCodeBlocksAsserted, 17 NumberOfCheckSat, 7508 ConstructedInterpolants, 0 QuantifiedInterpolants, 20369 SizeOfPredicates, 0 NumberOfNonLiveVariables, 2312 ConjunctsInSsa, 6 ConjunctsInUnsatCore, 17 InterpolantComputations, 14 PerfectInterpolantSequences, 13979/14368 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: 890]: Loop Invariant Derived loop invariant: ((((((7 <= a15) && (a24 == 1)) || ((9 <= a21) && (a24 == 1))) || ((a24 == 1) && (12 <= a12))) || (((a15 <= 8) && (a21 <= 7)) && (((long long) 49 + a12) <= 0))) || ((a24 == 1) && (a21 <= 7))) RESULT: Ultimate proved your program to be correct! [2024-11-11 17:04:45,938 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