./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/eca-rers2012/Problem03_label22.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/Problem03_label22.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 f365a0f129fa90e96f59a2a67efc46f6bd75f705664f3dab23b0f5e5824e9e07 --- Real Ultimate output --- This is Ultimate 0.2.5-?-c7c6ca5-m [2024-11-08 10:29:48,171 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-08 10:29:48,238 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-11-08 10:29:48,245 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-08 10:29:48,245 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-08 10:29:48,275 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-08 10:29:48,275 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-08 10:29:48,276 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-08 10:29:48,277 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-08 10:29:48,281 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-08 10:29:48,281 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-08 10:29:48,281 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-08 10:29:48,282 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-08 10:29:48,282 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-08 10:29:48,282 INFO L153 SettingsManager]: * Use SBE=true [2024-11-08 10:29:48,283 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-08 10:29:48,283 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-08 10:29:48,283 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-08 10:29:48,283 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-08 10:29:48,284 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-08 10:29:48,284 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-08 10:29:48,285 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-08 10:29:48,286 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-08 10:29:48,286 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-08 10:29:48,286 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-08 10:29:48,286 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-08 10:29:48,286 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-08 10:29:48,287 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-08 10:29:48,287 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-08 10:29:48,287 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-08 10:29:48,287 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-08 10:29:48,288 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-08 10:29:48,288 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-08 10:29:48,288 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-08 10:29:48,288 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-08 10:29:48,289 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-08 10:29:48,289 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-08 10:29:48,289 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-08 10:29:48,290 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-08 10:29:48,291 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-08 10:29:48,291 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-08 10:29:48,294 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-08 10:29:48,294 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 -> f365a0f129fa90e96f59a2a67efc46f6bd75f705664f3dab23b0f5e5824e9e07 [2024-11-08 10:29:48,525 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-08 10:29:48,555 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-08 10:29:48,558 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-08 10:29:48,560 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-08 10:29:48,560 INFO L274 PluginConnector]: CDTParser initialized [2024-11-08 10:29:48,562 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/eca-rers2012/Problem03_label22.c [2024-11-08 10:29:50,034 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-08 10:29:50,370 INFO L384 CDTParser]: Found 1 translation units. [2024-11-08 10:29:50,372 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/eca-rers2012/Problem03_label22.c [2024-11-08 10:29:50,396 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/e2c18483e/8430918cdd5148c9b7ee87e178ea055d/FLAGa780605e8 [2024-11-08 10:29:50,413 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/e2c18483e/8430918cdd5148c9b7ee87e178ea055d [2024-11-08 10:29:50,416 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-08 10:29:50,418 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-08 10:29:50,423 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-08 10:29:50,423 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-08 10:29:50,428 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-08 10:29:50,429 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.11 10:29:50" (1/1) ... [2024-11-08 10:29:50,433 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@7970798a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 10:29:50, skipping insertion in model container [2024-11-08 10:29:50,433 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.11 10:29:50" (1/1) ... [2024-11-08 10:29:50,502 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-08 10:29:51,013 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/Problem03_label22.c[56764,56777] [2024-11-08 10:29:51,053 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-08 10:29:51,064 INFO L200 MainTranslator]: Completed pre-run [2024-11-08 10:29:51,231 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/Problem03_label22.c[56764,56777] [2024-11-08 10:29:51,247 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-08 10:29:51,270 INFO L204 MainTranslator]: Completed translation [2024-11-08 10:29:51,271 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 10:29:51 WrapperNode [2024-11-08 10:29:51,271 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-08 10:29:51,273 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-08 10:29:51,273 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-08 10:29:51,273 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-08 10:29:51,281 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 10:29:51" (1/1) ... [2024-11-08 10:29:51,321 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 10:29:51" (1/1) ... [2024-11-08 10:29:51,415 INFO L138 Inliner]: procedures = 14, calls = 8, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 1772 [2024-11-08 10:29:51,416 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-08 10:29:51,416 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-08 10:29:51,416 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-08 10:29:51,417 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-08 10:29:51,427 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 10:29:51" (1/1) ... [2024-11-08 10:29:51,428 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 10:29:51" (1/1) ... [2024-11-08 10:29:51,440 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 10:29:51" (1/1) ... [2024-11-08 10:29:51,491 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 10:29:51,492 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 10:29:51" (1/1) ... [2024-11-08 10:29:51,492 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 10:29:51" (1/1) ... [2024-11-08 10:29:51,542 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 10:29:51" (1/1) ... [2024-11-08 10:29:51,558 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 10:29:51" (1/1) ... [2024-11-08 10:29:51,582 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 10:29:51" (1/1) ... [2024-11-08 10:29:51,589 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 10:29:51" (1/1) ... [2024-11-08 10:29:51,605 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-08 10:29:51,607 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-08 10:29:51,607 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-08 10:29:51,608 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-08 10:29:51,609 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 10:29:51" (1/1) ... [2024-11-08 10:29:51,614 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-08 10:29:51,627 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-08 10:29:51,645 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 10:29:51,649 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 10:29:51,692 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-08 10:29:51,692 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-11-08 10:29:51,692 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-08 10:29:51,692 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-08 10:29:51,779 INFO L238 CfgBuilder]: Building ICFG [2024-11-08 10:29:51,781 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-08 10:29:53,608 INFO L? ?]: Removed 147 outVars from TransFormulas that were not future-live. [2024-11-08 10:29:53,612 INFO L287 CfgBuilder]: Performing block encoding [2024-11-08 10:29:53,642 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-08 10:29:53,644 INFO L316 CfgBuilder]: Removed 1 assume(true) statements. [2024-11-08 10:29:53,644 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.11 10:29:53 BoogieIcfgContainer [2024-11-08 10:29:53,644 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-08 10:29:53,647 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-08 10:29:53,647 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-08 10:29:53,650 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-08 10:29:53,651 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 08.11 10:29:50" (1/3) ... [2024-11-08 10:29:53,651 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3cf03558 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.11 10:29:53, skipping insertion in model container [2024-11-08 10:29:53,652 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 10:29:51" (2/3) ... [2024-11-08 10:29:53,652 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3cf03558 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.11 10:29:53, skipping insertion in model container [2024-11-08 10:29:53,653 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.11 10:29:53" (3/3) ... [2024-11-08 10:29:53,654 INFO L112 eAbstractionObserver]: Analyzing ICFG Problem03_label22.c [2024-11-08 10:29:53,670 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-08 10:29:53,670 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-11-08 10:29:53,744 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-08 10:29:53,750 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;@25070e3b, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-08 10:29:53,751 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-08 10:29:53,757 INFO L276 IsEmpty]: Start isEmpty. Operand has 302 states, 300 states have (on average 1.73) internal successors, (519), 301 states have internal predecessors, (519), 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 10:29:53,775 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 168 [2024-11-08 10:29:53,776 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 10:29:53,777 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 10:29:53,778 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 10:29:53,783 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 10:29:53,784 INFO L85 PathProgramCache]: Analyzing trace with hash -1133598669, now seen corresponding path program 1 times [2024-11-08 10:29:53,793 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 10:29:53,794 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2042852814] [2024-11-08 10:29:53,794 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 10:29:53,794 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 10:29:54,088 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 10:29:54,729 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 10:29:54,731 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 10:29:54,731 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2042852814] [2024-11-08 10:29:54,732 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2042852814] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 10:29:54,732 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 10:29:54,732 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-08 10:29:54,734 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [471389026] [2024-11-08 10:29:54,735 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 10:29:54,740 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-08 10:29:54,742 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 10:29:54,769 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-08 10:29:54,770 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-08 10:29:54,774 INFO L87 Difference]: Start difference. First operand has 302 states, 300 states have (on average 1.73) internal successors, (519), 301 states have internal predecessors, (519), 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 55.666666666666664) internal successors, (167), 2 states have internal predecessors, (167), 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 10:29:55,884 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 10:29:55,885 INFO L93 Difference]: Finished difference Result 857 states and 1498 transitions. [2024-11-08 10:29:55,886 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-08 10:29:55,888 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 55.666666666666664) internal successors, (167), 2 states have internal predecessors, (167), 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 167 [2024-11-08 10:29:55,889 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 10:29:55,901 INFO L225 Difference]: With dead ends: 857 [2024-11-08 10:29:55,901 INFO L226 Difference]: Without dead ends: 462 [2024-11-08 10:29:55,905 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 10:29:55,908 INFO L432 NwaCegarLoop]: 149 mSDtfsCounter, 121 mSDsluCounter, 38 mSDsCounter, 0 mSdLazyCounter, 690 mSolverCounterSat, 136 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 121 SdHoareTripleChecker+Valid, 187 SdHoareTripleChecker+Invalid, 826 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 136 IncrementalHoareTripleChecker+Valid, 690 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2024-11-08 10:29:55,911 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [121 Valid, 187 Invalid, 826 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [136 Valid, 690 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2024-11-08 10:29:55,929 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 462 states. [2024-11-08 10:29:55,998 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 462 to 460. [2024-11-08 10:29:56,000 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 460 states, 459 states have (on average 1.5381263616557734) internal successors, (706), 459 states have internal predecessors, (706), 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 10:29:56,003 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 460 states to 460 states and 706 transitions. [2024-11-08 10:29:56,005 INFO L78 Accepts]: Start accepts. Automaton has 460 states and 706 transitions. Word has length 167 [2024-11-08 10:29:56,006 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 10:29:56,008 INFO L471 AbstractCegarLoop]: Abstraction has 460 states and 706 transitions. [2024-11-08 10:29:56,009 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 55.666666666666664) internal successors, (167), 2 states have internal predecessors, (167), 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 10:29:56,009 INFO L276 IsEmpty]: Start isEmpty. Operand 460 states and 706 transitions. [2024-11-08 10:29:56,012 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 176 [2024-11-08 10:29:56,012 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 10:29:56,013 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 10:29:56,013 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-08 10:29:56,013 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 10:29:56,014 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 10:29:56,014 INFO L85 PathProgramCache]: Analyzing trace with hash 166120884, now seen corresponding path program 1 times [2024-11-08 10:29:56,014 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 10:29:56,015 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1900929352] [2024-11-08 10:29:56,015 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 10:29:56,015 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 10:29:56,096 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 10:29:56,250 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-08 10:29:56,250 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 10:29:56,250 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1900929352] [2024-11-08 10:29:56,250 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1900929352] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 10:29:56,251 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 10:29:56,251 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-08 10:29:56,251 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1386254052] [2024-11-08 10:29:56,251 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 10:29:56,254 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-08 10:29:56,256 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 10:29:56,257 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-08 10:29:56,258 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-08 10:29:56,259 INFO L87 Difference]: Start difference. First operand 460 states and 706 transitions. Second operand has 3 states, 3 states have (on average 58.333333333333336) internal successors, (175), 2 states have internal predecessors, (175), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 10:29:56,991 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 10:29:56,992 INFO L93 Difference]: Finished difference Result 1344 states and 2079 transitions. [2024-11-08 10:29:56,992 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-08 10:29:56,992 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 58.333333333333336) internal successors, (175), 2 states have internal predecessors, (175), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 175 [2024-11-08 10:29:56,992 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 10:29:56,996 INFO L225 Difference]: With dead ends: 1344 [2024-11-08 10:29:56,996 INFO L226 Difference]: Without dead ends: 886 [2024-11-08 10:29:56,997 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 10:29:56,998 INFO L432 NwaCegarLoop]: 77 mSDtfsCounter, 247 mSDsluCounter, 15 mSDsCounter, 0 mSdLazyCounter, 584 mSolverCounterSat, 195 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 247 SdHoareTripleChecker+Valid, 92 SdHoareTripleChecker+Invalid, 779 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 195 IncrementalHoareTripleChecker+Valid, 584 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2024-11-08 10:29:56,999 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [247 Valid, 92 Invalid, 779 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [195 Valid, 584 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2024-11-08 10:29:57,001 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 886 states. [2024-11-08 10:29:57,029 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 886 to 870. [2024-11-08 10:29:57,030 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 870 states, 869 states have (on average 1.5120828538550057) internal successors, (1314), 869 states have internal predecessors, (1314), 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 10:29:57,033 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 870 states to 870 states and 1314 transitions. [2024-11-08 10:29:57,035 INFO L78 Accepts]: Start accepts. Automaton has 870 states and 1314 transitions. Word has length 175 [2024-11-08 10:29:57,035 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 10:29:57,036 INFO L471 AbstractCegarLoop]: Abstraction has 870 states and 1314 transitions. [2024-11-08 10:29:57,036 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 58.333333333333336) internal successors, (175), 2 states have internal predecessors, (175), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 10:29:57,036 INFO L276 IsEmpty]: Start isEmpty. Operand 870 states and 1314 transitions. [2024-11-08 10:29:57,040 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 188 [2024-11-08 10:29:57,041 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 10:29:57,041 INFO L215 NwaCegarLoop]: trace histogram [4, 4, 4, 3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 10:29:57,041 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-08 10:29:57,041 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 10:29:57,042 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 10:29:57,042 INFO L85 PathProgramCache]: Analyzing trace with hash 2000740269, now seen corresponding path program 1 times [2024-11-08 10:29:57,045 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 10:29:57,046 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [478151540] [2024-11-08 10:29:57,046 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 10:29:57,046 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 10:29:57,102 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 10:29:57,350 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 28 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2024-11-08 10:29:57,351 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 10:29:57,351 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [478151540] [2024-11-08 10:29:57,351 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [478151540] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 10:29:57,352 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 10:29:57,352 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-08 10:29:57,352 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [128593213] [2024-11-08 10:29:57,352 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 10:29:57,353 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-08 10:29:57,353 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 10:29:57,354 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-08 10:29:57,354 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-08 10:29:57,354 INFO L87 Difference]: Start difference. First operand 870 states and 1314 transitions. Second operand has 3 states, 3 states have (on average 60.666666666666664) internal successors, (182), 3 states have internal predecessors, (182), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 10:29:58,144 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 10:29:58,145 INFO L93 Difference]: Finished difference Result 2554 states and 3869 transitions. [2024-11-08 10:29:58,145 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-08 10:29:58,146 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 60.666666666666664) internal successors, (182), 3 states have internal predecessors, (182), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 187 [2024-11-08 10:29:58,146 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 10:29:58,151 INFO L225 Difference]: With dead ends: 2554 [2024-11-08 10:29:58,152 INFO L226 Difference]: Without dead ends: 1686 [2024-11-08 10:29:58,153 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 10:29:58,154 INFO L432 NwaCegarLoop]: 388 mSDtfsCounter, 233 mSDsluCounter, 28 mSDsCounter, 0 mSdLazyCounter, 530 mSolverCounterSat, 170 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 233 SdHoareTripleChecker+Valid, 416 SdHoareTripleChecker+Invalid, 700 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 170 IncrementalHoareTripleChecker+Valid, 530 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2024-11-08 10:29:58,155 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [233 Valid, 416 Invalid, 700 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [170 Valid, 530 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2024-11-08 10:29:58,157 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1686 states. [2024-11-08 10:29:58,189 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1686 to 1684. [2024-11-08 10:29:58,191 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1684 states, 1683 states have (on average 1.3368983957219251) internal successors, (2250), 1683 states have internal predecessors, (2250), 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 10:29:58,196 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1684 states to 1684 states and 2250 transitions. [2024-11-08 10:29:58,197 INFO L78 Accepts]: Start accepts. Automaton has 1684 states and 2250 transitions. Word has length 187 [2024-11-08 10:29:58,197 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 10:29:58,197 INFO L471 AbstractCegarLoop]: Abstraction has 1684 states and 2250 transitions. [2024-11-08 10:29:58,198 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 60.666666666666664) internal successors, (182), 3 states have internal predecessors, (182), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 10:29:58,198 INFO L276 IsEmpty]: Start isEmpty. Operand 1684 states and 2250 transitions. [2024-11-08 10:29:58,202 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 191 [2024-11-08 10:29:58,202 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 10:29:58,203 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 10:29:58,203 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-11-08 10:29:58,203 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 10:29:58,203 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 10:29:58,204 INFO L85 PathProgramCache]: Analyzing trace with hash 1982576624, now seen corresponding path program 1 times [2024-11-08 10:29:58,204 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 10:29:58,204 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [242899857] [2024-11-08 10:29:58,204 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 10:29:58,204 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 10:29:58,266 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 10:29:58,514 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 22 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-08 10:29:58,514 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 10:29:58,515 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [242899857] [2024-11-08 10:29:58,515 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [242899857] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 10:29:58,515 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 10:29:58,515 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-08 10:29:58,516 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [785766486] [2024-11-08 10:29:58,516 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 10:29:58,516 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-08 10:29:58,516 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 10:29:58,517 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-08 10:29:58,517 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-08 10:29:58,518 INFO L87 Difference]: Start difference. First operand 1684 states and 2250 transitions. Second operand has 3 states, 3 states have (on average 63.333333333333336) internal successors, (190), 2 states have internal predecessors, (190), 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 10:29:59,314 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 10:29:59,314 INFO L93 Difference]: Finished difference Result 5005 states and 6690 transitions. [2024-11-08 10:29:59,315 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-08 10:29:59,315 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 63.333333333333336) internal successors, (190), 2 states have internal predecessors, (190), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 190 [2024-11-08 10:29:59,315 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 10:29:59,326 INFO L225 Difference]: With dead ends: 5005 [2024-11-08 10:29:59,327 INFO L226 Difference]: Without dead ends: 3323 [2024-11-08 10:29:59,329 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 10:29:59,330 INFO L432 NwaCegarLoop]: 141 mSDtfsCounter, 241 mSDsluCounter, 33 mSDsCounter, 0 mSdLazyCounter, 639 mSolverCounterSat, 75 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 241 SdHoareTripleChecker+Valid, 174 SdHoareTripleChecker+Invalid, 714 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 75 IncrementalHoareTripleChecker+Valid, 639 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2024-11-08 10:29:59,331 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [241 Valid, 174 Invalid, 714 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [75 Valid, 639 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2024-11-08 10:29:59,334 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3323 states. [2024-11-08 10:29:59,376 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3323 to 3320. [2024-11-08 10:29:59,380 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3320 states, 3319 states have (on average 1.2853269056944863) internal successors, (4266), 3319 states have internal predecessors, (4266), 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 10:29:59,389 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3320 states to 3320 states and 4266 transitions. [2024-11-08 10:29:59,390 INFO L78 Accepts]: Start accepts. Automaton has 3320 states and 4266 transitions. Word has length 190 [2024-11-08 10:29:59,390 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 10:29:59,390 INFO L471 AbstractCegarLoop]: Abstraction has 3320 states and 4266 transitions. [2024-11-08 10:29:59,391 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 63.333333333333336) internal successors, (190), 2 states have internal predecessors, (190), 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 10:29:59,391 INFO L276 IsEmpty]: Start isEmpty. Operand 3320 states and 4266 transitions. [2024-11-08 10:29:59,416 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 203 [2024-11-08 10:29:59,418 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 10:29:59,419 INFO L215 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 10:29:59,419 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-11-08 10:29:59,420 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 10:29:59,420 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 10:29:59,421 INFO L85 PathProgramCache]: Analyzing trace with hash 326250757, now seen corresponding path program 1 times [2024-11-08 10:29:59,421 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 10:29:59,421 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [718929295] [2024-11-08 10:29:59,421 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 10:29:59,421 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 10:29:59,486 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 10:29:59,734 INFO L134 CoverageAnalysis]: Checked inductivity of 52 backedges. 46 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2024-11-08 10:29:59,735 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 10:29:59,735 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [718929295] [2024-11-08 10:29:59,735 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [718929295] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 10:29:59,735 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 10:29:59,735 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-08 10:29:59,737 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1200597245] [2024-11-08 10:29:59,737 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 10:29:59,738 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-08 10:29:59,738 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 10:29:59,738 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-08 10:29:59,739 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-08 10:29:59,740 INFO L87 Difference]: Start difference. First operand 3320 states and 4266 transitions. Second operand has 3 states, 3 states have (on average 65.66666666666667) internal successors, (197), 3 states have internal predecessors, (197), 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 10:30:00,621 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 10:30:00,622 INFO L93 Difference]: Finished difference Result 9900 states and 12723 transitions. [2024-11-08 10:30:00,622 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-08 10:30:00,622 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 65.66666666666667) internal successors, (197), 3 states have internal predecessors, (197), 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 202 [2024-11-08 10:30:00,623 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 10:30:00,643 INFO L225 Difference]: With dead ends: 9900 [2024-11-08 10:30:00,643 INFO L226 Difference]: Without dead ends: 6582 [2024-11-08 10:30:00,648 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 10:30:00,649 INFO L432 NwaCegarLoop]: 395 mSDtfsCounter, 202 mSDsluCounter, 23 mSDsCounter, 0 mSdLazyCounter, 599 mSolverCounterSat, 137 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 202 SdHoareTripleChecker+Valid, 418 SdHoareTripleChecker+Invalid, 736 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 137 IncrementalHoareTripleChecker+Valid, 599 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2024-11-08 10:30:00,650 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [202 Valid, 418 Invalid, 736 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [137 Valid, 599 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2024-11-08 10:30:00,656 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6582 states. [2024-11-08 10:30:00,744 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6582 to 6577. [2024-11-08 10:30:00,753 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6577 states, 6576 states have (on average 1.224756690997567) internal successors, (8054), 6576 states have internal predecessors, (8054), 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 10:30:00,771 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6577 states to 6577 states and 8054 transitions. [2024-11-08 10:30:00,771 INFO L78 Accepts]: Start accepts. Automaton has 6577 states and 8054 transitions. Word has length 202 [2024-11-08 10:30:00,772 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 10:30:00,772 INFO L471 AbstractCegarLoop]: Abstraction has 6577 states and 8054 transitions. [2024-11-08 10:30:00,772 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 65.66666666666667) internal successors, (197), 3 states have internal predecessors, (197), 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 10:30:00,772 INFO L276 IsEmpty]: Start isEmpty. Operand 6577 states and 8054 transitions. [2024-11-08 10:30:00,782 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 209 [2024-11-08 10:30:00,782 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 10:30:00,782 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, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 10:30:00,783 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-11-08 10:30:00,783 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 10:30:00,783 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 10:30:00,784 INFO L85 PathProgramCache]: Analyzing trace with hash -1195043644, now seen corresponding path program 1 times [2024-11-08 10:30:00,784 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 10:30:00,784 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [952754106] [2024-11-08 10:30:00,784 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 10:30:00,784 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 10:30:00,836 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 10:30:01,119 INFO L134 CoverageAnalysis]: Checked inductivity of 40 backedges. 40 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-08 10:30:01,120 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 10:30:01,120 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [952754106] [2024-11-08 10:30:01,120 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [952754106] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 10:30:01,121 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 10:30:01,121 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-08 10:30:01,121 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [239330814] [2024-11-08 10:30:01,121 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 10:30:01,122 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-08 10:30:01,122 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 10:30:01,123 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-08 10:30:01,123 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-08 10:30:01,123 INFO L87 Difference]: Start difference. First operand 6577 states and 8054 transitions. Second operand has 3 states, 3 states have (on average 69.33333333333333) internal successors, (208), 2 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 10:30:01,975 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 10:30:01,976 INFO L93 Difference]: Finished difference Result 16215 states and 19826 transitions. [2024-11-08 10:30:01,976 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-08 10:30:01,977 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 69.33333333333333) internal successors, (208), 2 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 10:30:01,977 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 10:30:02,014 INFO L225 Difference]: With dead ends: 16215 [2024-11-08 10:30:02,015 INFO L226 Difference]: Without dead ends: 9640 [2024-11-08 10:30:02,025 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 10:30:02,028 INFO L432 NwaCegarLoop]: 137 mSDtfsCounter, 203 mSDsluCounter, 18 mSDsCounter, 0 mSdLazyCounter, 594 mSolverCounterSat, 144 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 203 SdHoareTripleChecker+Valid, 155 SdHoareTripleChecker+Invalid, 738 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 144 IncrementalHoareTripleChecker+Valid, 594 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2024-11-08 10:30:02,030 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [203 Valid, 155 Invalid, 738 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [144 Valid, 594 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2024-11-08 10:30:02,040 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9640 states. [2024-11-08 10:30:02,224 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9640 to 9638. [2024-11-08 10:30:02,241 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9638 states, 9637 states have (on average 1.2039016291376985) internal successors, (11602), 9637 states have internal predecessors, (11602), 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 10:30:02,270 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9638 states to 9638 states and 11602 transitions. [2024-11-08 10:30:02,274 INFO L78 Accepts]: Start accepts. Automaton has 9638 states and 11602 transitions. Word has length 208 [2024-11-08 10:30:02,275 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 10:30:02,275 INFO L471 AbstractCegarLoop]: Abstraction has 9638 states and 11602 transitions. [2024-11-08 10:30:02,275 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 69.33333333333333) internal successors, (208), 2 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 10:30:02,276 INFO L276 IsEmpty]: Start isEmpty. Operand 9638 states and 11602 transitions. [2024-11-08 10:30:02,293 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 216 [2024-11-08 10:30:02,293 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 10:30:02,294 INFO L215 NwaCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 10:30:02,294 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-11-08 10:30:02,295 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 10:30:02,296 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 10:30:02,296 INFO L85 PathProgramCache]: Analyzing trace with hash -1486955153, now seen corresponding path program 1 times [2024-11-08 10:30:02,296 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 10:30:02,296 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1753906693] [2024-11-08 10:30:02,297 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 10:30:02,297 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 10:30:02,376 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 10:30:02,822 INFO L134 CoverageAnalysis]: Checked inductivity of 53 backedges. 47 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-08 10:30:02,822 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 10:30:02,822 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1753906693] [2024-11-08 10:30:02,823 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1753906693] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-08 10:30:02,823 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [233208949] [2024-11-08 10:30:02,823 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 10:30:02,823 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-08 10:30:02,823 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-08 10:30:02,825 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 10:30:02,827 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 10:30:02,995 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 10:30:02,999 INFO L255 TraceCheckSpWp]: Trace formula consists of 409 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-11-08 10:30:03,012 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-08 10:30:03,269 INFO L134 CoverageAnalysis]: Checked inductivity of 53 backedges. 47 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2024-11-08 10:30:03,270 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-08 10:30:03,270 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [233208949] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 10:30:03,270 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-08 10:30:03,271 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [3] total 5 [2024-11-08 10:30:03,272 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [851488799] [2024-11-08 10:30:03,273 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 10:30:03,273 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-08 10:30:03,273 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 10:30:03,274 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-08 10:30:03,274 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-11-08 10:30:03,274 INFO L87 Difference]: Start difference. First operand 9638 states and 11602 transitions. Second operand has 3 states, 3 states have (on average 70.0) internal successors, (210), 3 states have internal predecessors, (210), 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 10:30:04,008 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 10:30:04,009 INFO L93 Difference]: Finished difference Result 19277 states and 23207 transitions. [2024-11-08 10:30:04,009 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-08 10:30:04,009 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 70.0) internal successors, (210), 3 states have internal predecessors, (210), 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 215 [2024-11-08 10:30:04,010 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 10:30:04,036 INFO L225 Difference]: With dead ends: 19277 [2024-11-08 10:30:04,036 INFO L226 Difference]: Without dead ends: 9641 [2024-11-08 10:30:04,046 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 217 GetRequests, 214 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 10:30:04,047 INFO L432 NwaCegarLoop]: 80 mSDtfsCounter, 111 mSDsluCounter, 18 mSDsCounter, 0 mSdLazyCounter, 608 mSolverCounterSat, 56 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 111 SdHoareTripleChecker+Valid, 98 SdHoareTripleChecker+Invalid, 664 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 56 IncrementalHoareTripleChecker+Valid, 608 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2024-11-08 10:30:04,048 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [111 Valid, 98 Invalid, 664 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [56 Valid, 608 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2024-11-08 10:30:04,058 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9641 states. [2024-11-08 10:30:04,197 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9641 to 9638. [2024-11-08 10:30:04,215 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9638 states, 9637 states have (on average 1.1977793919269482) internal successors, (11543), 9637 states have internal predecessors, (11543), 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 10:30:04,235 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9638 states to 9638 states and 11543 transitions. [2024-11-08 10:30:04,237 INFO L78 Accepts]: Start accepts. Automaton has 9638 states and 11543 transitions. Word has length 215 [2024-11-08 10:30:04,237 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 10:30:04,237 INFO L471 AbstractCegarLoop]: Abstraction has 9638 states and 11543 transitions. [2024-11-08 10:30:04,241 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 70.0) internal successors, (210), 3 states have internal predecessors, (210), 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 10:30:04,241 INFO L276 IsEmpty]: Start isEmpty. Operand 9638 states and 11543 transitions. [2024-11-08 10:30:04,261 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 249 [2024-11-08 10:30:04,261 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 10:30:04,262 INFO L215 NwaCegarLoop]: trace histogram [5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 10:30:04,280 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2024-11-08 10:30:04,462 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-08 10:30:04,463 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 10:30:04,464 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 10:30:04,464 INFO L85 PathProgramCache]: Analyzing trace with hash -178927718, now seen corresponding path program 1 times [2024-11-08 10:30:04,464 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 10:30:04,464 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1763541782] [2024-11-08 10:30:04,464 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 10:30:04,464 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 10:30:04,529 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 10:30:05,028 INFO L134 CoverageAnalysis]: Checked inductivity of 154 backedges. 92 proven. 6 refuted. 0 times theorem prover too weak. 56 trivial. 0 not checked. [2024-11-08 10:30:05,028 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 10:30:05,029 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1763541782] [2024-11-08 10:30:05,029 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1763541782] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-08 10:30:05,029 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1947611188] [2024-11-08 10:30:05,029 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 10:30:05,029 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-08 10:30:05,030 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-08 10:30:05,031 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 10:30:05,033 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 10:30:05,215 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 10:30:05,218 INFO L255 TraceCheckSpWp]: Trace formula consists of 513 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-11-08 10:30:05,226 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-08 10:30:05,326 INFO L134 CoverageAnalysis]: Checked inductivity of 154 backedges. 99 proven. 0 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2024-11-08 10:30:05,327 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-08 10:30:05,327 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1947611188] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 10:30:05,327 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-08 10:30:05,327 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [3] total 4 [2024-11-08 10:30:05,327 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [153078056] [2024-11-08 10:30:05,327 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 10:30:05,328 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-08 10:30:05,328 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 10:30:05,329 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-08 10:30:05,329 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-08 10:30:05,330 INFO L87 Difference]: Start difference. First operand 9638 states and 11543 transitions. Second operand has 3 states, 3 states have (on average 67.33333333333333) internal successors, (202), 2 states have internal predecessors, (202), 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 10:30:05,761 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 10:30:05,761 INFO L93 Difference]: Finished difference Result 19238 states and 23035 transitions. [2024-11-08 10:30:05,762 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-08 10:30:05,762 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 67.33333333333333) internal successors, (202), 2 states have internal predecessors, (202), 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 248 [2024-11-08 10:30:05,762 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 10:30:05,779 INFO L225 Difference]: With dead ends: 19238 [2024-11-08 10:30:05,780 INFO L226 Difference]: Without dead ends: 9602 [2024-11-08 10:30:05,790 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 250 GetRequests, 247 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-08 10:30:05,791 INFO L432 NwaCegarLoop]: 31 mSDtfsCounter, 308 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 323 mSolverCounterSat, 26 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 308 SdHoareTripleChecker+Valid, 31 SdHoareTripleChecker+Invalid, 349 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 26 IncrementalHoareTripleChecker+Valid, 323 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-11-08 10:30:05,792 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [308 Valid, 31 Invalid, 349 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [26 Valid, 323 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-11-08 10:30:05,801 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9602 states. [2024-11-08 10:30:05,949 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9602 to 9602. [2024-11-08 10:30:05,968 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9602 states, 9601 states have (on average 1.1872721591500885) internal successors, (11399), 9601 states have internal predecessors, (11399), 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 10:30:05,988 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9602 states to 9602 states and 11399 transitions. [2024-11-08 10:30:05,989 INFO L78 Accepts]: Start accepts. Automaton has 9602 states and 11399 transitions. Word has length 248 [2024-11-08 10:30:05,989 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 10:30:05,990 INFO L471 AbstractCegarLoop]: Abstraction has 9602 states and 11399 transitions. [2024-11-08 10:30:05,990 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 67.33333333333333) internal successors, (202), 2 states have internal predecessors, (202), 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 10:30:05,991 INFO L276 IsEmpty]: Start isEmpty. Operand 9602 states and 11399 transitions. [2024-11-08 10:30:06,011 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 270 [2024-11-08 10:30:06,013 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 10:30:06,014 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, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 10:30:06,035 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2024-11-08 10:30:06,214 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,SelfDestructingSolverStorable7 [2024-11-08 10:30:06,215 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 10:30:06,215 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 10:30:06,215 INFO L85 PathProgramCache]: Analyzing trace with hash 1189467201, now seen corresponding path program 1 times [2024-11-08 10:30:06,215 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 10:30:06,216 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1775057823] [2024-11-08 10:30:06,216 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 10:30:06,216 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 10:30:06,305 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 10:30:06,561 INFO L134 CoverageAnalysis]: Checked inductivity of 128 backedges. 54 proven. 0 refuted. 0 times theorem prover too weak. 74 trivial. 0 not checked. [2024-11-08 10:30:06,562 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 10:30:06,562 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1775057823] [2024-11-08 10:30:06,562 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1775057823] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 10:30:06,562 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 10:30:06,562 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-08 10:30:06,563 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1928139234] [2024-11-08 10:30:06,563 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 10:30:06,563 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-08 10:30:06,563 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 10:30:06,564 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-08 10:30:06,564 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-08 10:30:06,564 INFO L87 Difference]: Start difference. First operand 9602 states and 11399 transitions. Second operand has 3 states, 3 states have (on average 65.33333333333333) internal successors, (196), 2 states have internal predecessors, (196), 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 10:30:07,402 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 10:30:07,403 INFO L93 Difference]: Finished difference Result 25330 states and 29968 transitions. [2024-11-08 10:30:07,404 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-08 10:30:07,404 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 65.33333333333333) internal successors, (196), 2 states have internal predecessors, (196), 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 269 [2024-11-08 10:30:07,404 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 10:30:07,427 INFO L225 Difference]: With dead ends: 25330 [2024-11-08 10:30:07,427 INFO L226 Difference]: Without dead ends: 15730 [2024-11-08 10:30:07,436 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 10:30:07,437 INFO L432 NwaCegarLoop]: 102 mSDtfsCounter, 205 mSDsluCounter, 13 mSDsCounter, 0 mSdLazyCounter, 616 mSolverCounterSat, 94 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 205 SdHoareTripleChecker+Valid, 115 SdHoareTripleChecker+Invalid, 710 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 94 IncrementalHoareTripleChecker+Valid, 616 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2024-11-08 10:30:07,437 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [205 Valid, 115 Invalid, 710 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [94 Valid, 616 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2024-11-08 10:30:07,452 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15730 states. [2024-11-08 10:30:07,600 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15730 to 15728. [2024-11-08 10:30:07,619 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 15728 states, 15727 states have (on average 1.1773383353468558) internal successors, (18516), 15727 states have internal predecessors, (18516), 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 10:30:07,646 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15728 states to 15728 states and 18516 transitions. [2024-11-08 10:30:07,647 INFO L78 Accepts]: Start accepts. Automaton has 15728 states and 18516 transitions. Word has length 269 [2024-11-08 10:30:07,647 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 10:30:07,647 INFO L471 AbstractCegarLoop]: Abstraction has 15728 states and 18516 transitions. [2024-11-08 10:30:07,647 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 65.33333333333333) internal successors, (196), 2 states have internal predecessors, (196), 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 10:30:07,647 INFO L276 IsEmpty]: Start isEmpty. Operand 15728 states and 18516 transitions. [2024-11-08 10:30:07,671 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 277 [2024-11-08 10:30:07,671 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 10:30:07,671 INFO L215 NwaCegarLoop]: trace histogram [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, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 10:30:07,672 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-11-08 10:30:07,672 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 10:30:07,672 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 10:30:07,673 INFO L85 PathProgramCache]: Analyzing trace with hash -1680499850, now seen corresponding path program 1 times [2024-11-08 10:30:07,673 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 10:30:07,673 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1602414053] [2024-11-08 10:30:07,673 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 10:30:07,673 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 10:30:07,733 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 10:30:08,120 INFO L134 CoverageAnalysis]: Checked inductivity of 148 backedges. 68 proven. 6 refuted. 0 times theorem prover too weak. 74 trivial. 0 not checked. [2024-11-08 10:30:08,120 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 10:30:08,120 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1602414053] [2024-11-08 10:30:08,120 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1602414053] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-08 10:30:08,120 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [96382629] [2024-11-08 10:30:08,120 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 10:30:08,121 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-08 10:30:08,121 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-08 10:30:08,123 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 10:30:08,124 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 10:30:08,295 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 10:30:08,299 INFO L255 TraceCheckSpWp]: Trace formula consists of 498 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-11-08 10:30:08,308 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-08 10:30:08,398 INFO L134 CoverageAnalysis]: Checked inductivity of 148 backedges. 142 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2024-11-08 10:30:08,398 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-08 10:30:08,398 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [96382629] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 10:30:08,398 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-08 10:30:08,399 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [3] total 5 [2024-11-08 10:30:08,399 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [373006276] [2024-11-08 10:30:08,399 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 10:30:08,399 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-08 10:30:08,400 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 10:30:08,400 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-08 10:30:08,400 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-08 10:30:08,401 INFO L87 Difference]: Start difference. First operand 15728 states and 18516 transitions. Second operand has 3 states, 3 states have (on average 90.33333333333333) internal successors, (271), 3 states have internal predecessors, (271), 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 10:30:09,065 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 10:30:09,065 INFO L93 Difference]: Finished difference Result 30838 states and 36191 transitions. [2024-11-08 10:30:09,066 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-08 10:30:09,066 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 90.33333333333333) internal successors, (271), 3 states have internal predecessors, (271), 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 276 [2024-11-08 10:30:09,066 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 10:30:09,090 INFO L225 Difference]: With dead ends: 30838 [2024-11-08 10:30:09,090 INFO L226 Difference]: Without dead ends: 15112 [2024-11-08 10:30:09,107 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 278 GetRequests, 275 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-08 10:30:09,108 INFO L432 NwaCegarLoop]: 321 mSDtfsCounter, 177 mSDsluCounter, 15 mSDsCounter, 0 mSdLazyCounter, 543 mSolverCounterSat, 100 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 177 SdHoareTripleChecker+Valid, 336 SdHoareTripleChecker+Invalid, 643 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 100 IncrementalHoareTripleChecker+Valid, 543 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2024-11-08 10:30:09,108 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [177 Valid, 336 Invalid, 643 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [100 Valid, 543 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2024-11-08 10:30:09,120 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15112 states. [2024-11-08 10:30:09,280 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15112 to 15106. [2024-11-08 10:30:09,297 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 15106 states, 15105 states have (on average 1.140946706388613) internal successors, (17234), 15105 states have internal predecessors, (17234), 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 10:30:09,422 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15106 states to 15106 states and 17234 transitions. [2024-11-08 10:30:09,423 INFO L78 Accepts]: Start accepts. Automaton has 15106 states and 17234 transitions. Word has length 276 [2024-11-08 10:30:09,423 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 10:30:09,424 INFO L471 AbstractCegarLoop]: Abstraction has 15106 states and 17234 transitions. [2024-11-08 10:30:09,424 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 90.33333333333333) internal successors, (271), 3 states have internal predecessors, (271), 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 10:30:09,424 INFO L276 IsEmpty]: Start isEmpty. Operand 15106 states and 17234 transitions. [2024-11-08 10:30:09,444 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 277 [2024-11-08 10:30:09,444 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 10:30:09,445 INFO L215 NwaCegarLoop]: trace histogram [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, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 10:30:09,464 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2024-11-08 10:30:09,648 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-08 10:30:09,649 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 10:30:09,650 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 10:30:09,650 INFO L85 PathProgramCache]: Analyzing trace with hash -1655882943, now seen corresponding path program 1 times [2024-11-08 10:30:09,650 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 10:30:09,650 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1146295892] [2024-11-08 10:30:09,650 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 10:30:09,650 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 10:30:09,709 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 10:30:10,225 INFO L134 CoverageAnalysis]: Checked inductivity of 161 backedges. 94 proven. 6 refuted. 0 times theorem prover too weak. 61 trivial. 0 not checked. [2024-11-08 10:30:10,226 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 10:30:10,226 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1146295892] [2024-11-08 10:30:10,226 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1146295892] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-08 10:30:10,227 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1282970442] [2024-11-08 10:30:10,227 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 10:30:10,227 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-08 10:30:10,227 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-08 10:30:10,229 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-08 10:30:10,231 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2024-11-08 10:30:10,454 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 10:30:10,458 INFO L255 TraceCheckSpWp]: Trace formula consists of 509 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-11-08 10:30:10,464 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-08 10:30:10,564 INFO L134 CoverageAnalysis]: Checked inductivity of 161 backedges. 155 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2024-11-08 10:30:10,566 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-08 10:30:10,566 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1282970442] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 10:30:10,566 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-08 10:30:10,566 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [3] total 5 [2024-11-08 10:30:10,567 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [423501146] [2024-11-08 10:30:10,567 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 10:30:10,568 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-08 10:30:10,568 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 10:30:10,568 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-08 10:30:10,569 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-11-08 10:30:10,569 INFO L87 Difference]: Start difference. First operand 15106 states and 17234 transitions. Second operand has 3 states, 3 states have (on average 90.33333333333333) internal successors, (271), 3 states have internal predecessors, (271), 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 10:30:11,381 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 10:30:11,381 INFO L93 Difference]: Finished difference Result 35291 states and 40808 transitions. [2024-11-08 10:30:11,382 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-08 10:30:11,382 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 90.33333333333333) internal successors, (271), 3 states have internal predecessors, (271), 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 276 [2024-11-08 10:30:11,382 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 10:30:11,420 INFO L225 Difference]: With dead ends: 35291 [2024-11-08 10:30:11,420 INFO L226 Difference]: Without dead ends: 20187 [2024-11-08 10:30:11,439 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 278 GetRequests, 275 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 10:30:11,441 INFO L432 NwaCegarLoop]: 115 mSDtfsCounter, 163 mSDsluCounter, 20 mSDsCounter, 0 mSdLazyCounter, 492 mSolverCounterSat, 182 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 163 SdHoareTripleChecker+Valid, 135 SdHoareTripleChecker+Invalid, 674 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 182 IncrementalHoareTripleChecker+Valid, 492 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2024-11-08 10:30:11,442 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [163 Valid, 135 Invalid, 674 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [182 Valid, 492 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2024-11-08 10:30:11,457 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20187 states. [2024-11-08 10:30:11,695 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20187 to 19775. [2024-11-08 10:30:11,715 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 19775 states, 19774 states have (on average 1.1240517851724487) internal successors, (22227), 19774 states have internal predecessors, (22227), 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 10:30:11,751 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19775 states to 19775 states and 22227 transitions. [2024-11-08 10:30:11,752 INFO L78 Accepts]: Start accepts. Automaton has 19775 states and 22227 transitions. Word has length 276 [2024-11-08 10:30:11,752 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 10:30:11,752 INFO L471 AbstractCegarLoop]: Abstraction has 19775 states and 22227 transitions. [2024-11-08 10:30:11,753 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 90.33333333333333) internal successors, (271), 3 states have internal predecessors, (271), 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 10:30:11,753 INFO L276 IsEmpty]: Start isEmpty. Operand 19775 states and 22227 transitions. [2024-11-08 10:30:11,775 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 301 [2024-11-08 10:30:11,775 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 10:30:11,776 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 10:30:11,795 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2024-11-08 10:30:11,976 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-08 10:30:11,977 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 10:30:11,977 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 10:30:11,977 INFO L85 PathProgramCache]: Analyzing trace with hash -1246965763, now seen corresponding path program 1 times [2024-11-08 10:30:11,977 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 10:30:11,977 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1310527344] [2024-11-08 10:30:11,978 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 10:30:11,978 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 10:30:12,062 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 10:30:12,514 INFO L134 CoverageAnalysis]: Checked inductivity of 136 backedges. 136 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-08 10:30:12,515 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 10:30:12,515 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1310527344] [2024-11-08 10:30:12,515 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1310527344] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 10:30:12,515 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 10:30:12,515 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-08 10:30:12,515 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1715145246] [2024-11-08 10:30:12,515 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 10:30:12,516 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-08 10:30:12,516 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 10:30:12,516 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-08 10:30:12,517 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-11-08 10:30:12,517 INFO L87 Difference]: Start difference. First operand 19775 states and 22227 transitions. Second operand has 4 states, 4 states have (on average 75.0) internal successors, (300), 3 states have internal predecessors, (300), 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 10:30:13,364 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 10:30:13,365 INFO L93 Difference]: Finished difference Result 42390 states and 47516 transitions. [2024-11-08 10:30:13,365 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-08 10:30:13,365 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 75.0) internal successors, (300), 3 states have internal predecessors, (300), 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 300 [2024-11-08 10:30:13,366 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 10:30:13,396 INFO L225 Difference]: With dead ends: 42390 [2024-11-08 10:30:13,396 INFO L226 Difference]: Without dead ends: 22617 [2024-11-08 10:30:13,414 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 10:30:13,415 INFO L432 NwaCegarLoop]: 129 mSDtfsCounter, 289 mSDsluCounter, 43 mSDsCounter, 0 mSdLazyCounter, 1082 mSolverCounterSat, 38 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 289 SdHoareTripleChecker+Valid, 172 SdHoareTripleChecker+Invalid, 1120 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 38 IncrementalHoareTripleChecker+Valid, 1082 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2024-11-08 10:30:13,415 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [289 Valid, 172 Invalid, 1120 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [38 Valid, 1082 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2024-11-08 10:30:13,431 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22617 states. [2024-11-08 10:30:13,596 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22617 to 21399. [2024-11-08 10:30:13,617 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 21399 states, 21398 states have (on average 1.117020282269371) internal successors, (23902), 21398 states have internal predecessors, (23902), 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 10:30:13,648 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21399 states to 21399 states and 23902 transitions. [2024-11-08 10:30:13,649 INFO L78 Accepts]: Start accepts. Automaton has 21399 states and 23902 transitions. Word has length 300 [2024-11-08 10:30:13,649 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 10:30:13,649 INFO L471 AbstractCegarLoop]: Abstraction has 21399 states and 23902 transitions. [2024-11-08 10:30:13,650 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 75.0) internal successors, (300), 3 states have internal predecessors, (300), 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 10:30:13,650 INFO L276 IsEmpty]: Start isEmpty. Operand 21399 states and 23902 transitions. [2024-11-08 10:30:13,666 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 304 [2024-11-08 10:30:13,667 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 10:30:13,667 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, 3, 3, 3, 3, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 10:30:13,667 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2024-11-08 10:30:13,668 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 10:30:13,668 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 10:30:13,668 INFO L85 PathProgramCache]: Analyzing trace with hash 646862978, now seen corresponding path program 1 times [2024-11-08 10:30:13,668 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 10:30:13,668 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1847260452] [2024-11-08 10:30:13,668 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 10:30:13,669 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 10:30:13,728 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 10:30:13,953 INFO L134 CoverageAnalysis]: Checked inductivity of 195 backedges. 134 proven. 0 refuted. 0 times theorem prover too weak. 61 trivial. 0 not checked. [2024-11-08 10:30:13,954 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 10:30:13,954 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1847260452] [2024-11-08 10:30:13,954 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1847260452] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 10:30:13,954 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 10:30:13,954 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-08 10:30:13,954 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1095846192] [2024-11-08 10:30:13,954 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 10:30:13,955 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-08 10:30:13,955 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 10:30:13,955 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-08 10:30:13,955 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-08 10:30:13,956 INFO L87 Difference]: Start difference. First operand 21399 states and 23902 transitions. Second operand has 3 states, 3 states have (on average 81.0) internal successors, (243), 2 states have internal predecessors, (243), 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 10:30:14,660 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 10:30:14,660 INFO L93 Difference]: Finished difference Result 51961 states and 58199 transitions. [2024-11-08 10:30:14,661 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-08 10:30:14,661 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 81.0) internal successors, (243), 2 states have internal predecessors, (243), 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 303 [2024-11-08 10:30:14,661 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 10:30:14,700 INFO L225 Difference]: With dead ends: 51961 [2024-11-08 10:30:14,700 INFO L226 Difference]: Without dead ends: 30564 [2024-11-08 10:30:14,724 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 10:30:14,725 INFO L432 NwaCegarLoop]: 115 mSDtfsCounter, 156 mSDsluCounter, 27 mSDsCounter, 0 mSdLazyCounter, 623 mSolverCounterSat, 50 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 156 SdHoareTripleChecker+Valid, 142 SdHoareTripleChecker+Invalid, 673 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 50 IncrementalHoareTripleChecker+Valid, 623 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2024-11-08 10:30:14,726 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [156 Valid, 142 Invalid, 673 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [50 Valid, 623 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2024-11-08 10:30:14,753 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30564 states. [2024-11-08 10:30:14,994 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30564 to 25666. [2024-11-08 10:30:15,018 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 25666 states, 25665 states have (on average 1.1227742061172803) internal successors, (28816), 25665 states have internal predecessors, (28816), 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 10:30:15,058 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25666 states to 25666 states and 28816 transitions. [2024-11-08 10:30:15,058 INFO L78 Accepts]: Start accepts. Automaton has 25666 states and 28816 transitions. Word has length 303 [2024-11-08 10:30:15,059 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 10:30:15,059 INFO L471 AbstractCegarLoop]: Abstraction has 25666 states and 28816 transitions. [2024-11-08 10:30:15,059 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 81.0) internal successors, (243), 2 states have internal predecessors, (243), 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 10:30:15,059 INFO L276 IsEmpty]: Start isEmpty. Operand 25666 states and 28816 transitions. [2024-11-08 10:30:15,078 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 309 [2024-11-08 10:30:15,078 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 10:30:15,079 INFO L215 NwaCegarLoop]: trace histogram [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, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 10:30:15,079 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2024-11-08 10:30:15,079 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 10:30:15,079 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 10:30:15,080 INFO L85 PathProgramCache]: Analyzing trace with hash -1127420156, now seen corresponding path program 1 times [2024-11-08 10:30:15,080 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 10:30:15,080 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1280226262] [2024-11-08 10:30:15,080 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 10:30:15,080 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 10:30:15,143 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 10:30:15,532 INFO L134 CoverageAnalysis]: Checked inductivity of 247 backedges. 110 proven. 6 refuted. 0 times theorem prover too weak. 131 trivial. 0 not checked. [2024-11-08 10:30:15,532 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 10:30:15,533 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1280226262] [2024-11-08 10:30:15,533 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1280226262] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-08 10:30:15,533 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1907439990] [2024-11-08 10:30:15,533 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 10:30:15,533 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-08 10:30:15,533 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-08 10:30:15,536 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-08 10:30:15,539 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2024-11-08 10:30:15,701 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 10:30:15,703 INFO L255 TraceCheckSpWp]: Trace formula consists of 579 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-11-08 10:30:15,709 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-08 10:30:15,949 INFO L134 CoverageAnalysis]: Checked inductivity of 247 backedges. 174 proven. 0 refuted. 0 times theorem prover too weak. 73 trivial. 0 not checked. [2024-11-08 10:30:15,950 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-08 10:30:15,950 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1907439990] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 10:30:15,950 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-08 10:30:15,950 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [3] total 5 [2024-11-08 10:30:15,950 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [88274353] [2024-11-08 10:30:15,950 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 10:30:15,951 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-08 10:30:15,951 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 10:30:15,952 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-08 10:30:15,952 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-08 10:30:15,952 INFO L87 Difference]: Start difference. First operand 25666 states and 28816 transitions. Second operand has 3 states, 3 states have (on average 81.33333333333333) internal successors, (244), 3 states have internal predecessors, (244), 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 10:30:16,638 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 10:30:16,638 INFO L93 Difference]: Finished difference Result 54801 states and 61516 transitions. [2024-11-08 10:30:16,638 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-08 10:30:16,639 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 81.33333333333333) internal successors, (244), 3 states have internal predecessors, (244), 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 308 [2024-11-08 10:30:16,639 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 10:30:16,670 INFO L225 Difference]: With dead ends: 54801 [2024-11-08 10:30:16,670 INFO L226 Difference]: Without dead ends: 29137 [2024-11-08 10:30:16,692 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 310 GetRequests, 307 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-08 10:30:16,692 INFO L432 NwaCegarLoop]: 351 mSDtfsCounter, 65 mSDsluCounter, 25 mSDsCounter, 0 mSdLazyCounter, 523 mSolverCounterSat, 133 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 65 SdHoareTripleChecker+Valid, 376 SdHoareTripleChecker+Invalid, 656 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 133 IncrementalHoareTripleChecker+Valid, 523 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-11-08 10:30:16,693 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [65 Valid, 376 Invalid, 656 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [133 Valid, 523 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2024-11-08 10:30:16,717 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29137 states. [2024-11-08 10:30:17,141 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29137 to 29113. [2024-11-08 10:30:17,167 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 29113 states, 29112 states have (on average 1.1144201703764771) internal successors, (32443), 29112 states have internal predecessors, (32443), 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 10:30:17,216 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29113 states to 29113 states and 32443 transitions. [2024-11-08 10:30:17,218 INFO L78 Accepts]: Start accepts. Automaton has 29113 states and 32443 transitions. Word has length 308 [2024-11-08 10:30:17,218 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 10:30:17,218 INFO L471 AbstractCegarLoop]: Abstraction has 29113 states and 32443 transitions. [2024-11-08 10:30:17,219 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 81.33333333333333) internal successors, (244), 3 states have internal predecessors, (244), 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 10:30:17,219 INFO L276 IsEmpty]: Start isEmpty. Operand 29113 states and 32443 transitions. [2024-11-08 10:30:17,250 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 325 [2024-11-08 10:30:17,251 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 10:30:17,251 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, 3, 3, 3, 3, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 10:30:17,272 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Ended with exit code 0 [2024-11-08 10:30:17,452 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable13 [2024-11-08 10:30:17,452 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 10:30:17,453 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 10:30:17,453 INFO L85 PathProgramCache]: Analyzing trace with hash 1083274386, now seen corresponding path program 1 times [2024-11-08 10:30:17,453 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 10:30:17,453 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [299507316] [2024-11-08 10:30:17,453 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 10:30:17,454 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 10:30:17,542 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 10:30:17,722 INFO L134 CoverageAnalysis]: Checked inductivity of 216 backedges. 216 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-08 10:30:17,722 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 10:30:17,722 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [299507316] [2024-11-08 10:30:17,723 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [299507316] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 10:30:17,723 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 10:30:17,723 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-08 10:30:17,723 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2088086360] [2024-11-08 10:30:17,723 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 10:30:17,724 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-08 10:30:17,724 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 10:30:17,725 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-08 10:30:17,725 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-08 10:30:17,725 INFO L87 Difference]: Start difference. First operand 29113 states and 32443 transitions. Second operand has 3 states, 3 states have (on average 108.0) internal successors, (324), 3 states have internal predecessors, (324), 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 10:30:18,455 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 10:30:18,455 INFO L93 Difference]: Finished difference Result 54556 states and 60866 transitions. [2024-11-08 10:30:18,456 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-08 10:30:18,456 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 108.0) internal successors, (324), 3 states have internal predecessors, (324), 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 324 [2024-11-08 10:30:18,456 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 10:30:18,485 INFO L225 Difference]: With dead ends: 54556 [2024-11-08 10:30:18,485 INFO L226 Difference]: Without dead ends: 25445 [2024-11-08 10:30:18,509 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 10:30:18,510 INFO L432 NwaCegarLoop]: 317 mSDtfsCounter, 197 mSDsluCounter, 16 mSDsCounter, 0 mSdLazyCounter, 519 mSolverCounterSat, 117 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 197 SdHoareTripleChecker+Valid, 333 SdHoareTripleChecker+Invalid, 636 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 117 IncrementalHoareTripleChecker+Valid, 519 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2024-11-08 10:30:18,510 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [197 Valid, 333 Invalid, 636 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [117 Valid, 519 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2024-11-08 10:30:18,527 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25445 states. [2024-11-08 10:30:18,707 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25445 to 24427. [2024-11-08 10:30:18,723 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 24427 states, 24426 states have (on average 1.0947760582985344) internal successors, (26741), 24426 states have internal predecessors, (26741), 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 10:30:18,745 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24427 states to 24427 states and 26741 transitions. [2024-11-08 10:30:18,746 INFO L78 Accepts]: Start accepts. Automaton has 24427 states and 26741 transitions. Word has length 324 [2024-11-08 10:30:18,747 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 10:30:18,747 INFO L471 AbstractCegarLoop]: Abstraction has 24427 states and 26741 transitions. [2024-11-08 10:30:18,747 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 108.0) internal successors, (324), 3 states have internal predecessors, (324), 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 10:30:18,747 INFO L276 IsEmpty]: Start isEmpty. Operand 24427 states and 26741 transitions. [2024-11-08 10:30:18,762 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 331 [2024-11-08 10:30:18,763 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 10:30:18,763 INFO L215 NwaCegarLoop]: trace histogram [4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 10:30:18,763 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2024-11-08 10:30:18,763 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 10:30:18,765 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 10:30:18,765 INFO L85 PathProgramCache]: Analyzing trace with hash 1943868510, now seen corresponding path program 1 times [2024-11-08 10:30:18,765 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 10:30:18,765 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [210192413] [2024-11-08 10:30:18,765 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 10:30:18,765 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 10:30:18,810 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 10:30:19,098 INFO L134 CoverageAnalysis]: Checked inductivity of 227 backedges. 166 proven. 0 refuted. 0 times theorem prover too weak. 61 trivial. 0 not checked. [2024-11-08 10:30:19,098 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 10:30:19,098 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [210192413] [2024-11-08 10:30:19,098 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [210192413] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 10:30:19,098 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 10:30:19,098 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-08 10:30:19,098 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1409968269] [2024-11-08 10:30:19,099 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 10:30:19,099 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-08 10:30:19,099 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 10:30:19,100 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-08 10:30:19,100 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-11-08 10:30:19,100 INFO L87 Difference]: Start difference. First operand 24427 states and 26741 transitions. Second operand has 4 states, 4 states have (on average 67.5) internal successors, (270), 3 states have internal predecessors, (270), 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 10:30:20,105 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 10:30:20,106 INFO L93 Difference]: Finished difference Result 54964 states and 60433 transitions. [2024-11-08 10:30:20,106 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-08 10:30:20,106 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 67.5) internal successors, (270), 3 states have internal predecessors, (270), 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 330 [2024-11-08 10:30:20,107 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 10:30:20,143 INFO L225 Difference]: With dead ends: 54964 [2024-11-08 10:30:20,143 INFO L226 Difference]: Without dead ends: 30539 [2024-11-08 10:30:20,163 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 10:30:20,164 INFO L432 NwaCegarLoop]: 60 mSDtfsCounter, 350 mSDsluCounter, 22 mSDsCounter, 0 mSdLazyCounter, 1056 mSolverCounterSat, 302 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 350 SdHoareTripleChecker+Valid, 82 SdHoareTripleChecker+Invalid, 1358 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 302 IncrementalHoareTripleChecker+Valid, 1056 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2024-11-08 10:30:20,164 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [350 Valid, 82 Invalid, 1358 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [302 Valid, 1056 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2024-11-08 10:30:20,185 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30539 states. [2024-11-08 10:30:20,404 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30539 to 28298. [2024-11-08 10:30:20,425 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 28298 states, 28297 states have (on average 1.099763225783652) internal successors, (31120), 28297 states have internal predecessors, (31120), 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 10:30:20,453 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28298 states to 28298 states and 31120 transitions. [2024-11-08 10:30:20,454 INFO L78 Accepts]: Start accepts. Automaton has 28298 states and 31120 transitions. Word has length 330 [2024-11-08 10:30:20,454 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 10:30:20,455 INFO L471 AbstractCegarLoop]: Abstraction has 28298 states and 31120 transitions. [2024-11-08 10:30:20,455 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 67.5) internal successors, (270), 3 states have internal predecessors, (270), 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 10:30:20,455 INFO L276 IsEmpty]: Start isEmpty. Operand 28298 states and 31120 transitions. [2024-11-08 10:30:20,477 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 343 [2024-11-08 10:30:20,477 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 10:30:20,478 INFO L215 NwaCegarLoop]: trace histogram [6, 6, 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, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 10:30:20,478 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2024-11-08 10:30:20,478 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 10:30:20,478 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 10:30:20,478 INFO L85 PathProgramCache]: Analyzing trace with hash -427811092, now seen corresponding path program 1 times [2024-11-08 10:30:20,479 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 10:30:20,479 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1783207313] [2024-11-08 10:30:20,479 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 10:30:20,479 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 10:30:20,541 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 10:30:20,810 INFO L134 CoverageAnalysis]: Checked inductivity of 320 backedges. 109 proven. 6 refuted. 0 times theorem prover too weak. 205 trivial. 0 not checked. [2024-11-08 10:30:20,810 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 10:30:20,811 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1783207313] [2024-11-08 10:30:20,811 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1783207313] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-08 10:30:20,811 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [669980833] [2024-11-08 10:30:20,811 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 10:30:20,811 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-08 10:30:20,811 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-08 10:30:20,813 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-08 10:30:20,875 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2024-11-08 10:30:21,051 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 10:30:21,054 INFO L255 TraceCheckSpWp]: Trace formula consists of 656 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-11-08 10:30:21,060 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-08 10:30:21,137 INFO L134 CoverageAnalysis]: Checked inductivity of 320 backedges. 269 proven. 0 refuted. 0 times theorem prover too weak. 51 trivial. 0 not checked. [2024-11-08 10:30:21,137 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-08 10:30:21,137 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [669980833] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 10:30:21,137 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-08 10:30:21,137 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [3] total 5 [2024-11-08 10:30:21,138 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [413481711] [2024-11-08 10:30:21,138 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 10:30:21,138 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-08 10:30:21,139 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 10:30:21,139 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-08 10:30:21,139 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-08 10:30:21,139 INFO L87 Difference]: Start difference. First operand 28298 states and 31120 transitions. Second operand has 3 states, 3 states have (on average 102.33333333333333) internal successors, (307), 3 states have internal predecessors, (307), 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 10:30:21,843 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 10:30:21,843 INFO L93 Difference]: Finished difference Result 69623 states and 76776 transitions. [2024-11-08 10:30:21,844 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-08 10:30:21,844 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 102.33333333333333) internal successors, (307), 3 states have internal predecessors, (307), 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 342 [2024-11-08 10:30:21,844 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 10:30:21,895 INFO L225 Difference]: With dead ends: 69623 [2024-11-08 10:30:21,895 INFO L226 Difference]: Without dead ends: 41327 [2024-11-08 10:30:21,919 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 344 GetRequests, 341 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-08 10:30:21,920 INFO L432 NwaCegarLoop]: 82 mSDtfsCounter, 194 mSDsluCounter, 19 mSDsCounter, 0 mSdLazyCounter, 588 mSolverCounterSat, 77 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 194 SdHoareTripleChecker+Valid, 101 SdHoareTripleChecker+Invalid, 665 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 77 IncrementalHoareTripleChecker+Valid, 588 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-11-08 10:30:21,920 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [194 Valid, 101 Invalid, 665 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [77 Valid, 588 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2024-11-08 10:30:21,944 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 41327 states. [2024-11-08 10:30:22,284 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 41327 to 40913. [2024-11-08 10:30:22,316 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 40913 states, 40912 states have (on average 1.0940555338287055) internal successors, (44760), 40912 states have internal predecessors, (44760), 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 10:30:22,359 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40913 states to 40913 states and 44760 transitions. [2024-11-08 10:30:22,360 INFO L78 Accepts]: Start accepts. Automaton has 40913 states and 44760 transitions. Word has length 342 [2024-11-08 10:30:22,360 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 10:30:22,360 INFO L471 AbstractCegarLoop]: Abstraction has 40913 states and 44760 transitions. [2024-11-08 10:30:22,361 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 102.33333333333333) internal successors, (307), 3 states have internal predecessors, (307), 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 10:30:22,361 INFO L276 IsEmpty]: Start isEmpty. Operand 40913 states and 44760 transitions. [2024-11-08 10:30:22,388 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 386 [2024-11-08 10:30:22,388 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 10:30:22,388 INFO L215 NwaCegarLoop]: trace histogram [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, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 10:30:22,402 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0 [2024-11-08 10:30:22,588 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable16 [2024-11-08 10:30:22,589 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 10:30:22,589 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 10:30:22,589 INFO L85 PathProgramCache]: Analyzing trace with hash 1469765734, now seen corresponding path program 1 times [2024-11-08 10:30:22,590 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 10:30:22,590 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2106652186] [2024-11-08 10:30:22,590 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 10:30:22,590 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 10:30:22,650 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 10:30:22,986 INFO L134 CoverageAnalysis]: Checked inductivity of 348 backedges. 342 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2024-11-08 10:30:22,987 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 10:30:22,987 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2106652186] [2024-11-08 10:30:22,987 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2106652186] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 10:30:22,987 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 10:30:22,987 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-08 10:30:22,987 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1764734015] [2024-11-08 10:30:22,987 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 10:30:22,988 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-08 10:30:22,988 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 10:30:22,988 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-08 10:30:22,989 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-11-08 10:30:22,989 INFO L87 Difference]: Start difference. First operand 40913 states and 44760 transitions. Second operand has 4 states, 4 states have (on average 95.0) internal successors, (380), 4 states have internal predecessors, (380), 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 10:30:24,034 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 10:30:24,034 INFO L93 Difference]: Finished difference Result 82867 states and 90669 transitions. [2024-11-08 10:30:24,035 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-08 10:30:24,035 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 95.0) internal successors, (380), 4 states have internal predecessors, (380), 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 385 [2024-11-08 10:30:24,035 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 10:30:24,076 INFO L225 Difference]: With dead ends: 82867 [2024-11-08 10:30:24,077 INFO L226 Difference]: Without dead ends: 39723 [2024-11-08 10:30:24,102 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-11-08 10:30:24,103 INFO L432 NwaCegarLoop]: 72 mSDtfsCounter, 380 mSDsluCounter, 19 mSDsCounter, 0 mSdLazyCounter, 1012 mSolverCounterSat, 316 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 380 SdHoareTripleChecker+Valid, 91 SdHoareTripleChecker+Invalid, 1328 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 316 IncrementalHoareTripleChecker+Valid, 1012 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2024-11-08 10:30:24,103 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [380 Valid, 91 Invalid, 1328 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [316 Valid, 1012 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2024-11-08 10:30:24,131 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 39723 states. [2024-11-08 10:30:24,410 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 39723 to 33189. [2024-11-08 10:30:24,432 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 33189 states, 33188 states have (on average 1.064360612269495) internal successors, (35324), 33188 states have internal predecessors, (35324), 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 10:30:24,462 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33189 states to 33189 states and 35324 transitions. [2024-11-08 10:30:24,463 INFO L78 Accepts]: Start accepts. Automaton has 33189 states and 35324 transitions. Word has length 385 [2024-11-08 10:30:24,463 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 10:30:24,463 INFO L471 AbstractCegarLoop]: Abstraction has 33189 states and 35324 transitions. [2024-11-08 10:30:24,463 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 95.0) internal successors, (380), 4 states have internal predecessors, (380), 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 10:30:24,464 INFO L276 IsEmpty]: Start isEmpty. Operand 33189 states and 35324 transitions. [2024-11-08 10:30:24,486 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 437 [2024-11-08 10:30:24,486 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 10:30:24,486 INFO L215 NwaCegarLoop]: trace histogram [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, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 10:30:24,486 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2024-11-08 10:30:24,486 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 10:30:24,487 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 10:30:24,487 INFO L85 PathProgramCache]: Analyzing trace with hash -1372203317, now seen corresponding path program 1 times [2024-11-08 10:30:24,487 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 10:30:24,487 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1369040973] [2024-11-08 10:30:24,487 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 10:30:24,487 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 10:30:24,577 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 10:30:25,336 INFO L134 CoverageAnalysis]: Checked inductivity of 528 backedges. 449 proven. 18 refuted. 0 times theorem prover too weak. 61 trivial. 0 not checked. [2024-11-08 10:30:25,337 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 10:30:25,337 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1369040973] [2024-11-08 10:30:25,337 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1369040973] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-08 10:30:25,337 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1338910214] [2024-11-08 10:30:25,337 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 10:30:25,337 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-08 10:30:25,338 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-08 10:30:25,339 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-08 10:30:25,341 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2024-11-08 10:30:25,640 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 10:30:25,645 INFO L255 TraceCheckSpWp]: Trace formula consists of 756 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-11-08 10:30:25,654 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-08 10:30:25,900 INFO L134 CoverageAnalysis]: Checked inductivity of 528 backedges. 346 proven. 0 refuted. 0 times theorem prover too weak. 182 trivial. 0 not checked. [2024-11-08 10:30:25,900 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-08 10:30:25,900 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1338910214] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 10:30:25,901 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-08 10:30:25,901 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [5] total 6 [2024-11-08 10:30:25,901 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1032640286] [2024-11-08 10:30:25,901 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 10:30:25,905 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-08 10:30:25,905 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 10:30:25,905 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-08 10:30:25,906 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-11-08 10:30:25,906 INFO L87 Difference]: Start difference. First operand 33189 states and 35324 transitions. Second operand has 3 states, 3 states have (on average 99.0) internal successors, (297), 2 states have internal predecessors, (297), 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 10:30:26,322 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 10:30:26,323 INFO L93 Difference]: Finished difference Result 97306 states and 103571 transitions. [2024-11-08 10:30:26,323 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-08 10:30:26,323 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 99.0) internal successors, (297), 2 states have internal predecessors, (297), 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 436 [2024-11-08 10:30:26,324 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 10:30:26,395 INFO L225 Difference]: With dead ends: 97306 [2024-11-08 10:30:26,395 INFO L226 Difference]: Without dead ends: 64119 [2024-11-08 10:30:26,428 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 440 GetRequests, 436 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-11-08 10:30:26,429 INFO L432 NwaCegarLoop]: 251 mSDtfsCounter, 166 mSDsluCounter, 233 mSDsCounter, 0 mSdLazyCounter, 130 mSolverCounterSat, 42 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 166 SdHoareTripleChecker+Valid, 484 SdHoareTripleChecker+Invalid, 172 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 42 IncrementalHoareTripleChecker+Valid, 130 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-08 10:30:26,429 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [166 Valid, 484 Invalid, 172 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [42 Valid, 130 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-08 10:30:26,473 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 64119 states. [2024-11-08 10:30:27,106 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 64119 to 63098. [2024-11-08 10:30:27,147 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 63098 states, 63097 states have (on average 1.0639016118040476) internal successors, (67129), 63097 states have internal predecessors, (67129), 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 10:30:27,212 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 63098 states to 63098 states and 67129 transitions. [2024-11-08 10:30:27,214 INFO L78 Accepts]: Start accepts. Automaton has 63098 states and 67129 transitions. Word has length 436 [2024-11-08 10:30:27,215 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 10:30:27,215 INFO L471 AbstractCegarLoop]: Abstraction has 63098 states and 67129 transitions. [2024-11-08 10:30:27,215 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 99.0) internal successors, (297), 2 states have internal predecessors, (297), 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 10:30:27,215 INFO L276 IsEmpty]: Start isEmpty. Operand 63098 states and 67129 transitions. [2024-11-08 10:30:27,246 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 486 [2024-11-08 10:30:27,246 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 10:30:27,247 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, 4, 4, 4, 4, 4, 4, 4, 4, 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, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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 10:30:27,261 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Forceful destruction successful, exit code 0 [2024-11-08 10:30:27,447 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-08 10:30:27,448 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 10:30:27,448 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 10:30:27,448 INFO L85 PathProgramCache]: Analyzing trace with hash 104892774, now seen corresponding path program 1 times [2024-11-08 10:30:27,449 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 10:30:27,449 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1832727980] [2024-11-08 10:30:27,449 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 10:30:27,449 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 10:30:27,569 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 10:30:28,185 INFO L134 CoverageAnalysis]: Checked inductivity of 622 backedges. 531 proven. 0 refuted. 0 times theorem prover too weak. 91 trivial. 0 not checked. [2024-11-08 10:30:28,186 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 10:30:28,186 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1832727980] [2024-11-08 10:30:28,187 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1832727980] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 10:30:28,187 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 10:30:28,187 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-08 10:30:28,187 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [973856912] [2024-11-08 10:30:28,187 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 10:30:28,188 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-08 10:30:28,188 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 10:30:28,189 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-08 10:30:28,189 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-11-08 10:30:28,189 INFO L87 Difference]: Start difference. First operand 63098 states and 67129 transitions. Second operand has 4 states, 4 states have (on average 99.0) internal successors, (396), 3 states have internal predecessors, (396), 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 10:30:29,207 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 10:30:29,207 INFO L93 Difference]: Finished difference Result 168916 states and 179814 transitions. [2024-11-08 10:30:29,207 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-08 10:30:29,208 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 99.0) internal successors, (396), 3 states have internal predecessors, (396), 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 485 [2024-11-08 10:30:29,208 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 10:30:29,209 INFO L225 Difference]: With dead ends: 168916 [2024-11-08 10:30:29,209 INFO L226 Difference]: Without dead ends: 0 [2024-11-08 10:30:29,267 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 10:30:29,267 INFO L432 NwaCegarLoop]: 215 mSDtfsCounter, 287 mSDsluCounter, 223 mSDsCounter, 0 mSdLazyCounter, 696 mSolverCounterSat, 87 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 287 SdHoareTripleChecker+Valid, 438 SdHoareTripleChecker+Invalid, 783 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 87 IncrementalHoareTripleChecker+Valid, 696 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2024-11-08 10:30:29,268 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [287 Valid, 438 Invalid, 783 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [87 Valid, 696 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2024-11-08 10:30:29,268 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2024-11-08 10:30:29,268 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2024-11-08 10:30:29,268 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 10:30:29,268 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2024-11-08 10:30:29,269 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 485 [2024-11-08 10:30:29,270 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 10:30:29,270 INFO L471 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2024-11-08 10:30:29,270 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 99.0) internal successors, (396), 3 states have internal predecessors, (396), 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 10:30:29,270 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2024-11-08 10:30:29,270 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2024-11-08 10:30:29,273 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2024-11-08 10:30:29,274 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2024-11-08 10:30:29,277 INFO L407 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 10:30:29,278 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2024-11-08 10:30:39,986 WARN L286 SmtUtils]: Spent 10.70s on a formula simplification. DAG size of input: 608 DAG size of output: 552 (called from [L 212] de.uni_freiburg.informatik.ultimate.lib.proofs.floydhoare.HoareAnnotationComposer.or) [2024-11-08 10:30:46,190 WARN L286 SmtUtils]: Spent 6.20s on a formula simplification. DAG size of input: 552 DAG size of output: 83 (called from [L 162] de.uni_freiburg.informatik.ultimate.lib.proofs.floydhoare.HoareAnnotationComposer.combineInter) [2024-11-08 10:30:46,196 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2024-11-08 10:30:46,247 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 08.11 10:30:46 BoogieIcfgContainer [2024-11-08 10:30:46,247 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-11-08 10:30:46,247 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-11-08 10:30:46,247 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-11-08 10:30:46,248 INFO L274 PluginConnector]: Witness Printer initialized [2024-11-08 10:30:46,248 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.11 10:29:53" (3/4) ... [2024-11-08 10:30:46,254 INFO L142 WitnessPrinter]: Generating witness for correct program [2024-11-08 10:30:46,284 INFO L925 BoogieBacktranslator]: Reduced CFG by removing 11 nodes and edges [2024-11-08 10:30:46,286 INFO L925 BoogieBacktranslator]: Reduced CFG by removing 4 nodes and edges [2024-11-08 10:30:46,288 INFO L925 BoogieBacktranslator]: Reduced CFG by removing 3 nodes and edges [2024-11-08 10:30:46,290 INFO L925 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2024-11-08 10:30:46,498 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2024-11-08 10:30:46,499 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.yml [2024-11-08 10:30:46,499 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-11-08 10:30:46,499 INFO L158 Benchmark]: Toolchain (without parser) took 56081.75ms. Allocated memory was 151.0MB in the beginning and 4.1GB in the end (delta: 4.0GB). Free memory was 73.7MB in the beginning and 2.6GB in the end (delta: -2.5GB). Peak memory consumption was 1.5GB. Max. memory is 16.1GB. [2024-11-08 10:30:46,500 INFO L158 Benchmark]: CDTParser took 0.25ms. Allocated memory is still 151.0MB. Free memory is still 102.3MB. There was no memory consumed. Max. memory is 16.1GB. [2024-11-08 10:30:46,500 INFO L158 Benchmark]: CACSL2BoogieTranslator took 849.20ms. Allocated memory was 151.0MB in the beginning and 205.5MB in the end (delta: 54.5MB). Free memory was 73.6MB in the beginning and 125.3MB in the end (delta: -51.8MB). Peak memory consumption was 30.0MB. Max. memory is 16.1GB. [2024-11-08 10:30:46,503 INFO L158 Benchmark]: Boogie Procedure Inliner took 143.23ms. Allocated memory is still 205.5MB. Free memory was 125.3MB in the beginning and 110.7MB in the end (delta: 14.7MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB. [2024-11-08 10:30:46,503 INFO L158 Benchmark]: Boogie Preprocessor took 189.36ms. Allocated memory is still 205.5MB. Free memory was 110.7MB in the beginning and 98.1MB in the end (delta: 12.6MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. [2024-11-08 10:30:46,504 INFO L158 Benchmark]: RCFGBuilder took 2037.28ms. Allocated memory is still 205.5MB. Free memory was 98.1MB in the beginning and 132.7MB in the end (delta: -34.6MB). Peak memory consumption was 74.4MB. Max. memory is 16.1GB. [2024-11-08 10:30:46,504 INFO L158 Benchmark]: TraceAbstraction took 52599.72ms. Allocated memory was 205.5MB in the beginning and 4.1GB in the end (delta: 3.9GB). Free memory was 131.6MB in the beginning and 2.6GB in the end (delta: -2.5GB). Peak memory consumption was 2.8GB. Max. memory is 16.1GB. [2024-11-08 10:30:46,504 INFO L158 Benchmark]: Witness Printer took 251.39ms. Allocated memory is still 4.1GB. Free memory was 2.6GB in the beginning and 2.6GB in the end (delta: 26.2MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB. [2024-11-08 10:30:46,505 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.25ms. Allocated memory is still 151.0MB. Free memory is still 102.3MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 849.20ms. Allocated memory was 151.0MB in the beginning and 205.5MB in the end (delta: 54.5MB). Free memory was 73.6MB in the beginning and 125.3MB in the end (delta: -51.8MB). Peak memory consumption was 30.0MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 143.23ms. Allocated memory is still 205.5MB. Free memory was 125.3MB in the beginning and 110.7MB in the end (delta: 14.7MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB. * Boogie Preprocessor took 189.36ms. Allocated memory is still 205.5MB. Free memory was 110.7MB in the beginning and 98.1MB in the end (delta: 12.6MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. * RCFGBuilder took 2037.28ms. Allocated memory is still 205.5MB. Free memory was 98.1MB in the beginning and 132.7MB in the end (delta: -34.6MB). Peak memory consumption was 74.4MB. Max. memory is 16.1GB. * TraceAbstraction took 52599.72ms. Allocated memory was 205.5MB in the beginning and 4.1GB in the end (delta: 3.9GB). Free memory was 131.6MB in the beginning and 2.6GB in the end (delta: -2.5GB). Peak memory consumption was 2.8GB. Max. memory is 16.1GB. * Witness Printer took 251.39ms. Allocated memory is still 4.1GB. Free memory was 2.6GB in the beginning and 2.6GB in the end (delta: 26.2MB). Peak memory consumption was 25.2MB. 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: 1546]: 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, 302 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 35.6s, OverallIterations: 20, TraceHistogramMax: 6, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.4s, AutomataDifference: 16.8s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 4295 SdHoareTripleChecker+Valid, 13.2s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 4295 mSDsluCounter, 4376 SdHoareTripleChecker+Invalid, 10.9s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 848 mSDsCounter, 2477 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 12447 IncrementalHoareTripleChecker+Invalid, 14924 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 2477 mSolverCounterUnsat, 3528 mSDtfsCounter, 12447 mSolverCounterSat, 0.1s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 2151 GetRequests, 2112 SyntacticMatches, 0 SemanticMatches, 39 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=63098occurred in iteration=19, InterpolantAutomatonStates: 64, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 5.0s AutomataMinimizationTime, 20 MinimizatonAttempts, 17821 StatesRemovedByMinimization, 18 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.6s SsaConstructionTime, 1.2s SatisfiabilityAnalysisTime, 8.6s InterpolantComputationTime, 7727 NumberOfCodeBlocks, 7727 NumberOfCodeBlocksAsserted, 27 NumberOfCheckSat, 7700 ConstructedInterpolants, 0 QuantifiedInterpolants, 15299 SizeOfPredicates, 0 NumberOfNonLiveVariables, 3920 ConjunctsInSsa, 17 ConjunctsInUnsatCore, 27 InterpolantComputations, 20 PerfectInterpolantSequences, 5195/5249 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: 1668]: Loop Invariant Derived loop invariant: (((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((a15 == 1) && (a26 == 1)) && (a5 == 1)) && (a12 == 1)) && (a11 == 1)) && (a3 == 1)) && (a6 == 1)) && (a27 == 1)) || ((((((a26 == 1) && (a5 == 1)) && (a12 == 1)) && (a11 == 1)) && (a6 == 1)) && (a3 == 0))) || (((((((a26 == 1) && (a5 == 1)) && (a12 == 1)) && (a11 == 1)) && (a27 == 1)) && (a3 == 0)) && (a6 <= 0))) || (((((((a5 == 1) && (1 <= a3)) && (a26 <= 0)) && (a11 == 1)) && (a23 <= 0)) && (a27 == 1)) && (a6 <= 0))) || (((((a26 == 1) && (a5 == 1)) && (a3 == 1)) && (a6 == 1)) && (a11 <= 0))) || ((((((a5 == 1) && (a11 == 1)) && (a6 == 1)) && (a12 <= 0)) && (a27 == 1)) && (a3 == 0))) || (((((((a26 == 1) && (a5 == 1)) && (a16 == 1)) && (a11 == 1)) && (a6 == 1)) && (a27 == 1)) && (a3 == 0))) || (((((((a26 == 1) && (a5 == 1)) && (a12 == 1)) && (a16 == 1)) && (a11 <= 0)) && (a3 == 0)) && (a6 <= 0))) || ((((((((a15 == 1) && (a26 == 1)) && (a5 == 1)) && (1 <= a3)) && (a16 == 1)) && (a11 <= 0)) && (a27 == 1)) && (a6 <= 0))) || ((((((a26 == 1) && (a5 == 1)) && (1 <= a3)) && (a16 == 1)) && (a11 == 1)) && (a6 == 1))) || ((((((a26 == 1) && (a5 == 1)) && (a12 == 1)) && (1 <= a3)) && (a11 == 1)) && (a6 <= 0))) || ((((((a26 == 1) && (a5 == 1)) && (a12 == 1)) && (1 <= a3)) && (a11 <= 0)) && (a6 <= 0))) || ((((((a5 == 1) && (1 <= a3)) && (a23 <= 0)) && (a6 == 1)) && (a11 <= 0)) && (a27 == 1))) || (((((a5 == 1) && (a26 <= 0)) && (a3 == 1)) && (a11 <= 0)) && (a6 <= 0))) || (((((((a26 == 1) && (a5 == 1)) && (a11 == 1)) && (a23 <= 0)) && (a6 == 1)) && (a27 == 1)) && (a3 == 0))) || (((((((a5 == 1) && (1 <= a3)) && (a16 == 1)) && (a26 <= 0)) && (a11 <= 0)) && (a27 == 1)) && (a6 <= 0))) || (((((((a26 == 1) && (a5 == 1)) && (1 <= a3)) && (a11 == 1)) && (a12 <= 0)) && (a27 == 1)) && (a6 <= 0))) || (((((((a26 == 1) && (a5 == 1)) && (a12 == 1)) && (a16 == 1)) && (a11 == 1)) && (a3 == 0)) && (a6 <= 0))) || ((((((a5 == 1) && (1 <= a3)) && (a11 == 1)) && (a6 == 1)) && (a12 <= 0)) && (a27 == 1))) || ((((((a26 == 1) && (a5 == 1)) && (a11 == 1)) && (a23 <= 0)) && (a3 == 1)) && (a6 <= 0))) || ((((((((a15 == 1) && (a5 == 1)) && (a12 == 1)) && (a11 == 1)) && (a23 <= 0)) && (a6 == 1)) && (a27 == 1)) && (a3 == 0))) || (((((((a5 == 1) && (1 <= a3)) && (a26 <= 0)) && (a23 <= 0)) && (a11 <= 0)) && (a27 == 1)) && (a6 <= 0))) || ((((((a5 == 1) && (1 <= a3)) && (a26 <= 0)) && (a11 == 1)) && (a12 <= 0)) && (a6 <= 0))) || (((((a26 == 1) && (a5 == 1)) && (a6 == 1)) && (a11 <= 0)) && (a3 == 0))) || (((((((a5 == 1) && (a12 == 1)) && (1 <= a3)) && (a16 == 1)) && (a26 <= 0)) && (a6 == 1)) && (a11 <= 0))) || (((((((a26 == 1) && (a5 == 1)) && (a12 == 1)) && (a11 == 1)) && (a23 <= 0)) && (a3 == 0)) && (a6 <= 0))) || ((((((a26 == 1) && (a5 == 1)) && (a12 == 1)) && (1 <= a3)) && (a6 == 1)) && (a11 <= 0))) || (((((((a15 == 1) && (a5 == 1)) && (a11 <= 0)) && (a12 <= 0)) && (a27 == 1)) && (a3 == 0)) && (a6 <= 0))) || (((((((a26 == 1) && (a5 == 1)) && (1 <= a3)) && (a16 == 1)) && (a11 == 1)) && (a27 == 1)) && (a6 <= 0))) || ((((((a26 == 1) && (a5 == 1)) && (1 <= a3)) && (a16 == 1)) && (a6 == 1)) && (a11 <= 0))) || ((((((a26 == 1) && (a5 == 1)) && (1 <= a3)) && (a11 == 1)) && (a6 == 1)) && (a12 <= 0))) || (((((((a26 == 1) && (a5 == 1)) && (1 <= a3)) && (a11 == 1)) && (a23 <= 0)) && (a27 == 1)) && (a6 <= 0))) || ((((((a5 == 1) && (1 <= a3)) && (a26 <= 0)) && (a6 == 1)) && (a11 <= 0)) && (a12 <= 0))) || ((((((a5 == 1) && (1 <= a3)) && (a26 <= 0)) && (a23 <= 0)) && (a6 == 1)) && (a11 <= 0))) || (((((((a5 == 1) && (1 <= a3)) && (a26 <= 0)) && (a11 <= 0)) && (a12 <= 0)) && (a27 == 1)) && (a6 <= 0))) || ((((((a5 == 1) && (a11 == 1)) && (a12 <= 0)) && (a27 == 1)) && (a3 == 0)) && (a6 <= 0))) || ((((((a26 == 1) && (a5 == 1)) && (1 <= a3)) && (a6 == 1)) && (a11 <= 0)) && (a12 <= 0))) || (((((((a5 == 1) && (a12 == 1)) && (1 <= a3)) && (a16 == 1)) && (a11 == 1)) && (a6 == 1)) && (a27 == 1))) || ((((((a5 == 1) && (1 <= a3)) && (a6 == 1)) && (a11 <= 0)) && (a12 <= 0)) && (a27 == 1))) || (((((((a26 == 1) && (a5 == 1)) && (a12 == 1)) && (a11 <= 0)) && (a27 == 1)) && (a3 == 0)) && (a6 <= 0))) || ((((((((a15 == 1) && (a26 == 1)) && (a5 == 1)) && (1 <= a3)) && (a11 <= 0)) && (a12 <= 0)) && (a27 == 1)) && (a6 <= 0))) || (((((((a5 == 1) && (a12 == 1)) && (a16 == 1)) && (a26 <= 0)) && (a11 == 1)) && (a3 == 1)) && (a6 == 1))) || (((((a26 == 1) && (a5 == 1)) && (a3 == 1)) && (a11 <= 0)) && (a6 <= 0))) || ((((((a26 == 1) && (a5 == 1)) && (1 <= a3)) && (a23 <= 0)) && (a6 == 1)) && (a11 <= 0))) || (((((((a5 == 1) && (a12 == 1)) && (1 <= a3)) && (a26 <= 0)) && (a11 <= 0)) && (a27 == 1)) && (a6 <= 0))) || ((((((((a15 == 1) && (a26 == 1)) && (a5 == 1)) && (1 <= a3)) && (a23 <= 0)) && (a11 <= 0)) && (a27 == 1)) && (a6 <= 0))) || (((((((a5 == 1) && (1 <= a3)) && (a16 == 1)) && (a26 <= 0)) && (a11 == 1)) && (a27 == 1)) && (a6 <= 0))) || ((((((a5 == 1) && (a12 == 1)) && (a16 == 1)) && (a6 == 1)) && (a11 <= 0)) && (a3 == 0))) || (((((((a26 == 1) && (a5 == 1)) && (a16 == 1)) && (a11 == 1)) && (a12 <= 0)) && (a3 == 0)) && (a6 <= 0))) || ((((((a5 == 1) && (a6 == 1)) && (a11 <= 0)) && (a12 <= 0)) && (a27 == 1)) && (a3 == 0))) || ((((((a26 == 1) && (a5 == 1)) && (a11 == 1)) && (a6 == 1)) && (a12 <= 0)) && (a3 == 0))) || ((((((a5 == 1) && (1 <= a3)) && (a16 == 1)) && (a6 == 1)) && (a11 <= 0)) && (a27 == 1))) || (((((a5 == 1) && (a26 <= 0)) && (a11 <= 0)) && (a3 == 0)) && (a6 <= 0))) || ((((((a26 == 1) && (a5 == 1)) && (1 <= a3)) && (a11 == 1)) && (a23 <= 0)) && (a6 == 1))) RESULT: Ultimate proved your program to be correct! [2024-11-08 10:30:46,540 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