./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/eca-rers2012/Problem14_label21.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version c7c6ca5d 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_label21.c -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash d844f5f056e0756d76cce620ddef5d81b013b68e741e848d9617fc0c9c828b8e --- Real Ultimate output --- This is Ultimate 0.2.5-?-c7c6ca5-m [2024-11-08 11:26:06,984 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-08 11:26:07,031 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-11-08 11:26:07,036 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-08 11:26:07,036 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-08 11:26:07,064 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-08 11:26:07,065 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-08 11:26:07,065 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-08 11:26:07,065 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-08 11:26:07,066 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-08 11:26:07,066 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-08 11:26:07,066 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-08 11:26:07,067 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-08 11:26:07,067 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-08 11:26:07,067 INFO L153 SettingsManager]: * Use SBE=true [2024-11-08 11:26:07,067 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-08 11:26:07,068 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-08 11:26:07,068 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-08 11:26:07,068 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-08 11:26:07,068 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-08 11:26:07,069 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-08 11:26:07,071 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-08 11:26:07,071 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-08 11:26:07,072 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-08 11:26:07,072 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-08 11:26:07,072 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-08 11:26:07,072 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-08 11:26:07,072 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-08 11:26:07,072 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-08 11:26:07,073 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-08 11:26:07,073 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-08 11:26:07,073 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-08 11:26:07,073 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-08 11:26:07,073 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-08 11:26:07,074 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-08 11:26:07,074 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-08 11:26:07,074 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-08 11:26:07,074 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-08 11:26:07,074 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-08 11:26:07,075 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-08 11:26:07,075 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-08 11:26:07,075 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-08 11:26:07,075 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 -> d844f5f056e0756d76cce620ddef5d81b013b68e741e848d9617fc0c9c828b8e [2024-11-08 11:26:07,261 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-08 11:26:07,275 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-08 11:26:07,278 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-08 11:26:07,279 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-08 11:26:07,279 INFO L274 PluginConnector]: CDTParser initialized [2024-11-08 11:26:07,280 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/eca-rers2012/Problem14_label21.c [2024-11-08 11:26:08,530 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-08 11:26:08,728 INFO L384 CDTParser]: Found 1 translation units. [2024-11-08 11:26:08,728 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/eca-rers2012/Problem14_label21.c [2024-11-08 11:26:08,745 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/9adb3d299/198f2572f506442490ac78c35c7c8f2d/FLAGce4bc31a8 [2024-11-08 11:26:08,757 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/9adb3d299/198f2572f506442490ac78c35c7c8f2d [2024-11-08 11:26:08,760 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-08 11:26:08,762 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-08 11:26:08,764 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-08 11:26:08,764 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-08 11:26:08,768 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-08 11:26:08,768 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.11 11:26:08" (1/1) ... [2024-11-08 11:26:08,770 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@65bce50b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 11:26:08, skipping insertion in model container [2024-11-08 11:26:08,770 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.11 11:26:08" (1/1) ... [2024-11-08 11:26:08,806 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-08 11:26:08,956 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_label21.c[3617,3630] [2024-11-08 11:26:09,094 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-08 11:26:09,101 INFO L200 MainTranslator]: Completed pre-run [2024-11-08 11:26:09,118 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_label21.c[3617,3630] [2024-11-08 11:26:09,174 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-08 11:26:09,192 INFO L204 MainTranslator]: Completed translation [2024-11-08 11:26:09,193 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 11:26:09 WrapperNode [2024-11-08 11:26:09,194 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-08 11:26:09,197 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-08 11:26:09,197 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-08 11:26:09,197 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-08 11:26:09,219 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 11:26:09" (1/1) ... [2024-11-08 11:26:09,238 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 11:26:09" (1/1) ... [2024-11-08 11:26:09,284 INFO L138 Inliner]: procedures = 14, calls = 8, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 859 [2024-11-08 11:26:09,284 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-08 11:26:09,285 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-08 11:26:09,285 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-08 11:26:09,285 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-08 11:26:09,294 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 11:26:09" (1/1) ... [2024-11-08 11:26:09,295 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 11:26:09" (1/1) ... [2024-11-08 11:26:09,304 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 11:26:09" (1/1) ... [2024-11-08 11:26:09,332 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-08 11:26:09,336 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 11:26:09" (1/1) ... [2024-11-08 11:26:09,336 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 11:26:09" (1/1) ... [2024-11-08 11:26:09,359 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 11:26:09" (1/1) ... [2024-11-08 11:26:09,371 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 11:26:09" (1/1) ... [2024-11-08 11:26:09,379 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 11:26:09" (1/1) ... [2024-11-08 11:26:09,386 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 11:26:09" (1/1) ... [2024-11-08 11:26:09,394 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-08 11:26:09,395 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-08 11:26:09,395 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-08 11:26:09,395 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-08 11:26:09,396 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 11:26:09" (1/1) ... [2024-11-08 11:26:09,400 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-08 11:26:09,408 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-08 11:26:09,422 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-11-08 11:26:09,424 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-08 11:26:09,459 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-08 11:26:09,459 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-11-08 11:26:09,460 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-08 11:26:09,460 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-08 11:26:09,516 INFO L238 CfgBuilder]: Building ICFG [2024-11-08 11:26:09,518 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-08 11:26:10,427 INFO L? ?]: Removed 123 outVars from TransFormulas that were not future-live. [2024-11-08 11:26:10,427 INFO L287 CfgBuilder]: Performing block encoding [2024-11-08 11:26:10,446 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-08 11:26:10,447 INFO L316 CfgBuilder]: Removed 1 assume(true) statements. [2024-11-08 11:26:10,448 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.11 11:26:10 BoogieIcfgContainer [2024-11-08 11:26:10,448 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-08 11:26:10,450 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-08 11:26:10,450 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-08 11:26:10,453 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-08 11:26:10,453 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 08.11 11:26:08" (1/3) ... [2024-11-08 11:26:10,454 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2e6f57b8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.11 11:26:10, skipping insertion in model container [2024-11-08 11:26:10,454 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 11:26:09" (2/3) ... [2024-11-08 11:26:10,454 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2e6f57b8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.11 11:26:10, skipping insertion in model container [2024-11-08 11:26:10,455 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.11 11:26:10" (3/3) ... [2024-11-08 11:26:10,456 INFO L112 eAbstractionObserver]: Analyzing ICFG Problem14_label21.c [2024-11-08 11:26:10,468 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-08 11:26:10,468 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-11-08 11:26:10,532 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-08 11:26:10,537 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;@63f1adb3, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-08 11:26:10,538 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-08 11:26:10,541 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-08 11:26:10,546 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2024-11-08 11:26:10,546 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 11:26:10,547 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 11:26:10,547 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 11:26:10,550 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 11:26:10,551 INFO L85 PathProgramCache]: Analyzing trace with hash 1089129850, now seen corresponding path program 1 times [2024-11-08 11:26:10,558 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 11:26:10,558 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [611478828] [2024-11-08 11:26:10,558 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 11:26:10,559 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 11:26:10,659 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 11:26:10,833 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-08 11:26:10,835 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 11:26:10,835 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [611478828] [2024-11-08 11:26:10,835 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [611478828] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 11:26:10,835 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 11:26:10,836 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-08 11:26:10,837 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [269741811] [2024-11-08 11:26:10,837 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 11:26:10,840 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-08 11:26:10,841 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 11:26:10,858 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-08 11:26:10,859 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-08 11:26:10,861 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 11.333333333333334) internal successors, (34), 2 states have internal predecessors, (34), 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-08 11:26:11,583 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 11:26:11,584 INFO L93 Difference]: Finished difference Result 669 states and 1200 transitions. [2024-11-08 11:26:11,585 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-08 11:26:11,586 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 11.333333333333334) internal successors, (34), 2 states have internal predecessors, (34), 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 34 [2024-11-08 11:26:11,586 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 11:26:11,598 INFO L225 Difference]: With dead ends: 669 [2024-11-08 11:26:11,598 INFO L226 Difference]: Without dead ends: 360 [2024-11-08 11:26:11,603 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-08 11:26:11,606 INFO L432 NwaCegarLoop]: 70 mSDtfsCounter, 172 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 615 mSolverCounterSat, 88 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 172 SdHoareTripleChecker+Valid, 77 SdHoareTripleChecker+Invalid, 703 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 88 IncrementalHoareTripleChecker+Valid, 615 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2024-11-08 11:26:11,607 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [172 Valid, 77 Invalid, 703 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [88 Valid, 615 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2024-11-08 11:26:11,623 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 360 states. [2024-11-08 11:26:11,647 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 360 to 360. [2024-11-08 11:26:11,650 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 360 states, 359 states have (on average 1.6378830083565459) internal successors, (588), 359 states have internal predecessors, (588), 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-08 11:26:11,651 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 360 states to 360 states and 588 transitions. [2024-11-08 11:26:11,652 INFO L78 Accepts]: Start accepts. Automaton has 360 states and 588 transitions. Word has length 34 [2024-11-08 11:26:11,653 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 11:26:11,653 INFO L471 AbstractCegarLoop]: Abstraction has 360 states and 588 transitions. [2024-11-08 11:26:11,653 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 11.333333333333334) internal successors, (34), 2 states have internal predecessors, (34), 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-08 11:26:11,653 INFO L276 IsEmpty]: Start isEmpty. Operand 360 states and 588 transitions. [2024-11-08 11:26:11,655 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2024-11-08 11:26:11,655 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 11:26:11,655 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2024-11-08 11:26:11,655 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-08 11:26:11,656 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 11:26:11,656 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 11:26:11,656 INFO L85 PathProgramCache]: Analyzing trace with hash 1732143824, now seen corresponding path program 1 times [2024-11-08 11:26:11,656 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 11:26:11,656 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1853597381] [2024-11-08 11:26:11,656 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 11:26:11,657 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 11:26:11,697 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 11:26:11,795 INFO L134 CoverageAnalysis]: Checked inductivity of 31 backedges. 31 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-08 11:26:11,795 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 11:26:11,796 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1853597381] [2024-11-08 11:26:11,796 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1853597381] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 11:26:11,796 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 11:26:11,796 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-08 11:26:11,796 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1321804465] [2024-11-08 11:26:11,796 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 11:26:11,797 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-08 11:26:11,797 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 11:26:11,798 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-08 11:26:11,798 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-08 11:26:11,799 INFO L87 Difference]: Start difference. First operand 360 states and 588 transitions. Second operand has 3 states, 3 states have (on average 33.0) internal successors, (99), 2 states have internal predecessors, (99), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 11:26:12,341 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 11:26:12,341 INFO L93 Difference]: Finished difference Result 1076 states and 1760 transitions. [2024-11-08 11:26:12,342 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-08 11:26:12,342 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 33.0) internal successors, (99), 2 states have internal predecessors, (99), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 99 [2024-11-08 11:26:12,342 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 11:26:12,345 INFO L225 Difference]: With dead ends: 1076 [2024-11-08 11:26:12,345 INFO L226 Difference]: Without dead ends: 718 [2024-11-08 11:26:12,346 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-08 11:26:12,346 INFO L432 NwaCegarLoop]: 84 mSDtfsCounter, 134 mSDsluCounter, 4 mSDsCounter, 0 mSdLazyCounter, 460 mSolverCounterSat, 131 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 134 SdHoareTripleChecker+Valid, 88 SdHoareTripleChecker+Invalid, 591 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 131 IncrementalHoareTripleChecker+Valid, 460 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-11-08 11:26:12,347 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [134 Valid, 88 Invalid, 591 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [131 Valid, 460 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2024-11-08 11:26:12,348 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 718 states. [2024-11-08 11:26:12,371 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 718 to 716. [2024-11-08 11:26:12,372 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 716 states, 715 states have (on average 1.4223776223776223) internal successors, (1017), 715 states have internal predecessors, (1017), 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-08 11:26:12,374 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 716 states to 716 states and 1017 transitions. [2024-11-08 11:26:12,374 INFO L78 Accepts]: Start accepts. Automaton has 716 states and 1017 transitions. Word has length 99 [2024-11-08 11:26:12,374 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 11:26:12,374 INFO L471 AbstractCegarLoop]: Abstraction has 716 states and 1017 transitions. [2024-11-08 11:26:12,374 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 33.0) internal successors, (99), 2 states have internal predecessors, (99), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 11:26:12,375 INFO L276 IsEmpty]: Start isEmpty. Operand 716 states and 1017 transitions. [2024-11-08 11:26:12,376 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 101 [2024-11-08 11:26:12,376 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 11:26:12,377 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 11:26:12,377 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-08 11:26:12,377 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 11:26:12,377 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 11:26:12,377 INFO L85 PathProgramCache]: Analyzing trace with hash 22069033, now seen corresponding path program 1 times [2024-11-08 11:26:12,377 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 11:26:12,378 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1296868978] [2024-11-08 11:26:12,378 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 11:26:12,378 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 11:26:12,392 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 11:26:12,457 INFO L134 CoverageAnalysis]: Checked inductivity of 31 backedges. 31 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-08 11:26:12,457 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 11:26:12,457 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1296868978] [2024-11-08 11:26:12,457 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1296868978] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 11:26:12,457 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 11:26:12,458 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-08 11:26:12,458 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [541219417] [2024-11-08 11:26:12,458 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 11:26:12,458 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-08 11:26:12,458 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 11:26:12,459 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-08 11:26:12,459 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-08 11:26:12,459 INFO L87 Difference]: Start difference. First operand 716 states and 1017 transitions. Second operand has 3 states, 3 states have (on average 33.333333333333336) internal successors, (100), 2 states have internal predecessors, (100), 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-08 11:26:12,940 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 11:26:12,940 INFO L93 Difference]: Finished difference Result 1608 states and 2324 transitions. [2024-11-08 11:26:12,940 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-08 11:26:12,941 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 33.333333333333336) internal successors, (100), 2 states have internal predecessors, (100), 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 100 [2024-11-08 11:26:12,941 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 11:26:12,943 INFO L225 Difference]: With dead ends: 1608 [2024-11-08 11:26:12,943 INFO L226 Difference]: Without dead ends: 894 [2024-11-08 11:26:12,944 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-08 11:26:12,945 INFO L432 NwaCegarLoop]: 54 mSDtfsCounter, 125 mSDsluCounter, 3 mSDsCounter, 0 mSdLazyCounter, 431 mSolverCounterSat, 201 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 125 SdHoareTripleChecker+Valid, 57 SdHoareTripleChecker+Invalid, 632 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 201 IncrementalHoareTripleChecker+Valid, 431 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-11-08 11:26:12,945 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [125 Valid, 57 Invalid, 632 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [201 Valid, 431 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2024-11-08 11:26:12,946 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 894 states. [2024-11-08 11:26:12,959 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 894 to 894. [2024-11-08 11:26:12,960 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 894 states, 893 states have (on average 1.3314669652855544) internal successors, (1189), 893 states have internal predecessors, (1189), 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-08 11:26:12,965 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 894 states to 894 states and 1189 transitions. [2024-11-08 11:26:12,965 INFO L78 Accepts]: Start accepts. Automaton has 894 states and 1189 transitions. Word has length 100 [2024-11-08 11:26:12,966 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 11:26:12,966 INFO L471 AbstractCegarLoop]: Abstraction has 894 states and 1189 transitions. [2024-11-08 11:26:12,966 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 33.333333333333336) internal successors, (100), 2 states have internal predecessors, (100), 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-08 11:26:12,966 INFO L276 IsEmpty]: Start isEmpty. Operand 894 states and 1189 transitions. [2024-11-08 11:26:12,969 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 104 [2024-11-08 11:26:12,971 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 11:26:12,971 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 11:26:12,971 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-11-08 11:26:12,972 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 11:26:12,972 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 11:26:12,972 INFO L85 PathProgramCache]: Analyzing trace with hash 1642942022, now seen corresponding path program 1 times [2024-11-08 11:26:12,972 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 11:26:12,974 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [840587009] [2024-11-08 11:26:12,975 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 11:26:12,975 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 11:26:12,999 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 11:26:13,160 INFO L134 CoverageAnalysis]: Checked inductivity of 31 backedges. 31 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-08 11:26:13,162 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 11:26:13,162 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [840587009] [2024-11-08 11:26:13,162 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [840587009] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 11:26:13,162 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 11:26:13,162 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-08 11:26:13,163 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2036684105] [2024-11-08 11:26:13,163 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 11:26:13,163 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-08 11:26:13,163 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 11:26:13,165 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-08 11:26:13,165 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-08 11:26:13,165 INFO L87 Difference]: Start difference. First operand 894 states and 1189 transitions. Second operand has 4 states, 4 states have (on average 25.75) internal successors, (103), 3 states have internal predecessors, (103), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 11:26:13,875 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 11:26:13,875 INFO L93 Difference]: Finished difference Result 2144 states and 2782 transitions. [2024-11-08 11:26:13,876 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-08 11:26:13,876 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 25.75) internal successors, (103), 3 states have internal predecessors, (103), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 103 [2024-11-08 11:26:13,876 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 11:26:13,879 INFO L225 Difference]: With dead ends: 2144 [2024-11-08 11:26:13,879 INFO L226 Difference]: Without dead ends: 1252 [2024-11-08 11:26:13,882 INFO L431 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-08 11:26:13,883 INFO L432 NwaCegarLoop]: 111 mSDtfsCounter, 441 mSDsluCounter, 12 mSDsCounter, 0 mSdLazyCounter, 943 mSolverCounterSat, 27 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 441 SdHoareTripleChecker+Valid, 123 SdHoareTripleChecker+Invalid, 970 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 27 IncrementalHoareTripleChecker+Valid, 943 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2024-11-08 11:26:13,886 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [441 Valid, 123 Invalid, 970 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [27 Valid, 943 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2024-11-08 11:26:13,887 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1252 states. [2024-11-08 11:26:13,906 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1252 to 1250. [2024-11-08 11:26:13,907 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1250 states, 1249 states have (on average 1.257005604483587) internal successors, (1570), 1249 states have internal predecessors, (1570), 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-08 11:26:13,910 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1250 states to 1250 states and 1570 transitions. [2024-11-08 11:26:13,910 INFO L78 Accepts]: Start accepts. Automaton has 1250 states and 1570 transitions. Word has length 103 [2024-11-08 11:26:13,910 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 11:26:13,911 INFO L471 AbstractCegarLoop]: Abstraction has 1250 states and 1570 transitions. [2024-11-08 11:26:13,911 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 25.75) internal successors, (103), 3 states have internal predecessors, (103), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 11:26:13,911 INFO L276 IsEmpty]: Start isEmpty. Operand 1250 states and 1570 transitions. [2024-11-08 11:26:13,913 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 115 [2024-11-08 11:26:13,915 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 11:26:13,915 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 11:26:13,916 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-11-08 11:26:13,916 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 11:26:13,916 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 11:26:13,916 INFO L85 PathProgramCache]: Analyzing trace with hash 1896681766, now seen corresponding path program 1 times [2024-11-08 11:26:13,916 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 11:26:13,917 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1309528856] [2024-11-08 11:26:13,917 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 11:26:13,917 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 11:26:13,939 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 11:26:14,118 INFO L134 CoverageAnalysis]: Checked inductivity of 31 backedges. 31 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-08 11:26:14,119 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 11:26:14,119 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1309528856] [2024-11-08 11:26:14,121 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1309528856] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 11:26:14,121 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 11:26:14,121 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-08 11:26:14,121 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [121698859] [2024-11-08 11:26:14,121 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 11:26:14,122 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-08 11:26:14,122 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 11:26:14,122 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-08 11:26:14,123 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-11-08 11:26:14,123 INFO L87 Difference]: Start difference. First operand 1250 states and 1570 transitions. Second operand has 4 states, 4 states have (on average 28.5) internal successors, (114), 3 states have internal predecessors, (114), 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-08 11:26:14,649 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 11:26:14,649 INFO L93 Difference]: Finished difference Result 2885 states and 3573 transitions. [2024-11-08 11:26:14,650 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-08 11:26:14,650 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 28.5) internal successors, (114), 3 states have internal predecessors, (114), 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 114 [2024-11-08 11:26:14,650 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 11:26:14,654 INFO L225 Difference]: With dead ends: 2885 [2024-11-08 11:26:14,654 INFO L226 Difference]: Without dead ends: 1608 [2024-11-08 11:26:14,655 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-11-08 11:26:14,656 INFO L432 NwaCegarLoop]: 112 mSDtfsCounter, 103 mSDsluCounter, 11 mSDsCounter, 0 mSdLazyCounter, 723 mSolverCounterSat, 61 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 103 SdHoareTripleChecker+Valid, 123 SdHoareTripleChecker+Invalid, 784 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 61 IncrementalHoareTripleChecker+Valid, 723 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-11-08 11:26:14,656 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [103 Valid, 123 Invalid, 784 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [61 Valid, 723 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2024-11-08 11:26:14,658 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1608 states. [2024-11-08 11:26:14,674 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1608 to 1606. [2024-11-08 11:26:14,675 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1606 states, 1605 states have (on average 1.1314641744548286) internal successors, (1816), 1605 states have internal predecessors, (1816), 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-08 11:26:14,699 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1606 states to 1606 states and 1816 transitions. [2024-11-08 11:26:14,700 INFO L78 Accepts]: Start accepts. Automaton has 1606 states and 1816 transitions. Word has length 114 [2024-11-08 11:26:14,700 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 11:26:14,700 INFO L471 AbstractCegarLoop]: Abstraction has 1606 states and 1816 transitions. [2024-11-08 11:26:14,700 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 28.5) internal successors, (114), 3 states have internal predecessors, (114), 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-08 11:26:14,701 INFO L276 IsEmpty]: Start isEmpty. Operand 1606 states and 1816 transitions. [2024-11-08 11:26:14,702 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 209 [2024-11-08 11:26:14,702 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 11:26:14,702 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 11:26:14,702 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-11-08 11:26:14,703 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 11:26:14,703 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 11:26:14,703 INFO L85 PathProgramCache]: Analyzing trace with hash 535573908, now seen corresponding path program 1 times [2024-11-08 11:26:14,703 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 11:26:14,703 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [48928232] [2024-11-08 11:26:14,704 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 11:26:14,704 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 11:26:14,729 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 11:26:14,874 INFO L134 CoverageAnalysis]: Checked inductivity of 131 backedges. 131 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-08 11:26:14,874 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 11:26:14,875 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [48928232] [2024-11-08 11:26:14,875 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [48928232] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 11:26:14,875 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 11:26:14,875 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-08 11:26:14,875 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1861798145] [2024-11-08 11:26:14,875 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 11:26:14,876 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-08 11:26:14,876 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 11:26:14,876 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-08 11:26:14,876 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-08 11:26:14,876 INFO L87 Difference]: Start difference. First operand 1606 states and 1816 transitions. Second operand has 3 states, 3 states have (on average 69.33333333333333) internal successors, (208), 3 states have internal predecessors, (208), 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-08 11:26:15,299 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 11:26:15,299 INFO L93 Difference]: Finished difference Result 3922 states and 4494 transitions. [2024-11-08 11:26:15,299 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-08 11:26:15,300 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 69.33333333333333) internal successors, (208), 3 states have internal predecessors, (208), 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 208 [2024-11-08 11:26:15,300 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 11:26:15,305 INFO L225 Difference]: With dead ends: 3922 [2024-11-08 11:26:15,305 INFO L226 Difference]: Without dead ends: 2318 [2024-11-08 11:26:15,307 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-08 11:26:15,307 INFO L432 NwaCegarLoop]: 73 mSDtfsCounter, 111 mSDsluCounter, 4 mSDsCounter, 0 mSdLazyCounter, 469 mSolverCounterSat, 51 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 111 SdHoareTripleChecker+Valid, 77 SdHoareTripleChecker+Invalid, 520 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 51 IncrementalHoareTripleChecker+Valid, 469 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-11-08 11:26:15,308 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [111 Valid, 77 Invalid, 520 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [51 Valid, 469 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-11-08 11:26:15,309 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2318 states. [2024-11-08 11:26:15,330 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2318 to 2140. [2024-11-08 11:26:15,332 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2140 states, 2139 states have (on average 1.1173445535296869) internal successors, (2390), 2139 states have internal predecessors, (2390), 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-08 11:26:15,335 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2140 states to 2140 states and 2390 transitions. [2024-11-08 11:26:15,336 INFO L78 Accepts]: Start accepts. Automaton has 2140 states and 2390 transitions. Word has length 208 [2024-11-08 11:26:15,336 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 11:26:15,336 INFO L471 AbstractCegarLoop]: Abstraction has 2140 states and 2390 transitions. [2024-11-08 11:26:15,336 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 69.33333333333333) internal successors, (208), 3 states have internal predecessors, (208), 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-08 11:26:15,337 INFO L276 IsEmpty]: Start isEmpty. Operand 2140 states and 2390 transitions. [2024-11-08 11:26:15,339 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 326 [2024-11-08 11:26:15,339 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 11:26:15,339 INFO L215 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 11:26:15,339 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-11-08 11:26:15,339 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 11:26:15,340 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 11:26:15,340 INFO L85 PathProgramCache]: Analyzing trace with hash -1934153555, now seen corresponding path program 1 times [2024-11-08 11:26:15,340 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 11:26:15,340 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [371112482] [2024-11-08 11:26:15,340 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 11:26:15,340 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 11:26:15,391 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 11:26:15,590 INFO L134 CoverageAnalysis]: Checked inductivity of 358 backedges. 95 proven. 0 refuted. 0 times theorem prover too weak. 263 trivial. 0 not checked. [2024-11-08 11:26:15,590 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 11:26:15,591 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [371112482] [2024-11-08 11:26:15,591 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [371112482] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 11:26:15,591 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 11:26:15,591 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-08 11:26:15,591 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1334690750] [2024-11-08 11:26:15,591 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 11:26:15,591 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-08 11:26:15,592 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 11:26:15,592 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-08 11:26:15,592 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-11-08 11:26:15,592 INFO L87 Difference]: Start difference. First operand 2140 states and 2390 transitions. Second operand has 4 states, 4 states have (on average 35.75) internal successors, (143), 3 states have internal predecessors, (143), 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-08 11:26:16,081 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 11:26:16,081 INFO L93 Difference]: Finished difference Result 4336 states and 4860 transitions. [2024-11-08 11:26:16,082 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-08 11:26:16,082 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 35.75) internal successors, (143), 3 states have internal predecessors, (143), 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 325 [2024-11-08 11:26:16,082 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 11:26:16,087 INFO L225 Difference]: With dead ends: 4336 [2024-11-08 11:26:16,087 INFO L226 Difference]: Without dead ends: 2318 [2024-11-08 11:26:16,089 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-11-08 11:26:16,091 INFO L432 NwaCegarLoop]: 9 mSDtfsCounter, 141 mSDsluCounter, 8 mSDsCounter, 0 mSdLazyCounter, 685 mSolverCounterSat, 58 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 141 SdHoareTripleChecker+Valid, 17 SdHoareTripleChecker+Invalid, 743 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 58 IncrementalHoareTripleChecker+Valid, 685 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-11-08 11:26:16,091 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [141 Valid, 17 Invalid, 743 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [58 Valid, 685 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2024-11-08 11:26:16,093 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2318 states. [2024-11-08 11:26:16,110 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2318 to 2140. [2024-11-08 11:26:16,112 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2140 states, 2139 states have (on average 1.077606358111267) internal successors, (2305), 2139 states have internal predecessors, (2305), 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-08 11:26:16,114 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2140 states to 2140 states and 2305 transitions. [2024-11-08 11:26:16,114 INFO L78 Accepts]: Start accepts. Automaton has 2140 states and 2305 transitions. Word has length 325 [2024-11-08 11:26:16,115 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 11:26:16,115 INFO L471 AbstractCegarLoop]: Abstraction has 2140 states and 2305 transitions. [2024-11-08 11:26:16,115 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 35.75) internal successors, (143), 3 states have internal predecessors, (143), 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-08 11:26:16,115 INFO L276 IsEmpty]: Start isEmpty. Operand 2140 states and 2305 transitions. [2024-11-08 11:26:16,118 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 421 [2024-11-08 11:26:16,118 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 11:26:16,118 INFO L215 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, 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, 2, 2, 1, 1, 1, 1, 1, 1] [2024-11-08 11:26:16,118 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-11-08 11:26:16,119 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 11:26:16,119 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 11:26:16,119 INFO L85 PathProgramCache]: Analyzing trace with hash -240102924, now seen corresponding path program 1 times [2024-11-08 11:26:16,119 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 11:26:16,119 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1952858038] [2024-11-08 11:26:16,119 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 11:26:16,120 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 11:26:16,167 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 11:26:16,473 INFO L134 CoverageAnalysis]: Checked inductivity of 647 backedges. 333 proven. 0 refuted. 0 times theorem prover too weak. 314 trivial. 0 not checked. [2024-11-08 11:26:16,473 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 11:26:16,473 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1952858038] [2024-11-08 11:26:16,473 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1952858038] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 11:26:16,473 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 11:26:16,474 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-08 11:26:16,474 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [370176587] [2024-11-08 11:26:16,474 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 11:26:16,474 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-08 11:26:16,474 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 11:26:16,474 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-08 11:26:16,475 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-08 11:26:16,475 INFO L87 Difference]: Start difference. First operand 2140 states and 2305 transitions. Second operand has 3 states, 3 states have (on average 70.66666666666667) internal successors, (212), 3 states have internal predecessors, (212), 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-08 11:26:16,865 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 11:26:16,865 INFO L93 Difference]: Finished difference Result 4456 states and 4866 transitions. [2024-11-08 11:26:16,865 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-08 11:26:16,866 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 70.66666666666667) internal successors, (212), 3 states have internal predecessors, (212), 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 420 [2024-11-08 11:26:16,866 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 11:26:16,871 INFO L225 Difference]: With dead ends: 4456 [2024-11-08 11:26:16,871 INFO L226 Difference]: Without dead ends: 2496 [2024-11-08 11:26:16,873 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-08 11:26:16,873 INFO L432 NwaCegarLoop]: 240 mSDtfsCounter, 110 mSDsluCounter, 5 mSDsCounter, 0 mSdLazyCounter, 410 mSolverCounterSat, 55 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 110 SdHoareTripleChecker+Valid, 245 SdHoareTripleChecker+Invalid, 465 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 55 IncrementalHoareTripleChecker+Valid, 410 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-11-08 11:26:16,874 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [110 Valid, 245 Invalid, 465 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [55 Valid, 410 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-11-08 11:26:16,875 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2496 states. [2024-11-08 11:26:16,892 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2496 to 1962. [2024-11-08 11:26:16,894 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1962 states, 1961 states have (on average 1.0775114737378888) internal successors, (2113), 1961 states have internal predecessors, (2113), 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-08 11:26:16,896 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1962 states to 1962 states and 2113 transitions. [2024-11-08 11:26:16,896 INFO L78 Accepts]: Start accepts. Automaton has 1962 states and 2113 transitions. Word has length 420 [2024-11-08 11:26:16,897 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 11:26:16,897 INFO L471 AbstractCegarLoop]: Abstraction has 1962 states and 2113 transitions. [2024-11-08 11:26:16,897 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 70.66666666666667) internal successors, (212), 3 states have internal predecessors, (212), 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-08 11:26:16,897 INFO L276 IsEmpty]: Start isEmpty. Operand 1962 states and 2113 transitions. [2024-11-08 11:26:16,900 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 428 [2024-11-08 11:26:16,901 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 11:26:16,901 INFO L215 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, 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, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 11:26:16,901 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-11-08 11:26:16,901 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 11:26:16,902 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 11:26:16,902 INFO L85 PathProgramCache]: Analyzing trace with hash 313193583, now seen corresponding path program 1 times [2024-11-08 11:26:16,902 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 11:26:16,902 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1389611814] [2024-11-08 11:26:16,902 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 11:26:16,903 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 11:26:16,987 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 11:26:17,215 INFO L134 CoverageAnalysis]: Checked inductivity of 647 backedges. 333 proven. 0 refuted. 0 times theorem prover too weak. 314 trivial. 0 not checked. [2024-11-08 11:26:17,216 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 11:26:17,216 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1389611814] [2024-11-08 11:26:17,216 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1389611814] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 11:26:17,216 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 11:26:17,217 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-08 11:26:17,217 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [32483049] [2024-11-08 11:26:17,217 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 11:26:17,217 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-08 11:26:17,218 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 11:26:17,218 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-08 11:26:17,218 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-08 11:26:17,219 INFO L87 Difference]: Start difference. First operand 1962 states and 2113 transitions. Second operand has 3 states, 3 states have (on average 73.0) internal successors, (219), 3 states have internal predecessors, (219), 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-08 11:26:17,646 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 11:26:17,648 INFO L93 Difference]: Finished difference Result 4456 states and 4867 transitions. [2024-11-08 11:26:17,648 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-08 11:26:17,648 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 73.0) internal successors, (219), 3 states have internal predecessors, (219), 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 427 [2024-11-08 11:26:17,649 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 11:26:17,655 INFO L225 Difference]: With dead ends: 4456 [2024-11-08 11:26:17,655 INFO L226 Difference]: Without dead ends: 2674 [2024-11-08 11:26:17,656 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-08 11:26:17,657 INFO L432 NwaCegarLoop]: 198 mSDtfsCounter, 112 mSDsluCounter, 5 mSDsCounter, 0 mSdLazyCounter, 423 mSolverCounterSat, 65 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 112 SdHoareTripleChecker+Valid, 203 SdHoareTripleChecker+Invalid, 488 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 65 IncrementalHoareTripleChecker+Valid, 423 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-11-08 11:26:17,658 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [112 Valid, 203 Invalid, 488 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [65 Valid, 423 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-11-08 11:26:17,659 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2674 states. [2024-11-08 11:26:17,681 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2674 to 2496. [2024-11-08 11:26:17,684 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2496 states, 2495 states have (on average 1.0837675350701403) internal successors, (2704), 2495 states have internal predecessors, (2704), 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-08 11:26:17,687 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2496 states to 2496 states and 2704 transitions. [2024-11-08 11:26:17,688 INFO L78 Accepts]: Start accepts. Automaton has 2496 states and 2704 transitions. Word has length 427 [2024-11-08 11:26:17,688 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 11:26:17,689 INFO L471 AbstractCegarLoop]: Abstraction has 2496 states and 2704 transitions. [2024-11-08 11:26:17,689 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 73.0) internal successors, (219), 3 states have internal predecessors, (219), 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-08 11:26:17,689 INFO L276 IsEmpty]: Start isEmpty. Operand 2496 states and 2704 transitions. [2024-11-08 11:26:17,693 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 469 [2024-11-08 11:26:17,693 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 11:26:17,693 INFO L215 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, 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, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 11:26:17,694 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-11-08 11:26:17,694 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 11:26:17,694 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 11:26:17,694 INFO L85 PathProgramCache]: Analyzing trace with hash 1953493490, now seen corresponding path program 1 times [2024-11-08 11:26:17,694 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 11:26:17,694 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [84766095] [2024-11-08 11:26:17,695 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 11:26:17,695 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 11:26:17,740 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 11:26:17,874 INFO L134 CoverageAnalysis]: Checked inductivity of 761 backedges. 447 proven. 0 refuted. 0 times theorem prover too weak. 314 trivial. 0 not checked. [2024-11-08 11:26:17,874 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 11:26:17,874 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [84766095] [2024-11-08 11:26:17,874 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [84766095] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 11:26:17,875 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 11:26:17,875 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-08 11:26:17,875 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [419990310] [2024-11-08 11:26:17,875 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 11:26:17,875 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-08 11:26:17,875 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 11:26:17,876 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-08 11:26:17,876 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-08 11:26:17,876 INFO L87 Difference]: Start difference. First operand 2496 states and 2704 transitions. Second operand has 3 states, 3 states have (on average 86.66666666666667) internal successors, (260), 3 states have internal predecessors, (260), 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-08 11:26:18,287 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 11:26:18,287 INFO L93 Difference]: Finished difference Result 5880 states and 6460 transitions. [2024-11-08 11:26:18,287 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-08 11:26:18,287 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 86.66666666666667) internal successors, (260), 3 states have internal predecessors, (260), 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 468 [2024-11-08 11:26:18,288 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 11:26:18,297 INFO L225 Difference]: With dead ends: 5880 [2024-11-08 11:26:18,297 INFO L226 Difference]: Without dead ends: 3564 [2024-11-08 11:26:18,299 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-08 11:26:18,300 INFO L432 NwaCegarLoop]: 47 mSDtfsCounter, 74 mSDsluCounter, 3 mSDsCounter, 0 mSdLazyCounter, 423 mSolverCounterSat, 55 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 74 SdHoareTripleChecker+Valid, 50 SdHoareTripleChecker+Invalid, 478 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 55 IncrementalHoareTripleChecker+Valid, 423 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-11-08 11:26:18,300 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [74 Valid, 50 Invalid, 478 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [55 Valid, 423 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-11-08 11:26:18,303 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3564 states. [2024-11-08 11:26:18,329 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3564 to 3564. [2024-11-08 11:26:18,332 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3564 states, 3563 states have (on average 1.079708111142296) internal successors, (3847), 3563 states have internal predecessors, (3847), 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-08 11:26:18,335 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3564 states to 3564 states and 3847 transitions. [2024-11-08 11:26:18,336 INFO L78 Accepts]: Start accepts. Automaton has 3564 states and 3847 transitions. Word has length 468 [2024-11-08 11:26:18,336 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 11:26:18,336 INFO L471 AbstractCegarLoop]: Abstraction has 3564 states and 3847 transitions. [2024-11-08 11:26:18,336 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 86.66666666666667) internal successors, (260), 3 states have internal predecessors, (260), 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-08 11:26:18,337 INFO L276 IsEmpty]: Start isEmpty. Operand 3564 states and 3847 transitions. [2024-11-08 11:26:18,342 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 505 [2024-11-08 11:26:18,342 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 11:26:18,343 INFO L215 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, 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, 3, 3, 3, 3, 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, 1] [2024-11-08 11:26:18,343 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2024-11-08 11:26:18,343 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 11:26:18,343 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 11:26:18,344 INFO L85 PathProgramCache]: Analyzing trace with hash -1407887867, now seen corresponding path program 1 times [2024-11-08 11:26:18,344 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 11:26:18,344 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [361231374] [2024-11-08 11:26:18,344 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 11:26:18,344 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 11:26:18,387 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 11:26:18,656 INFO L134 CoverageAnalysis]: Checked inductivity of 978 backedges. 595 proven. 0 refuted. 0 times theorem prover too weak. 383 trivial. 0 not checked. [2024-11-08 11:26:18,656 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 11:26:18,656 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [361231374] [2024-11-08 11:26:18,656 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [361231374] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 11:26:18,656 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 11:26:18,656 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-08 11:26:18,656 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [545277415] [2024-11-08 11:26:18,656 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 11:26:18,657 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-08 11:26:18,657 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 11:26:18,657 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-08 11:26:18,657 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-08 11:26:18,657 INFO L87 Difference]: Start difference. First operand 3564 states and 3847 transitions. Second operand has 3 states, 3 states have (on average 76.0) internal successors, (228), 3 states have internal predecessors, (228), 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-08 11:26:19,031 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 11:26:19,032 INFO L93 Difference]: Finished difference Result 7126 states and 7708 transitions. [2024-11-08 11:26:19,032 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-08 11:26:19,032 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 76.0) internal successors, (228), 3 states have internal predecessors, (228), 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 504 [2024-11-08 11:26:19,033 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 11:26:19,041 INFO L225 Difference]: With dead ends: 7126 [2024-11-08 11:26:19,041 INFO L226 Difference]: Without dead ends: 3742 [2024-11-08 11:26:19,044 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-08 11:26:19,046 INFO L432 NwaCegarLoop]: 238 mSDtfsCounter, 102 mSDsluCounter, 5 mSDsCounter, 0 mSdLazyCounter, 417 mSolverCounterSat, 21 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 102 SdHoareTripleChecker+Valid, 243 SdHoareTripleChecker+Invalid, 438 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 21 IncrementalHoareTripleChecker+Valid, 417 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-11-08 11:26:19,046 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [102 Valid, 243 Invalid, 438 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [21 Valid, 417 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-11-08 11:26:19,049 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3742 states. [2024-11-08 11:26:19,076 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3742 to 3208. [2024-11-08 11:26:19,079 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3208 states, 3207 states have (on average 1.0757717492984098) internal successors, (3450), 3207 states have internal predecessors, (3450), 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-08 11:26:19,082 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3208 states to 3208 states and 3450 transitions. [2024-11-08 11:26:19,082 INFO L78 Accepts]: Start accepts. Automaton has 3208 states and 3450 transitions. Word has length 504 [2024-11-08 11:26:19,083 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 11:26:19,083 INFO L471 AbstractCegarLoop]: Abstraction has 3208 states and 3450 transitions. [2024-11-08 11:26:19,083 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 76.0) internal successors, (228), 3 states have internal predecessors, (228), 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-08 11:26:19,083 INFO L276 IsEmpty]: Start isEmpty. Operand 3208 states and 3450 transitions. [2024-11-08 11:26:19,086 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 624 [2024-11-08 11:26:19,086 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 11:26:19,086 INFO L215 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, 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, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 3, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 11:26:19,086 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2024-11-08 11:26:19,086 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 11:26:19,087 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 11:26:19,087 INFO L85 PathProgramCache]: Analyzing trace with hash -2137582567, now seen corresponding path program 1 times [2024-11-08 11:26:19,087 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 11:26:19,087 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1560061756] [2024-11-08 11:26:19,087 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 11:26:19,087 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 11:26:19,191 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 11:26:19,452 INFO L134 CoverageAnalysis]: Checked inductivity of 1226 backedges. 802 proven. 110 refuted. 0 times theorem prover too weak. 314 trivial. 0 not checked. [2024-11-08 11:26:19,452 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 11:26:19,452 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1560061756] [2024-11-08 11:26:19,452 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1560061756] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-08 11:26:19,452 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [428001475] [2024-11-08 11:26:19,452 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 11:26:19,452 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-08 11:26:19,453 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-08 11:26:19,455 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-08 11:26:19,458 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-08 11:26:19,637 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 11:26:19,642 INFO L255 TraceCheckSpWp]: Trace formula consists of 782 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-11-08 11:26:19,658 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-08 11:26:19,727 INFO L134 CoverageAnalysis]: Checked inductivity of 1226 backedges. 159 proven. 0 refuted. 0 times theorem prover too weak. 1067 trivial. 0 not checked. [2024-11-08 11:26:19,728 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-08 11:26:19,728 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [428001475] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 11:26:19,728 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-08 11:26:19,728 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [4] total 5 [2024-11-08 11:26:19,728 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [284443590] [2024-11-08 11:26:19,728 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 11:26:19,729 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-08 11:26:19,729 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 11:26:19,729 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-08 11:26:19,729 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-11-08 11:26:19,730 INFO L87 Difference]: Start difference. First operand 3208 states and 3450 transitions. Second operand has 3 states, 3 states have (on average 64.66666666666667) internal successors, (194), 3 states have internal predecessors, (194), 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-08 11:26:20,072 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 11:26:20,072 INFO L93 Difference]: Finished difference Result 6948 states and 7489 transitions. [2024-11-08 11:26:20,073 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-08 11:26:20,073 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 64.66666666666667) internal successors, (194), 3 states have internal predecessors, (194), 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 623 [2024-11-08 11:26:20,074 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 11:26:20,079 INFO L225 Difference]: With dead ends: 6948 [2024-11-08 11:26:20,080 INFO L226 Difference]: Without dead ends: 3208 [2024-11-08 11:26:20,082 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 626 GetRequests, 623 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-08 11:26:20,083 INFO L432 NwaCegarLoop]: 236 mSDtfsCounter, 147 mSDsluCounter, 5 mSDsCounter, 0 mSdLazyCounter, 399 mSolverCounterSat, 35 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 147 SdHoareTripleChecker+Valid, 241 SdHoareTripleChecker+Invalid, 434 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 35 IncrementalHoareTripleChecker+Valid, 399 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-11-08 11:26:20,083 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [147 Valid, 241 Invalid, 434 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [35 Valid, 399 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-11-08 11:26:20,085 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3208 states. [2024-11-08 11:26:20,104 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3208 to 2852. [2024-11-08 11:26:20,107 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2852 states, 2851 states have (on average 1.0740091196071553) internal successors, (3062), 2851 states have internal predecessors, (3062), 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-08 11:26:20,109 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2852 states to 2852 states and 3062 transitions. [2024-11-08 11:26:20,109 INFO L78 Accepts]: Start accepts. Automaton has 2852 states and 3062 transitions. Word has length 623 [2024-11-08 11:26:20,110 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 11:26:20,110 INFO L471 AbstractCegarLoop]: Abstraction has 2852 states and 3062 transitions. [2024-11-08 11:26:20,110 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 64.66666666666667) internal successors, (194), 3 states have internal predecessors, (194), 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-08 11:26:20,110 INFO L276 IsEmpty]: Start isEmpty. Operand 2852 states and 3062 transitions. [2024-11-08 11:26:20,114 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 771 [2024-11-08 11:26:20,114 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 11:26:20,114 INFO L215 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, 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, 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-08 11:26:20,129 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-08 11:26:20,318 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable11 [2024-11-08 11:26:20,319 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 11:26:20,319 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 11:26:20,319 INFO L85 PathProgramCache]: Analyzing trace with hash -1968814362, now seen corresponding path program 1 times [2024-11-08 11:26:20,319 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 11:26:20,320 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1582662918] [2024-11-08 11:26:20,320 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 11:26:20,320 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 11:26:20,389 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 11:26:20,747 INFO L134 CoverageAnalysis]: Checked inductivity of 1715 backedges. 1214 proven. 155 refuted. 0 times theorem prover too weak. 346 trivial. 0 not checked. [2024-11-08 11:26:20,747 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 11:26:20,747 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1582662918] [2024-11-08 11:26:20,747 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1582662918] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-08 11:26:20,747 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1853166196] [2024-11-08 11:26:20,747 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 11:26:20,748 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-08 11:26:20,748 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-08 11:26:20,749 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-08 11:26:20,750 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-08 11:26:20,918 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 11:26:20,920 INFO L255 TraceCheckSpWp]: Trace formula consists of 952 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-11-08 11:26:20,925 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-08 11:26:20,969 INFO L134 CoverageAnalysis]: Checked inductivity of 1715 backedges. 191 proven. 0 refuted. 0 times theorem prover too weak. 1524 trivial. 0 not checked. [2024-11-08 11:26:20,969 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-08 11:26:20,969 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1853166196] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 11:26:20,969 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-08 11:26:20,969 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [4] total 5 [2024-11-08 11:26:20,970 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2018018755] [2024-11-08 11:26:20,970 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 11:26:20,970 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-08 11:26:20,970 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 11:26:20,970 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-08 11:26:20,971 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-11-08 11:26:20,971 INFO L87 Difference]: Start difference. First operand 2852 states and 3062 transitions. Second operand has 3 states, 3 states have (on average 71.66666666666667) internal successors, (215), 3 states have internal predecessors, (215), 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-08 11:26:21,283 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 11:26:21,283 INFO L93 Difference]: Finished difference Result 3210 states and 3435 transitions. [2024-11-08 11:26:21,283 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-08 11:26:21,284 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 71.66666666666667) internal successors, (215), 3 states have internal predecessors, (215), 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 770 [2024-11-08 11:26:21,284 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 11:26:21,290 INFO L225 Difference]: With dead ends: 3210 [2024-11-08 11:26:21,290 INFO L226 Difference]: Without dead ends: 3208 [2024-11-08 11:26:21,290 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 773 GetRequests, 770 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-08 11:26:21,290 INFO L432 NwaCegarLoop]: 12 mSDtfsCounter, 168 mSDsluCounter, 4 mSDsCounter, 0 mSdLazyCounter, 421 mSolverCounterSat, 25 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 168 SdHoareTripleChecker+Valid, 16 SdHoareTripleChecker+Invalid, 446 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 25 IncrementalHoareTripleChecker+Valid, 421 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-11-08 11:26:21,291 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [168 Valid, 16 Invalid, 446 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [25 Valid, 421 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-11-08 11:26:21,296 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3208 states. [2024-11-08 11:26:21,313 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3208 to 2674. [2024-11-08 11:26:21,316 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2674 states, 2673 states have (on average 1.0695847362514028) internal successors, (2859), 2673 states have internal predecessors, (2859), 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-08 11:26:21,317 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2674 states to 2674 states and 2859 transitions. [2024-11-08 11:26:21,318 INFO L78 Accepts]: Start accepts. Automaton has 2674 states and 2859 transitions. Word has length 770 [2024-11-08 11:26:21,318 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 11:26:21,318 INFO L471 AbstractCegarLoop]: Abstraction has 2674 states and 2859 transitions. [2024-11-08 11:26:21,318 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 71.66666666666667) internal successors, (215), 3 states have internal predecessors, (215), 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-08 11:26:21,318 INFO L276 IsEmpty]: Start isEmpty. Operand 2674 states and 2859 transitions. [2024-11-08 11:26:21,322 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 777 [2024-11-08 11:26:21,322 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 11:26:21,322 INFO L215 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, 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, 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-08 11:26:21,335 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2024-11-08 11:26:21,522 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-08 11:26:21,523 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 11:26:21,523 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 11:26:21,524 INFO L85 PathProgramCache]: Analyzing trace with hash 1961672119, now seen corresponding path program 1 times [2024-11-08 11:26:21,524 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 11:26:21,524 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [542933698] [2024-11-08 11:26:21,524 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 11:26:21,524 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 11:26:21,597 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 11:26:21,935 INFO L134 CoverageAnalysis]: Checked inductivity of 1745 backedges. 1244 proven. 155 refuted. 0 times theorem prover too weak. 346 trivial. 0 not checked. [2024-11-08 11:26:21,936 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 11:26:21,936 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [542933698] [2024-11-08 11:26:21,936 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [542933698] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-08 11:26:21,936 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1343701666] [2024-11-08 11:26:21,936 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 11:26:21,936 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-08 11:26:21,937 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-08 11:26:21,938 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-08 11:26:21,939 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-08 11:26:22,102 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 11:26:22,106 INFO L255 TraceCheckSpWp]: Trace formula consists of 958 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-11-08 11:26:22,110 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-08 11:26:22,152 INFO L134 CoverageAnalysis]: Checked inductivity of 1745 backedges. 191 proven. 0 refuted. 0 times theorem prover too weak. 1554 trivial. 0 not checked. [2024-11-08 11:26:22,152 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-08 11:26:22,153 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1343701666] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 11:26:22,153 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-08 11:26:22,153 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [4] total 5 [2024-11-08 11:26:22,153 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1546789034] [2024-11-08 11:26:22,153 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 11:26:22,154 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-08 11:26:22,154 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 11:26:22,154 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-08 11:26:22,154 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-11-08 11:26:22,154 INFO L87 Difference]: Start difference. First operand 2674 states and 2859 transitions. Second operand has 3 states, 3 states have (on average 71.66666666666667) internal successors, (215), 3 states have internal predecessors, (215), 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-08 11:26:22,491 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 11:26:22,492 INFO L93 Difference]: Finished difference Result 6412 states and 6926 transitions. [2024-11-08 11:26:22,492 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-08 11:26:22,492 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 71.66666666666667) internal successors, (215), 3 states have internal predecessors, (215), 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 776 [2024-11-08 11:26:22,493 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 11:26:22,506 INFO L225 Difference]: With dead ends: 6412 [2024-11-08 11:26:22,507 INFO L226 Difference]: Without dead ends: 0 [2024-11-08 11:26:22,509 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 779 GetRequests, 776 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-08 11:26:22,509 INFO L432 NwaCegarLoop]: 225 mSDtfsCounter, 147 mSDsluCounter, 4 mSDsCounter, 0 mSdLazyCounter, 435 mSolverCounterSat, 39 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 147 SdHoareTripleChecker+Valid, 229 SdHoareTripleChecker+Invalid, 474 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 39 IncrementalHoareTripleChecker+Valid, 435 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-11-08 11:26:22,510 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [147 Valid, 229 Invalid, 474 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [39 Valid, 435 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-11-08 11:26:22,510 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2024-11-08 11:26:22,510 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2024-11-08 11:26:22,510 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-08 11:26:22,510 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2024-11-08 11:26:22,510 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 776 [2024-11-08 11:26:22,511 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 11:26:22,511 INFO L471 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2024-11-08 11:26:22,511 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 71.66666666666667) internal successors, (215), 3 states have internal predecessors, (215), 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-08 11:26:22,511 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2024-11-08 11:26:22,511 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2024-11-08 11:26:22,513 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2024-11-08 11:26:22,527 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2024-11-08 11:26:22,717 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-08 11:26:22,720 INFO L407 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 11:26:22,722 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2024-11-08 11:26:23,032 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2024-11-08 11:26:23,043 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 08.11 11:26:23 BoogieIcfgContainer [2024-11-08 11:26:23,043 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-11-08 11:26:23,043 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-11-08 11:26:23,043 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-11-08 11:26:23,043 INFO L274 PluginConnector]: Witness Printer initialized [2024-11-08 11:26:23,043 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.11 11:26:10" (3/4) ... [2024-11-08 11:26:23,045 INFO L142 WitnessPrinter]: Generating witness for correct program [2024-11-08 11:26:23,056 INFO L925 BoogieBacktranslator]: Reduced CFG by removing 11 nodes and edges [2024-11-08 11:26:23,057 INFO L925 BoogieBacktranslator]: Reduced CFG by removing 4 nodes and edges [2024-11-08 11:26:23,057 INFO L925 BoogieBacktranslator]: Reduced CFG by removing 3 nodes and edges [2024-11-08 11:26:23,058 INFO L925 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2024-11-08 11:26:23,168 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2024-11-08 11:26:23,169 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.yml [2024-11-08 11:26:23,169 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-11-08 11:26:23,169 INFO L158 Benchmark]: Toolchain (without parser) took 14407.58ms. Allocated memory was 159.4MB in the beginning and 509.6MB in the end (delta: 350.2MB). Free memory was 102.9MB in the beginning and 324.3MB in the end (delta: -221.4MB). Peak memory consumption was 132.0MB. Max. memory is 16.1GB. [2024-11-08 11:26:23,169 INFO L158 Benchmark]: CDTParser took 0.16ms. Allocated memory is still 159.4MB. Free memory is still 117.9MB. There was no memory consumed. Max. memory is 16.1GB. [2024-11-08 11:26:23,170 INFO L158 Benchmark]: CACSL2BoogieTranslator took 432.54ms. Allocated memory is still 159.4MB. Free memory was 102.5MB in the beginning and 67.5MB in the end (delta: 35.0MB). Peak memory consumption was 33.6MB. Max. memory is 16.1GB. [2024-11-08 11:26:23,170 INFO L158 Benchmark]: Boogie Procedure Inliner took 87.83ms. Allocated memory is still 159.4MB. Free memory was 67.5MB in the beginning and 119.7MB in the end (delta: -52.2MB). Peak memory consumption was 6.7MB. Max. memory is 16.1GB. [2024-11-08 11:26:23,170 INFO L158 Benchmark]: Boogie Preprocessor took 109.47ms. Allocated memory is still 159.4MB. Free memory was 119.7MB in the beginning and 107.1MB in the end (delta: 12.6MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. [2024-11-08 11:26:23,170 INFO L158 Benchmark]: RCFGBuilder took 1052.82ms. Allocated memory was 159.4MB in the beginning and 228.6MB in the end (delta: 69.2MB). Free memory was 107.1MB in the beginning and 137.3MB in the end (delta: -30.2MB). Peak memory consumption was 71.0MB. Max. memory is 16.1GB. [2024-11-08 11:26:23,171 INFO L158 Benchmark]: TraceAbstraction took 12592.71ms. Allocated memory was 228.6MB in the beginning and 509.6MB in the end (delta: 281.0MB). Free memory was 136.2MB in the beginning and 337.9MB in the end (delta: -201.7MB). Peak memory consumption was 79.4MB. Max. memory is 16.1GB. [2024-11-08 11:26:23,171 INFO L158 Benchmark]: Witness Printer took 125.71ms. Allocated memory is still 509.6MB. Free memory was 337.9MB in the beginning and 324.3MB in the end (delta: 13.6MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB. [2024-11-08 11:26:23,172 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.16ms. Allocated memory is still 159.4MB. Free memory is still 117.9MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 432.54ms. Allocated memory is still 159.4MB. Free memory was 102.5MB in the beginning and 67.5MB in the end (delta: 35.0MB). Peak memory consumption was 33.6MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 87.83ms. Allocated memory is still 159.4MB. Free memory was 67.5MB in the beginning and 119.7MB in the end (delta: -52.2MB). Peak memory consumption was 6.7MB. Max. memory is 16.1GB. * Boogie Preprocessor took 109.47ms. Allocated memory is still 159.4MB. Free memory was 119.7MB in the beginning and 107.1MB in the end (delta: 12.6MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. * RCFGBuilder took 1052.82ms. Allocated memory was 159.4MB in the beginning and 228.6MB in the end (delta: 69.2MB). Free memory was 107.1MB in the beginning and 137.3MB in the end (delta: -30.2MB). Peak memory consumption was 71.0MB. Max. memory is 16.1GB. * TraceAbstraction took 12592.71ms. Allocated memory was 228.6MB in the beginning and 509.6MB in the end (delta: 281.0MB). Free memory was 136.2MB in the beginning and 337.9MB in the end (delta: -201.7MB). Peak memory consumption was 79.4MB. Max. memory is 16.1GB. * Witness Printer took 125.71ms. Allocated memory is still 509.6MB. Free memory was 337.9MB in the beginning and 324.3MB in the end (delta: 13.6MB). Peak memory consumption was 14.7MB. 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: 116]: 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: 12.2s, OverallIterations: 14, TraceHistogramMax: 7, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.1s, AutomataDifference: 6.7s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 2087 SdHoareTripleChecker+Valid, 6.2s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 2087 mSDsluCounter, 1789 SdHoareTripleChecker+Invalid, 5.0s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 80 mSDsCounter, 912 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 7254 IncrementalHoareTripleChecker+Invalid, 8166 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 912 mSolverCounterUnsat, 1709 mSDtfsCounter, 7254 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 2209 GetRequests, 2185 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=3564occurred in iteration=10, InterpolantAutomatonStates: 45, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.4s AutomataMinimizationTime, 14 MinimizatonAttempts, 2498 StatesRemovedByMinimization, 10 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.2s SsaConstructionTime, 0.6s SatisfiabilityAnalysisTime, 3.1s InterpolantComputationTime, 7140 NumberOfCodeBlocks, 7140 NumberOfCodeBlocksAsserted, 17 NumberOfCheckSat, 7123 ConstructedInterpolants, 0 QuantifiedInterpolants, 14982 SizeOfPredicates, 0 NumberOfNonLiveVariables, 2692 ConjunctsInSsa, 6 ConjunctsInUnsatCore, 17 InterpolantComputations, 14 PerfectInterpolantSequences, 12598/13018 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)) || ((((long long) 49 + a12) <= 0) && (a15 <= 5))) || (((a21 <= 9) && (a24 == 1)) && (0 <= ((long long) a12 + 42)))) || ((a24 == 1) && (a15 <= 5))) || (((a12 <= 11) && (9 <= a21)) && (a24 == 1))) RESULT: Ultimate proved your program to be correct! [2024-11-08 11:26:23,193 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Result: TRUE