./Ultimate.py --spec /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/properties/unreach-call.prp --file /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/eca-rers2012/Problem15_label31.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version a046e57d Calling Ultimate with: /root/.sdkman/candidates/java/current/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/eca-rers2012/Problem15_label31.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 c9e1a0326cfbd74069fe8a9392496d7bba5eb0c64820bba9b08ddeb981e8ffba --- Real Ultimate output --- This is Ultimate 0.2.5-tmp.dk.eval-mul-div-a046e57-m [2024-10-12 16:19:03,402 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-12 16:19:03,463 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-10-12 16:19:03,468 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-12 16:19:03,470 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-12 16:19:03,516 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-12 16:19:03,518 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-12 16:19:03,518 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-12 16:19:03,519 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-10-12 16:19:03,519 INFO L153 SettingsManager]: * Use memory slicer=true [2024-10-12 16:19:03,520 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-10-12 16:19:03,520 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-10-12 16:19:03,520 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-12 16:19:03,521 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-12 16:19:03,521 INFO L153 SettingsManager]: * Use SBE=true [2024-10-12 16:19:03,522 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-12 16:19:03,522 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-10-12 16:19:03,522 INFO L153 SettingsManager]: * sizeof long=4 [2024-10-12 16:19:03,522 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-10-12 16:19:03,523 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-10-12 16:19:03,523 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-12 16:19:03,523 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-10-12 16:19:03,523 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-10-12 16:19:03,524 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-10-12 16:19:03,524 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-12 16:19:03,524 INFO L153 SettingsManager]: * sizeof long double=12 [2024-10-12 16:19:03,524 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-10-12 16:19:03,525 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-12 16:19:03,525 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-12 16:19:03,525 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-12 16:19:03,525 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-10-12 16:19:03,525 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-10-12 16:19:03,526 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-12 16:19:03,526 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-12 16:19:03,526 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-10-12 16:19:03,526 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-10-12 16:19:03,527 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-10-12 16:19:03,527 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-10-12 16:19:03,527 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-10-12 16:19:03,527 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-10-12 16:19:03,527 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-10-12 16:19:03,528 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-10-12 16:19:03,528 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 -> c9e1a0326cfbd74069fe8a9392496d7bba5eb0c64820bba9b08ddeb981e8ffba [2024-10-12 16:19:03,745 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-12 16:19:03,763 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-12 16:19:03,767 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-12 16:19:03,768 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-12 16:19:03,769 INFO L274 PluginConnector]: CDTParser initialized [2024-10-12 16:19:03,770 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/eca-rers2012/Problem15_label31.c [2024-10-12 16:19:05,146 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-12 16:19:05,394 INFO L384 CDTParser]: Found 1 translation units. [2024-10-12 16:19:05,395 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/eca-rers2012/Problem15_label31.c [2024-10-12 16:19:05,415 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/31fa3bdbd/5551f674a3ad4648946bfba68d77f013/FLAG1cc9c9e61 [2024-10-12 16:19:05,430 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/31fa3bdbd/5551f674a3ad4648946bfba68d77f013 [2024-10-12 16:19:05,432 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-12 16:19:05,434 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-12 16:19:05,435 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-12 16:19:05,436 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-12 16:19:05,440 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-12 16:19:05,441 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 12.10 04:19:05" (1/1) ... [2024-10-12 16:19:05,442 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@9fa23eb and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 04:19:05, skipping insertion in model container [2024-10-12 16:19:05,442 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 12.10 04:19:05" (1/1) ... [2024-10-12 16:19:05,501 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-12 16:19:05,749 WARN L248 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/Problem15_label31.c[7892,7905] [2024-10-12 16:19:06,045 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-12 16:19:06,053 INFO L200 MainTranslator]: Completed pre-run [2024-10-12 16:19:06,079 WARN L248 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/Problem15_label31.c[7892,7905] [2024-10-12 16:19:06,205 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-12 16:19:06,221 INFO L204 MainTranslator]: Completed translation [2024-10-12 16:19:06,222 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 04:19:06 WrapperNode [2024-10-12 16:19:06,222 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-12 16:19:06,223 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-10-12 16:19:06,223 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-10-12 16:19:06,223 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-10-12 16:19:06,228 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 04:19:06" (1/1) ... [2024-10-12 16:19:06,264 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 04:19:06" (1/1) ... [2024-10-12 16:19:06,403 INFO L138 Inliner]: procedures = 15, calls = 9, calls flagged for inlining = 4, calls inlined = 4, statements flattened = 1760 [2024-10-12 16:19:06,403 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-10-12 16:19:06,404 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-10-12 16:19:06,404 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-10-12 16:19:06,404 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-10-12 16:19:06,412 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 04:19:06" (1/1) ... [2024-10-12 16:19:06,413 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 04:19:06" (1/1) ... [2024-10-12 16:19:06,434 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 04:19:06" (1/1) ... [2024-10-12 16:19:06,504 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-10-12 16:19:06,505 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 04:19:06" (1/1) ... [2024-10-12 16:19:06,505 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 04:19:06" (1/1) ... [2024-10-12 16:19:06,602 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 04:19:06" (1/1) ... [2024-10-12 16:19:06,619 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 04:19:06" (1/1) ... [2024-10-12 16:19:06,637 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 04:19:06" (1/1) ... [2024-10-12 16:19:06,647 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 04:19:06" (1/1) ... [2024-10-12 16:19:06,667 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-10-12 16:19:06,669 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-10-12 16:19:06,669 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-10-12 16:19:06,669 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-10-12 16:19:06,670 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 04:19:06" (1/1) ... [2024-10-12 16:19:06,674 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-12 16:19:06,682 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-12 16:19:06,702 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-10-12 16:19:06,711 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-10-12 16:19:06,747 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-10-12 16:19:06,747 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-10-12 16:19:06,747 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-10-12 16:19:06,747 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-10-12 16:19:06,803 INFO L238 CfgBuilder]: Building ICFG [2024-10-12 16:19:06,806 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-10-12 16:19:08,511 INFO L? ?]: Removed 246 outVars from TransFormulas that were not future-live. [2024-10-12 16:19:08,511 INFO L287 CfgBuilder]: Performing block encoding [2024-10-12 16:19:08,547 INFO L309 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-10-12 16:19:08,547 INFO L314 CfgBuilder]: Removed 1 assume(true) statements. [2024-10-12 16:19:08,547 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.10 04:19:08 BoogieIcfgContainer [2024-10-12 16:19:08,547 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-10-12 16:19:08,549 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-10-12 16:19:08,549 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-10-12 16:19:08,551 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-10-12 16:19:08,552 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 12.10 04:19:05" (1/3) ... [2024-10-12 16:19:08,552 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7b060901 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 12.10 04:19:08, skipping insertion in model container [2024-10-12 16:19:08,552 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 04:19:06" (2/3) ... [2024-10-12 16:19:08,552 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7b060901 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 12.10 04:19:08, skipping insertion in model container [2024-10-12 16:19:08,552 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.10 04:19:08" (3/3) ... [2024-10-12 16:19:08,553 INFO L112 eAbstractionObserver]: Analyzing ICFG Problem15_label31.c [2024-10-12 16:19:08,567 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-10-12 16:19:08,568 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-10-12 16:19:08,626 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-10-12 16:19:08,632 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;@478ca522, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-12 16:19:08,632 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-10-12 16:19:08,640 INFO L276 IsEmpty]: Start isEmpty. Operand has 362 states, 360 states have (on average 1.9111111111111112) internal successors, (688), 361 states have internal predecessors, (688), 0 states have call successors, (0), 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-10-12 16:19:08,655 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2024-10-12 16:19:08,655 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 16:19:08,656 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] [2024-10-12 16:19:08,657 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 16:19:08,665 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 16:19:08,666 INFO L85 PathProgramCache]: Analyzing trace with hash -702274917, now seen corresponding path program 1 times [2024-10-12 16:19:08,674 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 16:19:08,674 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [265653922] [2024-10-12 16:19:08,675 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 16:19:08,675 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 16:19:08,755 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 16:19:08,819 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-12 16:19:08,820 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 16:19:08,820 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [265653922] [2024-10-12 16:19:08,821 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [265653922] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 16:19:08,821 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 16:19:08,821 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-12 16:19:08,822 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2095713956] [2024-10-12 16:19:08,823 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 16:19:08,827 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-10-12 16:19:08,827 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 16:19:08,852 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-10-12 16:19:08,852 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-10-12 16:19:08,855 INFO L87 Difference]: Start difference. First operand has 362 states, 360 states have (on average 1.9111111111111112) internal successors, (688), 361 states have internal predecessors, (688), 0 states have call successors, (0), 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 2 states, 2 states have (on average 32.0) internal successors, (64), 2 states have internal predecessors, (64), 0 states have call successors, (0), 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-10-12 16:19:08,898 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 16:19:08,899 INFO L93 Difference]: Finished difference Result 723 states and 1375 transitions. [2024-10-12 16:19:08,905 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-12 16:19:08,906 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 32.0) internal successors, (64), 2 states have internal predecessors, (64), 0 states have call successors, (0), 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 64 [2024-10-12 16:19:08,907 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 16:19:08,917 INFO L225 Difference]: With dead ends: 723 [2024-10-12 16:19:08,917 INFO L226 Difference]: Without dead ends: 360 [2024-10-12 16:19:08,920 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-10-12 16:19:08,923 INFO L432 NwaCegarLoop]: 623 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 2 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 623 SdHoareTripleChecker+Invalid, 2 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 2 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-12 16:19:08,924 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 623 Invalid, 2 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 2 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-12 16:19:08,939 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 360 states. [2024-10-12 16:19:08,966 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 360 to 360. [2024-10-12 16:19:08,968 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 360 states, 359 states have (on average 1.7353760445682451) internal successors, (623), 359 states have internal predecessors, (623), 0 states have call successors, (0), 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-10-12 16:19:08,971 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 360 states to 360 states and 623 transitions. [2024-10-12 16:19:08,972 INFO L78 Accepts]: Start accepts. Automaton has 360 states and 623 transitions. Word has length 64 [2024-10-12 16:19:08,972 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 16:19:08,972 INFO L471 AbstractCegarLoop]: Abstraction has 360 states and 623 transitions. [2024-10-12 16:19:08,973 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 32.0) internal successors, (64), 2 states have internal predecessors, (64), 0 states have call successors, (0), 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-10-12 16:19:08,973 INFO L276 IsEmpty]: Start isEmpty. Operand 360 states and 623 transitions. [2024-10-12 16:19:08,974 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2024-10-12 16:19:08,974 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 16:19:08,974 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] [2024-10-12 16:19:08,974 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-10-12 16:19:08,975 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 16:19:08,975 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 16:19:08,975 INFO L85 PathProgramCache]: Analyzing trace with hash 460926035, now seen corresponding path program 1 times [2024-10-12 16:19:08,976 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 16:19:08,976 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [24223740] [2024-10-12 16:19:08,976 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 16:19:08,976 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 16:19:09,081 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 16:19:09,253 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-12 16:19:09,255 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 16:19:09,255 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [24223740] [2024-10-12 16:19:09,256 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [24223740] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 16:19:09,256 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 16:19:09,256 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-12 16:19:09,256 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [376239878] [2024-10-12 16:19:09,257 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 16:19:09,258 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-12 16:19:09,261 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 16:19:09,262 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-12 16:19:09,262 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-12 16:19:09,263 INFO L87 Difference]: Start difference. First operand 360 states and 623 transitions. Second operand has 3 states, 3 states have (on average 21.333333333333332) internal successors, (64), 2 states have internal predecessors, (64), 0 states have call successors, (0), 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-10-12 16:19:10,946 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 16:19:10,946 INFO L93 Difference]: Finished difference Result 1052 states and 1830 transitions. [2024-10-12 16:19:10,954 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-12 16:19:10,955 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 21.333333333333332) internal successors, (64), 2 states have internal predecessors, (64), 0 states have call successors, (0), 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 64 [2024-10-12 16:19:10,955 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 16:19:10,965 INFO L225 Difference]: With dead ends: 1052 [2024-10-12 16:19:10,965 INFO L226 Difference]: Without dead ends: 693 [2024-10-12 16:19:10,966 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-10-12 16:19:10,967 INFO L432 NwaCegarLoop]: 65 mSDtfsCounter, 305 mSDsluCounter, 26 mSDsCounter, 0 mSdLazyCounter, 1016 mSolverCounterSat, 259 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 305 SdHoareTripleChecker+Valid, 91 SdHoareTripleChecker+Invalid, 1275 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 259 IncrementalHoareTripleChecker+Valid, 1016 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.6s IncrementalHoareTripleChecker+Time [2024-10-12 16:19:10,968 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [305 Valid, 91 Invalid, 1275 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [259 Valid, 1016 Invalid, 0 Unknown, 0 Unchecked, 1.6s Time] [2024-10-12 16:19:10,969 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 693 states. [2024-10-12 16:19:11,004 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 693 to 683. [2024-10-12 16:19:11,005 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 683 states, 682 states have (on average 1.719941348973607) internal successors, (1173), 682 states have internal predecessors, (1173), 0 states have call successors, (0), 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-10-12 16:19:11,008 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 683 states to 683 states and 1173 transitions. [2024-10-12 16:19:11,008 INFO L78 Accepts]: Start accepts. Automaton has 683 states and 1173 transitions. Word has length 64 [2024-10-12 16:19:11,009 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 16:19:11,009 INFO L471 AbstractCegarLoop]: Abstraction has 683 states and 1173 transitions. [2024-10-12 16:19:11,009 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 21.333333333333332) internal successors, (64), 2 states have internal predecessors, (64), 0 states have call successors, (0), 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-10-12 16:19:11,009 INFO L276 IsEmpty]: Start isEmpty. Operand 683 states and 1173 transitions. [2024-10-12 16:19:11,013 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 130 [2024-10-12 16:19:11,013 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 16:19:11,013 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, 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] [2024-10-12 16:19:11,014 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-10-12 16:19:11,014 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 16:19:11,014 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 16:19:11,015 INFO L85 PathProgramCache]: Analyzing trace with hash 1055085189, now seen corresponding path program 1 times [2024-10-12 16:19:11,015 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 16:19:11,015 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1101524099] [2024-10-12 16:19:11,015 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 16:19:11,015 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 16:19:11,072 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 16:19:11,342 INFO L134 CoverageAnalysis]: Checked inductivity of 62 backedges. 62 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-12 16:19:11,343 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 16:19:11,343 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1101524099] [2024-10-12 16:19:11,344 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1101524099] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 16:19:11,344 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 16:19:11,344 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-12 16:19:11,345 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [436118914] [2024-10-12 16:19:11,345 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 16:19:11,345 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-12 16:19:11,347 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 16:19:11,347 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-12 16:19:11,348 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-12 16:19:11,349 INFO L87 Difference]: Start difference. First operand 683 states and 1173 transitions. Second operand has 3 states, 3 states have (on average 43.0) internal successors, (129), 2 states have internal predecessors, (129), 0 states have call successors, (0), 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-10-12 16:19:12,742 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 16:19:12,742 INFO L93 Difference]: Finished difference Result 1680 states and 2895 transitions. [2024-10-12 16:19:12,742 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-12 16:19:12,743 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 43.0) internal successors, (129), 2 states have internal predecessors, (129), 0 states have call successors, (0), 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 129 [2024-10-12 16:19:12,743 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 16:19:12,746 INFO L225 Difference]: With dead ends: 1680 [2024-10-12 16:19:12,746 INFO L226 Difference]: Without dead ends: 998 [2024-10-12 16:19:12,747 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-10-12 16:19:12,748 INFO L432 NwaCegarLoop]: 186 mSDtfsCounter, 254 mSDsluCounter, 38 mSDsCounter, 0 mSdLazyCounter, 1023 mSolverCounterSat, 105 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 254 SdHoareTripleChecker+Valid, 224 SdHoareTripleChecker+Invalid, 1128 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 105 IncrementalHoareTripleChecker+Valid, 1023 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.3s IncrementalHoareTripleChecker+Time [2024-10-12 16:19:12,748 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [254 Valid, 224 Invalid, 1128 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [105 Valid, 1023 Invalid, 0 Unknown, 0 Unchecked, 1.3s Time] [2024-10-12 16:19:12,750 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 998 states. [2024-10-12 16:19:12,766 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 998 to 988. [2024-10-12 16:19:12,767 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 988 states, 987 states have (on average 1.6200607902735562) internal successors, (1599), 987 states have internal predecessors, (1599), 0 states have call successors, (0), 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-10-12 16:19:12,769 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 988 states to 988 states and 1599 transitions. [2024-10-12 16:19:12,769 INFO L78 Accepts]: Start accepts. Automaton has 988 states and 1599 transitions. Word has length 129 [2024-10-12 16:19:12,770 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 16:19:12,770 INFO L471 AbstractCegarLoop]: Abstraction has 988 states and 1599 transitions. [2024-10-12 16:19:12,770 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 43.0) internal successors, (129), 2 states have internal predecessors, (129), 0 states have call successors, (0), 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-10-12 16:19:12,770 INFO L276 IsEmpty]: Start isEmpty. Operand 988 states and 1599 transitions. [2024-10-12 16:19:12,773 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 131 [2024-10-12 16:19:12,773 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 16:19:12,774 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, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-12 16:19:12,774 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-10-12 16:19:12,774 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 16:19:12,774 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 16:19:12,775 INFO L85 PathProgramCache]: Analyzing trace with hash 414820574, now seen corresponding path program 1 times [2024-10-12 16:19:12,775 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 16:19:12,775 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [993690158] [2024-10-12 16:19:12,775 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 16:19:12,775 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 16:19:12,815 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 16:19:12,922 INFO L134 CoverageAnalysis]: Checked inductivity of 62 backedges. 62 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-12 16:19:12,922 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 16:19:12,923 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [993690158] [2024-10-12 16:19:12,923 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [993690158] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 16:19:12,923 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 16:19:12,923 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-12 16:19:12,923 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [673884767] [2024-10-12 16:19:12,923 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 16:19:12,923 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-12 16:19:12,923 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 16:19:12,924 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-12 16:19:12,924 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-12 16:19:12,924 INFO L87 Difference]: Start difference. First operand 988 states and 1599 transitions. Second operand has 3 states, 3 states have (on average 43.333333333333336) internal successors, (130), 2 states have internal predecessors, (130), 0 states have call successors, (0), 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-10-12 16:19:14,124 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 16:19:14,125 INFO L93 Difference]: Finished difference Result 2574 states and 4254 transitions. [2024-10-12 16:19:14,125 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-12 16:19:14,125 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 43.333333333333336) internal successors, (130), 2 states have internal predecessors, (130), 0 states have call successors, (0), 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 130 [2024-10-12 16:19:14,125 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 16:19:14,130 INFO L225 Difference]: With dead ends: 2574 [2024-10-12 16:19:14,130 INFO L226 Difference]: Without dead ends: 1587 [2024-10-12 16:19:14,131 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-10-12 16:19:14,132 INFO L432 NwaCegarLoop]: 268 mSDtfsCounter, 284 mSDsluCounter, 67 mSDsCounter, 0 mSdLazyCounter, 792 mSolverCounterSat, 298 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 284 SdHoareTripleChecker+Valid, 335 SdHoareTripleChecker+Invalid, 1090 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 298 IncrementalHoareTripleChecker+Valid, 792 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.2s IncrementalHoareTripleChecker+Time [2024-10-12 16:19:14,133 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [284 Valid, 335 Invalid, 1090 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [298 Valid, 792 Invalid, 0 Unknown, 0 Unchecked, 1.2s Time] [2024-10-12 16:19:14,134 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1587 states. [2024-10-12 16:19:14,149 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1587 to 1583. [2024-10-12 16:19:14,151 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1583 states, 1582 states have (on average 1.3988621997471555) internal successors, (2213), 1582 states have internal predecessors, (2213), 0 states have call successors, (0), 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-10-12 16:19:14,154 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1583 states to 1583 states and 2213 transitions. [2024-10-12 16:19:14,154 INFO L78 Accepts]: Start accepts. Automaton has 1583 states and 2213 transitions. Word has length 130 [2024-10-12 16:19:14,154 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 16:19:14,155 INFO L471 AbstractCegarLoop]: Abstraction has 1583 states and 2213 transitions. [2024-10-12 16:19:14,155 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 43.333333333333336) internal successors, (130), 2 states have internal predecessors, (130), 0 states have call successors, (0), 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-10-12 16:19:14,155 INFO L276 IsEmpty]: Start isEmpty. Operand 1583 states and 2213 transitions. [2024-10-12 16:19:14,156 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 135 [2024-10-12 16:19:14,156 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 16:19:14,157 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, 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] [2024-10-12 16:19:14,157 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-10-12 16:19:14,157 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 16:19:14,157 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 16:19:14,157 INFO L85 PathProgramCache]: Analyzing trace with hash 752650664, now seen corresponding path program 1 times [2024-10-12 16:19:14,158 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 16:19:14,158 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1453285945] [2024-10-12 16:19:14,158 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 16:19:14,158 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 16:19:14,175 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 16:19:14,249 INFO L134 CoverageAnalysis]: Checked inductivity of 62 backedges. 62 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-12 16:19:14,249 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 16:19:14,249 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1453285945] [2024-10-12 16:19:14,249 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1453285945] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 16:19:14,249 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 16:19:14,249 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-12 16:19:14,249 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [578637889] [2024-10-12 16:19:14,249 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 16:19:14,250 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-12 16:19:14,250 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 16:19:14,250 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-12 16:19:14,250 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-12 16:19:14,250 INFO L87 Difference]: Start difference. First operand 1583 states and 2213 transitions. Second operand has 3 states, 3 states have (on average 44.666666666666664) internal successors, (134), 2 states have internal predecessors, (134), 0 states have call successors, (0), 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-10-12 16:19:15,511 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 16:19:15,512 INFO L93 Difference]: Finished difference Result 4067 states and 5865 transitions. [2024-10-12 16:19:15,512 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-12 16:19:15,512 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 44.666666666666664) internal successors, (134), 2 states have internal predecessors, (134), 0 states have call successors, (0), 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 134 [2024-10-12 16:19:15,512 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 16:19:15,519 INFO L225 Difference]: With dead ends: 4067 [2024-10-12 16:19:15,520 INFO L226 Difference]: Without dead ends: 2784 [2024-10-12 16:19:15,521 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-10-12 16:19:15,522 INFO L432 NwaCegarLoop]: 323 mSDtfsCounter, 243 mSDsluCounter, 39 mSDsCounter, 0 mSdLazyCounter, 862 mSolverCounterSat, 276 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 243 SdHoareTripleChecker+Valid, 362 SdHoareTripleChecker+Invalid, 1138 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 276 IncrementalHoareTripleChecker+Valid, 862 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.2s IncrementalHoareTripleChecker+Time [2024-10-12 16:19:15,522 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [243 Valid, 362 Invalid, 1138 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [276 Valid, 862 Invalid, 0 Unknown, 0 Unchecked, 1.2s Time] [2024-10-12 16:19:15,524 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2784 states. [2024-10-12 16:19:15,547 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2784 to 2183. [2024-10-12 16:19:15,549 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2183 states, 2182 states have (on average 1.3304307974335472) internal successors, (2903), 2182 states have internal predecessors, (2903), 0 states have call successors, (0), 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-10-12 16:19:15,552 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2183 states to 2183 states and 2903 transitions. [2024-10-12 16:19:15,553 INFO L78 Accepts]: Start accepts. Automaton has 2183 states and 2903 transitions. Word has length 134 [2024-10-12 16:19:15,553 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 16:19:15,553 INFO L471 AbstractCegarLoop]: Abstraction has 2183 states and 2903 transitions. [2024-10-12 16:19:15,553 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 44.666666666666664) internal successors, (134), 2 states have internal predecessors, (134), 0 states have call successors, (0), 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-10-12 16:19:15,554 INFO L276 IsEmpty]: Start isEmpty. Operand 2183 states and 2903 transitions. [2024-10-12 16:19:15,556 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 335 [2024-10-12 16:19:15,556 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 16:19:15,556 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, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-10-12 16:19:15,556 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-10-12 16:19:15,557 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 16:19:15,557 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 16:19:15,557 INFO L85 PathProgramCache]: Analyzing trace with hash 1610935280, now seen corresponding path program 1 times [2024-10-12 16:19:15,557 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 16:19:15,558 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1950216619] [2024-10-12 16:19:15,558 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 16:19:15,558 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 16:19:15,609 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 16:19:15,783 INFO L134 CoverageAnalysis]: Checked inductivity of 62 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 62 trivial. 0 not checked. [2024-10-12 16:19:15,783 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 16:19:15,783 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1950216619] [2024-10-12 16:19:15,784 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1950216619] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 16:19:15,784 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 16:19:15,784 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-12 16:19:15,784 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1523201691] [2024-10-12 16:19:15,784 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 16:19:15,785 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-12 16:19:15,785 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 16:19:15,785 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-12 16:19:15,785 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-12 16:19:15,786 INFO L87 Difference]: Start difference. First operand 2183 states and 2903 transitions. Second operand has 3 states, 3 states have (on average 91.0) internal successors, (273), 2 states have internal predecessors, (273), 0 states have call successors, (0), 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-10-12 16:19:16,973 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 16:19:16,973 INFO L93 Difference]: Finished difference Result 5867 states and 7889 transitions. [2024-10-12 16:19:16,973 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-12 16:19:16,974 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 91.0) internal successors, (273), 2 states have internal predecessors, (273), 0 states have call successors, (0), 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 334 [2024-10-12 16:19:16,974 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 16:19:16,983 INFO L225 Difference]: With dead ends: 5867 [2024-10-12 16:19:16,983 INFO L226 Difference]: Without dead ends: 3685 [2024-10-12 16:19:16,985 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-10-12 16:19:16,986 INFO L432 NwaCegarLoop]: 269 mSDtfsCounter, 43 mSDsluCounter, 46 mSDsCounter, 0 mSdLazyCounter, 916 mSolverCounterSat, 195 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 43 SdHoareTripleChecker+Valid, 315 SdHoareTripleChecker+Invalid, 1111 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 195 IncrementalHoareTripleChecker+Valid, 916 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.2s IncrementalHoareTripleChecker+Time [2024-10-12 16:19:16,986 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [43 Valid, 315 Invalid, 1111 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [195 Valid, 916 Invalid, 0 Unknown, 0 Unchecked, 1.2s Time] [2024-10-12 16:19:16,989 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3685 states. [2024-10-12 16:19:17,019 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3685 to 3683. [2024-10-12 16:19:17,022 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3683 states, 3682 states have (on average 1.2582835415535036) internal successors, (4633), 3682 states have internal predecessors, (4633), 0 states have call successors, (0), 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-10-12 16:19:17,027 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3683 states to 3683 states and 4633 transitions. [2024-10-12 16:19:17,027 INFO L78 Accepts]: Start accepts. Automaton has 3683 states and 4633 transitions. Word has length 334 [2024-10-12 16:19:17,028 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 16:19:17,028 INFO L471 AbstractCegarLoop]: Abstraction has 3683 states and 4633 transitions. [2024-10-12 16:19:17,028 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 91.0) internal successors, (273), 2 states have internal predecessors, (273), 0 states have call successors, (0), 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-10-12 16:19:17,028 INFO L276 IsEmpty]: Start isEmpty. Operand 3683 states and 4633 transitions. [2024-10-12 16:19:17,032 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 383 [2024-10-12 16:19:17,032 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 16:19:17,032 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, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-10-12 16:19:17,033 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-10-12 16:19:17,033 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 16:19:17,033 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 16:19:17,033 INFO L85 PathProgramCache]: Analyzing trace with hash 898961517, now seen corresponding path program 1 times [2024-10-12 16:19:17,033 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 16:19:17,033 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [303472190] [2024-10-12 16:19:17,033 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 16:19:17,034 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 16:19:17,079 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 16:19:17,611 INFO L134 CoverageAnalysis]: Checked inductivity of 244 backedges. 181 proven. 0 refuted. 0 times theorem prover too weak. 63 trivial. 0 not checked. [2024-10-12 16:19:17,611 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 16:19:17,611 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [303472190] [2024-10-12 16:19:17,612 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [303472190] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 16:19:17,612 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 16:19:17,612 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-12 16:19:17,612 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [268659785] [2024-10-12 16:19:17,612 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 16:19:17,613 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-12 16:19:17,613 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 16:19:17,613 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-12 16:19:17,613 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-12 16:19:17,614 INFO L87 Difference]: Start difference. First operand 3683 states and 4633 transitions. Second operand has 3 states, 3 states have (on average 106.66666666666667) internal successors, (320), 2 states have internal predecessors, (320), 0 states have call successors, (0), 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-10-12 16:19:18,612 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 16:19:18,613 INFO L93 Difference]: Finished difference Result 7664 states and 9576 transitions. [2024-10-12 16:19:18,613 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-12 16:19:18,613 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 106.66666666666667) internal successors, (320), 2 states have internal predecessors, (320), 0 states have call successors, (0), 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 382 [2024-10-12 16:19:18,614 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 16:19:18,624 INFO L225 Difference]: With dead ends: 7664 [2024-10-12 16:19:18,624 INFO L226 Difference]: Without dead ends: 3982 [2024-10-12 16:19:18,629 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-10-12 16:19:18,630 INFO L432 NwaCegarLoop]: 322 mSDtfsCounter, 105 mSDsluCounter, 35 mSDsCounter, 0 mSdLazyCounter, 889 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 105 SdHoareTripleChecker+Valid, 357 SdHoareTripleChecker+Invalid, 894 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 889 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2024-10-12 16:19:18,630 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [105 Valid, 357 Invalid, 894 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 889 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2024-10-12 16:19:18,633 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3982 states. [2024-10-12 16:19:18,669 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3982 to 3982. [2024-10-12 16:19:18,674 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3982 states, 3981 states have (on average 1.2403918613413716) internal successors, (4938), 3981 states have internal predecessors, (4938), 0 states have call successors, (0), 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-10-12 16:19:18,679 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3982 states to 3982 states and 4938 transitions. [2024-10-12 16:19:18,679 INFO L78 Accepts]: Start accepts. Automaton has 3982 states and 4938 transitions. Word has length 382 [2024-10-12 16:19:18,680 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 16:19:18,680 INFO L471 AbstractCegarLoop]: Abstraction has 3982 states and 4938 transitions. [2024-10-12 16:19:18,680 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 106.66666666666667) internal successors, (320), 2 states have internal predecessors, (320), 0 states have call successors, (0), 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-10-12 16:19:18,680 INFO L276 IsEmpty]: Start isEmpty. Operand 3982 states and 4938 transitions. [2024-10-12 16:19:18,684 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 426 [2024-10-12 16:19:18,684 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 16:19:18,685 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, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-10-12 16:19:18,685 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-10-12 16:19:18,686 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 16:19:18,686 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 16:19:18,686 INFO L85 PathProgramCache]: Analyzing trace with hash -1075275407, now seen corresponding path program 1 times [2024-10-12 16:19:18,686 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 16:19:18,687 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1933185743] [2024-10-12 16:19:18,687 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 16:19:18,687 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 16:19:18,741 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 16:19:18,938 INFO L134 CoverageAnalysis]: Checked inductivity of 215 backedges. 125 proven. 0 refuted. 0 times theorem prover too weak. 90 trivial. 0 not checked. [2024-10-12 16:19:18,939 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 16:19:18,939 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1933185743] [2024-10-12 16:19:18,939 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1933185743] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 16:19:18,939 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 16:19:18,940 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-12 16:19:18,940 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2075150202] [2024-10-12 16:19:18,940 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 16:19:18,940 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-12 16:19:18,940 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 16:19:18,941 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-12 16:19:18,941 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-12 16:19:18,941 INFO L87 Difference]: Start difference. First operand 3982 states and 4938 transitions. Second operand has 3 states, 3 states have (on average 112.0) internal successors, (336), 3 states have internal predecessors, (336), 0 states have call successors, (0), 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-10-12 16:19:20,648 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 16:19:20,648 INFO L93 Difference]: Finished difference Result 8860 states and 11332 transitions. [2024-10-12 16:19:20,649 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-12 16:19:20,649 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 112.0) internal successors, (336), 3 states have internal predecessors, (336), 0 states have call successors, (0), 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 425 [2024-10-12 16:19:20,650 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 16:19:20,663 INFO L225 Difference]: With dead ends: 8860 [2024-10-12 16:19:20,664 INFO L226 Difference]: Without dead ends: 5178 [2024-10-12 16:19:20,668 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-10-12 16:19:20,669 INFO L432 NwaCegarLoop]: 275 mSDtfsCounter, 248 mSDsluCounter, 45 mSDsCounter, 0 mSdLazyCounter, 909 mSolverCounterSat, 206 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 248 SdHoareTripleChecker+Valid, 320 SdHoareTripleChecker+Invalid, 1115 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 206 IncrementalHoareTripleChecker+Valid, 909 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.7s IncrementalHoareTripleChecker+Time [2024-10-12 16:19:20,670 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [248 Valid, 320 Invalid, 1115 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [206 Valid, 909 Invalid, 0 Unknown, 0 Unchecked, 1.7s Time] [2024-10-12 16:19:20,674 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5178 states. [2024-10-12 16:19:20,709 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5178 to 3380. [2024-10-12 16:19:20,712 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3380 states, 3379 states have (on average 1.2630955904113643) internal successors, (4268), 3379 states have internal predecessors, (4268), 0 states have call successors, (0), 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-10-12 16:19:20,717 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3380 states to 3380 states and 4268 transitions. [2024-10-12 16:19:20,718 INFO L78 Accepts]: Start accepts. Automaton has 3380 states and 4268 transitions. Word has length 425 [2024-10-12 16:19:20,718 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 16:19:20,718 INFO L471 AbstractCegarLoop]: Abstraction has 3380 states and 4268 transitions. [2024-10-12 16:19:20,719 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 112.0) internal successors, (336), 3 states have internal predecessors, (336), 0 states have call successors, (0), 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-10-12 16:19:20,719 INFO L276 IsEmpty]: Start isEmpty. Operand 3380 states and 4268 transitions. [2024-10-12 16:19:20,722 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 430 [2024-10-12 16:19:20,722 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 16:19:20,723 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, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-10-12 16:19:20,723 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-10-12 16:19:20,723 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 16:19:20,723 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 16:19:20,723 INFO L85 PathProgramCache]: Analyzing trace with hash -288524280, now seen corresponding path program 1 times [2024-10-12 16:19:20,723 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 16:19:20,723 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1114410171] [2024-10-12 16:19:20,723 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 16:19:20,724 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 16:19:20,775 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 16:19:21,199 INFO L134 CoverageAnalysis]: Checked inductivity of 219 backedges. 219 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-12 16:19:21,200 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 16:19:21,200 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1114410171] [2024-10-12 16:19:21,200 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1114410171] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 16:19:21,200 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 16:19:21,200 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-12 16:19:21,201 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [27309046] [2024-10-12 16:19:21,201 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 16:19:21,201 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-12 16:19:21,201 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 16:19:21,202 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-12 16:19:21,202 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-10-12 16:19:21,203 INFO L87 Difference]: Start difference. First operand 3380 states and 4268 transitions. Second operand has 5 states, 5 states have (on average 85.8) internal successors, (429), 5 states have internal predecessors, (429), 0 states have call successors, (0), 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-10-12 16:19:22,861 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 16:19:22,862 INFO L93 Difference]: Finished difference Result 8285 states and 10734 transitions. [2024-10-12 16:19:22,863 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-12 16:19:22,865 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 85.8) internal successors, (429), 5 states have internal predecessors, (429), 0 states have call successors, (0), 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 429 [2024-10-12 16:19:22,866 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 16:19:22,877 INFO L225 Difference]: With dead ends: 8285 [2024-10-12 16:19:22,877 INFO L226 Difference]: Without dead ends: 5205 [2024-10-12 16:19:22,880 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 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-10-12 16:19:22,881 INFO L432 NwaCegarLoop]: 620 mSDtfsCounter, 348 mSDsluCounter, 98 mSDsCounter, 0 mSdLazyCounter, 1879 mSolverCounterSat, 422 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 348 SdHoareTripleChecker+Valid, 718 SdHoareTripleChecker+Invalid, 2301 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 422 IncrementalHoareTripleChecker+Valid, 1879 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.6s IncrementalHoareTripleChecker+Time [2024-10-12 16:19:22,881 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [348 Valid, 718 Invalid, 2301 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [422 Valid, 1879 Invalid, 0 Unknown, 0 Unchecked, 1.6s Time] [2024-10-12 16:19:22,885 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5205 states. [2024-10-12 16:19:22,923 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5205 to 4879. [2024-10-12 16:19:22,928 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4879 states, 4878 states have (on average 1.2060270602706027) internal successors, (5883), 4878 states have internal predecessors, (5883), 0 states have call successors, (0), 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-10-12 16:19:22,939 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4879 states to 4879 states and 5883 transitions. [2024-10-12 16:19:22,939 INFO L78 Accepts]: Start accepts. Automaton has 4879 states and 5883 transitions. Word has length 429 [2024-10-12 16:19:22,940 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 16:19:22,940 INFO L471 AbstractCegarLoop]: Abstraction has 4879 states and 5883 transitions. [2024-10-12 16:19:22,940 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 85.8) internal successors, (429), 5 states have internal predecessors, (429), 0 states have call successors, (0), 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-10-12 16:19:22,940 INFO L276 IsEmpty]: Start isEmpty. Operand 4879 states and 5883 transitions. [2024-10-12 16:19:22,944 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 442 [2024-10-12 16:19:22,944 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 16:19:22,945 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, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-10-12 16:19:22,946 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-10-12 16:19:22,946 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 16:19:22,946 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 16:19:22,946 INFO L85 PathProgramCache]: Analyzing trace with hash -2079709210, now seen corresponding path program 1 times [2024-10-12 16:19:22,947 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 16:19:22,947 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1661421936] [2024-10-12 16:19:22,947 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 16:19:22,947 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 16:19:23,008 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 16:19:23,187 INFO L134 CoverageAnalysis]: Checked inductivity of 231 backedges. 125 proven. 0 refuted. 0 times theorem prover too weak. 106 trivial. 0 not checked. [2024-10-12 16:19:23,188 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 16:19:23,188 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1661421936] [2024-10-12 16:19:23,188 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1661421936] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 16:19:23,188 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 16:19:23,188 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-12 16:19:23,188 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [139282496] [2024-10-12 16:19:23,188 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 16:19:23,189 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-12 16:19:23,189 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 16:19:23,189 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-12 16:19:23,191 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-12 16:19:23,191 INFO L87 Difference]: Start difference. First operand 4879 states and 5883 transitions. Second operand has 3 states, 3 states have (on average 112.0) internal successors, (336), 3 states have internal predecessors, (336), 0 states have call successors, (0), 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-10-12 16:19:24,700 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 16:19:24,701 INFO L93 Difference]: Finished difference Result 10955 states and 13580 transitions. [2024-10-12 16:19:24,701 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-12 16:19:24,701 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 112.0) internal successors, (336), 3 states have internal predecessors, (336), 0 states have call successors, (0), 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 441 [2024-10-12 16:19:24,702 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 16:19:24,715 INFO L225 Difference]: With dead ends: 10955 [2024-10-12 16:19:24,715 INFO L226 Difference]: Without dead ends: 6376 [2024-10-12 16:19:24,718 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-10-12 16:19:24,719 INFO L432 NwaCegarLoop]: 577 mSDtfsCounter, 263 mSDsluCounter, 38 mSDsCounter, 0 mSdLazyCounter, 881 mSolverCounterSat, 242 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 263 SdHoareTripleChecker+Valid, 615 SdHoareTripleChecker+Invalid, 1123 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 242 IncrementalHoareTripleChecker+Valid, 881 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.5s IncrementalHoareTripleChecker+Time [2024-10-12 16:19:24,719 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [263 Valid, 615 Invalid, 1123 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [242 Valid, 881 Invalid, 0 Unknown, 0 Unchecked, 1.5s Time] [2024-10-12 16:19:24,723 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6376 states. [2024-10-12 16:19:24,767 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6376 to 6373. [2024-10-12 16:19:24,773 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6373 states, 6372 states have (on average 1.1828311362209667) internal successors, (7537), 6372 states have internal predecessors, (7537), 0 states have call successors, (0), 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-10-12 16:19:24,779 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6373 states to 6373 states and 7537 transitions. [2024-10-12 16:19:24,779 INFO L78 Accepts]: Start accepts. Automaton has 6373 states and 7537 transitions. Word has length 441 [2024-10-12 16:19:24,780 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 16:19:24,780 INFO L471 AbstractCegarLoop]: Abstraction has 6373 states and 7537 transitions. [2024-10-12 16:19:24,780 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 112.0) internal successors, (336), 3 states have internal predecessors, (336), 0 states have call successors, (0), 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-10-12 16:19:24,780 INFO L276 IsEmpty]: Start isEmpty. Operand 6373 states and 7537 transitions. [2024-10-12 16:19:24,786 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 539 [2024-10-12 16:19:24,786 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 16:19:24,786 INFO L215 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-10-12 16:19:24,786 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2024-10-12 16:19:24,786 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 16:19:24,787 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 16:19:24,787 INFO L85 PathProgramCache]: Analyzing trace with hash 1730783095, now seen corresponding path program 1 times [2024-10-12 16:19:24,787 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 16:19:24,787 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1422211529] [2024-10-12 16:19:24,787 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 16:19:24,787 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 16:19:24,854 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 16:19:24,991 INFO L134 CoverageAnalysis]: Checked inductivity of 487 backedges. 188 proven. 0 refuted. 0 times theorem prover too weak. 299 trivial. 0 not checked. [2024-10-12 16:19:24,992 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 16:19:24,992 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1422211529] [2024-10-12 16:19:24,992 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1422211529] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 16:19:24,992 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 16:19:24,992 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-12 16:19:24,993 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [45817283] [2024-10-12 16:19:24,993 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 16:19:24,993 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-12 16:19:24,993 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 16:19:24,994 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-12 16:19:24,994 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-12 16:19:24,994 INFO L87 Difference]: Start difference. First operand 6373 states and 7537 transitions. Second operand has 3 states, 3 states have (on average 112.33333333333333) internal successors, (337), 3 states have internal predecessors, (337), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 16:19:26,259 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 16:19:26,259 INFO L93 Difference]: Finished difference Result 16632 states and 19880 transitions. [2024-10-12 16:19:26,260 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-12 16:19:26,260 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 112.33333333333333) internal successors, (337), 3 states have internal predecessors, (337), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 538 [2024-10-12 16:19:26,261 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 16:19:26,274 INFO L225 Difference]: With dead ends: 16632 [2024-10-12 16:19:26,274 INFO L226 Difference]: Without dead ends: 10559 [2024-10-12 16:19:26,279 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-10-12 16:19:26,280 INFO L432 NwaCegarLoop]: 225 mSDtfsCounter, 274 mSDsluCounter, 36 mSDsCounter, 0 mSdLazyCounter, 955 mSolverCounterSat, 198 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 274 SdHoareTripleChecker+Valid, 261 SdHoareTripleChecker+Invalid, 1153 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 198 IncrementalHoareTripleChecker+Valid, 955 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.2s IncrementalHoareTripleChecker+Time [2024-10-12 16:19:26,280 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [274 Valid, 261 Invalid, 1153 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [198 Valid, 955 Invalid, 0 Unknown, 0 Unchecked, 1.2s Time] [2024-10-12 16:19:26,286 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10559 states. [2024-10-12 16:19:26,401 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10559 to 8466. [2024-10-12 16:19:26,419 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8466 states, 8465 states have (on average 1.1805079740106321) internal successors, (9993), 8465 states have internal predecessors, (9993), 0 states have call successors, (0), 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-10-12 16:19:26,438 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8466 states to 8466 states and 9993 transitions. [2024-10-12 16:19:26,439 INFO L78 Accepts]: Start accepts. Automaton has 8466 states and 9993 transitions. Word has length 538 [2024-10-12 16:19:26,439 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 16:19:26,439 INFO L471 AbstractCegarLoop]: Abstraction has 8466 states and 9993 transitions. [2024-10-12 16:19:26,440 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 112.33333333333333) internal successors, (337), 3 states have internal predecessors, (337), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 16:19:26,440 INFO L276 IsEmpty]: Start isEmpty. Operand 8466 states and 9993 transitions. [2024-10-12 16:19:26,448 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 556 [2024-10-12 16:19:26,451 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 16:19:26,451 INFO L215 NwaCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-10-12 16:19:26,452 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2024-10-12 16:19:26,452 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 16:19:26,452 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 16:19:26,452 INFO L85 PathProgramCache]: Analyzing trace with hash -188072250, now seen corresponding path program 1 times [2024-10-12 16:19:26,452 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 16:19:26,452 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1123597043] [2024-10-12 16:19:26,452 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 16:19:26,452 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 16:19:26,563 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 16:19:26,807 INFO L134 CoverageAnalysis]: Checked inductivity of 796 backedges. 496 proven. 0 refuted. 0 times theorem prover too weak. 300 trivial. 0 not checked. [2024-10-12 16:19:26,808 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 16:19:26,808 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1123597043] [2024-10-12 16:19:26,808 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1123597043] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 16:19:26,808 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 16:19:26,809 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-12 16:19:26,809 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [687980130] [2024-10-12 16:19:26,809 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 16:19:26,810 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-12 16:19:26,810 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 16:19:26,811 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-12 16:19:26,811 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-12 16:19:26,811 INFO L87 Difference]: Start difference. First operand 8466 states and 9993 transitions. Second operand has 3 states, 3 states have (on average 115.66666666666667) internal successors, (347), 3 states have internal predecessors, (347), 0 states have call successors, (0), 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-10-12 16:19:28,179 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 16:19:28,179 INFO L93 Difference]: Finished difference Result 19935 states and 23666 transitions. [2024-10-12 16:19:28,180 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-12 16:19:28,180 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 115.66666666666667) internal successors, (347), 3 states have internal predecessors, (347), 0 states have call successors, (0), 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 555 [2024-10-12 16:19:28,181 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 16:19:28,197 INFO L225 Difference]: With dead ends: 19935 [2024-10-12 16:19:28,197 INFO L226 Difference]: Without dead ends: 11769 [2024-10-12 16:19:28,205 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-10-12 16:19:28,206 INFO L432 NwaCegarLoop]: 584 mSDtfsCounter, 243 mSDsluCounter, 32 mSDsCounter, 0 mSdLazyCounter, 1039 mSolverCounterSat, 156 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 243 SdHoareTripleChecker+Valid, 616 SdHoareTripleChecker+Invalid, 1195 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 156 IncrementalHoareTripleChecker+Valid, 1039 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.3s IncrementalHoareTripleChecker+Time [2024-10-12 16:19:28,206 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [243 Valid, 616 Invalid, 1195 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [156 Valid, 1039 Invalid, 0 Unknown, 0 Unchecked, 1.3s Time] [2024-10-12 16:19:28,214 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11769 states. [2024-10-12 16:19:28,293 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11769 to 11757. [2024-10-12 16:19:28,305 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 11757 states, 11756 states have (on average 1.1626403538618577) internal successors, (13668), 11756 states have internal predecessors, (13668), 0 states have call successors, (0), 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-10-12 16:19:28,318 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11757 states to 11757 states and 13668 transitions. [2024-10-12 16:19:28,318 INFO L78 Accepts]: Start accepts. Automaton has 11757 states and 13668 transitions. Word has length 555 [2024-10-12 16:19:28,318 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 16:19:28,319 INFO L471 AbstractCegarLoop]: Abstraction has 11757 states and 13668 transitions. [2024-10-12 16:19:28,319 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 115.66666666666667) internal successors, (347), 3 states have internal predecessors, (347), 0 states have call successors, (0), 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-10-12 16:19:28,319 INFO L276 IsEmpty]: Start isEmpty. Operand 11757 states and 13668 transitions. [2024-10-12 16:19:28,324 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 566 [2024-10-12 16:19:28,324 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 16:19:28,326 INFO L215 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-12 16:19:28,326 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2024-10-12 16:19:28,326 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 16:19:28,327 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 16:19:28,327 INFO L85 PathProgramCache]: Analyzing trace with hash -897825059, now seen corresponding path program 1 times [2024-10-12 16:19:28,327 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 16:19:28,327 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1984874763] [2024-10-12 16:19:28,327 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 16:19:28,327 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 16:19:28,398 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 16:19:28,639 INFO L134 CoverageAnalysis]: Checked inductivity of 522 backedges. 188 proven. 0 refuted. 0 times theorem prover too weak. 334 trivial. 0 not checked. [2024-10-12 16:19:28,640 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 16:19:28,640 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1984874763] [2024-10-12 16:19:28,640 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1984874763] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 16:19:28,640 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 16:19:28,640 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-12 16:19:28,640 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [388554574] [2024-10-12 16:19:28,641 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 16:19:28,641 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-12 16:19:28,641 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 16:19:28,642 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-12 16:19:28,642 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-12 16:19:28,642 INFO L87 Difference]: Start difference. First operand 11757 states and 13668 transitions. Second operand has 3 states, 3 states have (on average 113.0) internal successors, (339), 3 states have internal predecessors, (339), 0 states have call successors, (0), 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-10-12 16:19:29,694 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 16:19:29,694 INFO L93 Difference]: Finished difference Result 23511 states and 27369 transitions. [2024-10-12 16:19:29,694 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-12 16:19:29,694 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 113.0) internal successors, (339), 3 states have internal predecessors, (339), 0 states have call successors, (0), 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 565 [2024-10-12 16:19:29,695 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 16:19:29,711 INFO L225 Difference]: With dead ends: 23511 [2024-10-12 16:19:29,711 INFO L226 Difference]: Without dead ends: 12054 [2024-10-12 16:19:29,721 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-10-12 16:19:29,721 INFO L432 NwaCegarLoop]: 63 mSDtfsCounter, 463 mSDsluCounter, 5 mSDsCounter, 0 mSdLazyCounter, 846 mSolverCounterSat, 190 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 463 SdHoareTripleChecker+Valid, 68 SdHoareTripleChecker+Invalid, 1036 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 190 IncrementalHoareTripleChecker+Valid, 846 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2024-10-12 16:19:29,721 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [463 Valid, 68 Invalid, 1036 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [190 Valid, 846 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2024-10-12 16:19:29,729 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12054 states. [2024-10-12 16:19:29,799 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12054 to 11755. [2024-10-12 16:19:29,810 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 11755 states, 11754 states have (on average 1.1624978730644886) internal successors, (13664), 11754 states have internal predecessors, (13664), 0 states have call successors, (0), 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-10-12 16:19:29,821 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11755 states to 11755 states and 13664 transitions. [2024-10-12 16:19:29,821 INFO L78 Accepts]: Start accepts. Automaton has 11755 states and 13664 transitions. Word has length 565 [2024-10-12 16:19:29,822 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 16:19:29,822 INFO L471 AbstractCegarLoop]: Abstraction has 11755 states and 13664 transitions. [2024-10-12 16:19:29,822 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 113.0) internal successors, (339), 3 states have internal predecessors, (339), 0 states have call successors, (0), 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-10-12 16:19:29,822 INFO L276 IsEmpty]: Start isEmpty. Operand 11755 states and 13664 transitions. [2024-10-12 16:19:29,827 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 586 [2024-10-12 16:19:29,828 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 16:19:29,828 INFO L215 NwaCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-10-12 16:19:29,828 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2024-10-12 16:19:29,828 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 16:19:29,829 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 16:19:29,829 INFO L85 PathProgramCache]: Analyzing trace with hash 210631792, now seen corresponding path program 1 times [2024-10-12 16:19:29,829 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 16:19:29,829 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1038967244] [2024-10-12 16:19:29,829 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 16:19:29,829 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 16:19:29,895 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 16:19:30,107 INFO L134 CoverageAnalysis]: Checked inductivity of 708 backedges. 473 proven. 0 refuted. 0 times theorem prover too weak. 235 trivial. 0 not checked. [2024-10-12 16:19:30,108 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 16:19:30,108 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1038967244] [2024-10-12 16:19:30,108 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1038967244] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 16:19:30,108 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 16:19:30,108 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-12 16:19:30,108 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1220673268] [2024-10-12 16:19:30,108 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 16:19:30,109 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-12 16:19:30,109 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 16:19:30,113 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-12 16:19:30,114 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-12 16:19:30,114 INFO L87 Difference]: Start difference. First operand 11755 states and 13664 transitions. Second operand has 3 states, 3 states have (on average 138.66666666666666) internal successors, (416), 3 states have internal predecessors, (416), 0 states have call successors, (0), 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-10-12 16:19:31,471 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 16:19:31,473 INFO L93 Difference]: Finished difference Result 24705 states and 28703 transitions. [2024-10-12 16:19:31,474 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-12 16:19:31,474 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 138.66666666666666) internal successors, (416), 3 states have internal predecessors, (416), 0 states have call successors, (0), 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 585 [2024-10-12 16:19:31,475 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 16:19:31,492 INFO L225 Difference]: With dead ends: 24705 [2024-10-12 16:19:31,492 INFO L226 Difference]: Without dead ends: 13250 [2024-10-12 16:19:31,503 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-10-12 16:19:31,504 INFO L432 NwaCegarLoop]: 259 mSDtfsCounter, 269 mSDsluCounter, 61 mSDsCounter, 0 mSdLazyCounter, 738 mSolverCounterSat, 243 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 269 SdHoareTripleChecker+Valid, 320 SdHoareTripleChecker+Invalid, 981 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 243 IncrementalHoareTripleChecker+Valid, 738 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.2s IncrementalHoareTripleChecker+Time [2024-10-12 16:19:31,504 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [269 Valid, 320 Invalid, 981 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [243 Valid, 738 Invalid, 0 Unknown, 0 Unchecked, 1.2s Time] [2024-10-12 16:19:31,511 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13250 states. [2024-10-12 16:19:31,587 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13250 to 9958. [2024-10-12 16:19:31,594 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9958 states, 9957 states have (on average 1.177864818720498) internal successors, (11728), 9957 states have internal predecessors, (11728), 0 states have call successors, (0), 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-10-12 16:19:31,602 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9958 states to 9958 states and 11728 transitions. [2024-10-12 16:19:31,602 INFO L78 Accepts]: Start accepts. Automaton has 9958 states and 11728 transitions. Word has length 585 [2024-10-12 16:19:31,603 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 16:19:31,603 INFO L471 AbstractCegarLoop]: Abstraction has 9958 states and 11728 transitions. [2024-10-12 16:19:31,603 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 138.66666666666666) internal successors, (416), 3 states have internal predecessors, (416), 0 states have call successors, (0), 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-10-12 16:19:31,603 INFO L276 IsEmpty]: Start isEmpty. Operand 9958 states and 11728 transitions. [2024-10-12 16:19:31,608 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 592 [2024-10-12 16:19:31,608 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 16:19:31,609 INFO L215 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2024-10-12 16:19:31,609 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2024-10-12 16:19:31,609 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 16:19:31,609 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 16:19:31,610 INFO L85 PathProgramCache]: Analyzing trace with hash -616139692, now seen corresponding path program 1 times [2024-10-12 16:19:31,610 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 16:19:31,610 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [692545922] [2024-10-12 16:19:31,610 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 16:19:31,610 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 16:19:31,678 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 16:19:32,006 INFO L134 CoverageAnalysis]: Checked inductivity of 550 backedges. 444 proven. 0 refuted. 0 times theorem prover too weak. 106 trivial. 0 not checked. [2024-10-12 16:19:32,007 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 16:19:32,007 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [692545922] [2024-10-12 16:19:32,007 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [692545922] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 16:19:32,007 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 16:19:32,007 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-12 16:19:32,007 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1842604755] [2024-10-12 16:19:32,007 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 16:19:32,008 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-12 16:19:32,008 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 16:19:32,008 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-12 16:19:32,009 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-12 16:19:32,009 INFO L87 Difference]: Start difference. First operand 9958 states and 11728 transitions. Second operand has 3 states, 3 states have (on average 162.0) internal successors, (486), 3 states have internal predecessors, (486), 0 states have call successors, (0), 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-10-12 16:19:33,230 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 16:19:33,230 INFO L93 Difference]: Finished difference Result 25895 states and 30601 transitions. [2024-10-12 16:19:33,230 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-12 16:19:33,231 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 162.0) internal successors, (486), 3 states have internal predecessors, (486), 0 states have call successors, (0), 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 591 [2024-10-12 16:19:33,231 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 16:19:33,251 INFO L225 Difference]: With dead ends: 25895 [2024-10-12 16:19:33,252 INFO L226 Difference]: Without dead ends: 16237 [2024-10-12 16:19:33,263 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-10-12 16:19:33,264 INFO L432 NwaCegarLoop]: 175 mSDtfsCounter, 220 mSDsluCounter, 29 mSDsCounter, 0 mSdLazyCounter, 992 mSolverCounterSat, 189 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 220 SdHoareTripleChecker+Valid, 204 SdHoareTripleChecker+Invalid, 1181 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 189 IncrementalHoareTripleChecker+Valid, 992 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2024-10-12 16:19:33,264 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [220 Valid, 204 Invalid, 1181 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [189 Valid, 992 Invalid, 0 Unknown, 0 Unchecked, 1.1s Time] [2024-10-12 16:19:33,273 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16237 states. [2024-10-12 16:19:33,349 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16237 to 12051. [2024-10-12 16:19:33,366 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 12051 states, 12050 states have (on average 1.1993360995850622) internal successors, (14452), 12050 states have internal predecessors, (14452), 0 states have call successors, (0), 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-10-12 16:19:33,386 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12051 states to 12051 states and 14452 transitions. [2024-10-12 16:19:33,390 INFO L78 Accepts]: Start accepts. Automaton has 12051 states and 14452 transitions. Word has length 591 [2024-10-12 16:19:33,391 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 16:19:33,391 INFO L471 AbstractCegarLoop]: Abstraction has 12051 states and 14452 transitions. [2024-10-12 16:19:33,391 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 162.0) internal successors, (486), 3 states have internal predecessors, (486), 0 states have call successors, (0), 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-10-12 16:19:33,391 INFO L276 IsEmpty]: Start isEmpty. Operand 12051 states and 14452 transitions. [2024-10-12 16:19:33,404 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 629 [2024-10-12 16:19:33,408 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 16:19:33,408 INFO L215 NwaCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2024-10-12 16:19:33,409 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2024-10-12 16:19:33,409 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 16:19:33,409 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 16:19:33,409 INFO L85 PathProgramCache]: Analyzing trace with hash 1454744971, now seen corresponding path program 1 times [2024-10-12 16:19:33,409 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 16:19:33,409 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1005268357] [2024-10-12 16:19:33,409 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 16:19:33,409 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 16:19:33,499 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 16:19:34,025 INFO L134 CoverageAnalysis]: Checked inductivity of 863 backedges. 619 proven. 39 refuted. 0 times theorem prover too weak. 205 trivial. 0 not checked. [2024-10-12 16:19:34,026 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 16:19:34,026 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1005268357] [2024-10-12 16:19:34,026 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1005268357] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-12 16:19:34,026 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1156595214] [2024-10-12 16:19:34,026 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 16:19:34,028 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-12 16:19:34,028 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-12 16:19:34,030 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-10-12 16:19:34,031 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-10-12 16:19:34,209 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 16:19:34,213 INFO L255 TraceCheckSpWp]: Trace formula consists of 766 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-10-12 16:19:34,233 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-12 16:19:34,408 INFO L134 CoverageAnalysis]: Checked inductivity of 863 backedges. 251 proven. 0 refuted. 0 times theorem prover too weak. 612 trivial. 0 not checked. [2024-10-12 16:19:34,408 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-12 16:19:34,408 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1156595214] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 16:19:34,408 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-10-12 16:19:34,408 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [4] total 6 [2024-10-12 16:19:34,409 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [822244169] [2024-10-12 16:19:34,409 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 16:19:34,409 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-12 16:19:34,410 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 16:19:34,411 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-12 16:19:34,411 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-10-12 16:19:34,411 INFO L87 Difference]: Start difference. First operand 12051 states and 14452 transitions. Second operand has 3 states, 3 states have (on average 88.66666666666667) internal successors, (266), 3 states have internal predecessors, (266), 0 states have call successors, (0), 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-10-12 16:19:35,652 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 16:19:35,653 INFO L93 Difference]: Finished difference Result 26793 states and 32888 transitions. [2024-10-12 16:19:35,653 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-12 16:19:35,653 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 88.66666666666667) internal successors, (266), 3 states have internal predecessors, (266), 0 states have call successors, (0), 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 628 [2024-10-12 16:19:35,654 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 16:19:35,671 INFO L225 Difference]: With dead ends: 26793 [2024-10-12 16:19:35,672 INFO L226 Difference]: Without dead ends: 15042 [2024-10-12 16:19:35,683 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 631 GetRequests, 627 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-10-12 16:19:35,683 INFO L432 NwaCegarLoop]: 586 mSDtfsCounter, 259 mSDsluCounter, 37 mSDsCounter, 0 mSdLazyCounter, 895 mSolverCounterSat, 226 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 259 SdHoareTripleChecker+Valid, 623 SdHoareTripleChecker+Invalid, 1121 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 226 IncrementalHoareTripleChecker+Valid, 895 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2024-10-12 16:19:35,683 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [259 Valid, 623 Invalid, 1121 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [226 Valid, 895 Invalid, 0 Unknown, 0 Unchecked, 1.1s Time] [2024-10-12 16:19:35,692 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15042 states. [2024-10-12 16:19:35,775 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15042 to 14444. [2024-10-12 16:19:35,785 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 14444 states, 14443 states have (on average 1.1807103787301807) internal successors, (17053), 14443 states have internal predecessors, (17053), 0 states have call successors, (0), 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-10-12 16:19:35,931 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14444 states to 14444 states and 17053 transitions. [2024-10-12 16:19:35,932 INFO L78 Accepts]: Start accepts. Automaton has 14444 states and 17053 transitions. Word has length 628 [2024-10-12 16:19:35,932 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 16:19:35,932 INFO L471 AbstractCegarLoop]: Abstraction has 14444 states and 17053 transitions. [2024-10-12 16:19:35,933 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 88.66666666666667) internal successors, (266), 3 states have internal predecessors, (266), 0 states have call successors, (0), 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-10-12 16:19:35,933 INFO L276 IsEmpty]: Start isEmpty. Operand 14444 states and 17053 transitions. [2024-10-12 16:19:35,941 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 686 [2024-10-12 16:19:35,942 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 16:19:35,943 INFO L215 NwaCegarLoop]: trace histogram [6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-10-12 16:19:35,958 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2024-10-12 16:19:36,143 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable15 [2024-10-12 16:19:36,144 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 16:19:36,145 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 16:19:36,146 INFO L85 PathProgramCache]: Analyzing trace with hash -1179881865, now seen corresponding path program 1 times [2024-10-12 16:19:36,146 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 16:19:36,146 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1572988524] [2024-10-12 16:19:36,146 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 16:19:36,146 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 16:19:36,215 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 16:19:36,608 INFO L134 CoverageAnalysis]: Checked inductivity of 1239 backedges. 765 proven. 39 refuted. 0 times theorem prover too weak. 435 trivial. 0 not checked. [2024-10-12 16:19:36,609 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 16:19:36,609 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1572988524] [2024-10-12 16:19:36,609 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1572988524] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-12 16:19:36,609 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1886921943] [2024-10-12 16:19:36,609 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 16:19:36,609 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-12 16:19:36,609 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-12 16:19:36,615 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-10-12 16:19:36,619 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-10-12 16:19:36,876 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 16:19:36,879 INFO L255 TraceCheckSpWp]: Trace formula consists of 839 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-10-12 16:19:36,887 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-12 16:19:37,663 INFO L134 CoverageAnalysis]: Checked inductivity of 1239 backedges. 804 proven. 0 refuted. 0 times theorem prover too weak. 435 trivial. 0 not checked. [2024-10-12 16:19:37,664 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-12 16:19:37,664 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1886921943] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 16:19:37,664 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-10-12 16:19:37,664 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [4] total 6 [2024-10-12 16:19:37,664 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1344633152] [2024-10-12 16:19:37,664 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 16:19:37,667 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-12 16:19:37,667 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 16:19:37,667 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-12 16:19:37,667 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=26, Unknown=0, NotChecked=0, Total=42 [2024-10-12 16:19:37,668 INFO L87 Difference]: Start difference. First operand 14444 states and 17053 transitions. Second operand has 4 states, 4 states have (on average 113.75) internal successors, (455), 3 states have internal predecessors, (455), 0 states have call successors, (0), 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-10-12 16:19:39,347 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 16:19:39,348 INFO L93 Difference]: Finished difference Result 29485 states and 34757 transitions. [2024-10-12 16:19:39,348 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-12 16:19:39,348 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 113.75) internal successors, (455), 3 states have internal predecessors, (455), 0 states have call successors, (0), 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 685 [2024-10-12 16:19:39,349 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 16:19:39,367 INFO L225 Difference]: With dead ends: 29485 [2024-10-12 16:19:39,367 INFO L226 Difference]: Without dead ends: 15042 [2024-10-12 16:19:39,380 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 688 GetRequests, 683 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=16, Invalid=26, Unknown=0, NotChecked=0, Total=42 [2024-10-12 16:19:39,381 INFO L432 NwaCegarLoop]: 313 mSDtfsCounter, 314 mSDsluCounter, 39 mSDsCounter, 0 mSdLazyCounter, 1487 mSolverCounterSat, 91 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 314 SdHoareTripleChecker+Valid, 352 SdHoareTripleChecker+Invalid, 1578 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 91 IncrementalHoareTripleChecker+Valid, 1487 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.6s IncrementalHoareTripleChecker+Time [2024-10-12 16:19:39,381 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [314 Valid, 352 Invalid, 1578 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [91 Valid, 1487 Invalid, 0 Unknown, 0 Unchecked, 1.6s Time] [2024-10-12 16:19:39,390 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15042 states. [2024-10-12 16:19:39,510 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15042 to 14743. [2024-10-12 16:19:39,522 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 14743 states, 14742 states have (on average 1.1743318409985077) internal successors, (17312), 14742 states have internal predecessors, (17312), 0 states have call successors, (0), 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-10-12 16:19:39,537 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14743 states to 14743 states and 17312 transitions. [2024-10-12 16:19:39,538 INFO L78 Accepts]: Start accepts. Automaton has 14743 states and 17312 transitions. Word has length 685 [2024-10-12 16:19:39,538 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 16:19:39,538 INFO L471 AbstractCegarLoop]: Abstraction has 14743 states and 17312 transitions. [2024-10-12 16:19:39,538 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 113.75) internal successors, (455), 3 states have internal predecessors, (455), 0 states have call successors, (0), 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-10-12 16:19:39,538 INFO L276 IsEmpty]: Start isEmpty. Operand 14743 states and 17312 transitions. [2024-10-12 16:19:39,546 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 686 [2024-10-12 16:19:39,546 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 16:19:39,546 INFO L215 NwaCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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] [2024-10-12 16:19:39,560 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-10-12 16:19:39,750 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,SelfDestructingSolverStorable16 [2024-10-12 16:19:39,751 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 16:19:39,751 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 16:19:39,752 INFO L85 PathProgramCache]: Analyzing trace with hash -170141480, now seen corresponding path program 1 times [2024-10-12 16:19:39,752 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 16:19:39,752 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1297996873] [2024-10-12 16:19:39,752 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 16:19:39,752 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 16:19:39,830 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 16:19:40,058 INFO L134 CoverageAnalysis]: Checked inductivity of 927 backedges. 593 proven. 0 refuted. 0 times theorem prover too weak. 334 trivial. 0 not checked. [2024-10-12 16:19:40,058 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 16:19:40,058 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1297996873] [2024-10-12 16:19:40,058 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1297996873] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 16:19:40,059 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 16:19:40,059 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-12 16:19:40,059 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [260648640] [2024-10-12 16:19:40,059 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 16:19:40,060 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-12 16:19:40,060 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 16:19:40,060 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-12 16:19:40,060 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-10-12 16:19:40,061 INFO L87 Difference]: Start difference. First operand 14743 states and 17312 transitions. Second operand has 4 states, 4 states have (on average 114.75) internal successors, (459), 4 states have internal predecessors, (459), 0 states have call successors, (0), 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-10-12 16:19:41,946 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 16:19:41,946 INFO L93 Difference]: Finished difference Result 39358 states and 45528 transitions. [2024-10-12 16:19:41,947 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-12 16:19:41,947 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 114.75) internal successors, (459), 4 states have internal predecessors, (459), 0 states have call successors, (0), 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 685 [2024-10-12 16:19:41,947 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 16:19:41,963 INFO L225 Difference]: With dead ends: 39358 [2024-10-12 16:19:41,964 INFO L226 Difference]: Without dead ends: 18038 [2024-10-12 16:19:41,976 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-10-12 16:19:41,976 INFO L432 NwaCegarLoop]: 404 mSDtfsCounter, 613 mSDsluCounter, 43 mSDsCounter, 0 mSdLazyCounter, 1577 mSolverCounterSat, 411 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 613 SdHoareTripleChecker+Valid, 447 SdHoareTripleChecker+Invalid, 1988 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 411 IncrementalHoareTripleChecker+Valid, 1577 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.8s IncrementalHoareTripleChecker+Time [2024-10-12 16:19:41,976 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [613 Valid, 447 Invalid, 1988 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [411 Valid, 1577 Invalid, 0 Unknown, 0 Unchecked, 1.8s Time] [2024-10-12 16:19:41,986 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18038 states. [2024-10-12 16:19:42,082 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18038 to 18034. [2024-10-12 16:19:42,094 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 18034 states, 18033 states have (on average 1.0484112460489103) internal successors, (18906), 18033 states have internal predecessors, (18906), 0 states have call successors, (0), 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-10-12 16:19:42,109 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18034 states to 18034 states and 18906 transitions. [2024-10-12 16:19:42,110 INFO L78 Accepts]: Start accepts. Automaton has 18034 states and 18906 transitions. Word has length 685 [2024-10-12 16:19:42,110 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 16:19:42,110 INFO L471 AbstractCegarLoop]: Abstraction has 18034 states and 18906 transitions. [2024-10-12 16:19:42,110 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 114.75) internal successors, (459), 4 states have internal predecessors, (459), 0 states have call successors, (0), 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-10-12 16:19:42,111 INFO L276 IsEmpty]: Start isEmpty. Operand 18034 states and 18906 transitions. [2024-10-12 16:19:42,118 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 726 [2024-10-12 16:19:42,119 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 16:19:42,119 INFO L215 NwaCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-10-12 16:19:42,119 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2024-10-12 16:19:42,119 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 16:19:42,119 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 16:19:42,120 INFO L85 PathProgramCache]: Analyzing trace with hash -1871361378, now seen corresponding path program 1 times [2024-10-12 16:19:42,120 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 16:19:42,120 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2094212485] [2024-10-12 16:19:42,120 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 16:19:42,120 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 16:19:42,195 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 16:19:42,545 INFO L134 CoverageAnalysis]: Checked inductivity of 913 backedges. 503 proven. 0 refuted. 0 times theorem prover too weak. 410 trivial. 0 not checked. [2024-10-12 16:19:42,545 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 16:19:42,545 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2094212485] [2024-10-12 16:19:42,546 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2094212485] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 16:19:42,546 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 16:19:42,546 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-12 16:19:42,546 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1064921771] [2024-10-12 16:19:42,546 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 16:19:42,546 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-12 16:19:42,547 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 16:19:42,547 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-12 16:19:42,547 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-12 16:19:42,548 INFO L87 Difference]: Start difference. First operand 18034 states and 18906 transitions. Second operand has 3 states, 3 states have (on average 132.33333333333334) internal successors, (397), 3 states have internal predecessors, (397), 0 states have call successors, (0), 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-10-12 16:19:43,429 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 16:19:43,429 INFO L93 Difference]: Finished difference Result 39369 states and 41267 transitions. [2024-10-12 16:19:43,429 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-12 16:19:43,430 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 132.33333333333334) internal successors, (397), 3 states have internal predecessors, (397), 0 states have call successors, (0), 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 725 [2024-10-12 16:19:43,430 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 16:19:43,471 INFO L225 Difference]: With dead ends: 39369 [2024-10-12 16:19:43,475 INFO L226 Difference]: Without dead ends: 21336 [2024-10-12 16:19:43,499 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-10-12 16:19:43,503 INFO L432 NwaCegarLoop]: 98 mSDtfsCounter, 344 mSDsluCounter, 21 mSDsCounter, 0 mSdLazyCounter, 789 mSolverCounterSat, 149 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 344 SdHoareTripleChecker+Valid, 119 SdHoareTripleChecker+Invalid, 938 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 149 IncrementalHoareTripleChecker+Valid, 789 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2024-10-12 16:19:43,504 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [344 Valid, 119 Invalid, 938 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [149 Valid, 789 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2024-10-12 16:19:43,530 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21336 states. [2024-10-12 16:19:43,668 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21336 to 19528. [2024-10-12 16:19:43,681 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 19528 states, 19527 states have (on average 1.0452706508936345) internal successors, (20411), 19527 states have internal predecessors, (20411), 0 states have call successors, (0), 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-10-12 16:19:43,697 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19528 states to 19528 states and 20411 transitions. [2024-10-12 16:19:43,698 INFO L78 Accepts]: Start accepts. Automaton has 19528 states and 20411 transitions. Word has length 725 [2024-10-12 16:19:43,698 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 16:19:43,699 INFO L471 AbstractCegarLoop]: Abstraction has 19528 states and 20411 transitions. [2024-10-12 16:19:43,699 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 132.33333333333334) internal successors, (397), 3 states have internal predecessors, (397), 0 states have call successors, (0), 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-10-12 16:19:43,699 INFO L276 IsEmpty]: Start isEmpty. Operand 19528 states and 20411 transitions. [2024-10-12 16:19:43,707 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 756 [2024-10-12 16:19:43,708 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 16:19:43,709 INFO L215 NwaCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-10-12 16:19:43,709 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2024-10-12 16:19:43,709 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 16:19:43,709 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 16:19:43,709 INFO L85 PathProgramCache]: Analyzing trace with hash 1599581901, now seen corresponding path program 1 times [2024-10-12 16:19:43,710 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 16:19:43,710 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [514124432] [2024-10-12 16:19:43,710 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 16:19:43,710 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 16:19:43,798 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 16:19:44,694 INFO L134 CoverageAnalysis]: Checked inductivity of 977 backedges. 583 proven. 188 refuted. 0 times theorem prover too weak. 206 trivial. 0 not checked. [2024-10-12 16:19:44,695 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 16:19:44,695 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [514124432] [2024-10-12 16:19:44,696 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [514124432] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-12 16:19:44,696 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [563947518] [2024-10-12 16:19:44,696 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 16:19:44,696 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-12 16:19:44,696 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-12 16:19:44,697 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-10-12 16:19:44,699 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-10-12 16:19:44,896 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 16:19:44,899 INFO L255 TraceCheckSpWp]: Trace formula consists of 891 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-10-12 16:19:44,906 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-12 16:19:46,534 INFO L134 CoverageAnalysis]: Checked inductivity of 977 backedges. 251 proven. 0 refuted. 0 times theorem prover too weak. 726 trivial. 0 not checked. [2024-10-12 16:19:46,534 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-12 16:19:46,534 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [563947518] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 16:19:46,534 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-10-12 16:19:46,535 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [4] total 6 [2024-10-12 16:19:46,535 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [827260386] [2024-10-12 16:19:46,535 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 16:19:46,536 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-12 16:19:46,536 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 16:19:46,536 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-12 16:19:46,536 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-10-12 16:19:46,536 INFO L87 Difference]: Start difference. First operand 19528 states and 20411 transitions. Second operand has 3 states, 3 states have (on average 113.33333333333333) internal successors, (340), 3 states have internal predecessors, (340), 0 states have call successors, (0), 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-10-12 16:19:48,200 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 16:19:48,200 INFO L93 Difference]: Finished difference Result 42357 states and 44233 transitions. [2024-10-12 16:19:48,200 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-12 16:19:48,201 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 113.33333333333333) internal successors, (340), 3 states have internal predecessors, (340), 0 states have call successors, (0), 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 755 [2024-10-12 16:19:48,202 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 16:19:48,223 INFO L225 Difference]: With dead ends: 42357 [2024-10-12 16:19:48,224 INFO L226 Difference]: Without dead ends: 22531 [2024-10-12 16:19:48,237 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 758 GetRequests, 754 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-10-12 16:19:48,237 INFO L432 NwaCegarLoop]: 79 mSDtfsCounter, 294 mSDsluCounter, 16 mSDsCounter, 0 mSdLazyCounter, 785 mSolverCounterSat, 140 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 294 SdHoareTripleChecker+Valid, 95 SdHoareTripleChecker+Invalid, 925 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 140 IncrementalHoareTripleChecker+Valid, 785 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.5s IncrementalHoareTripleChecker+Time [2024-10-12 16:19:48,238 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [294 Valid, 95 Invalid, 925 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [140 Valid, 785 Invalid, 0 Unknown, 0 Unchecked, 1.5s Time] [2024-10-12 16:19:48,249 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22531 states. [2024-10-12 16:19:48,370 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22531 to 18027. [2024-10-12 16:19:48,381 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 18027 states, 18026 states have (on average 1.0411072894707645) internal successors, (18767), 18026 states have internal predecessors, (18767), 0 states have call successors, (0), 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-10-12 16:19:48,397 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18027 states to 18027 states and 18767 transitions. [2024-10-12 16:19:48,398 INFO L78 Accepts]: Start accepts. Automaton has 18027 states and 18767 transitions. Word has length 755 [2024-10-12 16:19:48,398 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 16:19:48,398 INFO L471 AbstractCegarLoop]: Abstraction has 18027 states and 18767 transitions. [2024-10-12 16:19:48,398 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 113.33333333333333) internal successors, (340), 3 states have internal predecessors, (340), 0 states have call successors, (0), 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-10-12 16:19:48,398 INFO L276 IsEmpty]: Start isEmpty. Operand 18027 states and 18767 transitions. [2024-10-12 16:19:48,408 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 799 [2024-10-12 16:19:48,409 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 16:19:48,409 INFO L215 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-12 16:19:48,425 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2024-10-12 16:19:48,609 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-12 16:19:48,610 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 16:19:48,610 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 16:19:48,611 INFO L85 PathProgramCache]: Analyzing trace with hash 1384869552, now seen corresponding path program 1 times [2024-10-12 16:19:48,611 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 16:19:48,611 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1048928360] [2024-10-12 16:19:48,611 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 16:19:48,611 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 16:19:48,702 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 16:19:49,658 INFO L134 CoverageAnalysis]: Checked inductivity of 834 backedges. 464 proven. 364 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2024-10-12 16:19:49,659 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 16:19:49,659 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1048928360] [2024-10-12 16:19:49,659 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1048928360] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-12 16:19:49,659 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [704796808] [2024-10-12 16:19:49,659 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 16:19:49,659 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-12 16:19:49,659 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-12 16:19:49,660 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-10-12 16:19:49,661 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-10-12 16:19:49,866 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 16:19:49,869 INFO L255 TraceCheckSpWp]: Trace formula consists of 908 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-10-12 16:19:49,875 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-12 16:19:50,124 INFO L134 CoverageAnalysis]: Checked inductivity of 834 backedges. 646 proven. 0 refuted. 0 times theorem prover too weak. 188 trivial. 0 not checked. [2024-10-12 16:19:50,124 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-12 16:19:50,125 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [704796808] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 16:19:50,125 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-10-12 16:19:50,125 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [5] total 6 [2024-10-12 16:19:50,125 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1725460080] [2024-10-12 16:19:50,125 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 16:19:50,126 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-12 16:19:50,126 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 16:19:50,126 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-12 16:19:50,126 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2024-10-12 16:19:50,127 INFO L87 Difference]: Start difference. First operand 18027 states and 18767 transitions. Second operand has 3 states, 3 states have (on average 203.66666666666666) internal successors, (611), 3 states have internal predecessors, (611), 0 states have call successors, (0), 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-10-12 16:19:50,963 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 16:19:50,964 INFO L93 Difference]: Finished difference Result 36051 states and 37530 transitions. [2024-10-12 16:19:50,964 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-12 16:19:50,964 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 203.66666666666666) internal successors, (611), 3 states have internal predecessors, (611), 0 states have call successors, (0), 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 798 [2024-10-12 16:19:50,965 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 16:19:50,982 INFO L225 Difference]: With dead ends: 36051 [2024-10-12 16:19:50,982 INFO L226 Difference]: Without dead ends: 18025 [2024-10-12 16:19:50,994 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 803 GetRequests, 799 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2024-10-12 16:19:50,995 INFO L432 NwaCegarLoop]: 439 mSDtfsCounter, 72 mSDsluCounter, 25 mSDsCounter, 0 mSdLazyCounter, 729 mSolverCounterSat, 91 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 72 SdHoareTripleChecker+Valid, 464 SdHoareTripleChecker+Invalid, 820 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 91 IncrementalHoareTripleChecker+Valid, 729 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2024-10-12 16:19:50,995 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [72 Valid, 464 Invalid, 820 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [91 Valid, 729 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2024-10-12 16:19:51,005 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18025 states. [2024-10-12 16:19:51,123 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18025 to 17726. [2024-10-12 16:19:51,133 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 17726 states, 17725 states have (on average 1.030521861777151) internal successors, (18266), 17725 states have internal predecessors, (18266), 0 states have call successors, (0), 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-10-12 16:19:51,148 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17726 states to 17726 states and 18266 transitions. [2024-10-12 16:19:51,149 INFO L78 Accepts]: Start accepts. Automaton has 17726 states and 18266 transitions. Word has length 798 [2024-10-12 16:19:51,149 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 16:19:51,150 INFO L471 AbstractCegarLoop]: Abstraction has 17726 states and 18266 transitions. [2024-10-12 16:19:51,150 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 203.66666666666666) internal successors, (611), 3 states have internal predecessors, (611), 0 states have call successors, (0), 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-10-12 16:19:51,150 INFO L276 IsEmpty]: Start isEmpty. Operand 17726 states and 18266 transitions. [2024-10-12 16:19:51,160 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 837 [2024-10-12 16:19:51,160 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 16:19:51,161 INFO L215 NwaCegarLoop]: trace histogram [6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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-10-12 16:19:51,174 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2024-10-12 16:19:51,361 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-12 16:19:51,362 INFO L396 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 16:19:51,362 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 16:19:51,362 INFO L85 PathProgramCache]: Analyzing trace with hash 1929136089, now seen corresponding path program 1 times [2024-10-12 16:19:51,362 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 16:19:51,362 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [514996598] [2024-10-12 16:19:51,363 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 16:19:51,363 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 16:19:51,451 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 16:19:51,706 INFO L134 CoverageAnalysis]: Checked inductivity of 1382 backedges. 747 proven. 0 refuted. 0 times theorem prover too weak. 635 trivial. 0 not checked. [2024-10-12 16:19:51,707 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 16:19:51,707 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [514996598] [2024-10-12 16:19:51,707 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [514996598] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 16:19:51,707 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 16:19:51,707 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-12 16:19:51,707 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1924959486] [2024-10-12 16:19:51,707 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 16:19:51,708 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-12 16:19:51,708 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 16:19:51,708 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-12 16:19:51,708 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-12 16:19:51,709 INFO L87 Difference]: Start difference. First operand 17726 states and 18266 transitions. Second operand has 3 states, 3 states have (on average 124.66666666666667) internal successors, (374), 3 states have internal predecessors, (374), 0 states have call successors, (0), 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-10-12 16:19:52,434 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 16:19:52,434 INFO L93 Difference]: Finished difference Result 30622 states and 31516 transitions. [2024-10-12 16:19:52,435 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-12 16:19:52,435 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 124.66666666666667) internal successors, (374), 3 states have internal predecessors, (374), 0 states have call successors, (0), 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 836 [2024-10-12 16:19:52,435 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 16:19:52,447 INFO L225 Difference]: With dead ends: 30622 [2024-10-12 16:19:52,447 INFO L226 Difference]: Without dead ends: 12897 [2024-10-12 16:19:52,456 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-10-12 16:19:52,456 INFO L432 NwaCegarLoop]: 353 mSDtfsCounter, 340 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 685 mSolverCounterSat, 67 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 340 SdHoareTripleChecker+Valid, 360 SdHoareTripleChecker+Invalid, 752 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 67 IncrementalHoareTripleChecker+Valid, 685 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2024-10-12 16:19:52,456 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [340 Valid, 360 Invalid, 752 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [67 Valid, 685 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2024-10-12 16:19:52,463 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12897 states. [2024-10-12 16:19:52,530 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12897 to 10800. [2024-10-12 16:19:52,538 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10800 states, 10799 states have (on average 1.0267617371978888) internal successors, (11088), 10799 states have internal predecessors, (11088), 0 states have call successors, (0), 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-10-12 16:19:52,547 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10800 states to 10800 states and 11088 transitions. [2024-10-12 16:19:52,548 INFO L78 Accepts]: Start accepts. Automaton has 10800 states and 11088 transitions. Word has length 836 [2024-10-12 16:19:52,548 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 16:19:52,549 INFO L471 AbstractCegarLoop]: Abstraction has 10800 states and 11088 transitions. [2024-10-12 16:19:52,549 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 124.66666666666667) internal successors, (374), 3 states have internal predecessors, (374), 0 states have call successors, (0), 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-10-12 16:19:52,549 INFO L276 IsEmpty]: Start isEmpty. Operand 10800 states and 11088 transitions. [2024-10-12 16:19:52,557 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 841 [2024-10-12 16:19:52,557 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 16:19:52,557 INFO L215 NwaCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-10-12 16:19:52,557 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2024-10-12 16:19:52,557 INFO L396 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 16:19:52,558 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 16:19:52,558 INFO L85 PathProgramCache]: Analyzing trace with hash -1986141696, now seen corresponding path program 1 times [2024-10-12 16:19:52,558 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 16:19:52,558 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [948348708] [2024-10-12 16:19:52,558 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 16:19:52,558 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 16:19:52,644 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 16:19:52,828 INFO L134 CoverageAnalysis]: Checked inductivity of 1093 backedges. 251 proven. 0 refuted. 0 times theorem prover too weak. 842 trivial. 0 not checked. [2024-10-12 16:19:52,828 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 16:19:52,828 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [948348708] [2024-10-12 16:19:52,828 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [948348708] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 16:19:52,828 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 16:19:52,828 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-12 16:19:52,828 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [424059388] [2024-10-12 16:19:52,828 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 16:19:52,829 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-12 16:19:52,829 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 16:19:52,829 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-12 16:19:52,829 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-12 16:19:52,829 INFO L87 Difference]: Start difference. First operand 10800 states and 11088 transitions. Second operand has 3 states, 3 states have (on average 113.33333333333333) internal successors, (340), 3 states have internal predecessors, (340), 0 states have call successors, (0), 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-10-12 16:19:53,521 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 16:19:53,522 INFO L93 Difference]: Finished difference Result 21296 states and 21867 transitions. [2024-10-12 16:19:53,522 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-12 16:19:53,522 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 113.33333333333333) internal successors, (340), 3 states have internal predecessors, (340), 0 states have call successors, (0), 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 840 [2024-10-12 16:19:53,523 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 16:19:53,523 INFO L225 Difference]: With dead ends: 21296 [2024-10-12 16:19:53,523 INFO L226 Difference]: Without dead ends: 0 [2024-10-12 16:19:53,531 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-10-12 16:19:53,532 INFO L432 NwaCegarLoop]: 379 mSDtfsCounter, 323 mSDsluCounter, 15 mSDsCounter, 0 mSdLazyCounter, 673 mSolverCounterSat, 53 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 323 SdHoareTripleChecker+Valid, 394 SdHoareTripleChecker+Invalid, 726 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 53 IncrementalHoareTripleChecker+Valid, 673 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2024-10-12 16:19:53,532 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [323 Valid, 394 Invalid, 726 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [53 Valid, 673 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2024-10-12 16:19:53,532 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2024-10-12 16:19:53,532 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2024-10-12 16:19:53,532 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-10-12 16:19:53,533 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2024-10-12 16:19:53,533 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 840 [2024-10-12 16:19:53,533 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 16:19:53,533 INFO L471 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2024-10-12 16:19:53,533 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 113.33333333333333) internal successors, (340), 3 states have internal predecessors, (340), 0 states have call successors, (0), 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-10-12 16:19:53,533 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2024-10-12 16:19:53,534 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2024-10-12 16:19:53,536 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2024-10-12 16:19:53,536 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2024-10-12 16:19:53,538 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, 1, 1, 1] [2024-10-12 16:19:53,540 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2024-10-12 16:19:56,173 INFO L165 ceAbstractionStarter]: Computing trace abstraction results [2024-10-12 16:19:56,195 WARN L953 BoogieBacktranslator]: Unfinished Backtranslation: Expression type not yet supported in backtranslation: QuantifierExpression [2024-10-12 16:19:56,197 WARN L953 BoogieBacktranslator]: Unfinished Backtranslation: Expression type not yet supported in backtranslation: QuantifierExpression [2024-10-12 16:19:56,197 WARN L953 BoogieBacktranslator]: Unfinished Backtranslation: Expression type not yet supported in backtranslation: QuantifierExpression [2024-10-12 16:19:56,198 WARN L953 BoogieBacktranslator]: Unfinished Backtranslation: Expression type not yet supported in backtranslation: QuantifierExpression [2024-10-12 16:19:56,204 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 12.10 04:19:56 BoogieIcfgContainer [2024-10-12 16:19:56,206 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-10-12 16:19:56,207 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-10-12 16:19:56,207 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-10-12 16:19:56,207 INFO L274 PluginConnector]: Witness Printer initialized [2024-10-12 16:19:56,207 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.10 04:19:08" (3/4) ... [2024-10-12 16:19:56,209 INFO L139 WitnessPrinter]: Generating witness for correct program [2024-10-12 16:19:56,232 INFO L904 BoogieBacktranslator]: Reduced CFG by removing 13 nodes and edges [2024-10-12 16:19:56,234 INFO L904 BoogieBacktranslator]: Reduced CFG by removing 4 nodes and edges [2024-10-12 16:19:56,236 INFO L904 BoogieBacktranslator]: Reduced CFG by removing 3 nodes and edges [2024-10-12 16:19:56,237 INFO L904 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2024-10-12 16:19:56,403 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2024-10-12 16:19:56,406 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.yml [2024-10-12 16:19:56,406 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-10-12 16:19:56,407 INFO L158 Benchmark]: Toolchain (without parser) took 50972.17ms. Allocated memory was 190.8MB in the beginning and 1.6GB in the end (delta: 1.4GB). Free memory was 116.2MB in the beginning and 1.2GB in the end (delta: -1.1GB). Peak memory consumption was 319.7MB. Max. memory is 16.1GB. [2024-10-12 16:19:56,407 INFO L158 Benchmark]: CDTParser took 0.13ms. Allocated memory is still 130.0MB. Free memory was 96.2MB in the beginning and 96.1MB in the end (delta: 96.4kB). There was no memory consumed. Max. memory is 16.1GB. [2024-10-12 16:19:56,407 INFO L158 Benchmark]: CACSL2BoogieTranslator took 786.63ms. Allocated memory is still 190.8MB. Free memory was 116.0MB in the beginning and 92.6MB in the end (delta: 23.4MB). Peak memory consumption was 24.2MB. Max. memory is 16.1GB. [2024-10-12 16:19:56,408 INFO L158 Benchmark]: Boogie Procedure Inliner took 181.01ms. Allocated memory is still 190.8MB. Free memory was 92.6MB in the beginning and 122.6MB in the end (delta: -30.0MB). Peak memory consumption was 20.0MB. Max. memory is 16.1GB. [2024-10-12 16:19:56,408 INFO L158 Benchmark]: Boogie Preprocessor took 263.62ms. Allocated memory is still 190.8MB. Free memory was 122.6MB in the beginning and 126.9MB in the end (delta: -4.3MB). Peak memory consumption was 71.2MB. Max. memory is 16.1GB. [2024-10-12 16:19:56,408 INFO L158 Benchmark]: RCFGBuilder took 1878.82ms. Allocated memory was 190.8MB in the beginning and 310.4MB in the end (delta: 119.5MB). Free memory was 126.9MB in the beginning and 153.1MB in the end (delta: -26.2MB). Peak memory consumption was 120.6MB. Max. memory is 16.1GB. [2024-10-12 16:19:56,408 INFO L158 Benchmark]: TraceAbstraction took 47657.62ms. Allocated memory was 310.4MB in the beginning and 1.6GB in the end (delta: 1.3GB). Free memory was 152.0MB in the beginning and 1.3GB in the end (delta: -1.1GB). Peak memory consumption was 936.2MB. Max. memory is 16.1GB. [2024-10-12 16:19:56,409 INFO L158 Benchmark]: Witness Printer took 199.14ms. Allocated memory is still 1.6GB. Free memory was 1.3GB in the beginning and 1.2GB in the end (delta: 27.3MB). Peak memory consumption was 27.3MB. Max. memory is 16.1GB. [2024-10-12 16:19:56,410 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.13ms. Allocated memory is still 130.0MB. Free memory was 96.2MB in the beginning and 96.1MB in the end (delta: 96.4kB). There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 786.63ms. Allocated memory is still 190.8MB. Free memory was 116.0MB in the beginning and 92.6MB in the end (delta: 23.4MB). Peak memory consumption was 24.2MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 181.01ms. Allocated memory is still 190.8MB. Free memory was 92.6MB in the beginning and 122.6MB in the end (delta: -30.0MB). Peak memory consumption was 20.0MB. Max. memory is 16.1GB. * Boogie Preprocessor took 263.62ms. Allocated memory is still 190.8MB. Free memory was 122.6MB in the beginning and 126.9MB in the end (delta: -4.3MB). Peak memory consumption was 71.2MB. Max. memory is 16.1GB. * RCFGBuilder took 1878.82ms. Allocated memory was 190.8MB in the beginning and 310.4MB in the end (delta: 119.5MB). Free memory was 126.9MB in the beginning and 153.1MB in the end (delta: -26.2MB). Peak memory consumption was 120.6MB. Max. memory is 16.1GB. * TraceAbstraction took 47657.62ms. Allocated memory was 310.4MB in the beginning and 1.6GB in the end (delta: 1.3GB). Free memory was 152.0MB in the beginning and 1.3GB in the end (delta: -1.1GB). Peak memory consumption was 936.2MB. Max. memory is 16.1GB. * Witness Printer took 199.14ms. Allocated memory is still 1.6GB. Free memory was 1.3GB in the beginning and 1.2GB in the end (delta: 27.3MB). Peak memory consumption was 27.3MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Expression type not yet supported in backtranslation: QuantifierExpression - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Expression type not yet supported in backtranslation: QuantifierExpression - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Expression type not yet supported in backtranslation: QuantifierExpression - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Expression type not yet supported in backtranslation: QuantifierExpression * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - PositiveResult [Line: 212]: a call to reach_error is unreachable For all program executions holds that a call to reach_error is unreachable at this location - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 362 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 44.9s, OverallIterations: 23, TraceHistogramMax: 6, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.2s, AutomataDifference: 29.2s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 6121 SdHoareTripleChecker+Valid, 26.8s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 6121 mSDsluCounter, 8283 SdHoareTripleChecker+Invalid, 23.1s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 798 mSDsCounter, 4212 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 21359 IncrementalHoareTripleChecker+Invalid, 25571 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 4212 mSolverCounterUnsat, 7485 mSDtfsCounter, 21359 mSolverCounterSat, 0.1s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 2933 GetRequests, 2895 SyntacticMatches, 0 SemanticMatches, 38 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.2s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=19528occurred in iteration=19, InterpolantAutomatonStates: 71, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 2.1s AutomataMinimizationTime, 23 MinimizatonAttempts, 22245 StatesRemovedByMinimization, 20 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.4s SsaConstructionTime, 1.0s SatisfiabilityAnalysisTime, 10.0s InterpolantComputationTime, 14184 NumberOfCodeBlocks, 14184 NumberOfCodeBlocksAsserted, 27 NumberOfCheckSat, 14157 ConstructedInterpolants, 63 QuantifiedInterpolants, 43553 SizeOfPredicates, 1 NumberOfNonLiveVariables, 3404 ConjunctsInSsa, 10 ConjunctsInUnsatCore, 27 InterpolantComputations, 23 PerfectInterpolantSequences, 15731/16361 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: 1776]: Loop Invariant Derived loop invariant: (((((((((((((((((((((((((((((long long) 42 + a4) <= 0) && (((long long) 98 + a0) <= 0)) && (3 == a2)) || (((((long long) 42 + a4) <= 0) && (((long long) a0 + 147) <= 0)) && (4 <= a2))) || (((0 <= ((long long) a29 + 127)) && (((long long) a4 + 86) <= 0)) && (3 == a2))) || ((((((long long) 42 + a4) <= 0) && (0 <= ((long long) a29 + 127))) && (a2 == 1)) && (a29 <= 43))) || (((2 == a2) && (44 <= a29)) && (((long long) 98 + a0) <= 0))) || (((((long long) 42 + a4) <= 0) && (2 == a2)) && (((long long) a0 + 147) <= 0))) || (((0 <= ((long long) a29 + 127)) && (((long long) 89 + a4) <= 0)) && (((long long) a0 + 61) <= 0))) || ((((44 <= a29) && (0 <= ((long long) a0 + 60))) && (5 <= a2)) && (((long long) a4 + 86) <= 0))) || ((((((long long) 89 + a4) <= 0) && (0 <= ((long long) a0 + 60))) && (4 <= a2)) && (a29 <= 43))) || (((0 <= ((long long) 97 + a0)) && (((long long) 89 + a4) <= 0)) && (((long long) a0 + 61) <= 0))) || (((a2 == 1) && (((long long) a4 + 86) <= 0)) && (((long long) a0 + 61) <= 0))) || ((2 == a2) && (((long long) 89 + a4) <= 0))) || ((((long long) 104 + a0) <= 0) && (((long long) 89 + a4) <= 0))) || ((((((long long) 42 + a4) <= 0) && (0 <= ((long long) a29 + 127))) && (((long long) 98 + a0) <= 0)) && (5 <= a2))) || ((((((long long) 104 + a0) <= 0) && (((long long) 42 + a4) <= 0)) && (44 <= a29)) && (4 <= a2))) || ((((long long) 89 + a4) <= 0) && (3 == a2))) || ((((((long long) 42 + a4) <= 0) && (((long long) 98 + a0) <= 0)) && (0 <= ((long long) 146 + a0))) && (a2 == 1))) || ((((((long long) 42 + a4) <= 0) && (2 == a2)) && (0 <= ((long long) a29 + 127))) && (((long long) 98 + a0) <= 0))) || ((((((long long) 89 + a4) <= 0) && (a29 <= 43)) || ((((0 <= ((long long) a29 + 127)) && (0 <= ((long long) a0 + 60))) && (((long long) a4 + 86) <= 0)) && (a29 <= 43))) && (4 <= a2))) || (((2 == a2) && (0 <= ((long long) a0 + 60))) && (((long long) a4 + 86) <= 0))) || (((a2 == 1) && (((long long) a4 + 86) <= 0)) && (((long long) a29 + 127) <= 0))) || ((((long long) 89 + a4) <= 0) && (5 <= a2))) || (((((long long) 104 + a0) <= 0) && (((long long) 42 + a4) <= 0)) && (5 <= a2))) || ((((((long long) 42 + a4) <= 0) && (a2 == 1)) && (a29 <= 43)) && (((long long) a0 + 61) <= 0))) || (((((long long) 42 + a4) <= 0) && (((long long) a0 + 147) <= 0)) && (a2 == 1))) RESULT: Ultimate proved your program to be correct! [2024-10-12 16:19:56,468 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