./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/eca-rers2012/Problem13_label22.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version c7c6ca5d Calling Ultimate with: /root/.sdkman/candidates/java/11.0.12-open/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/eca-rers2012/Problem13_label22.c -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash a5646bd4d96b8fcc9e551b79d403a795dc3f85c7ce3ca7ca69beb4234714a055 --- Real Ultimate output --- This is Ultimate 0.2.5-?-c7c6ca5-m [2024-11-08 11:20:53,850 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-08 11:20:53,914 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-11-08 11:20:53,917 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-08 11:20:53,918 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-08 11:20:53,942 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-08 11:20:53,944 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-08 11:20:53,944 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-08 11:20:53,945 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-08 11:20:53,947 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-08 11:20:53,947 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-08 11:20:53,947 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-08 11:20:53,948 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-08 11:20:53,949 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-08 11:20:53,949 INFO L153 SettingsManager]: * Use SBE=true [2024-11-08 11:20:53,950 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-08 11:20:53,950 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-08 11:20:53,950 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-08 11:20:53,950 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-08 11:20:53,950 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-08 11:20:53,951 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-08 11:20:53,953 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-08 11:20:53,953 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-08 11:20:53,953 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-08 11:20:53,953 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-08 11:20:53,953 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-08 11:20:53,954 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-08 11:20:53,954 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-08 11:20:53,954 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-08 11:20:53,954 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-08 11:20:53,954 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-08 11:20:53,954 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-08 11:20:53,954 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-08 11:20:53,955 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-08 11:20:53,955 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-08 11:20:53,955 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-08 11:20:53,955 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-08 11:20:53,955 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-08 11:20:53,955 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-08 11:20:53,956 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-08 11:20:53,956 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-08 11:20:53,958 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-08 11:20:53,958 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 -> a5646bd4d96b8fcc9e551b79d403a795dc3f85c7ce3ca7ca69beb4234714a055 [2024-11-08 11:20:54,164 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-08 11:20:54,183 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-08 11:20:54,185 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-08 11:20:54,186 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-08 11:20:54,186 INFO L274 PluginConnector]: CDTParser initialized [2024-11-08 11:20:54,187 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/eca-rers2012/Problem13_label22.c [2024-11-08 11:20:55,527 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-08 11:20:55,961 INFO L384 CDTParser]: Found 1 translation units. [2024-11-08 11:20:55,965 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/eca-rers2012/Problem13_label22.c [2024-11-08 11:20:55,990 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/6e1766b78/782a4ddd89474055a9de58607fd09349/FLAGaceb41999 [2024-11-08 11:20:56,004 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/6e1766b78/782a4ddd89474055a9de58607fd09349 [2024-11-08 11:20:56,007 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-08 11:20:56,008 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-08 11:20:56,009 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-08 11:20:56,010 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-08 11:20:56,020 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-08 11:20:56,021 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.11 11:20:56" (1/1) ... [2024-11-08 11:20:56,023 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6de5912d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 11:20:56, skipping insertion in model container [2024-11-08 11:20:56,023 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.11 11:20:56" (1/1) ... [2024-11-08 11:20:56,097 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-08 11:20:56,273 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/eca-rers2012/Problem13_label22.c[4777,4790] [2024-11-08 11:20:56,919 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-08 11:20:56,929 INFO L200 MainTranslator]: Completed pre-run [2024-11-08 11:20:56,944 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/eca-rers2012/Problem13_label22.c[4777,4790] [2024-11-08 11:20:57,361 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-08 11:20:57,381 INFO L204 MainTranslator]: Completed translation [2024-11-08 11:20:57,382 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 11:20:57 WrapperNode [2024-11-08 11:20:57,382 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-08 11:20:57,383 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-08 11:20:57,383 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-08 11:20:57,383 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-08 11:20:57,388 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 11:20:57" (1/1) ... [2024-11-08 11:20:57,435 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 11:20:57" (1/1) ... [2024-11-08 11:20:57,830 INFO L138 Inliner]: procedures = 17, calls = 11, calls flagged for inlining = 6, calls inlined = 6, statements flattened = 5587 [2024-11-08 11:20:57,830 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-08 11:20:57,831 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-08 11:20:57,831 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-08 11:20:57,832 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-08 11:20:57,840 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 11:20:57" (1/1) ... [2024-11-08 11:20:57,841 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 11:20:57" (1/1) ... [2024-11-08 11:20:57,977 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 11:20:57" (1/1) ... [2024-11-08 11:20:58,135 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2024-11-08 11:20:58,138 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 11:20:57" (1/1) ... [2024-11-08 11:20:58,138 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 11:20:57" (1/1) ... [2024-11-08 11:20:58,263 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 11:20:57" (1/1) ... [2024-11-08 11:20:58,297 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 11:20:57" (1/1) ... [2024-11-08 11:20:58,325 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 11:20:57" (1/1) ... [2024-11-08 11:20:58,348 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 11:20:57" (1/1) ... [2024-11-08 11:20:58,393 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-08 11:20:58,394 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-08 11:20:58,395 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-08 11:20:58,395 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-08 11:20:58,396 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 11:20:57" (1/1) ... [2024-11-08 11:20:58,400 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-08 11:20:58,409 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-08 11:20:58,422 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-11-08 11:20:58,425 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-11-08 11:20:58,520 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-08 11:20:58,520 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-11-08 11:20:58,520 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-08 11:20:58,520 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-08 11:20:58,594 INFO L238 CfgBuilder]: Building ICFG [2024-11-08 11:20:58,595 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-08 11:21:02,602 INFO L? ?]: Removed 738 outVars from TransFormulas that were not future-live. [2024-11-08 11:21:02,602 INFO L287 CfgBuilder]: Performing block encoding [2024-11-08 11:21:02,643 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-08 11:21:02,647 INFO L316 CfgBuilder]: Removed 1 assume(true) statements. [2024-11-08 11:21:02,648 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.11 11:21:02 BoogieIcfgContainer [2024-11-08 11:21:02,648 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-08 11:21:02,650 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-08 11:21:02,653 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-08 11:21:02,656 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-08 11:21:02,659 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 08.11 11:20:56" (1/3) ... [2024-11-08 11:21:02,660 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@59f01c09 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.11 11:21:02, skipping insertion in model container [2024-11-08 11:21:02,660 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 11:20:57" (2/3) ... [2024-11-08 11:21:02,660 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@59f01c09 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.11 11:21:02, skipping insertion in model container [2024-11-08 11:21:02,660 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.11 11:21:02" (3/3) ... [2024-11-08 11:21:02,661 INFO L112 eAbstractionObserver]: Analyzing ICFG Problem13_label22.c [2024-11-08 11:21:02,688 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-08 11:21:02,688 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-11-08 11:21:02,766 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-08 11:21:02,771 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;@2995b4c8, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-08 11:21:02,771 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-08 11:21:02,777 INFO L276 IsEmpty]: Start isEmpty. Operand has 1098 states, 1096 states have (on average 1.8275547445255473) internal successors, (2003), 1097 states have internal predecessors, (2003), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 11:21:02,782 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2024-11-08 11:21:02,783 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 11:21:02,783 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] [2024-11-08 11:21:02,784 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 11:21:02,787 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 11:21:02,787 INFO L85 PathProgramCache]: Analyzing trace with hash -1317301102, now seen corresponding path program 1 times [2024-11-08 11:21:02,794 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 11:21:02,794 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [639512181] [2024-11-08 11:21:02,794 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 11:21:02,798 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 11:21:02,997 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 11:21:03,211 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-08 11:21:03,213 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 11:21:03,213 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [639512181] [2024-11-08 11:21:03,214 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [639512181] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 11:21:03,214 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 11:21:03,214 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-08 11:21:03,215 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [212875289] [2024-11-08 11:21:03,216 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 11:21:03,219 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-08 11:21:03,220 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 11:21:03,240 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-08 11:21:03,241 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-08 11:21:03,245 INFO L87 Difference]: Start difference. First operand has 1098 states, 1096 states have (on average 1.8275547445255473) internal successors, (2003), 1097 states have internal predecessors, (2003), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 3 states, 3 states have (on average 10.666666666666666) internal successors, (32), 2 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 11:21:07,382 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 11:21:07,383 INFO L93 Difference]: Finished difference Result 3121 states and 5804 transitions. [2024-11-08 11:21:07,384 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-08 11:21:07,385 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 10.666666666666666) internal successors, (32), 2 states have internal predecessors, (32), 0 states have call successors, (0), 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 32 [2024-11-08 11:21:07,385 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 11:21:07,407 INFO L225 Difference]: With dead ends: 3121 [2024-11-08 11:21:07,407 INFO L226 Difference]: Without dead ends: 1944 [2024-11-08 11:21:07,414 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-08 11:21:07,417 INFO L432 NwaCegarLoop]: 438 mSDtfsCounter, 957 mSDsluCounter, 137 mSDsCounter, 0 mSdLazyCounter, 3124 mSolverCounterSat, 577 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 957 SdHoareTripleChecker+Valid, 575 SdHoareTripleChecker+Invalid, 3701 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 577 IncrementalHoareTripleChecker+Valid, 3124 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.0s IncrementalHoareTripleChecker+Time [2024-11-08 11:21:07,418 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [957 Valid, 575 Invalid, 3701 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [577 Valid, 3124 Invalid, 0 Unknown, 0 Unchecked, 4.0s Time] [2024-11-08 11:21:07,435 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1944 states. [2024-11-08 11:21:07,506 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1944 to 1873. [2024-11-08 11:21:07,510 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1873 states, 1872 states have (on average 1.7393162393162394) internal successors, (3256), 1872 states have internal predecessors, (3256), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 11:21:07,516 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1873 states to 1873 states and 3256 transitions. [2024-11-08 11:21:07,517 INFO L78 Accepts]: Start accepts. Automaton has 1873 states and 3256 transitions. Word has length 32 [2024-11-08 11:21:07,517 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 11:21:07,518 INFO L471 AbstractCegarLoop]: Abstraction has 1873 states and 3256 transitions. [2024-11-08 11:21:07,518 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 10.666666666666666) internal successors, (32), 2 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 11:21:07,518 INFO L276 IsEmpty]: Start isEmpty. Operand 1873 states and 3256 transitions. [2024-11-08 11:21:07,522 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 98 [2024-11-08 11:21:07,522 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 11:21:07,522 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 11:21:07,523 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-08 11:21:07,523 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 11:21:07,524 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 11:21:07,524 INFO L85 PathProgramCache]: Analyzing trace with hash 1153859322, now seen corresponding path program 1 times [2024-11-08 11:21:07,524 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 11:21:07,524 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [658863730] [2024-11-08 11:21:07,525 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 11:21:07,525 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 11:21:07,593 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 11:21:07,797 INFO L134 CoverageAnalysis]: Checked inductivity of 29 backedges. 29 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-08 11:21:07,797 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 11:21:07,798 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [658863730] [2024-11-08 11:21:07,798 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [658863730] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 11:21:07,798 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 11:21:07,798 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-08 11:21:07,798 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2126190229] [2024-11-08 11:21:07,799 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 11:21:07,800 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-08 11:21:07,800 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 11:21:07,800 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-08 11:21:07,801 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-08 11:21:07,801 INFO L87 Difference]: Start difference. First operand 1873 states and 3256 transitions. Second operand has 3 states, 3 states have (on average 32.333333333333336) internal successors, (97), 2 states have internal predecessors, (97), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 11:21:10,988 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 11:21:10,989 INFO L93 Difference]: Finished difference Result 5351 states and 9369 transitions. [2024-11-08 11:21:10,989 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-08 11:21:10,990 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 32.333333333333336) internal successors, (97), 2 states have internal predecessors, (97), 0 states have call successors, (0), 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 97 [2024-11-08 11:21:10,990 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 11:21:10,999 INFO L225 Difference]: With dead ends: 5351 [2024-11-08 11:21:11,000 INFO L226 Difference]: Without dead ends: 3480 [2024-11-08 11:21:11,002 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-08 11:21:11,003 INFO L432 NwaCegarLoop]: 926 mSDtfsCounter, 884 mSDsluCounter, 153 mSDsCounter, 0 mSdLazyCounter, 2338 mSolverCounterSat, 878 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 884 SdHoareTripleChecker+Valid, 1079 SdHoareTripleChecker+Invalid, 3216 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 878 IncrementalHoareTripleChecker+Valid, 2338 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.1s IncrementalHoareTripleChecker+Time [2024-11-08 11:21:11,003 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [884 Valid, 1079 Invalid, 3216 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [878 Valid, 2338 Invalid, 0 Unknown, 0 Unchecked, 3.1s Time] [2024-11-08 11:21:11,006 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3480 states. [2024-11-08 11:21:11,037 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3480 to 3479. [2024-11-08 11:21:11,040 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3479 states, 3478 states have (on average 1.518688901667625) internal successors, (5282), 3478 states have internal predecessors, (5282), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 11:21:11,045 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3479 states to 3479 states and 5282 transitions. [2024-11-08 11:21:11,045 INFO L78 Accepts]: Start accepts. Automaton has 3479 states and 5282 transitions. Word has length 97 [2024-11-08 11:21:11,046 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 11:21:11,046 INFO L471 AbstractCegarLoop]: Abstraction has 3479 states and 5282 transitions. [2024-11-08 11:21:11,046 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 32.333333333333336) internal successors, (97), 2 states have internal predecessors, (97), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 11:21:11,046 INFO L276 IsEmpty]: Start isEmpty. Operand 3479 states and 5282 transitions. [2024-11-08 11:21:11,047 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2024-11-08 11:21:11,047 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 11:21:11,047 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 11:21:11,048 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-08 11:21:11,048 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 11:21:11,048 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 11:21:11,048 INFO L85 PathProgramCache]: Analyzing trace with hash -1724311179, now seen corresponding path program 1 times [2024-11-08 11:21:11,049 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 11:21:11,049 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1187109281] [2024-11-08 11:21:11,049 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 11:21:11,049 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 11:21:11,067 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 11:21:11,177 INFO L134 CoverageAnalysis]: Checked inductivity of 29 backedges. 29 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-08 11:21:11,178 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 11:21:11,178 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1187109281] [2024-11-08 11:21:11,178 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1187109281] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 11:21:11,179 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 11:21:11,179 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-08 11:21:11,179 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2009811714] [2024-11-08 11:21:11,179 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 11:21:11,180 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-08 11:21:11,180 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 11:21:11,181 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-08 11:21:11,182 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-08 11:21:11,182 INFO L87 Difference]: Start difference. First operand 3479 states and 5282 transitions. Second operand has 3 states, 3 states have (on average 33.0) internal successors, (99), 2 states have internal predecessors, (99), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 11:21:14,200 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 11:21:14,201 INFO L93 Difference]: Finished difference Result 10142 states and 15438 transitions. [2024-11-08 11:21:14,201 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-08 11:21:14,201 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 33.0) internal successors, (99), 2 states have internal predecessors, (99), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 99 [2024-11-08 11:21:14,202 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 11:21:14,224 INFO L225 Difference]: With dead ends: 10142 [2024-11-08 11:21:14,224 INFO L226 Difference]: Without dead ends: 6665 [2024-11-08 11:21:14,231 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-08 11:21:14,232 INFO L432 NwaCegarLoop]: 744 mSDtfsCounter, 976 mSDsluCounter, 133 mSDsCounter, 0 mSdLazyCounter, 2553 mSolverCounterSat, 772 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 976 SdHoareTripleChecker+Valid, 877 SdHoareTripleChecker+Invalid, 3325 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 772 IncrementalHoareTripleChecker+Valid, 2553 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.9s IncrementalHoareTripleChecker+Time [2024-11-08 11:21:14,232 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [976 Valid, 877 Invalid, 3325 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [772 Valid, 2553 Invalid, 0 Unknown, 0 Unchecked, 2.9s Time] [2024-11-08 11:21:14,238 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6665 states. [2024-11-08 11:21:14,316 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6665 to 6657. [2024-11-08 11:21:14,324 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6657 states, 6656 states have (on average 1.3728966346153846) internal successors, (9138), 6656 states have internal predecessors, (9138), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 11:21:14,336 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6657 states to 6657 states and 9138 transitions. [2024-11-08 11:21:14,336 INFO L78 Accepts]: Start accepts. Automaton has 6657 states and 9138 transitions. Word has length 99 [2024-11-08 11:21:14,337 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 11:21:14,337 INFO L471 AbstractCegarLoop]: Abstraction has 6657 states and 9138 transitions. [2024-11-08 11:21:14,337 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 33.0) internal successors, (99), 2 states have internal predecessors, (99), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 11:21:14,337 INFO L276 IsEmpty]: Start isEmpty. Operand 6657 states and 9138 transitions. [2024-11-08 11:21:14,338 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2024-11-08 11:21:14,339 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 11:21:14,339 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 11:21:14,339 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-11-08 11:21:14,339 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 11:21:14,340 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 11:21:14,340 INFO L85 PathProgramCache]: Analyzing trace with hash 40058662, now seen corresponding path program 1 times [2024-11-08 11:21:14,340 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 11:21:14,340 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1222517794] [2024-11-08 11:21:14,340 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 11:21:14,340 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 11:21:14,370 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 11:21:14,492 INFO L134 CoverageAnalysis]: Checked inductivity of 29 backedges. 29 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-08 11:21:14,492 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 11:21:14,492 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1222517794] [2024-11-08 11:21:14,493 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1222517794] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 11:21:14,494 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 11:21:14,494 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-08 11:21:14,494 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [193084709] [2024-11-08 11:21:14,494 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 11:21:14,494 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-08 11:21:14,495 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 11:21:14,496 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-08 11:21:14,496 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-08 11:21:14,496 INFO L87 Difference]: Start difference. First operand 6657 states and 9138 transitions. Second operand has 3 states, 3 states have (on average 35.0) internal successors, (105), 2 states have internal predecessors, (105), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 11:21:17,587 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 11:21:17,588 INFO L93 Difference]: Finished difference Result 19637 states and 26969 transitions. [2024-11-08 11:21:17,588 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-08 11:21:17,588 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 35.0) internal successors, (105), 2 states have internal predecessors, (105), 0 states have call successors, (0), 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 105 [2024-11-08 11:21:17,589 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 11:21:17,618 INFO L225 Difference]: With dead ends: 19637 [2024-11-08 11:21:17,618 INFO L226 Difference]: Without dead ends: 12982 [2024-11-08 11:21:17,627 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-08 11:21:17,628 INFO L432 NwaCegarLoop]: 1012 mSDtfsCounter, 792 mSDsluCounter, 150 mSDsCounter, 0 mSdLazyCounter, 2485 mSolverCounterSat, 792 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 792 SdHoareTripleChecker+Valid, 1162 SdHoareTripleChecker+Invalid, 3277 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 792 IncrementalHoareTripleChecker+Valid, 2485 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.0s IncrementalHoareTripleChecker+Time [2024-11-08 11:21:17,629 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [792 Valid, 1162 Invalid, 3277 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [792 Valid, 2485 Invalid, 0 Unknown, 0 Unchecked, 3.0s Time] [2024-11-08 11:21:17,638 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12982 states. [2024-11-08 11:21:17,745 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12982 to 12964. [2024-11-08 11:21:17,765 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 12964 states, 12963 states have (on average 1.2390650312427678) internal successors, (16062), 12963 states have internal predecessors, (16062), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 11:21:17,792 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12964 states to 12964 states and 16062 transitions. [2024-11-08 11:21:17,795 INFO L78 Accepts]: Start accepts. Automaton has 12964 states and 16062 transitions. Word has length 105 [2024-11-08 11:21:17,795 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 11:21:17,796 INFO L471 AbstractCegarLoop]: Abstraction has 12964 states and 16062 transitions. [2024-11-08 11:21:17,796 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 35.0) internal successors, (105), 2 states have internal predecessors, (105), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 11:21:17,796 INFO L276 IsEmpty]: Start isEmpty. Operand 12964 states and 16062 transitions. [2024-11-08 11:21:17,797 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 122 [2024-11-08 11:21:17,797 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 11:21:17,797 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 11:21:17,798 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-11-08 11:21:17,798 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 11:21:17,798 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 11:21:17,798 INFO L85 PathProgramCache]: Analyzing trace with hash -1375773890, now seen corresponding path program 1 times [2024-11-08 11:21:17,798 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 11:21:17,798 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [99761473] [2024-11-08 11:21:17,798 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 11:21:17,798 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 11:21:17,824 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 11:21:17,904 INFO L134 CoverageAnalysis]: Checked inductivity of 29 backedges. 29 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-08 11:21:17,904 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 11:21:17,904 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [99761473] [2024-11-08 11:21:17,904 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [99761473] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 11:21:17,904 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 11:21:17,904 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-08 11:21:17,905 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [883170242] [2024-11-08 11:21:17,907 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 11:21:17,907 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-08 11:21:17,907 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 11:21:17,908 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-08 11:21:17,908 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-08 11:21:17,908 INFO L87 Difference]: Start difference. First operand 12964 states and 16062 transitions. Second operand has 3 states, 3 states have (on average 40.333333333333336) internal successors, (121), 3 states have internal predecessors, (121), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 11:21:20,991 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 11:21:20,991 INFO L93 Difference]: Finished difference Result 32235 states and 40792 transitions. [2024-11-08 11:21:20,992 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-08 11:21:20,992 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 40.333333333333336) internal successors, (121), 3 states have internal predecessors, (121), 0 states have call successors, (0), 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 121 [2024-11-08 11:21:20,993 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 11:21:21,032 INFO L225 Difference]: With dead ends: 32235 [2024-11-08 11:21:21,032 INFO L226 Difference]: Without dead ends: 19273 [2024-11-08 11:21:21,047 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-08 11:21:21,048 INFO L432 NwaCegarLoop]: 1590 mSDtfsCounter, 965 mSDsluCounter, 98 mSDsCounter, 0 mSdLazyCounter, 2555 mSolverCounterSat, 812 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 965 SdHoareTripleChecker+Valid, 1688 SdHoareTripleChecker+Invalid, 3367 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 812 IncrementalHoareTripleChecker+Valid, 2555 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.9s IncrementalHoareTripleChecker+Time [2024-11-08 11:21:21,049 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [965 Valid, 1688 Invalid, 3367 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [812 Valid, 2555 Invalid, 0 Unknown, 0 Unchecked, 2.9s Time] [2024-11-08 11:21:21,086 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19273 states. [2024-11-08 11:21:21,281 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19273 to 19263. [2024-11-08 11:21:21,299 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 19263 states, 19262 states have (on average 1.2407849652164884) internal successors, (23900), 19262 states have internal predecessors, (23900), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 11:21:21,318 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19263 states to 19263 states and 23900 transitions. [2024-11-08 11:21:21,319 INFO L78 Accepts]: Start accepts. Automaton has 19263 states and 23900 transitions. Word has length 121 [2024-11-08 11:21:21,320 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 11:21:21,320 INFO L471 AbstractCegarLoop]: Abstraction has 19263 states and 23900 transitions. [2024-11-08 11:21:21,320 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 40.333333333333336) internal successors, (121), 3 states have internal predecessors, (121), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 11:21:21,320 INFO L276 IsEmpty]: Start isEmpty. Operand 19263 states and 23900 transitions. [2024-11-08 11:21:21,321 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 129 [2024-11-08 11:21:21,321 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 11:21:21,322 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 11:21:21,322 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-11-08 11:21:21,322 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 11:21:21,322 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 11:21:21,322 INFO L85 PathProgramCache]: Analyzing trace with hash -1196887405, now seen corresponding path program 1 times [2024-11-08 11:21:21,323 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 11:21:21,323 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [842521044] [2024-11-08 11:21:21,323 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 11:21:21,323 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 11:21:21,349 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 11:21:21,408 INFO L134 CoverageAnalysis]: Checked inductivity of 29 backedges. 29 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-08 11:21:21,409 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 11:21:21,409 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [842521044] [2024-11-08 11:21:21,409 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [842521044] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 11:21:21,409 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 11:21:21,410 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-08 11:21:21,410 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [400779541] [2024-11-08 11:21:21,410 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 11:21:21,411 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-08 11:21:21,411 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 11:21:21,411 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-08 11:21:21,412 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-08 11:21:21,412 INFO L87 Difference]: Start difference. First operand 19263 states and 23900 transitions. Second operand has 3 states, 3 states have (on average 42.666666666666664) internal successors, (128), 3 states have internal predecessors, (128), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 11:21:24,257 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 11:21:24,257 INFO L93 Difference]: Finished difference Result 38542 states and 47831 transitions. [2024-11-08 11:21:24,258 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-08 11:21:24,258 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 42.666666666666664) internal successors, (128), 3 states have internal predecessors, (128), 0 states have call successors, (0), 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 128 [2024-11-08 11:21:24,258 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 11:21:24,285 INFO L225 Difference]: With dead ends: 38542 [2024-11-08 11:21:24,285 INFO L226 Difference]: Without dead ends: 19281 [2024-11-08 11:21:24,301 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-08 11:21:24,302 INFO L432 NwaCegarLoop]: 1306 mSDtfsCounter, 1092 mSDsluCounter, 53 mSDsCounter, 0 mSdLazyCounter, 2468 mSolverCounterSat, 616 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1092 SdHoareTripleChecker+Valid, 1359 SdHoareTripleChecker+Invalid, 3084 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 616 IncrementalHoareTripleChecker+Valid, 2468 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.6s IncrementalHoareTripleChecker+Time [2024-11-08 11:21:24,302 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1092 Valid, 1359 Invalid, 3084 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [616 Valid, 2468 Invalid, 0 Unknown, 0 Unchecked, 2.6s Time] [2024-11-08 11:21:24,315 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19281 states. [2024-11-08 11:21:24,445 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19281 to 19263. [2024-11-08 11:21:24,461 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 19263 states, 19262 states have (on average 1.225262174229052) internal successors, (23601), 19262 states have internal predecessors, (23601), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 11:21:24,480 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19263 states to 19263 states and 23601 transitions. [2024-11-08 11:21:24,480 INFO L78 Accepts]: Start accepts. Automaton has 19263 states and 23601 transitions. Word has length 128 [2024-11-08 11:21:24,480 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 11:21:24,481 INFO L471 AbstractCegarLoop]: Abstraction has 19263 states and 23601 transitions. [2024-11-08 11:21:24,481 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 42.666666666666664) internal successors, (128), 3 states have internal predecessors, (128), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 11:21:24,481 INFO L276 IsEmpty]: Start isEmpty. Operand 19263 states and 23601 transitions. [2024-11-08 11:21:24,482 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 204 [2024-11-08 11:21:24,482 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 11:21:24,483 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, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2024-11-08 11:21:24,483 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-11-08 11:21:24,483 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 11:21:24,483 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 11:21:24,483 INFO L85 PathProgramCache]: Analyzing trace with hash 401334377, now seen corresponding path program 1 times [2024-11-08 11:21:24,484 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 11:21:24,484 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1517106338] [2024-11-08 11:21:24,484 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 11:21:24,484 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 11:21:24,505 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 11:21:24,755 INFO L134 CoverageAnalysis]: Checked inductivity of 140 backedges. 110 proven. 0 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2024-11-08 11:21:24,756 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 11:21:24,756 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1517106338] [2024-11-08 11:21:24,756 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1517106338] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 11:21:24,756 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 11:21:24,756 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-08 11:21:24,756 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1588592004] [2024-11-08 11:21:24,756 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 11:21:24,756 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-08 11:21:24,756 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 11:21:24,757 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-08 11:21:24,757 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-08 11:21:24,757 INFO L87 Difference]: Start difference. First operand 19263 states and 23601 transitions. Second operand has 3 states, 3 states have (on average 58.0) internal successors, (174), 2 states have internal predecessors, (174), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 11:21:27,337 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 11:21:27,337 INFO L93 Difference]: Finished difference Result 39311 states and 48002 transitions. [2024-11-08 11:21:27,338 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-08 11:21:27,338 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 58.0) internal successors, (174), 2 states have internal predecessors, (174), 0 states have call successors, (0), 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 203 [2024-11-08 11:21:27,339 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 11:21:27,368 INFO L225 Difference]: With dead ends: 39311 [2024-11-08 11:21:27,368 INFO L226 Difference]: Without dead ends: 20050 [2024-11-08 11:21:27,383 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-08 11:21:27,384 INFO L432 NwaCegarLoop]: 1077 mSDtfsCounter, 700 mSDsluCounter, 129 mSDsCounter, 0 mSdLazyCounter, 2514 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 700 SdHoareTripleChecker+Valid, 1206 SdHoareTripleChecker+Invalid, 2523 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 2514 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.4s IncrementalHoareTripleChecker+Time [2024-11-08 11:21:27,384 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [700 Valid, 1206 Invalid, 2523 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 2514 Invalid, 0 Unknown, 0 Unchecked, 2.4s Time] [2024-11-08 11:21:27,396 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20050 states. [2024-11-08 11:21:27,521 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20050 to 20050. [2024-11-08 11:21:27,538 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 20050 states, 20049 states have (on average 1.2166691605566362) internal successors, (24393), 20049 states have internal predecessors, (24393), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 11:21:27,556 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20050 states to 20050 states and 24393 transitions. [2024-11-08 11:21:27,557 INFO L78 Accepts]: Start accepts. Automaton has 20050 states and 24393 transitions. Word has length 203 [2024-11-08 11:21:27,558 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 11:21:27,558 INFO L471 AbstractCegarLoop]: Abstraction has 20050 states and 24393 transitions. [2024-11-08 11:21:27,558 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 58.0) internal successors, (174), 2 states have internal predecessors, (174), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 11:21:27,558 INFO L276 IsEmpty]: Start isEmpty. Operand 20050 states and 24393 transitions. [2024-11-08 11:21:27,559 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 211 [2024-11-08 11:21:27,559 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 11:21:27,560 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, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2024-11-08 11:21:27,560 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-11-08 11:21:27,560 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 11:21:27,560 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 11:21:27,561 INFO L85 PathProgramCache]: Analyzing trace with hash 199558270, now seen corresponding path program 1 times [2024-11-08 11:21:27,561 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 11:21:27,561 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [314854126] [2024-11-08 11:21:27,561 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 11:21:27,561 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 11:21:27,586 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 11:21:27,678 INFO L134 CoverageAnalysis]: Checked inductivity of 140 backedges. 140 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-08 11:21:27,679 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 11:21:27,679 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [314854126] [2024-11-08 11:21:27,679 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [314854126] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 11:21:27,679 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 11:21:27,679 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-08 11:21:27,680 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1868488708] [2024-11-08 11:21:27,680 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 11:21:27,680 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-08 11:21:27,681 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 11:21:27,681 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-08 11:21:27,681 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-08 11:21:27,681 INFO L87 Difference]: Start difference. First operand 20050 states and 24393 transitions. Second operand has 3 states, 3 states have (on average 70.0) internal successors, (210), 3 states have internal predecessors, (210), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 11:21:31,065 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 11:21:31,065 INFO L93 Difference]: Finished difference Result 39321 states and 48009 transitions. [2024-11-08 11:21:31,066 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-08 11:21:31,066 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 70.0) internal successors, (210), 3 states have internal predecessors, (210), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 210 [2024-11-08 11:21:31,066 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 11:21:31,090 INFO L225 Difference]: With dead ends: 39321 [2024-11-08 11:21:31,090 INFO L226 Difference]: Without dead ends: 20060 [2024-11-08 11:21:31,104 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-08 11:21:31,105 INFO L432 NwaCegarLoop]: 810 mSDtfsCounter, 887 mSDsluCounter, 118 mSDsCounter, 0 mSdLazyCounter, 2381 mSolverCounterSat, 764 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 887 SdHoareTripleChecker+Valid, 928 SdHoareTripleChecker+Invalid, 3145 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 764 IncrementalHoareTripleChecker+Valid, 2381 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.2s IncrementalHoareTripleChecker+Time [2024-11-08 11:21:31,105 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [887 Valid, 928 Invalid, 3145 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [764 Valid, 2381 Invalid, 0 Unknown, 0 Unchecked, 3.2s Time] [2024-11-08 11:21:31,119 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20060 states. [2024-11-08 11:21:31,306 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20060 to 20050. [2024-11-08 11:21:31,322 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 20050 states, 20049 states have (on average 1.1535737443264003) internal successors, (23128), 20049 states have internal predecessors, (23128), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 11:21:31,348 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20050 states to 20050 states and 23128 transitions. [2024-11-08 11:21:31,349 INFO L78 Accepts]: Start accepts. Automaton has 20050 states and 23128 transitions. Word has length 210 [2024-11-08 11:21:31,349 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 11:21:31,349 INFO L471 AbstractCegarLoop]: Abstraction has 20050 states and 23128 transitions. [2024-11-08 11:21:31,350 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 70.0) internal successors, (210), 3 states have internal predecessors, (210), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 11:21:31,350 INFO L276 IsEmpty]: Start isEmpty. Operand 20050 states and 23128 transitions. [2024-11-08 11:21:31,354 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 300 [2024-11-08 11:21:31,354 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 11:21:31,354 INFO L215 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 11:21:31,354 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-11-08 11:21:31,354 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 11:21:31,355 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 11:21:31,355 INFO L85 PathProgramCache]: Analyzing trace with hash 1013398472, now seen corresponding path program 1 times [2024-11-08 11:21:31,355 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 11:21:31,355 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [599970125] [2024-11-08 11:21:31,355 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 11:21:31,355 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 11:21:31,405 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 11:21:31,562 INFO L134 CoverageAnalysis]: Checked inductivity of 340 backedges. 252 proven. 0 refuted. 0 times theorem prover too weak. 88 trivial. 0 not checked. [2024-11-08 11:21:31,563 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 11:21:31,563 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [599970125] [2024-11-08 11:21:31,563 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [599970125] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 11:21:31,563 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 11:21:31,563 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-08 11:21:31,563 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [784457185] [2024-11-08 11:21:31,563 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 11:21:31,564 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-08 11:21:31,564 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 11:21:31,565 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-08 11:21:31,565 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-08 11:21:31,565 INFO L87 Difference]: Start difference. First operand 20050 states and 23128 transitions. Second operand has 3 states, 3 states have (on average 70.66666666666667) internal successors, (212), 3 states have internal predecessors, (212), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 11:21:34,774 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 11:21:34,775 INFO L93 Difference]: Finished difference Result 45630 states and 53337 transitions. [2024-11-08 11:21:34,775 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-08 11:21:34,775 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 70.66666666666667) internal successors, (212), 3 states have internal predecessors, (212), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 299 [2024-11-08 11:21:34,776 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 11:21:34,807 INFO L225 Difference]: With dead ends: 45630 [2024-11-08 11:21:34,808 INFO L226 Difference]: Without dead ends: 26369 [2024-11-08 11:21:34,824 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-08 11:21:34,825 INFO L432 NwaCegarLoop]: 698 mSDtfsCounter, 968 mSDsluCounter, 88 mSDsCounter, 0 mSdLazyCounter, 2383 mSolverCounterSat, 844 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 968 SdHoareTripleChecker+Valid, 786 SdHoareTripleChecker+Invalid, 3227 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 844 IncrementalHoareTripleChecker+Valid, 2383 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.0s IncrementalHoareTripleChecker+Time [2024-11-08 11:21:34,825 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [968 Valid, 786 Invalid, 3227 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [844 Valid, 2383 Invalid, 0 Unknown, 0 Unchecked, 3.0s Time] [2024-11-08 11:21:34,842 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26369 states. [2024-11-08 11:21:35,078 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26369 to 26357. [2024-11-08 11:21:35,098 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 26357 states, 26356 states have (on average 1.145204128092275) internal successors, (30183), 26356 states have internal predecessors, (30183), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 11:21:35,133 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26357 states to 26357 states and 30183 transitions. [2024-11-08 11:21:35,134 INFO L78 Accepts]: Start accepts. Automaton has 26357 states and 30183 transitions. Word has length 299 [2024-11-08 11:21:35,134 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 11:21:35,134 INFO L471 AbstractCegarLoop]: Abstraction has 26357 states and 30183 transitions. [2024-11-08 11:21:35,134 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 70.66666666666667) internal successors, (212), 3 states have internal predecessors, (212), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 11:21:35,135 INFO L276 IsEmpty]: Start isEmpty. Operand 26357 states and 30183 transitions. [2024-11-08 11:21:35,140 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 352 [2024-11-08 11:21:35,140 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 11:21:35,140 INFO L215 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 11:21:35,141 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-11-08 11:21:35,141 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 11:21:35,141 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 11:21:35,141 INFO L85 PathProgramCache]: Analyzing trace with hash 466056108, now seen corresponding path program 1 times [2024-11-08 11:21:35,141 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 11:21:35,141 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1306007731] [2024-11-08 11:21:35,142 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 11:21:35,142 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 11:21:35,194 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 11:21:35,500 INFO L134 CoverageAnalysis]: Checked inductivity of 386 backedges. 261 proven. 0 refuted. 0 times theorem prover too weak. 125 trivial. 0 not checked. [2024-11-08 11:21:35,501 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 11:21:35,501 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1306007731] [2024-11-08 11:21:35,501 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1306007731] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 11:21:35,501 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 11:21:35,501 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-08 11:21:35,501 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1992944297] [2024-11-08 11:21:35,501 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 11:21:35,502 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-08 11:21:35,502 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 11:21:35,502 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-08 11:21:35,502 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-08 11:21:35,502 INFO L87 Difference]: Start difference. First operand 26357 states and 30183 transitions. Second operand has 3 states, 3 states have (on average 76.0) internal successors, (228), 2 states have internal predecessors, (228), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 11:21:38,684 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 11:21:38,685 INFO L93 Difference]: Finished difference Result 61387 states and 70044 transitions. [2024-11-08 11:21:38,685 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-08 11:21:38,685 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 76.0) internal successors, (228), 2 states have internal predecessors, (228), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 351 [2024-11-08 11:21:38,686 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 11:21:38,725 INFO L225 Difference]: With dead ends: 61387 [2024-11-08 11:21:38,726 INFO L226 Difference]: Without dead ends: 35819 [2024-11-08 11:21:38,746 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-08 11:21:38,746 INFO L432 NwaCegarLoop]: 1041 mSDtfsCounter, 726 mSDsluCounter, 182 mSDsCounter, 0 mSdLazyCounter, 2726 mSolverCounterSat, 181 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 726 SdHoareTripleChecker+Valid, 1223 SdHoareTripleChecker+Invalid, 2907 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 181 IncrementalHoareTripleChecker+Valid, 2726 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.0s IncrementalHoareTripleChecker+Time [2024-11-08 11:21:38,747 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [726 Valid, 1223 Invalid, 2907 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [181 Valid, 2726 Invalid, 0 Unknown, 0 Unchecked, 3.0s Time] [2024-11-08 11:21:38,772 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35819 states. [2024-11-08 11:21:38,984 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35819 to 35811. [2024-11-08 11:21:39,009 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 35811 states, 35810 states have (on average 1.1199385646467468) internal successors, (40105), 35810 states have internal predecessors, (40105), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 11:21:39,042 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35811 states to 35811 states and 40105 transitions. [2024-11-08 11:21:39,042 INFO L78 Accepts]: Start accepts. Automaton has 35811 states and 40105 transitions. Word has length 351 [2024-11-08 11:21:39,043 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 11:21:39,043 INFO L471 AbstractCegarLoop]: Abstraction has 35811 states and 40105 transitions. [2024-11-08 11:21:39,043 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 76.0) internal successors, (228), 2 states have internal predecessors, (228), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 11:21:39,043 INFO L276 IsEmpty]: Start isEmpty. Operand 35811 states and 40105 transitions. [2024-11-08 11:21:39,048 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 360 [2024-11-08 11:21:39,048 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 11:21:39,048 INFO L215 NwaCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 11:21:39,048 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2024-11-08 11:21:39,049 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 11:21:39,049 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 11:21:39,049 INFO L85 PathProgramCache]: Analyzing trace with hash -1671520665, now seen corresponding path program 1 times [2024-11-08 11:21:39,049 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 11:21:39,049 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1158417255] [2024-11-08 11:21:39,049 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 11:21:39,049 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 11:21:39,086 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 11:21:39,682 INFO L134 CoverageAnalysis]: Checked inductivity of 558 backedges. 119 proven. 75 refuted. 0 times theorem prover too weak. 364 trivial. 0 not checked. [2024-11-08 11:21:39,682 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 11:21:39,682 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1158417255] [2024-11-08 11:21:39,682 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1158417255] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-08 11:21:39,682 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [731737434] [2024-11-08 11:21:39,682 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 11:21:39,682 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-08 11:21:39,682 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-08 11:21:39,684 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-08 11:21:39,691 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2024-11-08 11:21:39,812 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 11:21:39,815 INFO L255 TraceCheckSpWp]: Trace formula consists of 521 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-11-08 11:21:39,829 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-08 11:21:40,170 INFO L134 CoverageAnalysis]: Checked inductivity of 558 backedges. 119 proven. 0 refuted. 0 times theorem prover too weak. 439 trivial. 0 not checked. [2024-11-08 11:21:40,170 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-08 11:21:40,170 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [731737434] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 11:21:40,170 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-08 11:21:40,170 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [3] total 4 [2024-11-08 11:21:40,171 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1808259405] [2024-11-08 11:21:40,171 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 11:21:40,171 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-08 11:21:40,171 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 11:21:40,171 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-08 11:21:40,172 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-11-08 11:21:40,172 INFO L87 Difference]: Start difference. First operand 35811 states and 40105 transitions. Second operand has 3 states, 3 states have (on average 44.0) internal successors, (132), 2 states have internal predecessors, (132), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 11:21:42,952 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 11:21:42,953 INFO L93 Difference]: Finished difference Result 101690 states and 114343 transitions. [2024-11-08 11:21:42,953 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-08 11:21:42,953 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 44.0) internal successors, (132), 2 states have internal predecessors, (132), 0 states have call successors, (0), 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 359 [2024-11-08 11:21:42,953 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 11:21:43,026 INFO L225 Difference]: With dead ends: 101690 [2024-11-08 11:21:43,026 INFO L226 Difference]: Without dead ends: 66668 [2024-11-08 11:21:43,054 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 361 GetRequests, 358 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-11-08 11:21:43,054 INFO L432 NwaCegarLoop]: 933 mSDtfsCounter, 1045 mSDsluCounter, 208 mSDsCounter, 0 mSdLazyCounter, 2717 mSolverCounterSat, 533 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1045 SdHoareTripleChecker+Valid, 1141 SdHoareTripleChecker+Invalid, 3250 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 533 IncrementalHoareTripleChecker+Valid, 2717 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.5s IncrementalHoareTripleChecker+Time [2024-11-08 11:21:43,054 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1045 Valid, 1141 Invalid, 3250 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [533 Valid, 2717 Invalid, 0 Unknown, 0 Unchecked, 2.5s Time] [2024-11-08 11:21:43,099 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 66668 states. [2024-11-08 11:21:43,526 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 66668 to 66647. [2024-11-08 11:21:43,567 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 66647 states, 66646 states have (on average 1.1020466344566815) internal successors, (73447), 66646 states have internal predecessors, (73447), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 11:21:43,629 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 66647 states to 66647 states and 73447 transitions. [2024-11-08 11:21:43,629 INFO L78 Accepts]: Start accepts. Automaton has 66647 states and 73447 transitions. Word has length 359 [2024-11-08 11:21:43,630 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 11:21:43,630 INFO L471 AbstractCegarLoop]: Abstraction has 66647 states and 73447 transitions. [2024-11-08 11:21:43,630 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 44.0) internal successors, (132), 2 states have internal predecessors, (132), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 11:21:43,630 INFO L276 IsEmpty]: Start isEmpty. Operand 66647 states and 73447 transitions. [2024-11-08 11:21:43,634 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 360 [2024-11-08 11:21:43,634 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 11:21:43,634 INFO L215 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 11:21:43,653 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2024-11-08 11:21:43,835 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable10 [2024-11-08 11:21:43,836 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 11:21:43,836 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 11:21:43,836 INFO L85 PathProgramCache]: Analyzing trace with hash -223688760, now seen corresponding path program 1 times [2024-11-08 11:21:43,836 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 11:21:43,836 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2030189146] [2024-11-08 11:21:43,836 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 11:21:43,837 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 11:21:43,878 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 11:21:43,960 INFO L134 CoverageAnalysis]: Checked inductivity of 361 backedges. 89 proven. 0 refuted. 0 times theorem prover too weak. 272 trivial. 0 not checked. [2024-11-08 11:21:43,961 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 11:21:43,961 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2030189146] [2024-11-08 11:21:43,961 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2030189146] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 11:21:43,961 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 11:21:43,961 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-08 11:21:43,961 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [482722642] [2024-11-08 11:21:43,961 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 11:21:43,962 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-08 11:21:43,962 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 11:21:43,962 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-08 11:21:43,962 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-08 11:21:43,962 INFO L87 Difference]: Start difference. First operand 66647 states and 73447 transitions. Second operand has 3 states, 3 states have (on average 59.0) internal successors, (177), 3 states have internal predecessors, (177), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 11:21:46,541 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 11:21:46,542 INFO L93 Difference]: Finished difference Result 128406 states and 141788 transitions. [2024-11-08 11:21:46,542 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-08 11:21:46,542 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 59.0) internal successors, (177), 3 states have internal predecessors, (177), 0 states have call successors, (0), 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 359 [2024-11-08 11:21:46,543 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 11:21:46,609 INFO L225 Difference]: With dead ends: 128406 [2024-11-08 11:21:46,609 INFO L226 Difference]: Without dead ends: 61761 [2024-11-08 11:21:46,647 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-08 11:21:46,649 INFO L432 NwaCegarLoop]: 1491 mSDtfsCounter, 1085 mSDsluCounter, 137 mSDsCounter, 0 mSdLazyCounter, 2344 mSolverCounterSat, 600 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1085 SdHoareTripleChecker+Valid, 1628 SdHoareTripleChecker+Invalid, 2944 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 600 IncrementalHoareTripleChecker+Valid, 2344 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.3s IncrementalHoareTripleChecker+Time [2024-11-08 11:21:46,649 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1085 Valid, 1628 Invalid, 2944 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [600 Valid, 2344 Invalid, 0 Unknown, 0 Unchecked, 2.3s Time] [2024-11-08 11:21:46,690 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 61761 states. [2024-11-08 11:21:47,775 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 61761 to 56242. [2024-11-08 11:21:47,819 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 56242 states, 56241 states have (on average 1.0810618587862948) internal successors, (60800), 56241 states have internal predecessors, (60800), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 11:21:47,872 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 56242 states to 56242 states and 60800 transitions. [2024-11-08 11:21:47,873 INFO L78 Accepts]: Start accepts. Automaton has 56242 states and 60800 transitions. Word has length 359 [2024-11-08 11:21:47,873 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 11:21:47,873 INFO L471 AbstractCegarLoop]: Abstraction has 56242 states and 60800 transitions. [2024-11-08 11:21:47,874 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 59.0) internal successors, (177), 3 states have internal predecessors, (177), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 11:21:47,874 INFO L276 IsEmpty]: Start isEmpty. Operand 56242 states and 60800 transitions. [2024-11-08 11:21:47,888 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 381 [2024-11-08 11:21:47,888 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 11:21:47,888 INFO L215 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 11:21:47,888 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2024-11-08 11:21:47,888 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 11:21:47,889 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 11:21:47,889 INFO L85 PathProgramCache]: Analyzing trace with hash -122794750, now seen corresponding path program 1 times [2024-11-08 11:21:47,889 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 11:21:47,889 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1272392239] [2024-11-08 11:21:47,889 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 11:21:47,889 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 11:21:48,347 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 11:21:49,460 INFO L134 CoverageAnalysis]: Checked inductivity of 415 backedges. 272 proven. 113 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2024-11-08 11:21:49,460 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 11:21:49,461 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1272392239] [2024-11-08 11:21:49,461 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1272392239] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-08 11:21:49,461 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1078783965] [2024-11-08 11:21:49,461 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 11:21:49,461 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-08 11:21:49,461 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-08 11:21:49,463 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-08 11:21:49,467 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2024-11-08 11:21:49,580 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 11:21:49,582 INFO L255 TraceCheckSpWp]: Trace formula consists of 510 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-11-08 11:21:49,586 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-08 11:21:49,793 INFO L134 CoverageAnalysis]: Checked inductivity of 415 backedges. 302 proven. 0 refuted. 0 times theorem prover too weak. 113 trivial. 0 not checked. [2024-11-08 11:21:49,793 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-08 11:21:49,793 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1078783965] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 11:21:49,793 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-08 11:21:49,793 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [7] total 9 [2024-11-08 11:21:49,794 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1803306298] [2024-11-08 11:21:49,794 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 11:21:49,794 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-08 11:21:49,794 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 11:21:49,794 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-08 11:21:49,795 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=46, Unknown=0, NotChecked=0, Total=72 [2024-11-08 11:21:49,795 INFO L87 Difference]: Start difference. First operand 56242 states and 60800 transitions. Second operand has 3 states, 3 states have (on average 89.33333333333333) internal successors, (268), 3 states have internal predecessors, (268), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 11:21:52,852 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 11:21:52,852 INFO L93 Difference]: Finished difference Result 111676 states and 121615 transitions. [2024-11-08 11:21:52,852 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-08 11:21:52,852 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 89.33333333333333) internal successors, (268), 3 states have internal predecessors, (268), 0 states have call successors, (0), 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 380 [2024-11-08 11:21:52,853 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 11:21:52,920 INFO L225 Difference]: With dead ends: 111676 [2024-11-08 11:21:52,920 INFO L226 Difference]: Without dead ends: 66462 [2024-11-08 11:21:52,943 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 386 GetRequests, 379 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=26, Invalid=46, Unknown=0, NotChecked=0, Total=72 [2024-11-08 11:21:52,943 INFO L432 NwaCegarLoop]: 387 mSDtfsCounter, 1217 mSDsluCounter, 17 mSDsCounter, 0 mSdLazyCounter, 2266 mSolverCounterSat, 971 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1217 SdHoareTripleChecker+Valid, 404 SdHoareTripleChecker+Invalid, 3237 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 971 IncrementalHoareTripleChecker+Valid, 2266 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.7s IncrementalHoareTripleChecker+Time [2024-11-08 11:21:52,948 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1217 Valid, 404 Invalid, 3237 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [971 Valid, 2266 Invalid, 0 Unknown, 0 Unchecked, 2.7s Time] [2024-11-08 11:21:52,989 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 66462 states. [2024-11-08 11:21:53,599 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 66462 to 66462. [2024-11-08 11:21:53,632 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 66462 states, 66461 states have (on average 1.0791892989873761) internal successors, (71724), 66461 states have internal predecessors, (71724), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 11:21:53,693 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 66462 states to 66462 states and 71724 transitions. [2024-11-08 11:21:53,693 INFO L78 Accepts]: Start accepts. Automaton has 66462 states and 71724 transitions. Word has length 380 [2024-11-08 11:21:53,695 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 11:21:53,695 INFO L471 AbstractCegarLoop]: Abstraction has 66462 states and 71724 transitions. [2024-11-08 11:21:53,696 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 89.33333333333333) internal successors, (268), 3 states have internal predecessors, (268), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 11:21:53,696 INFO L276 IsEmpty]: Start isEmpty. Operand 66462 states and 71724 transitions. [2024-11-08 11:21:53,703 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 390 [2024-11-08 11:21:53,704 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 11:21:53,705 INFO L215 NwaCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 11:21:53,719 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2024-11-08 11:21:53,909 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable12 [2024-11-08 11:21:53,910 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 11:21:53,910 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 11:21:53,910 INFO L85 PathProgramCache]: Analyzing trace with hash -1998945486, now seen corresponding path program 1 times [2024-11-08 11:21:53,911 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 11:21:53,911 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1454564668] [2024-11-08 11:21:53,911 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 11:21:53,911 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 11:21:54,007 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 11:21:54,325 INFO L134 CoverageAnalysis]: Checked inductivity of 597 backedges. 325 proven. 0 refuted. 0 times theorem prover too weak. 272 trivial. 0 not checked. [2024-11-08 11:21:54,325 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 11:21:54,325 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1454564668] [2024-11-08 11:21:54,325 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1454564668] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 11:21:54,326 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 11:21:54,326 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-08 11:21:54,326 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1230921284] [2024-11-08 11:21:54,326 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 11:21:54,326 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-08 11:21:54,326 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 11:21:54,327 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-08 11:21:54,327 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-08 11:21:54,327 INFO L87 Difference]: Start difference. First operand 66462 states and 71724 transitions. Second operand has 3 states, 3 states have (on average 69.0) internal successors, (207), 3 states have internal predecessors, (207), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 11:21:57,197 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 11:21:57,197 INFO L93 Difference]: Finished difference Result 144731 states and 156792 transitions. [2024-11-08 11:21:57,197 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-08 11:21:57,198 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 69.0) internal successors, (207), 3 states have internal predecessors, (207), 0 states have call successors, (0), 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 389 [2024-11-08 11:21:57,198 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 11:21:57,376 INFO L225 Difference]: With dead ends: 144731 [2024-11-08 11:21:57,376 INFO L226 Difference]: Without dead ends: 79058 [2024-11-08 11:21:57,395 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-08 11:21:57,395 INFO L432 NwaCegarLoop]: 1750 mSDtfsCounter, 788 mSDsluCounter, 140 mSDsCounter, 0 mSdLazyCounter, 2485 mSolverCounterSat, 443 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 788 SdHoareTripleChecker+Valid, 1890 SdHoareTripleChecker+Invalid, 2928 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 443 IncrementalHoareTripleChecker+Valid, 2485 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.6s IncrementalHoareTripleChecker+Time [2024-11-08 11:21:57,396 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [788 Valid, 1890 Invalid, 2928 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [443 Valid, 2485 Invalid, 0 Unknown, 0 Unchecked, 2.6s Time] [2024-11-08 11:21:57,437 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 79058 states. [2024-11-08 11:21:58,099 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 79058 to 78265. [2024-11-08 11:21:58,157 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 78265 states, 78264 states have (on average 1.0746959010528467) internal successors, (84110), 78264 states have internal predecessors, (84110), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 11:21:58,469 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 78265 states to 78265 states and 84110 transitions. [2024-11-08 11:21:58,470 INFO L78 Accepts]: Start accepts. Automaton has 78265 states and 84110 transitions. Word has length 389 [2024-11-08 11:21:58,473 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 11:21:58,473 INFO L471 AbstractCegarLoop]: Abstraction has 78265 states and 84110 transitions. [2024-11-08 11:21:58,474 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 69.0) internal successors, (207), 3 states have internal predecessors, (207), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 11:21:58,474 INFO L276 IsEmpty]: Start isEmpty. Operand 78265 states and 84110 transitions. [2024-11-08 11:21:58,486 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 395 [2024-11-08 11:21:58,486 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 11:21:58,486 INFO L215 NwaCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 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] [2024-11-08 11:21:58,486 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2024-11-08 11:21:58,486 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 11:21:58,487 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 11:21:58,487 INFO L85 PathProgramCache]: Analyzing trace with hash 1737086632, now seen corresponding path program 1 times [2024-11-08 11:21:58,487 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 11:21:58,487 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [926705233] [2024-11-08 11:21:58,487 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 11:21:58,487 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 11:21:58,569 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 11:21:58,726 INFO L134 CoverageAnalysis]: Checked inductivity of 617 backedges. 478 proven. 0 refuted. 0 times theorem prover too weak. 139 trivial. 0 not checked. [2024-11-08 11:21:58,726 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 11:21:58,726 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [926705233] [2024-11-08 11:21:58,726 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [926705233] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 11:21:58,726 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 11:21:58,726 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-08 11:21:58,726 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [844635736] [2024-11-08 11:21:58,726 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 11:21:58,727 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-08 11:21:58,727 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 11:21:58,727 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-08 11:21:58,727 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-11-08 11:21:58,727 INFO L87 Difference]: Start difference. First operand 78265 states and 84110 transitions. Second operand has 4 states, 4 states have (on average 71.75) internal successors, (287), 3 states have internal predecessors, (287), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 11:22:04,204 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 11:22:04,204 INFO L93 Difference]: Finished difference Result 213352 states and 229648 transitions. [2024-11-08 11:22:04,205 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-08 11:22:04,205 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 71.75) internal successors, (287), 3 states have internal predecessors, (287), 0 states have call successors, (0), 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 394 [2024-11-08 11:22:04,205 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 11:22:04,342 INFO L225 Difference]: With dead ends: 213352 [2024-11-08 11:22:04,342 INFO L226 Difference]: Without dead ends: 135876 [2024-11-08 11:22:04,368 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-11-08 11:22:04,368 INFO L432 NwaCegarLoop]: 659 mSDtfsCounter, 1679 mSDsluCounter, 179 mSDsCounter, 0 mSdLazyCounter, 5866 mSolverCounterSat, 963 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1679 SdHoareTripleChecker+Valid, 838 SdHoareTripleChecker+Invalid, 6829 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 963 IncrementalHoareTripleChecker+Valid, 5866 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 5.0s IncrementalHoareTripleChecker+Time [2024-11-08 11:22:04,369 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1679 Valid, 838 Invalid, 6829 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [963 Valid, 5866 Invalid, 0 Unknown, 0 Unchecked, 5.0s Time] [2024-11-08 11:22:04,446 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 135876 states. [2024-11-08 11:22:05,721 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 135876 to 132622. [2024-11-08 11:22:05,805 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 132622 states, 132621 states have (on average 1.071723181095) internal successors, (142133), 132621 states have internal predecessors, (142133), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 11:22:05,938 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 132622 states to 132622 states and 142133 transitions. [2024-11-08 11:22:05,939 INFO L78 Accepts]: Start accepts. Automaton has 132622 states and 142133 transitions. Word has length 394 [2024-11-08 11:22:05,939 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 11:22:05,939 INFO L471 AbstractCegarLoop]: Abstraction has 132622 states and 142133 transitions. [2024-11-08 11:22:05,939 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 71.75) internal successors, (287), 3 states have internal predecessors, (287), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 11:22:05,939 INFO L276 IsEmpty]: Start isEmpty. Operand 132622 states and 142133 transitions. [2024-11-08 11:22:05,944 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 424 [2024-11-08 11:22:05,944 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 11:22:05,944 INFO L215 NwaCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 11:22:05,944 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2024-11-08 11:22:05,944 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 11:22:05,945 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 11:22:05,945 INFO L85 PathProgramCache]: Analyzing trace with hash -1578591018, now seen corresponding path program 1 times [2024-11-08 11:22:05,945 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 11:22:05,945 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1279662094] [2024-11-08 11:22:05,945 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 11:22:05,945 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 11:22:06,248 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 11:22:06,494 INFO L134 CoverageAnalysis]: Checked inductivity of 615 backedges. 343 proven. 0 refuted. 0 times theorem prover too weak. 272 trivial. 0 not checked. [2024-11-08 11:22:06,495 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 11:22:06,495 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1279662094] [2024-11-08 11:22:06,495 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1279662094] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 11:22:06,495 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 11:22:06,495 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-08 11:22:06,495 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [282571054] [2024-11-08 11:22:06,495 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 11:22:06,496 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-08 11:22:06,496 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 11:22:06,496 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-08 11:22:06,496 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-08 11:22:06,496 INFO L87 Difference]: Start difference. First operand 132622 states and 142133 transitions. Second operand has 3 states, 3 states have (on average 80.33333333333333) internal successors, (241), 3 states have internal predecessors, (241), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 11:22:09,729 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 11:22:09,729 INFO L93 Difference]: Finished difference Result 265235 states and 284216 transitions. [2024-11-08 11:22:09,733 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-08 11:22:09,733 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 80.33333333333333) internal successors, (241), 3 states have internal predecessors, (241), 0 states have call successors, (0), 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 423 [2024-11-08 11:22:09,734 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 11:22:09,911 INFO L225 Difference]: With dead ends: 265235 [2024-11-08 11:22:09,911 INFO L226 Difference]: Without dead ends: 131828 [2024-11-08 11:22:09,976 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-08 11:22:09,977 INFO L432 NwaCegarLoop]: 1665 mSDtfsCounter, 785 mSDsluCounter, 131 mSDsCounter, 0 mSdLazyCounter, 2466 mSolverCounterSat, 413 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 785 SdHoareTripleChecker+Valid, 1796 SdHoareTripleChecker+Invalid, 2879 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 413 IncrementalHoareTripleChecker+Valid, 2466 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.5s IncrementalHoareTripleChecker+Time [2024-11-08 11:22:09,977 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [785 Valid, 1796 Invalid, 2879 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [413 Valid, 2466 Invalid, 0 Unknown, 0 Unchecked, 2.5s Time] [2024-11-08 11:22:10,074 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 131828 states. [2024-11-08 11:22:11,236 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 131828 to 131814. [2024-11-08 11:22:11,320 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 131814 states, 131813 states have (on average 1.0560794458816658) internal successors, (139205), 131813 states have internal predecessors, (139205), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 11:22:11,759 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 131814 states to 131814 states and 139205 transitions. [2024-11-08 11:22:11,764 INFO L78 Accepts]: Start accepts. Automaton has 131814 states and 139205 transitions. Word has length 423 [2024-11-08 11:22:11,764 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 11:22:11,764 INFO L471 AbstractCegarLoop]: Abstraction has 131814 states and 139205 transitions. [2024-11-08 11:22:11,764 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 80.33333333333333) internal successors, (241), 3 states have internal predecessors, (241), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 11:22:11,764 INFO L276 IsEmpty]: Start isEmpty. Operand 131814 states and 139205 transitions. [2024-11-08 11:22:11,770 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 431 [2024-11-08 11:22:11,773 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 11:22:11,773 INFO L215 NwaCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 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, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 11:22:11,774 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2024-11-08 11:22:11,777 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 11:22:11,777 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 11:22:11,778 INFO L85 PathProgramCache]: Analyzing trace with hash -835118328, now seen corresponding path program 1 times [2024-11-08 11:22:11,778 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 11:22:11,778 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [46679062] [2024-11-08 11:22:11,778 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 11:22:11,778 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 11:22:11,850 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 11:22:12,333 INFO L134 CoverageAnalysis]: Checked inductivity of 636 backedges. 364 proven. 0 refuted. 0 times theorem prover too weak. 272 trivial. 0 not checked. [2024-11-08 11:22:12,333 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 11:22:12,333 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [46679062] [2024-11-08 11:22:12,333 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [46679062] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 11:22:12,333 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 11:22:12,333 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-08 11:22:12,333 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1304542351] [2024-11-08 11:22:12,333 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 11:22:12,335 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-08 11:22:12,335 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 11:22:12,336 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-08 11:22:12,336 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-08 11:22:12,336 INFO L87 Difference]: Start difference. First operand 131814 states and 139205 transitions. Second operand has 3 states, 3 states have (on average 82.66666666666667) internal successors, (248), 3 states have internal predecessors, (248), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 11:22:15,176 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 11:22:15,176 INFO L93 Difference]: Finished difference Result 262050 states and 276714 transitions. [2024-11-08 11:22:15,177 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-08 11:22:15,177 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 82.66666666666667) internal successors, (248), 3 states have internal predecessors, (248), 0 states have call successors, (0), 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 430 [2024-11-08 11:22:15,177 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 11:22:15,322 INFO L225 Difference]: With dead ends: 262050 [2024-11-08 11:22:15,323 INFO L226 Difference]: Without dead ends: 131025 [2024-11-08 11:22:15,376 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-08 11:22:15,377 INFO L432 NwaCegarLoop]: 1312 mSDtfsCounter, 1097 mSDsluCounter, 72 mSDsCounter, 0 mSdLazyCounter, 2396 mSolverCounterSat, 430 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1097 SdHoareTripleChecker+Valid, 1384 SdHoareTripleChecker+Invalid, 2826 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 430 IncrementalHoareTripleChecker+Valid, 2396 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.1s IncrementalHoareTripleChecker+Time [2024-11-08 11:22:15,377 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1097 Valid, 1384 Invalid, 2826 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [430 Valid, 2396 Invalid, 0 Unknown, 0 Unchecked, 2.1s Time] [2024-11-08 11:22:15,460 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 131025 states. [2024-11-08 11:22:16,703 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 131025 to 131024. [2024-11-08 11:22:16,792 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 131024 states, 131023 states have (on average 1.042435297619502) internal successors, (136583), 131023 states have internal predecessors, (136583), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 11:22:17,278 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 131024 states to 131024 states and 136583 transitions. [2024-11-08 11:22:17,280 INFO L78 Accepts]: Start accepts. Automaton has 131024 states and 136583 transitions. Word has length 430 [2024-11-08 11:22:17,280 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 11:22:17,283 INFO L471 AbstractCegarLoop]: Abstraction has 131024 states and 136583 transitions. [2024-11-08 11:22:17,283 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 82.66666666666667) internal successors, (248), 3 states have internal predecessors, (248), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 11:22:17,283 INFO L276 IsEmpty]: Start isEmpty. Operand 131024 states and 136583 transitions. [2024-11-08 11:22:17,292 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 464 [2024-11-08 11:22:17,293 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 11:22:17,293 INFO L215 NwaCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 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] [2024-11-08 11:22:17,293 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2024-11-08 11:22:17,293 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 11:22:17,293 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 11:22:17,294 INFO L85 PathProgramCache]: Analyzing trace with hash -869792363, now seen corresponding path program 1 times [2024-11-08 11:22:17,294 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 11:22:17,294 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1520341166] [2024-11-08 11:22:17,294 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 11:22:17,294 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 11:22:17,370 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 11:22:17,675 INFO L134 CoverageAnalysis]: Checked inductivity of 688 backedges. 119 proven. 0 refuted. 0 times theorem prover too weak. 569 trivial. 0 not checked. [2024-11-08 11:22:17,676 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 11:22:17,676 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1520341166] [2024-11-08 11:22:17,676 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1520341166] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 11:22:17,676 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 11:22:17,676 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-08 11:22:17,676 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1686207182] [2024-11-08 11:22:17,676 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 11:22:17,677 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-08 11:22:17,677 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 11:22:17,677 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-08 11:22:17,677 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-08 11:22:17,677 INFO L87 Difference]: Start difference. First operand 131024 states and 136583 transitions. Second operand has 4 states, 4 states have (on average 42.25) internal successors, (169), 4 states have internal predecessors, (169), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 11:22:24,299 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 11:22:24,300 INFO L93 Difference]: Finished difference Result 314093 states and 327567 transitions. [2024-11-08 11:22:24,300 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-08 11:22:24,300 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 42.25) internal successors, (169), 4 states have internal predecessors, (169), 0 states have call successors, (0), 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 463 [2024-11-08 11:22:24,301 INFO L84 Accepts]: Finished accepts. some prefix is accepted.