./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/Problem03_label48.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/Problem03_label48.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 3f14d4f9bc9aeaf37fb25f1f86f7bc3a3a5a6ca0e3e96922bca4446f4d37ab9f --- Real Ultimate output --- This is Ultimate 0.2.5-tmp.dk.eval-mul-div-a046e57-m [2024-10-12 15:20:31,862 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-12 15:20:31,928 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-10-12 15:20:31,933 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-12 15:20:31,933 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-12 15:20:31,956 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-12 15:20:31,957 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-12 15:20:31,957 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-12 15:20:31,957 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-10-12 15:20:31,958 INFO L153 SettingsManager]: * Use memory slicer=true [2024-10-12 15:20:31,959 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-10-12 15:20:31,959 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-10-12 15:20:31,959 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-12 15:20:31,960 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-12 15:20:31,960 INFO L153 SettingsManager]: * Use SBE=true [2024-10-12 15:20:31,961 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-12 15:20:31,961 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-10-12 15:20:31,961 INFO L153 SettingsManager]: * sizeof long=4 [2024-10-12 15:20:31,961 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-10-12 15:20:31,961 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-10-12 15:20:31,961 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-12 15:20:31,964 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-10-12 15:20:31,964 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-10-12 15:20:31,964 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-10-12 15:20:31,964 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-12 15:20:31,964 INFO L153 SettingsManager]: * sizeof long double=12 [2024-10-12 15:20:31,964 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-10-12 15:20:31,964 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-12 15:20:31,964 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-12 15:20:31,965 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-12 15:20:31,965 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-10-12 15:20:31,965 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-10-12 15:20:31,965 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-12 15:20:31,965 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-12 15:20:31,965 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-10-12 15:20:31,965 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-10-12 15:20:31,966 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-10-12 15:20:31,966 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-10-12 15:20:31,966 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-10-12 15:20:31,966 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-10-12 15:20:31,966 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-10-12 15:20:31,968 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-10-12 15:20:31,968 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 -> 3f14d4f9bc9aeaf37fb25f1f86f7bc3a3a5a6ca0e3e96922bca4446f4d37ab9f [2024-10-12 15:20:32,176 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-12 15:20:32,196 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-12 15:20:32,199 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-12 15:20:32,200 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-12 15:20:32,200 INFO L274 PluginConnector]: CDTParser initialized [2024-10-12 15:20:32,201 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/eca-rers2012/Problem03_label48.c [2024-10-12 15:20:33,479 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-12 15:20:33,762 INFO L384 CDTParser]: Found 1 translation units. [2024-10-12 15:20:33,763 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/eca-rers2012/Problem03_label48.c [2024-10-12 15:20:33,790 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/a49ea3a1a/7a03f7d892ba464ba62fc0850382cdea/FLAG5332d73cc [2024-10-12 15:20:33,805 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/a49ea3a1a/7a03f7d892ba464ba62fc0850382cdea [2024-10-12 15:20:33,808 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-12 15:20:33,809 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-12 15:20:33,812 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-12 15:20:33,812 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-12 15:20:33,817 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-12 15:20:33,817 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 12.10 03:20:33" (1/1) ... [2024-10-12 15:20:33,818 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@699e8db1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 03:20:33, skipping insertion in model container [2024-10-12 15:20:33,818 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 12.10 03:20:33" (1/1) ... [2024-10-12 15:20:33,873 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-12 15:20:34,310 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/Problem03_label48.c[58935,58948] [2024-10-12 15:20:34,339 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-12 15:20:34,353 INFO L200 MainTranslator]: Completed pre-run [2024-10-12 15:20:34,482 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/Problem03_label48.c[58935,58948] [2024-10-12 15:20:34,493 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-12 15:20:34,511 INFO L204 MainTranslator]: Completed translation [2024-10-12 15:20:34,511 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 03:20:34 WrapperNode [2024-10-12 15:20:34,511 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-12 15:20:34,512 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-10-12 15:20:34,512 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-10-12 15:20:34,512 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-10-12 15:20:34,519 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 03:20:34" (1/1) ... [2024-10-12 15:20:34,542 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 03:20:34" (1/1) ... [2024-10-12 15:20:34,630 INFO L138 Inliner]: procedures = 14, calls = 8, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 1772 [2024-10-12 15:20:34,631 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-10-12 15:20:34,632 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-10-12 15:20:34,632 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-10-12 15:20:34,632 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-10-12 15:20:34,644 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 03:20:34" (1/1) ... [2024-10-12 15:20:34,645 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 03:20:34" (1/1) ... [2024-10-12 15:20:34,657 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 03:20:34" (1/1) ... [2024-10-12 15:20:34,688 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 15:20:34,688 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 03:20:34" (1/1) ... [2024-10-12 15:20:34,689 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 03:20:34" (1/1) ... [2024-10-12 15:20:34,718 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 03:20:34" (1/1) ... [2024-10-12 15:20:34,725 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 03:20:34" (1/1) ... [2024-10-12 15:20:34,736 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 03:20:34" (1/1) ... [2024-10-12 15:20:34,742 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 03:20:34" (1/1) ... [2024-10-12 15:20:34,753 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-10-12 15:20:34,754 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-10-12 15:20:34,755 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-10-12 15:20:34,755 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-10-12 15:20:34,756 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 03:20:34" (1/1) ... [2024-10-12 15:20:34,761 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-12 15:20:34,771 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-12 15:20:34,787 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 15:20:34,789 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 15:20:34,831 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-10-12 15:20:34,831 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-10-12 15:20:34,832 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-10-12 15:20:34,832 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-10-12 15:20:34,906 INFO L238 CfgBuilder]: Building ICFG [2024-10-12 15:20:34,909 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-10-12 15:20:36,411 INFO L? ?]: Removed 147 outVars from TransFormulas that were not future-live. [2024-10-12 15:20:36,411 INFO L287 CfgBuilder]: Performing block encoding [2024-10-12 15:20:36,472 INFO L309 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-10-12 15:20:36,475 INFO L314 CfgBuilder]: Removed 1 assume(true) statements. [2024-10-12 15:20:36,475 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.10 03:20:36 BoogieIcfgContainer [2024-10-12 15:20:36,476 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-10-12 15:20:36,477 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-10-12 15:20:36,477 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-10-12 15:20:36,480 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-10-12 15:20:36,480 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 12.10 03:20:33" (1/3) ... [2024-10-12 15:20:36,481 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4acafde9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 12.10 03:20:36, skipping insertion in model container [2024-10-12 15:20:36,481 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 03:20:34" (2/3) ... [2024-10-12 15:20:36,482 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4acafde9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 12.10 03:20:36, skipping insertion in model container [2024-10-12 15:20:36,482 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.10 03:20:36" (3/3) ... [2024-10-12 15:20:36,484 INFO L112 eAbstractionObserver]: Analyzing ICFG Problem03_label48.c [2024-10-12 15:20:36,498 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-10-12 15:20:36,498 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-10-12 15:20:36,565 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-10-12 15:20:36,573 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;@38be7250, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-12 15:20:36,573 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-10-12 15:20:36,579 INFO L276 IsEmpty]: Start isEmpty. Operand has 240 states, 238 states have (on average 1.9201680672268908) internal successors, (457), 239 states have internal predecessors, (457), 0 states have call successors, (0), 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 15:20:36,599 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 183 [2024-10-12 15:20:36,600 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 15:20:36,600 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-12 15:20:36,601 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 15:20:36,606 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 15:20:36,607 INFO L85 PathProgramCache]: Analyzing trace with hash 2133573514, now seen corresponding path program 1 times [2024-10-12 15:20:36,615 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 15:20:36,615 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [838453203] [2024-10-12 15:20:36,616 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 15:20:36,616 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 15:20:36,852 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 15:20:37,092 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 15:20:37,094 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 15:20:37,094 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [838453203] [2024-10-12 15:20:37,094 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [838453203] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 15:20:37,095 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 15:20:37,095 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-12 15:20:37,097 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1471523172] [2024-10-12 15:20:37,097 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 15:20:37,102 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-10-12 15:20:37,103 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 15:20:37,125 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-10-12 15:20:37,126 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-10-12 15:20:37,130 INFO L87 Difference]: Start difference. First operand has 240 states, 238 states have (on average 1.9201680672268908) internal successors, (457), 239 states have internal predecessors, (457), 0 states have call successors, (0), 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 91.0) internal successors, (182), 2 states have internal predecessors, (182), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 15:20:37,171 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 15:20:37,172 INFO L93 Difference]: Finished difference Result 479 states and 913 transitions. [2024-10-12 15:20:37,173 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-12 15:20:37,174 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 91.0) internal successors, (182), 2 states have internal predecessors, (182), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 182 [2024-10-12 15:20:37,175 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 15:20:37,185 INFO L225 Difference]: With dead ends: 479 [2024-10-12 15:20:37,185 INFO L226 Difference]: Without dead ends: 238 [2024-10-12 15:20:37,188 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 15:20:37,191 INFO L432 NwaCegarLoop]: 392 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, 392 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 15:20:37,191 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 392 Invalid, 2 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 2 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-12 15:20:37,206 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 238 states. [2024-10-12 15:20:37,230 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 238 to 238. [2024-10-12 15:20:37,231 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 238 states, 237 states have (on average 1.6540084388185654) internal successors, (392), 237 states have internal predecessors, (392), 0 states have call successors, (0), 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 15:20:37,233 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 238 states to 238 states and 392 transitions. [2024-10-12 15:20:37,234 INFO L78 Accepts]: Start accepts. Automaton has 238 states and 392 transitions. Word has length 182 [2024-10-12 15:20:37,235 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 15:20:37,236 INFO L471 AbstractCegarLoop]: Abstraction has 238 states and 392 transitions. [2024-10-12 15:20:37,236 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 91.0) internal successors, (182), 2 states have internal predecessors, (182), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 15:20:37,237 INFO L276 IsEmpty]: Start isEmpty. Operand 238 states and 392 transitions. [2024-10-12 15:20:37,238 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 183 [2024-10-12 15:20:37,239 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 15:20:37,239 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-12 15:20:37,239 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-10-12 15:20:37,239 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 15:20:37,240 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 15:20:37,240 INFO L85 PathProgramCache]: Analyzing trace with hash -710452075, now seen corresponding path program 1 times [2024-10-12 15:20:37,240 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 15:20:37,240 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [177399566] [2024-10-12 15:20:37,241 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 15:20:37,241 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 15:20:37,308 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 15:20:37,695 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 15:20:37,695 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 15:20:37,695 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [177399566] [2024-10-12 15:20:37,696 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [177399566] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 15:20:37,696 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 15:20:37,696 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-12 15:20:37,696 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [127501494] [2024-10-12 15:20:37,696 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 15:20:37,697 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-12 15:20:37,698 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 15:20:37,698 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-12 15:20:37,698 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-12 15:20:37,699 INFO L87 Difference]: Start difference. First operand 238 states and 392 transitions. Second operand has 3 states, 3 states have (on average 60.666666666666664) internal successors, (182), 2 states have internal predecessors, (182), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 15:20:38,465 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 15:20:38,465 INFO L93 Difference]: Finished difference Result 701 states and 1160 transitions. [2024-10-12 15:20:38,466 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-12 15:20:38,466 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 60.666666666666664) internal successors, (182), 2 states have internal predecessors, (182), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 182 [2024-10-12 15:20:38,467 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 15:20:38,469 INFO L225 Difference]: With dead ends: 701 [2024-10-12 15:20:38,469 INFO L226 Difference]: Without dead ends: 464 [2024-10-12 15:20:38,470 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 15:20:38,471 INFO L432 NwaCegarLoop]: 99 mSDtfsCounter, 89 mSDsluCounter, 32 mSDsCounter, 0 mSdLazyCounter, 614 mSolverCounterSat, 100 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 89 SdHoareTripleChecker+Valid, 131 SdHoareTripleChecker+Invalid, 714 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 100 IncrementalHoareTripleChecker+Valid, 614 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2024-10-12 15:20:38,471 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [89 Valid, 131 Invalid, 714 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [100 Valid, 614 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2024-10-12 15:20:38,472 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 464 states. [2024-10-12 15:20:38,493 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 464 to 458. [2024-10-12 15:20:38,494 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 458 states, 457 states have (on average 1.5579868708971554) internal successors, (712), 457 states have internal predecessors, (712), 0 states have call successors, (0), 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 15:20:38,496 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 458 states to 458 states and 712 transitions. [2024-10-12 15:20:38,496 INFO L78 Accepts]: Start accepts. Automaton has 458 states and 712 transitions. Word has length 182 [2024-10-12 15:20:38,497 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 15:20:38,497 INFO L471 AbstractCegarLoop]: Abstraction has 458 states and 712 transitions. [2024-10-12 15:20:38,497 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 60.666666666666664) internal successors, (182), 2 states have internal predecessors, (182), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 15:20:38,497 INFO L276 IsEmpty]: Start isEmpty. Operand 458 states and 712 transitions. [2024-10-12 15:20:38,501 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 191 [2024-10-12 15:20:38,501 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 15:20:38,501 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-12 15:20:38,502 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-10-12 15:20:38,502 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 15:20:38,502 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 15:20:38,502 INFO L85 PathProgramCache]: Analyzing trace with hash -1871700458, now seen corresponding path program 1 times [2024-10-12 15:20:38,503 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 15:20:38,503 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1637999360] [2024-10-12 15:20:38,503 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 15:20:38,503 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 15:20:38,556 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 15:20:38,703 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-12 15:20:38,704 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 15:20:38,704 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1637999360] [2024-10-12 15:20:38,704 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1637999360] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 15:20:38,704 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 15:20:38,705 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-12 15:20:38,705 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1706094009] [2024-10-12 15:20:38,705 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 15:20:38,705 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-12 15:20:38,706 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 15:20:38,706 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-12 15:20:38,707 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-12 15:20:38,707 INFO L87 Difference]: Start difference. First operand 458 states and 712 transitions. Second operand has 3 states, 3 states have (on average 63.333333333333336) internal successors, (190), 2 states have internal predecessors, (190), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 15:20:39,391 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 15:20:39,392 INFO L93 Difference]: Finished difference Result 1342 states and 2101 transitions. [2024-10-12 15:20:39,392 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-12 15:20:39,392 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 63.333333333333336) internal successors, (190), 2 states have internal predecessors, (190), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 190 [2024-10-12 15:20:39,392 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 15:20:39,395 INFO L225 Difference]: With dead ends: 1342 [2024-10-12 15:20:39,395 INFO L226 Difference]: Without dead ends: 885 [2024-10-12 15:20:39,397 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 15:20:39,398 INFO L432 NwaCegarLoop]: 73 mSDtfsCounter, 249 mSDsluCounter, 14 mSDsCounter, 0 mSdLazyCounter, 585 mSolverCounterSat, 195 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 249 SdHoareTripleChecker+Valid, 87 SdHoareTripleChecker+Invalid, 780 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 195 IncrementalHoareTripleChecker+Valid, 585 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2024-10-12 15:20:39,399 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [249 Valid, 87 Invalid, 780 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [195 Valid, 585 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2024-10-12 15:20:39,400 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 885 states. [2024-10-12 15:20:39,416 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 885 to 867. [2024-10-12 15:20:39,417 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 867 states, 866 states have (on average 1.5346420323325636) internal successors, (1329), 866 states have internal predecessors, (1329), 0 states have call successors, (0), 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 15:20:39,419 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 867 states to 867 states and 1329 transitions. [2024-10-12 15:20:39,420 INFO L78 Accepts]: Start accepts. Automaton has 867 states and 1329 transitions. Word has length 190 [2024-10-12 15:20:39,420 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 15:20:39,420 INFO L471 AbstractCegarLoop]: Abstraction has 867 states and 1329 transitions. [2024-10-12 15:20:39,420 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 63.333333333333336) internal successors, (190), 2 states have internal predecessors, (190), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 15:20:39,421 INFO L276 IsEmpty]: Start isEmpty. Operand 867 states and 1329 transitions. [2024-10-12 15:20:39,427 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 192 [2024-10-12 15:20:39,427 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 15:20:39,427 INFO L215 NwaCegarLoop]: trace histogram [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] [2024-10-12 15:20:39,428 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-10-12 15:20:39,428 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 15:20:39,430 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 15:20:39,431 INFO L85 PathProgramCache]: Analyzing trace with hash 962079051, now seen corresponding path program 1 times [2024-10-12 15:20:39,431 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 15:20:39,431 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1767508679] [2024-10-12 15:20:39,432 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 15:20:39,432 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 15:20:39,474 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 15:20:39,703 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-12 15:20:39,704 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 15:20:39,704 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1767508679] [2024-10-12 15:20:39,704 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1767508679] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 15:20:39,705 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 15:20:39,705 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-12 15:20:39,705 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [685739121] [2024-10-12 15:20:39,705 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 15:20:39,705 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-12 15:20:39,706 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 15:20:39,707 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-12 15:20:39,707 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-12 15:20:39,707 INFO L87 Difference]: Start difference. First operand 867 states and 1329 transitions. Second operand has 3 states, 3 states have (on average 63.666666666666664) internal successors, (191), 2 states have internal predecessors, (191), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 15:20:40,387 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 15:20:40,387 INFO L93 Difference]: Finished difference Result 2572 states and 3945 transitions. [2024-10-12 15:20:40,388 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-12 15:20:40,388 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 63.666666666666664) internal successors, (191), 2 states have internal predecessors, (191), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 191 [2024-10-12 15:20:40,388 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 15:20:40,393 INFO L225 Difference]: With dead ends: 2572 [2024-10-12 15:20:40,393 INFO L226 Difference]: Without dead ends: 1706 [2024-10-12 15:20:40,395 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 15:20:40,396 INFO L432 NwaCegarLoop]: 102 mSDtfsCounter, 255 mSDsluCounter, 33 mSDsCounter, 0 mSdLazyCounter, 626 mSolverCounterSat, 77 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 255 SdHoareTripleChecker+Valid, 135 SdHoareTripleChecker+Invalid, 703 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 77 IncrementalHoareTripleChecker+Valid, 626 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2024-10-12 15:20:40,396 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [255 Valid, 135 Invalid, 703 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [77 Valid, 626 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2024-10-12 15:20:40,398 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1706 states. [2024-10-12 15:20:40,418 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1706 to 1703. [2024-10-12 15:20:40,420 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1703 states, 1702 states have (on average 1.4488836662749707) internal successors, (2466), 1702 states have internal predecessors, (2466), 0 states have call successors, (0), 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 15:20:40,424 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1703 states to 1703 states and 2466 transitions. [2024-10-12 15:20:40,424 INFO L78 Accepts]: Start accepts. Automaton has 1703 states and 2466 transitions. Word has length 191 [2024-10-12 15:20:40,425 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 15:20:40,425 INFO L471 AbstractCegarLoop]: Abstraction has 1703 states and 2466 transitions. [2024-10-12 15:20:40,425 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 63.666666666666664) internal successors, (191), 2 states have internal predecessors, (191), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 15:20:40,425 INFO L276 IsEmpty]: Start isEmpty. Operand 1703 states and 2466 transitions. [2024-10-12 15:20:40,428 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 193 [2024-10-12 15:20:40,428 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 15:20:40,428 INFO L215 NwaCegarLoop]: trace histogram [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] [2024-10-12 15:20:40,429 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-10-12 15:20:40,429 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 15:20:40,429 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 15:20:40,429 INFO L85 PathProgramCache]: Analyzing trace with hash 1508761339, now seen corresponding path program 1 times [2024-10-12 15:20:40,429 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 15:20:40,430 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1275815784] [2024-10-12 15:20:40,430 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 15:20:40,430 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 15:20:40,464 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 15:20:40,701 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 9 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-12 15:20:40,701 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 15:20:40,701 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1275815784] [2024-10-12 15:20:40,703 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1275815784] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 15:20:40,703 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 15:20:40,703 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-12 15:20:40,703 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2052395520] [2024-10-12 15:20:40,703 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 15:20:40,704 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-12 15:20:40,704 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 15:20:40,705 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-12 15:20:40,705 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-12 15:20:40,705 INFO L87 Difference]: Start difference. First operand 1703 states and 2466 transitions. Second operand has 3 states, 3 states have (on average 64.0) internal successors, (192), 2 states have internal predecessors, (192), 0 states have call successors, (0), 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 15:20:41,349 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 15:20:41,350 INFO L93 Difference]: Finished difference Result 4237 states and 6116 transitions. [2024-10-12 15:20:41,350 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-12 15:20:41,350 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 64.0) internal successors, (192), 2 states have internal predecessors, (192), 0 states have call successors, (0), 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 192 [2024-10-12 15:20:41,351 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 15:20:41,357 INFO L225 Difference]: With dead ends: 4237 [2024-10-12 15:20:41,357 INFO L226 Difference]: Without dead ends: 2535 [2024-10-12 15:20:41,360 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 15:20:41,360 INFO L432 NwaCegarLoop]: 93 mSDtfsCounter, 236 mSDsluCounter, 17 mSDsCounter, 0 mSdLazyCounter, 585 mSolverCounterSat, 161 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 236 SdHoareTripleChecker+Valid, 110 SdHoareTripleChecker+Invalid, 746 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 161 IncrementalHoareTripleChecker+Valid, 585 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2024-10-12 15:20:41,361 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [236 Valid, 110 Invalid, 746 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [161 Valid, 585 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2024-10-12 15:20:41,363 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2535 states. [2024-10-12 15:20:41,411 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2535 to 2534. [2024-10-12 15:20:41,414 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2534 states, 2533 states have (on average 1.418476115278326) internal successors, (3593), 2533 states have internal predecessors, (3593), 0 states have call successors, (0), 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 15:20:41,418 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2534 states to 2534 states and 3593 transitions. [2024-10-12 15:20:41,418 INFO L78 Accepts]: Start accepts. Automaton has 2534 states and 3593 transitions. Word has length 192 [2024-10-12 15:20:41,419 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 15:20:41,419 INFO L471 AbstractCegarLoop]: Abstraction has 2534 states and 3593 transitions. [2024-10-12 15:20:41,419 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 64.0) internal successors, (192), 2 states have internal predecessors, (192), 0 states have call successors, (0), 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 15:20:41,419 INFO L276 IsEmpty]: Start isEmpty. Operand 2534 states and 3593 transitions. [2024-10-12 15:20:41,423 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 198 [2024-10-12 15:20:41,423 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 15:20:41,423 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 15:20:41,423 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-10-12 15:20:41,423 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 15:20:41,424 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 15:20:41,424 INFO L85 PathProgramCache]: Analyzing trace with hash -633639545, now seen corresponding path program 1 times [2024-10-12 15:20:41,424 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 15:20:41,424 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1909953627] [2024-10-12 15:20:41,424 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 15:20:41,424 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 15:20:41,469 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 15:20:41,858 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 14 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2024-10-12 15:20:41,858 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 15:20:41,858 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1909953627] [2024-10-12 15:20:41,858 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1909953627] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 15:20:41,858 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 15:20:41,859 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-12 15:20:41,859 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2098353868] [2024-10-12 15:20:41,859 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 15:20:41,859 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-12 15:20:41,859 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 15:20:41,860 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-12 15:20:41,860 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-10-12 15:20:41,860 INFO L87 Difference]: Start difference. First operand 2534 states and 3593 transitions. Second operand has 4 states, 4 states have (on average 48.0) internal successors, (192), 3 states have internal predecessors, (192), 0 states have call successors, (0), 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 15:20:42,607 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 15:20:42,607 INFO L93 Difference]: Finished difference Result 5381 states and 7711 transitions. [2024-10-12 15:20:42,608 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-12 15:20:42,609 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 48.0) internal successors, (192), 3 states have internal predecessors, (192), 0 states have call successors, (0), 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 197 [2024-10-12 15:20:42,609 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 15:20:42,616 INFO L225 Difference]: With dead ends: 5381 [2024-10-12 15:20:42,616 INFO L226 Difference]: Without dead ends: 2500 [2024-10-12 15:20:42,619 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-10-12 15:20:42,620 INFO L432 NwaCegarLoop]: 30 mSDtfsCounter, 332 mSDsluCounter, 14 mSDsCounter, 0 mSdLazyCounter, 801 mSolverCounterSat, 166 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 332 SdHoareTripleChecker+Valid, 44 SdHoareTripleChecker+Invalid, 967 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 166 IncrementalHoareTripleChecker+Valid, 801 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2024-10-12 15:20:42,620 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [332 Valid, 44 Invalid, 967 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [166 Valid, 801 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2024-10-12 15:20:42,622 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2500 states. [2024-10-12 15:20:42,651 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2500 to 2500. [2024-10-12 15:20:42,654 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2500 states, 2499 states have (on average 1.3133253301320529) internal successors, (3282), 2499 states have internal predecessors, (3282), 0 states have call successors, (0), 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 15:20:42,659 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2500 states to 2500 states and 3282 transitions. [2024-10-12 15:20:42,659 INFO L78 Accepts]: Start accepts. Automaton has 2500 states and 3282 transitions. Word has length 197 [2024-10-12 15:20:42,659 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 15:20:42,660 INFO L471 AbstractCegarLoop]: Abstraction has 2500 states and 3282 transitions. [2024-10-12 15:20:42,660 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 48.0) internal successors, (192), 3 states have internal predecessors, (192), 0 states have call successors, (0), 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 15:20:42,660 INFO L276 IsEmpty]: Start isEmpty. Operand 2500 states and 3282 transitions. [2024-10-12 15:20:42,664 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 200 [2024-10-12 15:20:42,665 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 15:20:42,665 INFO L215 NwaCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-12 15:20:42,665 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-10-12 15:20:42,665 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 15:20:42,666 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 15:20:42,666 INFO L85 PathProgramCache]: Analyzing trace with hash 1579357740, now seen corresponding path program 1 times [2024-10-12 15:20:42,666 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 15:20:42,666 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [271304118] [2024-10-12 15:20:42,666 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 15:20:42,666 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 15:20:42,717 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 15:20:42,916 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 16 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2024-10-12 15:20:42,916 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 15:20:42,916 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [271304118] [2024-10-12 15:20:42,916 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [271304118] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 15:20:42,916 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 15:20:42,916 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-12 15:20:42,916 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [983420374] [2024-10-12 15:20:42,916 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 15:20:42,917 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-12 15:20:42,917 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 15:20:42,917 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-12 15:20:42,917 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-12 15:20:42,918 INFO L87 Difference]: Start difference. First operand 2500 states and 3282 transitions. Second operand has 3 states, 3 states have (on average 64.66666666666667) internal successors, (194), 2 states have internal predecessors, (194), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 15:20:43,486 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 15:20:43,487 INFO L93 Difference]: Finished difference Result 7435 states and 9757 transitions. [2024-10-12 15:20:43,487 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-12 15:20:43,487 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 64.66666666666667) internal successors, (194), 2 states have internal predecessors, (194), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 199 [2024-10-12 15:20:43,487 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 15:20:43,499 INFO L225 Difference]: With dead ends: 7435 [2024-10-12 15:20:43,499 INFO L226 Difference]: Without dead ends: 4936 [2024-10-12 15:20:43,503 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 15:20:43,504 INFO L432 NwaCegarLoop]: 105 mSDtfsCounter, 204 mSDsluCounter, 19 mSDsCounter, 0 mSdLazyCounter, 508 mSolverCounterSat, 86 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 204 SdHoareTripleChecker+Valid, 124 SdHoareTripleChecker+Invalid, 594 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 86 IncrementalHoareTripleChecker+Valid, 508 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-10-12 15:20:43,504 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [204 Valid, 124 Invalid, 594 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [86 Valid, 508 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2024-10-12 15:20:43,508 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4936 states. [2024-10-12 15:20:43,556 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4936 to 4936. [2024-10-12 15:20:43,562 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4936 states, 4935 states have (on average 1.2008105369807498) internal successors, (5926), 4935 states have internal predecessors, (5926), 0 states have call successors, (0), 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 15:20:43,569 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4936 states to 4936 states and 5926 transitions. [2024-10-12 15:20:43,570 INFO L78 Accepts]: Start accepts. Automaton has 4936 states and 5926 transitions. Word has length 199 [2024-10-12 15:20:43,570 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 15:20:43,570 INFO L471 AbstractCegarLoop]: Abstraction has 4936 states and 5926 transitions. [2024-10-12 15:20:43,571 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 64.66666666666667) internal successors, (194), 2 states have internal predecessors, (194), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 15:20:43,571 INFO L276 IsEmpty]: Start isEmpty. Operand 4936 states and 5926 transitions. [2024-10-12 15:20:43,577 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 214 [2024-10-12 15:20:43,577 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 15:20:43,577 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 15:20:43,577 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-10-12 15:20:43,577 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 15:20:43,578 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 15:20:43,578 INFO L85 PathProgramCache]: Analyzing trace with hash 15646306, now seen corresponding path program 1 times [2024-10-12 15:20:43,578 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 15:20:43,578 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [635150952] [2024-10-12 15:20:43,578 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 15:20:43,578 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 15:20:43,620 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 15:20:44,037 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 30 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-12 15:20:44,037 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 15:20:44,037 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [635150952] [2024-10-12 15:20:44,037 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [635150952] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 15:20:44,037 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 15:20:44,038 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-12 15:20:44,038 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [278802984] [2024-10-12 15:20:44,038 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 15:20:44,039 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-12 15:20:44,039 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 15:20:44,040 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-12 15:20:44,040 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-10-12 15:20:44,040 INFO L87 Difference]: Start difference. First operand 4936 states and 5926 transitions. Second operand has 4 states, 4 states have (on average 53.25) internal successors, (213), 3 states have internal predecessors, (213), 0 states have call successors, (0), 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 15:20:44,984 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 15:20:44,984 INFO L93 Difference]: Finished difference Result 11282 states and 13608 transitions. [2024-10-12 15:20:44,984 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-12 15:20:44,985 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 53.25) internal successors, (213), 3 states have internal predecessors, (213), 0 states have call successors, (0), 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 213 [2024-10-12 15:20:44,985 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 15:20:44,999 INFO L225 Difference]: With dead ends: 11282 [2024-10-12 15:20:45,000 INFO L226 Difference]: Without dead ends: 6173 [2024-10-12 15:20:45,006 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-10-12 15:20:45,007 INFO L432 NwaCegarLoop]: 87 mSDtfsCounter, 194 mSDsluCounter, 22 mSDsCounter, 0 mSdLazyCounter, 1009 mSolverCounterSat, 143 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 194 SdHoareTripleChecker+Valid, 109 SdHoareTripleChecker+Invalid, 1152 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 143 IncrementalHoareTripleChecker+Valid, 1009 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2024-10-12 15:20:45,008 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [194 Valid, 109 Invalid, 1152 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [143 Valid, 1009 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2024-10-12 15:20:45,014 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6173 states. [2024-10-12 15:20:45,074 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6173 to 6172. [2024-10-12 15:20:45,081 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6172 states, 6171 states have (on average 1.2025603629881705) internal successors, (7421), 6171 states have internal predecessors, (7421), 0 states have call successors, (0), 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 15:20:45,091 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6172 states to 6172 states and 7421 transitions. [2024-10-12 15:20:45,093 INFO L78 Accepts]: Start accepts. Automaton has 6172 states and 7421 transitions. Word has length 213 [2024-10-12 15:20:45,093 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 15:20:45,094 INFO L471 AbstractCegarLoop]: Abstraction has 6172 states and 7421 transitions. [2024-10-12 15:20:45,094 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 53.25) internal successors, (213), 3 states have internal predecessors, (213), 0 states have call successors, (0), 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 15:20:45,094 INFO L276 IsEmpty]: Start isEmpty. Operand 6172 states and 7421 transitions. [2024-10-12 15:20:45,101 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 221 [2024-10-12 15:20:45,102 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 15:20:45,102 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 15:20:45,102 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-10-12 15:20:45,102 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 15:20:45,103 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 15:20:45,103 INFO L85 PathProgramCache]: Analyzing trace with hash -1702191151, now seen corresponding path program 1 times [2024-10-12 15:20:45,103 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 15:20:45,103 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [740851001] [2024-10-12 15:20:45,103 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 15:20:45,104 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 15:20:45,142 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 15:20:45,455 INFO L134 CoverageAnalysis]: Checked inductivity of 43 backedges. 37 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-12 15:20:45,455 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 15:20:45,456 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [740851001] [2024-10-12 15:20:45,456 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [740851001] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-12 15:20:45,456 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [743503389] [2024-10-12 15:20:45,456 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 15:20:45,456 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-12 15:20:45,457 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-12 15:20:45,458 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 15:20:45,459 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 15:20:45,611 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 15:20:45,614 INFO L255 TraceCheckSpWp]: Trace formula consists of 417 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-10-12 15:20:45,626 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-12 15:20:45,895 INFO L134 CoverageAnalysis]: Checked inductivity of 43 backedges. 12 proven. 0 refuted. 0 times theorem prover too weak. 31 trivial. 0 not checked. [2024-10-12 15:20:45,896 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-12 15:20:45,896 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [743503389] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 15:20:45,896 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-10-12 15:20:45,896 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [3] total 5 [2024-10-12 15:20:45,896 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1572246892] [2024-10-12 15:20:45,896 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 15:20:45,897 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-12 15:20:45,897 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 15:20:45,897 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-12 15:20:45,897 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-10-12 15:20:45,897 INFO L87 Difference]: Start difference. First operand 6172 states and 7421 transitions. Second operand has 3 states, 3 states have (on average 63.333333333333336) internal successors, (190), 3 states have internal predecessors, (190), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 15:20:46,425 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 15:20:46,425 INFO L93 Difference]: Finished difference Result 12356 states and 14865 transitions. [2024-10-12 15:20:46,425 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-12 15:20:46,426 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 63.333333333333336) internal successors, (190), 3 states have internal predecessors, (190), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 220 [2024-10-12 15:20:46,426 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 15:20:46,440 INFO L225 Difference]: With dead ends: 12356 [2024-10-12 15:20:46,441 INFO L226 Difference]: Without dead ends: 6185 [2024-10-12 15:20:46,446 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 222 GetRequests, 219 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-10-12 15:20:46,447 INFO L432 NwaCegarLoop]: 295 mSDtfsCounter, 41 mSDsluCounter, 14 mSDsCounter, 0 mSdLazyCounter, 575 mSolverCounterSat, 60 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 41 SdHoareTripleChecker+Valid, 309 SdHoareTripleChecker+Invalid, 635 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 60 IncrementalHoareTripleChecker+Valid, 575 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-10-12 15:20:46,447 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [41 Valid, 309 Invalid, 635 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [60 Valid, 575 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2024-10-12 15:20:46,453 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6185 states. [2024-10-12 15:20:46,509 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6185 to 6172. [2024-10-12 15:20:46,518 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6172 states, 6171 states have (on average 1.1926754172743477) internal successors, (7360), 6171 states have internal predecessors, (7360), 0 states have call successors, (0), 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 15:20:46,527 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6172 states to 6172 states and 7360 transitions. [2024-10-12 15:20:46,527 INFO L78 Accepts]: Start accepts. Automaton has 6172 states and 7360 transitions. Word has length 220 [2024-10-12 15:20:46,528 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 15:20:46,528 INFO L471 AbstractCegarLoop]: Abstraction has 6172 states and 7360 transitions. [2024-10-12 15:20:46,528 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 63.333333333333336) internal successors, (190), 3 states have internal predecessors, (190), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 15:20:46,528 INFO L276 IsEmpty]: Start isEmpty. Operand 6172 states and 7360 transitions. [2024-10-12 15:20:46,536 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 227 [2024-10-12 15:20:46,536 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 15:20:46,537 INFO L215 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 15:20:46,553 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 15:20:46,738 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-12 15:20:46,738 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 15:20:46,740 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 15:20:46,740 INFO L85 PathProgramCache]: Analyzing trace with hash -1388171411, now seen corresponding path program 1 times [2024-10-12 15:20:46,741 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 15:20:46,741 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1832967992] [2024-10-12 15:20:46,741 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 15:20:46,741 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 15:20:46,817 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 15:20:47,038 INFO L134 CoverageAnalysis]: Checked inductivity of 60 backedges. 48 proven. 6 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2024-10-12 15:20:47,039 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 15:20:47,039 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1832967992] [2024-10-12 15:20:47,039 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1832967992] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-12 15:20:47,039 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2111244201] [2024-10-12 15:20:47,039 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 15:20:47,039 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-12 15:20:47,040 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-12 15:20:47,041 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 15:20:47,047 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 15:20:47,164 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 15:20:47,167 INFO L255 TraceCheckSpWp]: Trace formula consists of 460 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-10-12 15:20:47,175 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-12 15:20:47,354 INFO L134 CoverageAnalysis]: Checked inductivity of 60 backedges. 48 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2024-10-12 15:20:47,354 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-12 15:20:47,354 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2111244201] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 15:20:47,355 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-10-12 15:20:47,355 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [3] total 5 [2024-10-12 15:20:47,355 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1202471692] [2024-10-12 15:20:47,355 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 15:20:47,355 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-12 15:20:47,355 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 15:20:47,356 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-12 15:20:47,356 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-10-12 15:20:47,356 INFO L87 Difference]: Start difference. First operand 6172 states and 7360 transitions. Second operand has 3 states, 3 states have (on average 72.0) internal successors, (216), 3 states have internal predecessors, (216), 0 states have call successors, (0), 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 15:20:47,927 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 15:20:47,928 INFO L93 Difference]: Finished difference Result 15594 states and 18914 transitions. [2024-10-12 15:20:47,928 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-12 15:20:47,928 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 72.0) internal successors, (216), 3 states have internal predecessors, (216), 0 states have call successors, (0), 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 226 [2024-10-12 15:20:47,928 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 15:20:47,946 INFO L225 Difference]: With dead ends: 15594 [2024-10-12 15:20:47,946 INFO L226 Difference]: Without dead ends: 9423 [2024-10-12 15:20:47,952 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 228 GetRequests, 225 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-10-12 15:20:47,952 INFO L432 NwaCegarLoop]: 311 mSDtfsCounter, 36 mSDsluCounter, 20 mSDsCounter, 0 mSdLazyCounter, 492 mSolverCounterSat, 105 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 36 SdHoareTripleChecker+Valid, 331 SdHoareTripleChecker+Invalid, 597 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 105 IncrementalHoareTripleChecker+Valid, 492 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-10-12 15:20:47,952 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [36 Valid, 331 Invalid, 597 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [105 Valid, 492 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2024-10-12 15:20:47,965 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9423 states. [2024-10-12 15:20:48,046 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9423 to 9420. [2024-10-12 15:20:48,056 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9420 states, 9419 states have (on average 1.149166578193014) internal successors, (10824), 9419 states have internal predecessors, (10824), 0 states have call successors, (0), 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 15:20:48,065 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9420 states to 9420 states and 10824 transitions. [2024-10-12 15:20:48,066 INFO L78 Accepts]: Start accepts. Automaton has 9420 states and 10824 transitions. Word has length 226 [2024-10-12 15:20:48,066 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 15:20:48,066 INFO L471 AbstractCegarLoop]: Abstraction has 9420 states and 10824 transitions. [2024-10-12 15:20:48,067 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 72.0) internal successors, (216), 3 states have internal predecessors, (216), 0 states have call successors, (0), 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 15:20:48,067 INFO L276 IsEmpty]: Start isEmpty. Operand 9420 states and 10824 transitions. [2024-10-12 15:20:48,078 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 246 [2024-10-12 15:20:48,078 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 15:20:48,078 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] [2024-10-12 15:20:48,093 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2024-10-12 15:20:48,282 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,SelfDestructingSolverStorable9 [2024-10-12 15:20:48,283 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 15:20:48,283 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 15:20:48,283 INFO L85 PathProgramCache]: Analyzing trace with hash -1352179552, now seen corresponding path program 1 times [2024-10-12 15:20:48,283 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 15:20:48,284 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1558073617] [2024-10-12 15:20:48,284 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 15:20:48,285 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 15:20:48,323 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 15:20:48,626 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 15:20:48,626 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 15:20:48,626 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1558073617] [2024-10-12 15:20:48,627 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1558073617] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 15:20:48,627 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 15:20:48,627 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-12 15:20:48,627 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [420844362] [2024-10-12 15:20:48,627 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 15:20:48,627 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-12 15:20:48,627 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 15:20:48,628 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-12 15:20:48,628 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-12 15:20:48,628 INFO L87 Difference]: Start difference. First operand 9420 states and 10824 transitions. Second operand has 3 states, 3 states have (on average 81.66666666666667) internal successors, (245), 2 states have internal predecessors, (245), 0 states have call successors, (0), 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 15:20:49,111 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 15:20:49,111 INFO L93 Difference]: Finished difference Result 22526 states and 25783 transitions. [2024-10-12 15:20:49,111 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-12 15:20:49,111 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 81.66666666666667) internal successors, (245), 2 states have internal predecessors, (245), 0 states have call successors, (0), 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 245 [2024-10-12 15:20:49,111 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 15:20:49,132 INFO L225 Difference]: With dead ends: 22526 [2024-10-12 15:20:49,132 INFO L226 Difference]: Without dead ends: 13107 [2024-10-12 15:20:49,142 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 15:20:49,143 INFO L432 NwaCegarLoop]: 80 mSDtfsCounter, 160 mSDsluCounter, 15 mSDsCounter, 0 mSdLazyCounter, 563 mSolverCounterSat, 29 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 160 SdHoareTripleChecker+Valid, 95 SdHoareTripleChecker+Invalid, 592 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 29 IncrementalHoareTripleChecker+Valid, 563 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-10-12 15:20:49,143 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [160 Valid, 95 Invalid, 592 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [29 Valid, 563 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-10-12 15:20:49,153 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13107 states. [2024-10-12 15:20:49,269 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13107 to 13101. [2024-10-12 15:20:49,282 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 13101 states, 13100 states have (on average 1.1372519083969466) internal successors, (14898), 13100 states have internal predecessors, (14898), 0 states have call successors, (0), 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 15:20:49,297 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13101 states to 13101 states and 14898 transitions. [2024-10-12 15:20:49,297 INFO L78 Accepts]: Start accepts. Automaton has 13101 states and 14898 transitions. Word has length 245 [2024-10-12 15:20:49,298 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 15:20:49,298 INFO L471 AbstractCegarLoop]: Abstraction has 13101 states and 14898 transitions. [2024-10-12 15:20:49,298 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 81.66666666666667) internal successors, (245), 2 states have internal predecessors, (245), 0 states have call successors, (0), 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 15:20:49,298 INFO L276 IsEmpty]: Start isEmpty. Operand 13101 states and 14898 transitions. [2024-10-12 15:20:49,312 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 253 [2024-10-12 15:20:49,312 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 15:20:49,312 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 15:20:49,312 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2024-10-12 15:20:49,312 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 15:20:49,313 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 15:20:49,313 INFO L85 PathProgramCache]: Analyzing trace with hash 1237960207, now seen corresponding path program 1 times [2024-10-12 15:20:49,313 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 15:20:49,313 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1206085828] [2024-10-12 15:20:49,313 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 15:20:49,313 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 15:20:49,402 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 15:20:49,802 INFO L134 CoverageAnalysis]: Checked inductivity of 75 backedges. 75 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-12 15:20:49,802 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 15:20:49,802 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1206085828] [2024-10-12 15:20:49,803 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1206085828] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 15:20:49,803 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 15:20:49,803 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-12 15:20:49,803 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1481657010] [2024-10-12 15:20:49,803 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 15:20:49,804 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-12 15:20:49,804 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 15:20:49,804 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-12 15:20:49,805 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-10-12 15:20:49,805 INFO L87 Difference]: Start difference. First operand 13101 states and 14898 transitions. Second operand has 4 states, 4 states have (on average 63.0) internal successors, (252), 3 states have internal predecessors, (252), 0 states have call successors, (0), 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 15:20:50,538 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 15:20:50,539 INFO L93 Difference]: Finished difference Result 29871 states and 34068 transitions. [2024-10-12 15:20:50,539 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-12 15:20:50,539 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 63.0) internal successors, (252), 3 states have internal predecessors, (252), 0 states have call successors, (0), 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 252 [2024-10-12 15:20:50,539 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 15:20:50,560 INFO L225 Difference]: With dead ends: 29871 [2024-10-12 15:20:50,560 INFO L226 Difference]: Without dead ends: 16771 [2024-10-12 15:20:50,569 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-10-12 15:20:50,570 INFO L432 NwaCegarLoop]: 111 mSDtfsCounter, 500 mSDsluCounter, 20 mSDsCounter, 0 mSdLazyCounter, 819 mSolverCounterSat, 92 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 500 SdHoareTripleChecker+Valid, 131 SdHoareTripleChecker+Invalid, 911 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 92 IncrementalHoareTripleChecker+Valid, 819 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2024-10-12 15:20:50,570 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [500 Valid, 131 Invalid, 911 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [92 Valid, 819 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2024-10-12 15:20:50,581 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16771 states. [2024-10-12 15:20:50,719 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16771 to 16759. [2024-10-12 15:20:50,735 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 16759 states, 16758 states have (on average 1.1253729562000239) internal successors, (18859), 16758 states have internal predecessors, (18859), 0 states have call successors, (0), 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 15:20:50,752 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16759 states to 16759 states and 18859 transitions. [2024-10-12 15:20:50,753 INFO L78 Accepts]: Start accepts. Automaton has 16759 states and 18859 transitions. Word has length 252 [2024-10-12 15:20:50,753 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 15:20:50,753 INFO L471 AbstractCegarLoop]: Abstraction has 16759 states and 18859 transitions. [2024-10-12 15:20:50,753 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 63.0) internal successors, (252), 3 states have internal predecessors, (252), 0 states have call successors, (0), 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 15:20:50,753 INFO L276 IsEmpty]: Start isEmpty. Operand 16759 states and 18859 transitions. [2024-10-12 15:20:50,767 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 271 [2024-10-12 15:20:50,767 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 15:20:50,768 INFO L215 NwaCegarLoop]: trace histogram [5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 15:20:50,768 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2024-10-12 15:20:50,768 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 15:20:50,768 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 15:20:50,769 INFO L85 PathProgramCache]: Analyzing trace with hash 1554505730, now seen corresponding path program 1 times [2024-10-12 15:20:50,769 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 15:20:50,769 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1023504737] [2024-10-12 15:20:50,769 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 15:20:50,769 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 15:20:50,806 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 15:20:51,045 INFO L134 CoverageAnalysis]: Checked inductivity of 157 backedges. 86 proven. 6 refuted. 0 times theorem prover too weak. 65 trivial. 0 not checked. [2024-10-12 15:20:51,045 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 15:20:51,045 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1023504737] [2024-10-12 15:20:51,046 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1023504737] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-12 15:20:51,046 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [558658938] [2024-10-12 15:20:51,046 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 15:20:51,046 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-12 15:20:51,046 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-12 15:20:51,048 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 15:20:51,049 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 15:20:51,214 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 15:20:51,217 INFO L255 TraceCheckSpWp]: Trace formula consists of 542 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-10-12 15:20:51,220 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-12 15:20:51,403 INFO L134 CoverageAnalysis]: Checked inductivity of 157 backedges. 87 proven. 0 refuted. 0 times theorem prover too weak. 70 trivial. 0 not checked. [2024-10-12 15:20:51,403 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-12 15:20:51,403 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [558658938] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 15:20:51,403 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-10-12 15:20:51,403 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [3] total 5 [2024-10-12 15:20:51,403 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1212700877] [2024-10-12 15:20:51,403 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 15:20:51,404 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-12 15:20:51,404 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 15:20:51,404 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-12 15:20:51,404 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-10-12 15:20:51,404 INFO L87 Difference]: Start difference. First operand 16759 states and 18859 transitions. Second operand has 3 states, 3 states have (on average 75.66666666666667) internal successors, (227), 3 states have internal predecessors, (227), 0 states have call successors, (0), 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 15:20:51,922 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 15:20:51,922 INFO L93 Difference]: Finished difference Result 47753 states and 53740 transitions. [2024-10-12 15:20:51,922 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-12 15:20:51,923 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 75.66666666666667) internal successors, (227), 3 states have internal predecessors, (227), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 270 [2024-10-12 15:20:51,923 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 15:20:51,969 INFO L225 Difference]: With dead ends: 47753 [2024-10-12 15:20:51,970 INFO L226 Difference]: Without dead ends: 31401 [2024-10-12 15:20:51,987 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 272 GetRequests, 269 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-10-12 15:20:51,988 INFO L432 NwaCegarLoop]: 119 mSDtfsCounter, 58 mSDsluCounter, 19 mSDsCounter, 0 mSdLazyCounter, 555 mSolverCounterSat, 58 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 58 SdHoareTripleChecker+Valid, 138 SdHoareTripleChecker+Invalid, 613 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 58 IncrementalHoareTripleChecker+Valid, 555 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-10-12 15:20:51,988 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [58 Valid, 138 Invalid, 613 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [58 Valid, 555 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-10-12 15:20:52,010 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31401 states. [2024-10-12 15:20:52,249 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31401 to 30789. [2024-10-12 15:20:52,272 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 30789 states, 30788 states have (on average 1.1113096011433026) internal successors, (34215), 30788 states have internal predecessors, (34215), 0 states have call successors, (0), 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 15:20:52,433 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30789 states to 30789 states and 34215 transitions. [2024-10-12 15:20:52,434 INFO L78 Accepts]: Start accepts. Automaton has 30789 states and 34215 transitions. Word has length 270 [2024-10-12 15:20:52,434 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 15:20:52,434 INFO L471 AbstractCegarLoop]: Abstraction has 30789 states and 34215 transitions. [2024-10-12 15:20:52,435 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 75.66666666666667) internal successors, (227), 3 states have internal predecessors, (227), 0 states have call successors, (0), 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 15:20:52,435 INFO L276 IsEmpty]: Start isEmpty. Operand 30789 states and 34215 transitions. [2024-10-12 15:20:52,457 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 279 [2024-10-12 15:20:52,457 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 15:20:52,457 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, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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 15:20:52,474 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2024-10-12 15:20:52,658 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-12 15:20:52,659 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 15:20:52,659 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 15:20:52,659 INFO L85 PathProgramCache]: Analyzing trace with hash 306345184, now seen corresponding path program 1 times [2024-10-12 15:20:52,659 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 15:20:52,659 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [760294391] [2024-10-12 15:20:52,660 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 15:20:52,660 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 15:20:52,801 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 15:20:54,001 INFO L134 CoverageAnalysis]: Checked inductivity of 95 backedges. 30 proven. 65 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-12 15:20:54,002 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 15:20:54,002 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [760294391] [2024-10-12 15:20:54,002 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [760294391] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-12 15:20:54,002 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1080952923] [2024-10-12 15:20:54,002 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 15:20:54,002 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-12 15:20:54,002 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-12 15:20:54,004 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 15:20:54,006 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 15:20:54,136 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 15:20:54,139 INFO L255 TraceCheckSpWp]: Trace formula consists of 440 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-10-12 15:20:54,142 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-12 15:20:54,317 INFO L134 CoverageAnalysis]: Checked inductivity of 95 backedges. 95 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-12 15:20:54,317 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-12 15:20:54,317 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1080952923] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 15:20:54,317 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-10-12 15:20:54,317 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [5] total 6 [2024-10-12 15:20:54,317 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1148026328] [2024-10-12 15:20:54,318 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 15:20:54,318 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-12 15:20:54,318 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 15:20:54,319 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-12 15:20:54,319 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2024-10-12 15:20:54,319 INFO L87 Difference]: Start difference. First operand 30789 states and 34215 transitions. Second operand has 3 states, 3 states have (on average 92.66666666666667) internal successors, (278), 3 states have internal predecessors, (278), 0 states have call successors, (0), 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 15:20:55,052 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 15:20:55,052 INFO L93 Difference]: Finished difference Result 64623 states and 72300 transitions. [2024-10-12 15:20:55,053 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-12 15:20:55,053 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 92.66666666666667) internal successors, (278), 3 states have internal predecessors, (278), 0 states have call successors, (0), 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 278 [2024-10-12 15:20:55,054 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 15:20:55,110 INFO L225 Difference]: With dead ends: 64623 [2024-10-12 15:20:55,110 INFO L226 Difference]: Without dead ends: 34242 [2024-10-12 15:20:55,127 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 282 GetRequests, 278 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2024-10-12 15:20:55,127 INFO L432 NwaCegarLoop]: 270 mSDtfsCounter, 81 mSDsluCounter, 8 mSDsCounter, 0 mSdLazyCounter, 553 mSolverCounterSat, 52 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 81 SdHoareTripleChecker+Valid, 278 SdHoareTripleChecker+Invalid, 605 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 52 IncrementalHoareTripleChecker+Valid, 553 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-10-12 15:20:55,127 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [81 Valid, 278 Invalid, 605 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [52 Valid, 553 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2024-10-12 15:20:55,151 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34242 states. [2024-10-12 15:20:55,426 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34242 to 34239. [2024-10-12 15:20:55,453 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 34239 states, 34238 states have (on average 1.1163911443425434) internal successors, (38223), 34238 states have internal predecessors, (38223), 0 states have call successors, (0), 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 15:20:55,491 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34239 states to 34239 states and 38223 transitions. [2024-10-12 15:20:55,492 INFO L78 Accepts]: Start accepts. Automaton has 34239 states and 38223 transitions. Word has length 278 [2024-10-12 15:20:55,493 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 15:20:55,493 INFO L471 AbstractCegarLoop]: Abstraction has 34239 states and 38223 transitions. [2024-10-12 15:20:55,493 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 92.66666666666667) internal successors, (278), 3 states have internal predecessors, (278), 0 states have call successors, (0), 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 15:20:55,493 INFO L276 IsEmpty]: Start isEmpty. Operand 34239 states and 38223 transitions. [2024-10-12 15:20:55,512 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 287 [2024-10-12 15:20:55,513 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 15:20:55,513 INFO L215 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 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] [2024-10-12 15:20:55,526 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2024-10-12 15:20:55,717 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-12 15:20:55,718 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 15:20:55,718 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 15:20:55,718 INFO L85 PathProgramCache]: Analyzing trace with hash 1532976710, now seen corresponding path program 1 times [2024-10-12 15:20:55,718 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 15:20:55,718 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1192024364] [2024-10-12 15:20:55,718 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 15:20:55,719 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 15:20:55,757 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 15:20:56,073 INFO L134 CoverageAnalysis]: Checked inductivity of 149 backedges. 86 proven. 0 refuted. 0 times theorem prover too weak. 63 trivial. 0 not checked. [2024-10-12 15:20:56,073 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 15:20:56,073 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1192024364] [2024-10-12 15:20:56,073 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1192024364] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 15:20:56,073 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 15:20:56,073 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-12 15:20:56,073 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1590157632] [2024-10-12 15:20:56,074 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 15:20:56,074 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-12 15:20:56,074 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 15:20:56,074 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-12 15:20:56,075 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-10-12 15:20:56,075 INFO L87 Difference]: Start difference. First operand 34239 states and 38223 transitions. Second operand has 4 states, 4 states have (on average 56.0) internal successors, (224), 3 states have internal predecessors, (224), 0 states have call successors, (0), 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 15:20:57,012 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 15:20:57,012 INFO L93 Difference]: Finished difference Result 112583 states and 125844 transitions. [2024-10-12 15:20:57,012 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-12 15:20:57,013 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 56.0) internal successors, (224), 3 states have internal predecessors, (224), 0 states have call successors, (0), 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 286 [2024-10-12 15:20:57,013 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 15:20:57,114 INFO L225 Difference]: With dead ends: 112583 [2024-10-12 15:20:57,114 INFO L226 Difference]: Without dead ends: 78753 [2024-10-12 15:20:57,158 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-10-12 15:20:57,159 INFO L432 NwaCegarLoop]: 78 mSDtfsCounter, 467 mSDsluCounter, 238 mSDsCounter, 0 mSdLazyCounter, 685 mSolverCounterSat, 90 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 467 SdHoareTripleChecker+Valid, 316 SdHoareTripleChecker+Invalid, 775 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 90 IncrementalHoareTripleChecker+Valid, 685 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2024-10-12 15:20:57,159 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [467 Valid, 316 Invalid, 775 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [90 Valid, 685 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2024-10-12 15:20:57,233 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 78753 states. [2024-10-12 15:20:58,164 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 78753 to 69985. [2024-10-12 15:20:58,213 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 69985 states, 69984 states have (on average 1.1139974851394605) internal successors, (77962), 69984 states have internal predecessors, (77962), 0 states have call successors, (0), 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 15:20:58,309 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 69985 states to 69985 states and 77962 transitions. [2024-10-12 15:20:58,310 INFO L78 Accepts]: Start accepts. Automaton has 69985 states and 77962 transitions. Word has length 286 [2024-10-12 15:20:58,311 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 15:20:58,311 INFO L471 AbstractCegarLoop]: Abstraction has 69985 states and 77962 transitions. [2024-10-12 15:20:58,311 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 56.0) internal successors, (224), 3 states have internal predecessors, (224), 0 states have call successors, (0), 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 15:20:58,311 INFO L276 IsEmpty]: Start isEmpty. Operand 69985 states and 77962 transitions. [2024-10-12 15:20:58,357 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 320 [2024-10-12 15:20:58,357 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 15:20:58,357 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 15:20:58,357 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2024-10-12 15:20:58,358 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 15:20:58,358 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 15:20:58,358 INFO L85 PathProgramCache]: Analyzing trace with hash 603235820, now seen corresponding path program 1 times [2024-10-12 15:20:58,358 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 15:20:58,358 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1217761482] [2024-10-12 15:20:58,358 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 15:20:58,358 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 15:20:58,572 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 15:20:59,080 INFO L134 CoverageAnalysis]: Checked inductivity of 198 backedges. 135 proven. 0 refuted. 0 times theorem prover too weak. 63 trivial. 0 not checked. [2024-10-12 15:20:59,081 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 15:20:59,081 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1217761482] [2024-10-12 15:20:59,082 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1217761482] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 15:20:59,082 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 15:20:59,082 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-12 15:20:59,082 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [873318886] [2024-10-12 15:20:59,082 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 15:20:59,083 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-12 15:20:59,083 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 15:20:59,083 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-12 15:20:59,083 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-12 15:20:59,083 INFO L87 Difference]: Start difference. First operand 69985 states and 77962 transitions. Second operand has 3 states, 3 states have (on average 85.66666666666667) internal successors, (257), 2 states have internal predecessors, (257), 0 states have call successors, (0), 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 15:20:59,724 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 15:20:59,724 INFO L93 Difference]: Finished difference Result 140172 states and 156137 transitions. [2024-10-12 15:20:59,725 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-12 15:20:59,725 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 85.66666666666667) internal successors, (257), 2 states have internal predecessors, (257), 0 states have call successors, (0), 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 319 [2024-10-12 15:20:59,725 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 15:20:59,799 INFO L225 Difference]: With dead ends: 140172 [2024-10-12 15:20:59,799 INFO L226 Difference]: Without dead ends: 70596 [2024-10-12 15:20:59,842 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 15:20:59,842 INFO L432 NwaCegarLoop]: 110 mSDtfsCounter, 133 mSDsluCounter, 18 mSDsCounter, 0 mSdLazyCounter, 517 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 133 SdHoareTripleChecker+Valid, 128 SdHoareTripleChecker+Invalid, 518 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 517 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-10-12 15:20:59,843 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [133 Valid, 128 Invalid, 518 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 517 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-10-12 15:20:59,894 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 70596 states. [2024-10-12 15:21:00,793 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 70596 to 70594. [2024-10-12 15:21:00,847 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 70594 states, 70593 states have (on average 1.1133256838496735) internal successors, (78593), 70593 states have internal predecessors, (78593), 0 states have call successors, (0), 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 15:21:00,952 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 70594 states to 70594 states and 78593 transitions. [2024-10-12 15:21:00,953 INFO L78 Accepts]: Start accepts. Automaton has 70594 states and 78593 transitions. Word has length 319 [2024-10-12 15:21:00,954 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 15:21:00,954 INFO L471 AbstractCegarLoop]: Abstraction has 70594 states and 78593 transitions. [2024-10-12 15:21:00,954 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 85.66666666666667) internal successors, (257), 2 states have internal predecessors, (257), 0 states have call successors, (0), 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 15:21:00,954 INFO L276 IsEmpty]: Start isEmpty. Operand 70594 states and 78593 transitions. [2024-10-12 15:21:00,999 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 321 [2024-10-12 15:21:00,999 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 15:21:00,999 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, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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 15:21:00,999 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2024-10-12 15:21:00,999 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 15:21:01,000 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 15:21:01,000 INFO L85 PathProgramCache]: Analyzing trace with hash 1193407677, now seen corresponding path program 1 times [2024-10-12 15:21:01,000 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 15:21:01,000 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [832489332] [2024-10-12 15:21:01,000 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 15:21:01,000 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 15:21:01,076 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 15:21:01,729 INFO L134 CoverageAnalysis]: Checked inductivity of 178 backedges. 137 proven. 41 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-12 15:21:01,729 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 15:21:01,730 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [832489332] [2024-10-12 15:21:01,730 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [832489332] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-12 15:21:01,730 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1958560276] [2024-10-12 15:21:01,730 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 15:21:01,730 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-12 15:21:01,730 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-12 15:21:01,732 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-12 15:21:01,733 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2024-10-12 15:21:01,883 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 15:21:01,885 INFO L255 TraceCheckSpWp]: Trace formula consists of 516 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-10-12 15:21:01,889 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-12 15:21:02,041 INFO L134 CoverageAnalysis]: Checked inductivity of 178 backedges. 178 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-12 15:21:02,041 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-12 15:21:02,041 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1958560276] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 15:21:02,041 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-10-12 15:21:02,041 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [3] total 5 [2024-10-12 15:21:02,042 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1163432159] [2024-10-12 15:21:02,042 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 15:21:02,042 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-12 15:21:02,042 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 15:21:02,043 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-12 15:21:02,043 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-10-12 15:21:02,043 INFO L87 Difference]: Start difference. First operand 70594 states and 78593 transitions. Second operand has 3 states, 3 states have (on average 106.66666666666667) internal successors, (320), 3 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 15:21:02,682 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 15:21:02,683 INFO L93 Difference]: Finished difference Result 127147 states and 141042 transitions. [2024-10-12 15:21:02,683 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-12 15:21:02,683 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 106.66666666666667) internal successors, (320), 3 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 320 [2024-10-12 15:21:02,683 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 15:21:02,764 INFO L225 Difference]: With dead ends: 127147 [2024-10-12 15:21:02,764 INFO L226 Difference]: Without dead ends: 57571 [2024-10-12 15:21:02,805 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 322 GetRequests, 319 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-10-12 15:21:02,806 INFO L432 NwaCegarLoop]: 277 mSDtfsCounter, 200 mSDsluCounter, 19 mSDsCounter, 0 mSdLazyCounter, 532 mSolverCounterSat, 48 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 200 SdHoareTripleChecker+Valid, 296 SdHoareTripleChecker+Invalid, 580 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 48 IncrementalHoareTripleChecker+Valid, 532 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-10-12 15:21:02,806 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [200 Valid, 296 Invalid, 580 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [48 Valid, 532 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-10-12 15:21:02,845 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 57571 states. [2024-10-12 15:21:03,359 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 57571 to 57361. [2024-10-12 15:21:03,399 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 57361 states, 57360 states have (on average 1.0941073919107391) internal successors, (62758), 57360 states have internal predecessors, (62758), 0 states have call successors, (0), 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 15:21:03,459 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 57361 states to 57361 states and 62758 transitions. [2024-10-12 15:21:03,461 INFO L78 Accepts]: Start accepts. Automaton has 57361 states and 62758 transitions. Word has length 320 [2024-10-12 15:21:03,461 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 15:21:03,461 INFO L471 AbstractCegarLoop]: Abstraction has 57361 states and 62758 transitions. [2024-10-12 15:21:03,461 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 106.66666666666667) internal successors, (320), 3 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 15:21:03,461 INFO L276 IsEmpty]: Start isEmpty. Operand 57361 states and 62758 transitions. [2024-10-12 15:21:03,486 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 322 [2024-10-12 15:21:03,486 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 15:21:03,486 INFO L215 NwaCegarLoop]: trace histogram [5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 15:21:03,500 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Ended with exit code 0 [2024-10-12 15:21:03,687 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable16 [2024-10-12 15:21:03,687 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 15:21:03,688 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 15:21:03,688 INFO L85 PathProgramCache]: Analyzing trace with hash 553717054, now seen corresponding path program 1 times [2024-10-12 15:21:03,688 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 15:21:03,688 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [411774972] [2024-10-12 15:21:03,688 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 15:21:03,688 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 15:21:03,725 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 15:21:04,275 INFO L134 CoverageAnalysis]: Checked inductivity of 253 backedges. 102 proven. 6 refuted. 0 times theorem prover too weak. 145 trivial. 0 not checked. [2024-10-12 15:21:04,276 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 15:21:04,276 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [411774972] [2024-10-12 15:21:04,276 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [411774972] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-12 15:21:04,276 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2083370208] [2024-10-12 15:21:04,276 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 15:21:04,277 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-12 15:21:04,277 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-12 15:21:04,278 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-12 15:21:04,279 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2024-10-12 15:21:04,447 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 15:21:04,449 INFO L255 TraceCheckSpWp]: Trace formula consists of 588 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-10-12 15:21:04,454 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-12 15:21:04,591 INFO L134 CoverageAnalysis]: Checked inductivity of 253 backedges. 138 proven. 0 refuted. 0 times theorem prover too weak. 115 trivial. 0 not checked. [2024-10-12 15:21:04,591 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-12 15:21:04,592 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2083370208] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 15:21:04,592 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-10-12 15:21:04,592 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [3] total 5 [2024-10-12 15:21:04,592 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [456275246] [2024-10-12 15:21:04,592 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 15:21:04,593 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-12 15:21:04,593 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 15:21:04,593 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-12 15:21:04,593 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-10-12 15:21:04,594 INFO L87 Difference]: Start difference. First operand 57361 states and 62758 transitions. Second operand has 3 states, 3 states have (on average 83.0) internal successors, (249), 3 states have internal predecessors, (249), 0 states have call successors, (0), 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 15:21:05,398 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 15:21:05,398 INFO L93 Difference]: Finished difference Result 130989 states and 143628 transitions. [2024-10-12 15:21:05,399 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-12 15:21:05,399 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 83.0) internal successors, (249), 3 states have internal predecessors, (249), 0 states have call successors, (0), 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 321 [2024-10-12 15:21:05,399 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 15:21:05,401 INFO L225 Difference]: With dead ends: 130989 [2024-10-12 15:21:05,401 INFO L226 Difference]: Without dead ends: 0 [2024-10-12 15:21:05,435 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 323 GetRequests, 320 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-10-12 15:21:05,436 INFO L432 NwaCegarLoop]: 314 mSDtfsCounter, 46 mSDsluCounter, 23 mSDsCounter, 0 mSdLazyCounter, 498 mSolverCounterSat, 99 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 46 SdHoareTripleChecker+Valid, 337 SdHoareTripleChecker+Invalid, 597 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 99 IncrementalHoareTripleChecker+Valid, 498 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-10-12 15:21:05,436 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [46 Valid, 337 Invalid, 597 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [99 Valid, 498 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-10-12 15:21:05,436 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2024-10-12 15:21:05,436 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2024-10-12 15:21:05,437 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 15:21:05,437 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2024-10-12 15:21:05,437 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 321 [2024-10-12 15:21:05,437 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 15:21:05,438 INFO L471 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2024-10-12 15:21:05,438 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 83.0) internal successors, (249), 3 states have internal predecessors, (249), 0 states have call successors, (0), 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 15:21:05,438 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2024-10-12 15:21:05,438 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2024-10-12 15:21:05,440 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2024-10-12 15:21:05,453 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Ended with exit code 0 [2024-10-12 15:21:05,640 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable17 [2024-10-12 15:21:05,643 INFO L407 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-12 15:21:05,646 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2024-10-12 15:21:09,879 INFO L165 ceAbstractionStarter]: Computing trace abstraction results [2024-10-12 15:21:09,896 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 12.10 03:21:09 BoogieIcfgContainer [2024-10-12 15:21:09,896 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-10-12 15:21:09,897 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-10-12 15:21:09,897 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-10-12 15:21:09,897 INFO L274 PluginConnector]: Witness Printer initialized [2024-10-12 15:21:09,897 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.10 03:20:36" (3/4) ... [2024-10-12 15:21:09,899 INFO L139 WitnessPrinter]: Generating witness for correct program [2024-10-12 15:21:09,926 INFO L904 BoogieBacktranslator]: Reduced CFG by removing 12 nodes and edges [2024-10-12 15:21:09,928 INFO L904 BoogieBacktranslator]: Reduced CFG by removing 4 nodes and edges [2024-10-12 15:21:09,930 INFO L904 BoogieBacktranslator]: Reduced CFG by removing 3 nodes and edges [2024-10-12 15:21:09,932 INFO L904 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2024-10-12 15:21:10,116 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2024-10-12 15:21:10,118 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.yml [2024-10-12 15:21:10,118 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-10-12 15:21:10,119 INFO L158 Benchmark]: Toolchain (without parser) took 36309.47ms. Allocated memory was 182.5MB in the beginning and 11.2GB in the end (delta: 11.0GB). Free memory was 109.9MB in the beginning and 9.1GB in the end (delta: -9.0GB). Peak memory consumption was 2.0GB. Max. memory is 16.1GB. [2024-10-12 15:21:10,119 INFO L158 Benchmark]: CDTParser took 0.08ms. Allocated memory is still 104.9MB. Free memory is still 67.4MB. There was no memory consumed. Max. memory is 16.1GB. [2024-10-12 15:21:10,119 INFO L158 Benchmark]: CACSL2BoogieTranslator took 699.66ms. Allocated memory is still 182.5MB. Free memory was 109.7MB in the beginning and 100.6MB in the end (delta: 9.1MB). Peak memory consumption was 14.8MB. Max. memory is 16.1GB. [2024-10-12 15:21:10,120 INFO L158 Benchmark]: Boogie Procedure Inliner took 118.79ms. Allocated memory is still 182.5MB. Free memory was 100.6MB in the beginning and 86.0MB in the end (delta: 14.6MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB. [2024-10-12 15:21:10,120 INFO L158 Benchmark]: Boogie Preprocessor took 121.74ms. Allocated memory is still 182.5MB. Free memory was 86.0MB in the beginning and 73.4MB in the end (delta: 12.6MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. [2024-10-12 15:21:10,121 INFO L158 Benchmark]: RCFGBuilder took 1721.15ms. Allocated memory was 182.5MB in the beginning and 272.6MB in the end (delta: 90.2MB). Free memory was 73.4MB in the beginning and 166.5MB in the end (delta: -93.1MB). Peak memory consumption was 49.7MB. Max. memory is 16.1GB. [2024-10-12 15:21:10,121 INFO L158 Benchmark]: TraceAbstraction took 33419.02ms. Allocated memory was 272.6MB in the beginning and 11.2GB in the end (delta: 10.9GB). Free memory was 166.5MB in the beginning and 9.2GB in the end (delta: -9.0GB). Peak memory consumption was 2.0GB. Max. memory is 16.1GB. [2024-10-12 15:21:10,123 INFO L158 Benchmark]: Witness Printer took 221.44ms. Allocated memory is still 11.2GB. Free memory was 9.2GB in the beginning and 9.1GB in the end (delta: 26.2MB). Peak memory consumption was 27.3MB. Max. memory is 16.1GB. [2024-10-12 15:21:10,125 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.08ms. Allocated memory is still 104.9MB. Free memory is still 67.4MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 699.66ms. Allocated memory is still 182.5MB. Free memory was 109.7MB in the beginning and 100.6MB in the end (delta: 9.1MB). Peak memory consumption was 14.8MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 118.79ms. Allocated memory is still 182.5MB. Free memory was 100.6MB in the beginning and 86.0MB in the end (delta: 14.6MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB. * Boogie Preprocessor took 121.74ms. Allocated memory is still 182.5MB. Free memory was 86.0MB in the beginning and 73.4MB in the end (delta: 12.6MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. * RCFGBuilder took 1721.15ms. Allocated memory was 182.5MB in the beginning and 272.6MB in the end (delta: 90.2MB). Free memory was 73.4MB in the beginning and 166.5MB in the end (delta: -93.1MB). Peak memory consumption was 49.7MB. Max. memory is 16.1GB. * TraceAbstraction took 33419.02ms. Allocated memory was 272.6MB in the beginning and 11.2GB in the end (delta: 10.9GB). Free memory was 166.5MB in the beginning and 9.2GB in the end (delta: -9.0GB). Peak memory consumption was 2.0GB. Max. memory is 16.1GB. * Witness Printer took 221.44ms. Allocated memory is still 11.2GB. Free memory was 9.2GB in the beginning and 9.1GB in the end (delta: 26.2MB). Peak memory consumption was 27.3MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - PositiveResult [Line: 1594]: 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, 240 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 29.1s, OverallIterations: 18, TraceHistogramMax: 5, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.3s, AutomataDifference: 12.5s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 3281 SdHoareTripleChecker+Valid, 9.4s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 3281 mSDsluCounter, 3491 SdHoareTripleChecker+Invalid, 7.8s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 545 mSDsCounter, 1562 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 10519 IncrementalHoareTripleChecker+Invalid, 12081 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 1562 mSolverCounterUnsat, 2946 mSDtfsCounter, 10519 mSolverCounterSat, 0.1s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 1677 GetRequests, 1643 SyntacticMatches, 0 SemanticMatches, 34 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.2s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=70594occurred in iteration=16, InterpolantAutomatonStates: 57, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 4.6s AutomataMinimizationTime, 18 MinimizatonAttempts, 9658 StatesRemovedByMinimization, 14 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.5s SsaConstructionTime, 0.8s SatisfiabilityAnalysisTime, 8.1s InterpolantComputationTime, 5918 NumberOfCodeBlocks, 5918 NumberOfCodeBlocksAsserted, 24 NumberOfCheckSat, 5894 ConstructedInterpolants, 0 QuantifiedInterpolants, 24232 SizeOfPredicates, 0 NumberOfNonLiveVariables, 2963 ConjunctsInSsa, 14 ConjunctsInUnsatCore, 24 InterpolantComputations, 18 PerfectInterpolantSequences, 2022/2152 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available - AllSpecificationsHoldResult: All specifications hold 1 specifications checked. All of them hold - InvariantResult [Line: 1668]: Loop Invariant Derived loop invariant: ((((((((((((((((((((((a26 == 1) && (a5 == 1)) && (a12 == 1)) && (a11 == 1)) && (a27 == 1)) && (a18 == 1)) || ((((((a5 == 1) && (a29 == 1)) && (a12 == 0)) && (a11 != 1)) && (a18 == 1)) && (a27 <= 0))) || (((((a26 == 1) && (a5 == 1)) && (a12 == 0)) && (a18 == 1)) && (a27 <= 0))) || (((((a5 == 1) && (a3 <= 0)) && (a12 == 0)) && (a27 == 1)) && (a18 == 1))) || (((((a5 == 1) && (a12 == 1)) && (2 <= a3)) && (a27 == 1)) && (a18 == 1))) || (((((a5 == 1) && (2 <= a3)) && (a12 == 0)) && (a27 == 1)) && (a18 == 1))) || (((((a5 == 1) && (a12 == 0)) && (a27 == 1)) && (a18 == 1)) && (a6 <= 0))) || (((((a5 == 1) && (a11 == 0)) && (a12 == 0)) && (a27 == 1)) && (a18 == 1))) || (((((a5 == 1) && (a11 == 0)) && (a12 == 0)) && (a18 == 1)) && (a27 <= 0))) || (((((a26 == 1) && (a5 == 1)) && (a12 == 0)) && (a27 == 1)) && (a18 == 1))) || ((((((a5 == 1) && (a29 == 1)) && (a12 == 0)) && (a27 == 1)) && (a11 != 1)) && (a18 == 1))) || ((((a5 == 1) && (a12 == 1)) && (a18 == 1)) && (a27 <= 0))) || ((((((a26 == 1) && (a5 == 1)) && (a12 == 1)) && (a29 == 1)) && (a27 == 1)) && (a18 == 1))) || (((((a5 == 1) && (2 <= a3)) && (a12 == 0)) && (a18 == 1)) && (a27 <= 0))) || ((((((a26 == 1) && (a5 == 1)) && (a12 == 1)) && (a11 == 0)) && (a27 == 1)) && (a18 == 1))) || (((((a5 == 1) && (a12 == 0)) && (a18 == 1)) && (a27 <= 0)) && (a6 <= 0))) || (((((a5 == 1) && (a12 == 1)) && (a3 <= 0)) && (a27 == 1)) && (a18 == 1))) RESULT: Ultimate proved your program to be correct! [2024-10-12 15:21:10,155 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Ended with exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Result: TRUE