./Ultimate.py --spec /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/properties/unreach-call.prp --file /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/seq-mthreaded/pals_lcr.5_overflow.ufo.UNBOUNDED.pals.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version a046e57d Calling Ultimate with: /root/.sdkman/candidates/java/current/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/seq-mthreaded/pals_lcr.5_overflow.ufo.UNBOUNDED.pals.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 6994f5bfaf30a704120445031d2592cb0b289806736d22478b28cc84ed2b2216 --- Real Ultimate output --- This is Ultimate 0.2.5-tmp.dk.eval-mul-div-a046e57-m [2024-10-12 20:05:07,848 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-12 20:05:07,925 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-10-12 20:05:07,932 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-12 20:05:07,933 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-12 20:05:07,961 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-12 20:05:07,962 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-12 20:05:07,963 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-12 20:05:07,963 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-10-12 20:05:07,964 INFO L153 SettingsManager]: * Use memory slicer=true [2024-10-12 20:05:07,964 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-10-12 20:05:07,964 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-10-12 20:05:07,965 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-12 20:05:07,968 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-12 20:05:07,969 INFO L153 SettingsManager]: * Use SBE=true [2024-10-12 20:05:07,969 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-12 20:05:07,969 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-10-12 20:05:07,969 INFO L153 SettingsManager]: * sizeof long=4 [2024-10-12 20:05:07,970 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-10-12 20:05:07,970 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-10-12 20:05:07,970 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-12 20:05:07,971 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-10-12 20:05:07,971 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-10-12 20:05:07,971 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-10-12 20:05:07,972 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-12 20:05:07,972 INFO L153 SettingsManager]: * sizeof long double=12 [2024-10-12 20:05:07,972 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-10-12 20:05:07,973 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-12 20:05:07,973 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-12 20:05:07,973 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-12 20:05:07,973 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-10-12 20:05:07,974 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-10-12 20:05:07,974 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-12 20:05:07,975 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-12 20:05:07,975 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-10-12 20:05:07,976 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-10-12 20:05:07,976 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-10-12 20:05:07,976 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-10-12 20:05:07,976 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-10-12 20:05:07,977 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-10-12 20:05:07,977 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-10-12 20:05:07,977 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-10-12 20:05:07,977 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 -> 6994f5bfaf30a704120445031d2592cb0b289806736d22478b28cc84ed2b2216 [2024-10-12 20:05:08,230 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-12 20:05:08,255 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-12 20:05:08,258 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-12 20:05:08,259 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-12 20:05:08,260 INFO L274 PluginConnector]: CDTParser initialized [2024-10-12 20:05:08,261 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/seq-mthreaded/pals_lcr.5_overflow.ufo.UNBOUNDED.pals.c [2024-10-12 20:05:09,706 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-12 20:05:09,921 INFO L384 CDTParser]: Found 1 translation units. [2024-10-12 20:05:09,924 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/seq-mthreaded/pals_lcr.5_overflow.ufo.UNBOUNDED.pals.c [2024-10-12 20:05:09,934 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/6a8b36c3d/43b7cfde079e4d9eadb047698c55aa2b/FLAG96d76ea39 [2024-10-12 20:05:10,263 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/6a8b36c3d/43b7cfde079e4d9eadb047698c55aa2b [2024-10-12 20:05:10,266 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-12 20:05:10,267 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-12 20:05:10,269 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-12 20:05:10,269 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-12 20:05:10,273 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-12 20:05:10,274 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 12.10 08:05:10" (1/1) ... [2024-10-12 20:05:10,274 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@1e3d5965 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 08:05:10, skipping insertion in model container [2024-10-12 20:05:10,275 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 12.10 08:05:10" (1/1) ... [2024-10-12 20:05:10,307 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-12 20:05:10,532 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/seq-mthreaded/pals_lcr.5_overflow.ufo.UNBOUNDED.pals.c[11335,11348] [2024-10-12 20:05:10,540 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-12 20:05:10,549 INFO L200 MainTranslator]: Completed pre-run [2024-10-12 20:05:10,596 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/seq-mthreaded/pals_lcr.5_overflow.ufo.UNBOUNDED.pals.c[11335,11348] [2024-10-12 20:05:10,597 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-12 20:05:10,619 INFO L204 MainTranslator]: Completed translation [2024-10-12 20:05:10,620 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 08:05:10 WrapperNode [2024-10-12 20:05:10,620 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-12 20:05:10,621 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-10-12 20:05:10,622 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-10-12 20:05:10,622 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-10-12 20:05:10,628 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 08:05:10" (1/1) ... [2024-10-12 20:05:10,637 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 08:05:10" (1/1) ... [2024-10-12 20:05:10,665 INFO L138 Inliner]: procedures = 25, calls = 16, calls flagged for inlining = 11, calls inlined = 11, statements flattened = 334 [2024-10-12 20:05:10,666 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-10-12 20:05:10,667 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-10-12 20:05:10,667 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-10-12 20:05:10,667 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-10-12 20:05:10,685 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 08:05:10" (1/1) ... [2024-10-12 20:05:10,688 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 08:05:10" (1/1) ... [2024-10-12 20:05:10,700 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 08:05:10" (1/1) ... [2024-10-12 20:05:10,720 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2024-10-12 20:05:10,720 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 08:05:10" (1/1) ... [2024-10-12 20:05:10,720 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 08:05:10" (1/1) ... [2024-10-12 20:05:10,744 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 08:05:10" (1/1) ... [2024-10-12 20:05:10,750 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 08:05:10" (1/1) ... [2024-10-12 20:05:10,752 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 08:05:10" (1/1) ... [2024-10-12 20:05:10,754 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 08:05:10" (1/1) ... [2024-10-12 20:05:10,759 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-10-12 20:05:10,764 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-10-12 20:05:10,764 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-10-12 20:05:10,764 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-10-12 20:05:10,765 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 08:05:10" (1/1) ... [2024-10-12 20:05:10,772 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-12 20:05:10,793 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-12 20:05:10,812 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-10-12 20:05:10,819 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-10-12 20:05:10,865 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-10-12 20:05:10,865 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-10-12 20:05:10,866 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-10-12 20:05:10,866 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-10-12 20:05:10,977 INFO L238 CfgBuilder]: Building ICFG [2024-10-12 20:05:10,981 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-10-12 20:05:11,461 INFO L? ?]: Removed 40 outVars from TransFormulas that were not future-live. [2024-10-12 20:05:11,462 INFO L287 CfgBuilder]: Performing block encoding [2024-10-12 20:05:11,506 INFO L309 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-10-12 20:05:11,506 INFO L314 CfgBuilder]: Removed 1 assume(true) statements. [2024-10-12 20:05:11,507 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.10 08:05:11 BoogieIcfgContainer [2024-10-12 20:05:11,507 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-10-12 20:05:11,510 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-10-12 20:05:11,510 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-10-12 20:05:11,513 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-10-12 20:05:11,513 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 12.10 08:05:10" (1/3) ... [2024-10-12 20:05:11,513 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6f618a39 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 12.10 08:05:11, skipping insertion in model container [2024-10-12 20:05:11,514 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 08:05:10" (2/3) ... [2024-10-12 20:05:11,514 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6f618a39 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 12.10 08:05:11, skipping insertion in model container [2024-10-12 20:05:11,514 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.10 08:05:11" (3/3) ... [2024-10-12 20:05:11,515 INFO L112 eAbstractionObserver]: Analyzing ICFG pals_lcr.5_overflow.ufo.UNBOUNDED.pals.c [2024-10-12 20:05:11,528 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-10-12 20:05:11,529 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-10-12 20:05:11,586 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-10-12 20:05:11,592 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;@189f1799, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-12 20:05:11,592 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-10-12 20:05:11,596 INFO L276 IsEmpty]: Start isEmpty. Operand has 78 states, 76 states have (on average 1.8026315789473684) internal successors, (137), 77 states have internal predecessors, (137), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 20:05:11,603 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2024-10-12 20:05:11,604 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 20:05:11,605 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] [2024-10-12 20:05:11,605 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 20:05:11,612 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 20:05:11,612 INFO L85 PathProgramCache]: Analyzing trace with hash -936899003, now seen corresponding path program 1 times [2024-10-12 20:05:11,621 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 20:05:11,622 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1126735015] [2024-10-12 20:05:11,622 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 20:05:11,623 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 20:05:11,765 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 20:05:11,872 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-12 20:05:11,873 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 20:05:11,874 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1126735015] [2024-10-12 20:05:11,875 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1126735015] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 20:05:11,875 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 20:05:11,876 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-12 20:05:11,877 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1556190977] [2024-10-12 20:05:11,878 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 20:05:11,883 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-10-12 20:05:11,883 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 20:05:11,904 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-10-12 20:05:11,905 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-10-12 20:05:11,907 INFO L87 Difference]: Start difference. First operand has 78 states, 76 states have (on average 1.8026315789473684) internal successors, (137), 77 states have internal predecessors, (137), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 2 states, 2 states have (on average 10.0) internal successors, (20), 2 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 20:05:11,939 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 20:05:11,939 INFO L93 Difference]: Finished difference Result 120 states and 207 transitions. [2024-10-12 20:05:11,941 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-12 20:05:11,942 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 10.0) internal successors, (20), 2 states have internal predecessors, (20), 0 states have call successors, (0), 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 20 [2024-10-12 20:05:11,943 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 20:05:11,949 INFO L225 Difference]: With dead ends: 120 [2024-10-12 20:05:11,950 INFO L226 Difference]: Without dead ends: 76 [2024-10-12 20:05:11,952 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-10-12 20:05:11,955 INFO L432 NwaCegarLoop]: 129 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 3 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 129 SdHoareTripleChecker+Invalid, 3 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 3 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-12 20:05:11,956 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 129 Invalid, 3 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 3 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-12 20:05:11,969 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 76 states. [2024-10-12 20:05:11,982 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 76 to 76. [2024-10-12 20:05:11,983 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 76 states, 75 states have (on average 1.76) internal successors, (132), 75 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-10-12 20:05:11,984 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 76 states to 76 states and 132 transitions. [2024-10-12 20:05:11,986 INFO L78 Accepts]: Start accepts. Automaton has 76 states and 132 transitions. Word has length 20 [2024-10-12 20:05:11,986 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 20:05:11,986 INFO L471 AbstractCegarLoop]: Abstraction has 76 states and 132 transitions. [2024-10-12 20:05:11,987 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 10.0) internal successors, (20), 2 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 20:05:11,987 INFO L276 IsEmpty]: Start isEmpty. Operand 76 states and 132 transitions. [2024-10-12 20:05:11,988 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2024-10-12 20:05:11,988 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 20:05:11,988 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] [2024-10-12 20:05:11,988 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-10-12 20:05:11,989 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 20:05:11,989 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 20:05:11,989 INFO L85 PathProgramCache]: Analyzing trace with hash 1769720391, now seen corresponding path program 1 times [2024-10-12 20:05:11,990 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 20:05:11,990 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1044221609] [2024-10-12 20:05:11,990 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 20:05:11,990 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 20:05:12,035 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 20:05:12,185 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-12 20:05:12,185 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 20:05:12,185 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1044221609] [2024-10-12 20:05:12,185 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1044221609] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 20:05:12,185 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 20:05:12,186 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-12 20:05:12,186 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1988699275] [2024-10-12 20:05:12,186 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 20:05:12,187 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-12 20:05:12,187 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 20:05:12,188 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-12 20:05:12,188 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-12 20:05:12,190 INFO L87 Difference]: Start difference. First operand 76 states and 132 transitions. Second operand has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 20:05:12,292 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 20:05:12,292 INFO L93 Difference]: Finished difference Result 120 states and 201 transitions. [2024-10-12 20:05:12,293 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-12 20:05:12,293 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 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 20 [2024-10-12 20:05:12,293 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 20:05:12,294 INFO L225 Difference]: With dead ends: 120 [2024-10-12 20:05:12,294 INFO L226 Difference]: Without dead ends: 76 [2024-10-12 20:05:12,295 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-12 20:05:12,296 INFO L432 NwaCegarLoop]: 129 mSDtfsCounter, 0 mSDsluCounter, 224 mSDsCounter, 0 mSdLazyCounter, 12 mSolverCounterSat, 30 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 353 SdHoareTripleChecker+Invalid, 42 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 30 IncrementalHoareTripleChecker+Valid, 12 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-12 20:05:12,297 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 353 Invalid, 42 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [30 Valid, 12 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-12 20:05:12,297 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 76 states. [2024-10-12 20:05:12,303 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 76 to 76. [2024-10-12 20:05:12,303 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 76 states, 75 states have (on average 1.3466666666666667) internal successors, (101), 75 states have internal predecessors, (101), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 20:05:12,304 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 76 states to 76 states and 101 transitions. [2024-10-12 20:05:12,305 INFO L78 Accepts]: Start accepts. Automaton has 76 states and 101 transitions. Word has length 20 [2024-10-12 20:05:12,306 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 20:05:12,306 INFO L471 AbstractCegarLoop]: Abstraction has 76 states and 101 transitions. [2024-10-12 20:05:12,307 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 20:05:12,307 INFO L276 IsEmpty]: Start isEmpty. Operand 76 states and 101 transitions. [2024-10-12 20:05:12,308 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2024-10-12 20:05:12,309 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 20:05:12,309 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-12 20:05:12,310 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-10-12 20:05:12,310 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 20:05:12,311 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 20:05:12,311 INFO L85 PathProgramCache]: Analyzing trace with hash -1805949634, now seen corresponding path program 1 times [2024-10-12 20:05:12,311 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 20:05:12,311 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1574109016] [2024-10-12 20:05:12,312 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 20:05:12,312 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 20:05:12,375 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 20:05:12,571 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-12 20:05:12,572 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 20:05:12,572 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1574109016] [2024-10-12 20:05:12,572 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1574109016] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 20:05:12,572 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 20:05:12,572 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-10-12 20:05:12,572 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1205679014] [2024-10-12 20:05:12,573 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 20:05:12,573 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-12 20:05:12,573 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 20:05:12,573 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-12 20:05:12,574 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-10-12 20:05:12,574 INFO L87 Difference]: Start difference. First operand 76 states and 101 transitions. Second operand has 7 states, 7 states have (on average 7.142857142857143) internal successors, (50), 7 states have internal predecessors, (50), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 20:05:12,934 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 20:05:12,934 INFO L93 Difference]: Finished difference Result 486 states and 761 transitions. [2024-10-12 20:05:12,935 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-10-12 20:05:12,935 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 7.142857142857143) internal successors, (50), 7 states have internal predecessors, (50), 0 states have call successors, (0), 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 50 [2024-10-12 20:05:12,938 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 20:05:12,942 INFO L225 Difference]: With dead ends: 486 [2024-10-12 20:05:12,942 INFO L226 Difference]: Without dead ends: 445 [2024-10-12 20:05:12,943 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=63, Invalid=119, Unknown=0, NotChecked=0, Total=182 [2024-10-12 20:05:12,944 INFO L432 NwaCegarLoop]: 94 mSDtfsCounter, 743 mSDsluCounter, 1167 mSDsCounter, 0 mSdLazyCounter, 163 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 743 SdHoareTripleChecker+Valid, 1261 SdHoareTripleChecker+Invalid, 166 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 163 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-10-12 20:05:12,945 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [743 Valid, 1261 Invalid, 166 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 163 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-10-12 20:05:12,946 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 445 states. [2024-10-12 20:05:12,958 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 445 to 115. [2024-10-12 20:05:12,959 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 115 states, 114 states have (on average 1.4385964912280702) internal successors, (164), 114 states have internal predecessors, (164), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 20:05:12,960 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 115 states to 115 states and 164 transitions. [2024-10-12 20:05:12,960 INFO L78 Accepts]: Start accepts. Automaton has 115 states and 164 transitions. Word has length 50 [2024-10-12 20:05:12,960 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 20:05:12,961 INFO L471 AbstractCegarLoop]: Abstraction has 115 states and 164 transitions. [2024-10-12 20:05:12,961 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 7.142857142857143) internal successors, (50), 7 states have internal predecessors, (50), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 20:05:12,961 INFO L276 IsEmpty]: Start isEmpty. Operand 115 states and 164 transitions. [2024-10-12 20:05:12,962 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2024-10-12 20:05:12,962 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 20:05:12,963 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-12 20:05:12,963 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-10-12 20:05:12,963 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 20:05:12,964 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 20:05:12,964 INFO L85 PathProgramCache]: Analyzing trace with hash -1110513490, now seen corresponding path program 1 times [2024-10-12 20:05:12,964 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 20:05:12,964 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1659421301] [2024-10-12 20:05:12,964 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 20:05:12,965 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 20:05:12,996 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 20:05:13,099 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-12 20:05:13,100 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 20:05:13,100 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1659421301] [2024-10-12 20:05:13,100 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1659421301] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 20:05:13,100 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 20:05:13,100 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-12 20:05:13,101 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1372579753] [2024-10-12 20:05:13,101 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 20:05:13,101 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-12 20:05:13,101 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 20:05:13,102 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-12 20:05:13,102 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-12 20:05:13,102 INFO L87 Difference]: Start difference. First operand 115 states and 164 transitions. Second operand has 3 states, 3 states have (on average 17.333333333333332) internal successors, (52), 3 states have internal predecessors, (52), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 20:05:13,126 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 20:05:13,126 INFO L93 Difference]: Finished difference Result 264 states and 403 transitions. [2024-10-12 20:05:13,127 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-12 20:05:13,128 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 17.333333333333332) internal successors, (52), 3 states have internal predecessors, (52), 0 states have call successors, (0), 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 52 [2024-10-12 20:05:13,128 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 20:05:13,129 INFO L225 Difference]: With dead ends: 264 [2024-10-12 20:05:13,129 INFO L226 Difference]: Without dead ends: 184 [2024-10-12 20:05:13,130 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-12 20:05:13,131 INFO L432 NwaCegarLoop]: 96 mSDtfsCounter, 42 mSDsluCounter, 60 mSDsCounter, 0 mSdLazyCounter, 13 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 42 SdHoareTripleChecker+Valid, 156 SdHoareTripleChecker+Invalid, 14 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 13 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-12 20:05:13,134 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [42 Valid, 156 Invalid, 14 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 13 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-12 20:05:13,135 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 184 states. [2024-10-12 20:05:13,148 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 184 to 182. [2024-10-12 20:05:13,149 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 182 states, 181 states have (on average 1.4917127071823204) internal successors, (270), 181 states have internal predecessors, (270), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 20:05:13,150 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 182 states to 182 states and 270 transitions. [2024-10-12 20:05:13,151 INFO L78 Accepts]: Start accepts. Automaton has 182 states and 270 transitions. Word has length 52 [2024-10-12 20:05:13,151 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 20:05:13,151 INFO L471 AbstractCegarLoop]: Abstraction has 182 states and 270 transitions. [2024-10-12 20:05:13,151 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 17.333333333333332) internal successors, (52), 3 states have internal predecessors, (52), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 20:05:13,152 INFO L276 IsEmpty]: Start isEmpty. Operand 182 states and 270 transitions. [2024-10-12 20:05:13,153 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2024-10-12 20:05:13,153 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 20:05:13,153 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-12 20:05:13,154 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-10-12 20:05:13,154 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 20:05:13,154 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 20:05:13,155 INFO L85 PathProgramCache]: Analyzing trace with hash -1108368538, now seen corresponding path program 1 times [2024-10-12 20:05:13,155 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 20:05:13,155 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1501747979] [2024-10-12 20:05:13,155 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 20:05:13,155 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 20:05:13,184 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 20:05:13,489 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-12 20:05:13,489 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 20:05:13,490 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1501747979] [2024-10-12 20:05:13,490 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1501747979] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 20:05:13,490 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 20:05:13,490 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-10-12 20:05:13,490 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [701380682] [2024-10-12 20:05:13,491 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 20:05:13,491 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-12 20:05:13,491 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 20:05:13,492 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-12 20:05:13,492 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2024-10-12 20:05:13,492 INFO L87 Difference]: Start difference. First operand 182 states and 270 transitions. Second operand has 7 states, 7 states have (on average 7.428571428571429) internal successors, (52), 7 states have internal predecessors, (52), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 20:05:13,676 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 20:05:13,677 INFO L93 Difference]: Finished difference Result 331 states and 506 transitions. [2024-10-12 20:05:13,677 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-10-12 20:05:13,678 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 7.428571428571429) internal successors, (52), 7 states have internal predecessors, (52), 0 states have call successors, (0), 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 52 [2024-10-12 20:05:13,678 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 20:05:13,681 INFO L225 Difference]: With dead ends: 331 [2024-10-12 20:05:13,681 INFO L226 Difference]: Without dead ends: 184 [2024-10-12 20:05:13,681 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=36, Invalid=54, Unknown=0, NotChecked=0, Total=90 [2024-10-12 20:05:13,682 INFO L432 NwaCegarLoop]: 91 mSDtfsCounter, 249 mSDsluCounter, 245 mSDsCounter, 0 mSdLazyCounter, 65 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 249 SdHoareTripleChecker+Valid, 336 SdHoareTripleChecker+Invalid, 70 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 65 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-12 20:05:13,683 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [249 Valid, 336 Invalid, 70 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 65 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-12 20:05:13,686 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 184 states. [2024-10-12 20:05:13,696 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 184 to 182. [2024-10-12 20:05:13,696 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 182 states, 181 states have (on average 1.4806629834254144) internal successors, (268), 181 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-10-12 20:05:13,697 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 182 states to 182 states and 268 transitions. [2024-10-12 20:05:13,698 INFO L78 Accepts]: Start accepts. Automaton has 182 states and 268 transitions. Word has length 52 [2024-10-12 20:05:13,698 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 20:05:13,698 INFO L471 AbstractCegarLoop]: Abstraction has 182 states and 268 transitions. [2024-10-12 20:05:13,698 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 7.428571428571429) internal successors, (52), 7 states have internal predecessors, (52), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 20:05:13,699 INFO L276 IsEmpty]: Start isEmpty. Operand 182 states and 268 transitions. [2024-10-12 20:05:13,700 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2024-10-12 20:05:13,700 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 20:05:13,701 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-12 20:05:13,701 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-10-12 20:05:13,701 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 20:05:13,702 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 20:05:13,702 INFO L85 PathProgramCache]: Analyzing trace with hash -13730052, now seen corresponding path program 1 times [2024-10-12 20:05:13,702 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 20:05:13,702 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1687936883] [2024-10-12 20:05:13,702 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 20:05:13,702 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 20:05:13,735 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 20:05:13,871 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-12 20:05:13,872 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 20:05:13,872 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1687936883] [2024-10-12 20:05:13,872 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1687936883] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 20:05:13,872 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 20:05:13,872 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-12 20:05:13,872 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1751382532] [2024-10-12 20:05:13,872 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 20:05:13,873 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-12 20:05:13,873 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 20:05:13,873 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-12 20:05:13,873 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-12 20:05:13,874 INFO L87 Difference]: Start difference. First operand 182 states and 268 transitions. Second operand has 4 states, 4 states have (on average 13.25) internal successors, (53), 4 states have internal predecessors, (53), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 20:05:13,900 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 20:05:13,900 INFO L93 Difference]: Finished difference Result 188 states and 275 transitions. [2024-10-12 20:05:13,902 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-12 20:05:13,902 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 13.25) internal successors, (53), 4 states have internal predecessors, (53), 0 states have call successors, (0), 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 53 [2024-10-12 20:05:13,902 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 20:05:13,903 INFO L225 Difference]: With dead ends: 188 [2024-10-12 20:05:13,903 INFO L226 Difference]: Without dead ends: 186 [2024-10-12 20:05:13,903 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-12 20:05:13,904 INFO L432 NwaCegarLoop]: 97 mSDtfsCounter, 0 mSDsluCounter, 186 mSDsCounter, 0 mSdLazyCounter, 18 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 283 SdHoareTripleChecker+Invalid, 19 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 18 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-12 20:05:13,905 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 283 Invalid, 19 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 18 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-12 20:05:13,909 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 186 states. [2024-10-12 20:05:13,917 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 186 to 186. [2024-10-12 20:05:13,918 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 186 states, 185 states have (on average 1.4648648648648648) internal successors, (271), 185 states have internal predecessors, (271), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 20:05:13,919 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 186 states to 186 states and 271 transitions. [2024-10-12 20:05:13,922 INFO L78 Accepts]: Start accepts. Automaton has 186 states and 271 transitions. Word has length 53 [2024-10-12 20:05:13,922 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 20:05:13,923 INFO L471 AbstractCegarLoop]: Abstraction has 186 states and 271 transitions. [2024-10-12 20:05:13,923 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 13.25) internal successors, (53), 4 states have internal predecessors, (53), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 20:05:13,923 INFO L276 IsEmpty]: Start isEmpty. Operand 186 states and 271 transitions. [2024-10-12 20:05:13,924 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2024-10-12 20:05:13,924 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 20:05:13,924 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-12 20:05:13,925 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-10-12 20:05:13,925 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 20:05:13,925 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 20:05:13,925 INFO L85 PathProgramCache]: Analyzing trace with hash -1384081850, now seen corresponding path program 1 times [2024-10-12 20:05:13,925 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 20:05:13,925 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1174645629] [2024-10-12 20:05:13,926 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 20:05:13,926 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 20:05:13,953 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 20:05:14,001 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-12 20:05:14,003 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 20:05:14,003 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1174645629] [2024-10-12 20:05:14,004 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1174645629] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 20:05:14,004 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 20:05:14,004 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-12 20:05:14,004 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1501068724] [2024-10-12 20:05:14,004 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 20:05:14,005 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-12 20:05:14,005 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 20:05:14,005 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-12 20:05:14,005 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-12 20:05:14,006 INFO L87 Difference]: Start difference. First operand 186 states and 271 transitions. Second operand has 3 states, 3 states have (on average 18.0) internal successors, (54), 3 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 20:05:14,025 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 20:05:14,026 INFO L93 Difference]: Finished difference Result 348 states and 524 transitions. [2024-10-12 20:05:14,026 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-12 20:05:14,027 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 18.0) internal successors, (54), 3 states have internal predecessors, (54), 0 states have call successors, (0), 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 54 [2024-10-12 20:05:14,027 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 20:05:14,028 INFO L225 Difference]: With dead ends: 348 [2024-10-12 20:05:14,029 INFO L226 Difference]: Without dead ends: 264 [2024-10-12 20:05:14,029 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-12 20:05:14,032 INFO L432 NwaCegarLoop]: 148 mSDtfsCounter, 56 mSDsluCounter, 66 mSDsCounter, 0 mSdLazyCounter, 9 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 56 SdHoareTripleChecker+Valid, 214 SdHoareTripleChecker+Invalid, 10 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 9 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-12 20:05:14,032 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [56 Valid, 214 Invalid, 10 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 9 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-12 20:05:14,033 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 264 states. [2024-10-12 20:05:14,041 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 264 to 262. [2024-10-12 20:05:14,042 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 262 states, 261 states have (on average 1.4865900383141764) internal successors, (388), 261 states have internal predecessors, (388), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 20:05:14,043 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 262 states to 262 states and 388 transitions. [2024-10-12 20:05:14,044 INFO L78 Accepts]: Start accepts. Automaton has 262 states and 388 transitions. Word has length 54 [2024-10-12 20:05:14,044 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 20:05:14,044 INFO L471 AbstractCegarLoop]: Abstraction has 262 states and 388 transitions. [2024-10-12 20:05:14,044 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 18.0) internal successors, (54), 3 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 20:05:14,044 INFO L276 IsEmpty]: Start isEmpty. Operand 262 states and 388 transitions. [2024-10-12 20:05:14,045 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2024-10-12 20:05:14,046 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 20:05:14,046 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-12 20:05:14,046 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-10-12 20:05:14,046 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 20:05:14,047 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 20:05:14,047 INFO L85 PathProgramCache]: Analyzing trace with hash -1612721082, now seen corresponding path program 1 times [2024-10-12 20:05:14,047 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 20:05:14,047 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1911150942] [2024-10-12 20:05:14,047 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 20:05:14,047 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 20:05:14,064 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 20:05:14,099 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-12 20:05:14,100 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 20:05:14,100 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1911150942] [2024-10-12 20:05:14,100 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1911150942] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 20:05:14,100 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 20:05:14,100 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-12 20:05:14,101 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [111727890] [2024-10-12 20:05:14,101 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 20:05:14,101 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-12 20:05:14,101 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 20:05:14,102 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-12 20:05:14,102 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-12 20:05:14,102 INFO L87 Difference]: Start difference. First operand 262 states and 388 transitions. Second operand has 3 states, 3 states have (on average 18.0) internal successors, (54), 3 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 20:05:14,125 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 20:05:14,125 INFO L93 Difference]: Finished difference Result 688 states and 1048 transitions. [2024-10-12 20:05:14,126 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-12 20:05:14,126 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 18.0) internal successors, (54), 3 states have internal predecessors, (54), 0 states have call successors, (0), 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 54 [2024-10-12 20:05:14,126 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 20:05:14,128 INFO L225 Difference]: With dead ends: 688 [2024-10-12 20:05:14,128 INFO L226 Difference]: Without dead ends: 463 [2024-10-12 20:05:14,129 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-12 20:05:14,129 INFO L432 NwaCegarLoop]: 140 mSDtfsCounter, 52 mSDsluCounter, 74 mSDsCounter, 0 mSdLazyCounter, 9 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 52 SdHoareTripleChecker+Valid, 214 SdHoareTripleChecker+Invalid, 10 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 9 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-12 20:05:14,130 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [52 Valid, 214 Invalid, 10 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 9 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-12 20:05:14,130 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 463 states. [2024-10-12 20:05:14,141 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 463 to 461. [2024-10-12 20:05:14,142 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 461 states, 460 states have (on average 1.5) internal successors, (690), 460 states have internal predecessors, (690), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 20:05:14,143 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 461 states to 461 states and 690 transitions. [2024-10-12 20:05:14,144 INFO L78 Accepts]: Start accepts. Automaton has 461 states and 690 transitions. Word has length 54 [2024-10-12 20:05:14,144 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 20:05:14,144 INFO L471 AbstractCegarLoop]: Abstraction has 461 states and 690 transitions. [2024-10-12 20:05:14,144 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 18.0) internal successors, (54), 3 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 20:05:14,144 INFO L276 IsEmpty]: Start isEmpty. Operand 461 states and 690 transitions. [2024-10-12 20:05:14,145 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2024-10-12 20:05:14,146 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 20:05:14,146 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-12 20:05:14,146 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-10-12 20:05:14,146 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 20:05:14,146 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 20:05:14,147 INFO L85 PathProgramCache]: Analyzing trace with hash 2056590150, now seen corresponding path program 1 times [2024-10-12 20:05:14,147 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 20:05:14,147 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [251333821] [2024-10-12 20:05:14,147 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 20:05:14,147 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 20:05:14,162 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 20:05:14,214 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-12 20:05:14,214 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 20:05:14,214 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [251333821] [2024-10-12 20:05:14,214 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [251333821] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 20:05:14,214 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 20:05:14,214 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-12 20:05:14,214 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1703399148] [2024-10-12 20:05:14,214 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 20:05:14,215 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-12 20:05:14,215 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 20:05:14,215 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-12 20:05:14,215 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-12 20:05:14,215 INFO L87 Difference]: Start difference. First operand 461 states and 690 transitions. Second operand has 3 states, 3 states have (on average 18.0) internal successors, (54), 3 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 20:05:14,245 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 20:05:14,246 INFO L93 Difference]: Finished difference Result 1261 states and 1912 transitions. [2024-10-12 20:05:14,249 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-12 20:05:14,250 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 18.0) internal successors, (54), 3 states have internal predecessors, (54), 0 states have call successors, (0), 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 54 [2024-10-12 20:05:14,250 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 20:05:14,253 INFO L225 Difference]: With dead ends: 1261 [2024-10-12 20:05:14,253 INFO L226 Difference]: Without dead ends: 837 [2024-10-12 20:05:14,255 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-12 20:05:14,256 INFO L432 NwaCegarLoop]: 138 mSDtfsCounter, 50 mSDsluCounter, 78 mSDsCounter, 0 mSdLazyCounter, 9 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 50 SdHoareTripleChecker+Valid, 216 SdHoareTripleChecker+Invalid, 10 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 9 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-12 20:05:14,256 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [50 Valid, 216 Invalid, 10 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 9 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-12 20:05:14,259 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 837 states. [2024-10-12 20:05:14,280 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 837 to 835. [2024-10-12 20:05:14,281 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 835 states, 834 states have (on average 1.4940047961630696) internal successors, (1246), 834 states have internal predecessors, (1246), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 20:05:14,283 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 835 states to 835 states and 1246 transitions. [2024-10-12 20:05:14,284 INFO L78 Accepts]: Start accepts. Automaton has 835 states and 1246 transitions. Word has length 54 [2024-10-12 20:05:14,284 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 20:05:14,284 INFO L471 AbstractCegarLoop]: Abstraction has 835 states and 1246 transitions. [2024-10-12 20:05:14,284 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 18.0) internal successors, (54), 3 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 20:05:14,284 INFO L276 IsEmpty]: Start isEmpty. Operand 835 states and 1246 transitions. [2024-10-12 20:05:14,285 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2024-10-12 20:05:14,289 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 20:05:14,289 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-12 20:05:14,289 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-10-12 20:05:14,289 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 20:05:14,290 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 20:05:14,290 INFO L85 PathProgramCache]: Analyzing trace with hash -1349643706, now seen corresponding path program 1 times [2024-10-12 20:05:14,290 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 20:05:14,290 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [388052818] [2024-10-12 20:05:14,290 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 20:05:14,290 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 20:05:14,324 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 20:05:14,367 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-12 20:05:14,368 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 20:05:14,368 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [388052818] [2024-10-12 20:05:14,368 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [388052818] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 20:05:14,368 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 20:05:14,368 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-12 20:05:14,368 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1763136104] [2024-10-12 20:05:14,368 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 20:05:14,369 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-12 20:05:14,370 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 20:05:14,371 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-12 20:05:14,371 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-12 20:05:14,371 INFO L87 Difference]: Start difference. First operand 835 states and 1246 transitions. Second operand has 3 states, 3 states have (on average 18.0) internal successors, (54), 3 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 20:05:14,411 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 20:05:14,412 INFO L93 Difference]: Finished difference Result 2335 states and 3496 transitions. [2024-10-12 20:05:14,412 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-12 20:05:14,412 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 18.0) internal successors, (54), 3 states have internal predecessors, (54), 0 states have call successors, (0), 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 54 [2024-10-12 20:05:14,413 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 20:05:14,419 INFO L225 Difference]: With dead ends: 2335 [2024-10-12 20:05:14,420 INFO L226 Difference]: Without dead ends: 1537 [2024-10-12 20:05:14,421 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-12 20:05:14,422 INFO L432 NwaCegarLoop]: 136 mSDtfsCounter, 48 mSDsluCounter, 82 mSDsCounter, 0 mSdLazyCounter, 9 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 48 SdHoareTripleChecker+Valid, 218 SdHoareTripleChecker+Invalid, 10 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 9 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-12 20:05:14,423 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [48 Valid, 218 Invalid, 10 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 9 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-12 20:05:14,425 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1537 states. [2024-10-12 20:05:14,461 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1537 to 1535. [2024-10-12 20:05:14,464 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1535 states, 1534 states have (on average 1.4745762711864407) internal successors, (2262), 1534 states have internal predecessors, (2262), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 20:05:14,468 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1535 states to 1535 states and 2262 transitions. [2024-10-12 20:05:14,469 INFO L78 Accepts]: Start accepts. Automaton has 1535 states and 2262 transitions. Word has length 54 [2024-10-12 20:05:14,470 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 20:05:14,470 INFO L471 AbstractCegarLoop]: Abstraction has 1535 states and 2262 transitions. [2024-10-12 20:05:14,470 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 18.0) internal successors, (54), 3 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 20:05:14,470 INFO L276 IsEmpty]: Start isEmpty. Operand 1535 states and 2262 transitions. [2024-10-12 20:05:14,471 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2024-10-12 20:05:14,471 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 20:05:14,471 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-12 20:05:14,471 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2024-10-12 20:05:14,472 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 20:05:14,472 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 20:05:14,472 INFO L85 PathProgramCache]: Analyzing trace with hash -1652665018, now seen corresponding path program 1 times [2024-10-12 20:05:14,474 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 20:05:14,474 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1728040684] [2024-10-12 20:05:14,474 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 20:05:14,475 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 20:05:14,495 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 20:05:14,538 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-12 20:05:14,538 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 20:05:14,538 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1728040684] [2024-10-12 20:05:14,538 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1728040684] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 20:05:14,539 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 20:05:14,539 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-12 20:05:14,539 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [781923788] [2024-10-12 20:05:14,539 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 20:05:14,539 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-12 20:05:14,539 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 20:05:14,540 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-12 20:05:14,540 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-12 20:05:14,540 INFO L87 Difference]: Start difference. First operand 1535 states and 2262 transitions. Second operand has 3 states, 3 states have (on average 18.0) internal successors, (54), 3 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 20:05:14,605 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 20:05:14,605 INFO L93 Difference]: Finished difference Result 4339 states and 6376 transitions. [2024-10-12 20:05:14,605 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-12 20:05:14,606 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 18.0) internal successors, (54), 3 states have internal predecessors, (54), 0 states have call successors, (0), 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 54 [2024-10-12 20:05:14,606 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 20:05:14,616 INFO L225 Difference]: With dead ends: 4339 [2024-10-12 20:05:14,616 INFO L226 Difference]: Without dead ends: 2841 [2024-10-12 20:05:14,618 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-12 20:05:14,619 INFO L432 NwaCegarLoop]: 150 mSDtfsCounter, 54 mSDsluCounter, 70 mSDsCounter, 0 mSdLazyCounter, 9 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 54 SdHoareTripleChecker+Valid, 220 SdHoareTripleChecker+Invalid, 10 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 9 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-12 20:05:14,619 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [54 Valid, 220 Invalid, 10 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 9 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-12 20:05:14,622 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2841 states. [2024-10-12 20:05:14,690 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2841 to 2839. [2024-10-12 20:05:14,695 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2839 states, 2838 states have (on average 1.4453840732910501) internal successors, (4102), 2838 states have internal predecessors, (4102), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 20:05:14,703 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2839 states to 2839 states and 4102 transitions. [2024-10-12 20:05:14,704 INFO L78 Accepts]: Start accepts. Automaton has 2839 states and 4102 transitions. Word has length 54 [2024-10-12 20:05:14,705 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 20:05:14,705 INFO L471 AbstractCegarLoop]: Abstraction has 2839 states and 4102 transitions. [2024-10-12 20:05:14,705 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 18.0) internal successors, (54), 3 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 20:05:14,705 INFO L276 IsEmpty]: Start isEmpty. Operand 2839 states and 4102 transitions. [2024-10-12 20:05:14,707 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 73 [2024-10-12 20:05:14,707 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 20:05:14,707 INFO L215 NwaCegarLoop]: trace histogram [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] [2024-10-12 20:05:14,707 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2024-10-12 20:05:14,707 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 20:05:14,708 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 20:05:14,708 INFO L85 PathProgramCache]: Analyzing trace with hash 824044613, now seen corresponding path program 1 times [2024-10-12 20:05:14,708 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 20:05:14,708 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [963091840] [2024-10-12 20:05:14,708 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 20:05:14,709 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 20:05:14,751 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 20:05:14,938 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 12 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-10-12 20:05:14,939 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 20:05:14,939 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [963091840] [2024-10-12 20:05:14,939 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [963091840] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 20:05:14,939 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 20:05:14,939 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-10-12 20:05:14,940 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [639507772] [2024-10-12 20:05:14,940 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 20:05:14,940 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-12 20:05:14,940 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 20:05:14,941 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-12 20:05:14,942 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2024-10-12 20:05:14,942 INFO L87 Difference]: Start difference. First operand 2839 states and 4102 transitions. Second operand has 7 states, 7 states have (on average 10.142857142857142) internal successors, (71), 7 states have internal predecessors, (71), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 20:05:15,340 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 20:05:15,340 INFO L93 Difference]: Finished difference Result 16627 states and 24092 transitions. [2024-10-12 20:05:15,341 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-10-12 20:05:15,341 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 10.142857142857142) internal successors, (71), 7 states have internal predecessors, (71), 0 states have call successors, (0), 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 72 [2024-10-12 20:05:15,341 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 20:05:15,390 INFO L225 Difference]: With dead ends: 16627 [2024-10-12 20:05:15,392 INFO L226 Difference]: Without dead ends: 14641 [2024-10-12 20:05:15,399 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=40, Invalid=70, Unknown=0, NotChecked=0, Total=110 [2024-10-12 20:05:15,400 INFO L432 NwaCegarLoop]: 157 mSDtfsCounter, 541 mSDsluCounter, 507 mSDsCounter, 0 mSdLazyCounter, 100 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 541 SdHoareTripleChecker+Valid, 664 SdHoareTripleChecker+Invalid, 100 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 100 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-12 20:05:15,400 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [541 Valid, 664 Invalid, 100 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 100 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-12 20:05:15,412 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14641 states. [2024-10-12 20:05:15,629 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14641 to 5239. [2024-10-12 20:05:15,637 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5239 states, 5238 states have (on average 1.4398625429553265) internal successors, (7542), 5238 states have internal predecessors, (7542), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 20:05:15,653 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5239 states to 5239 states and 7542 transitions. [2024-10-12 20:05:15,654 INFO L78 Accepts]: Start accepts. Automaton has 5239 states and 7542 transitions. Word has length 72 [2024-10-12 20:05:15,654 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 20:05:15,655 INFO L471 AbstractCegarLoop]: Abstraction has 5239 states and 7542 transitions. [2024-10-12 20:05:15,655 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 10.142857142857142) internal successors, (71), 7 states have internal predecessors, (71), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 20:05:15,655 INFO L276 IsEmpty]: Start isEmpty. Operand 5239 states and 7542 transitions. [2024-10-12 20:05:15,657 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 73 [2024-10-12 20:05:15,657 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 20:05:15,657 INFO L215 NwaCegarLoop]: trace histogram [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] [2024-10-12 20:05:15,657 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2024-10-12 20:05:15,657 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 20:05:15,658 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 20:05:15,658 INFO L85 PathProgramCache]: Analyzing trace with hash 595405381, now seen corresponding path program 1 times [2024-10-12 20:05:15,658 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 20:05:15,658 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1722028415] [2024-10-12 20:05:15,659 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 20:05:15,659 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 20:05:15,684 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 20:05:15,836 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2024-10-12 20:05:15,836 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 20:05:15,836 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1722028415] [2024-10-12 20:05:15,836 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1722028415] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 20:05:15,836 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 20:05:15,837 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-10-12 20:05:15,837 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1739803689] [2024-10-12 20:05:15,837 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 20:05:15,837 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-12 20:05:15,837 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 20:05:15,837 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-12 20:05:15,838 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2024-10-12 20:05:15,838 INFO L87 Difference]: Start difference. First operand 5239 states and 7542 transitions. Second operand has 7 states, 7 states have (on average 9.571428571428571) internal successors, (67), 7 states have internal predecessors, (67), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 20:05:16,298 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 20:05:16,298 INFO L93 Difference]: Finished difference Result 19427 states and 28124 transitions. [2024-10-12 20:05:16,298 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-10-12 20:05:16,299 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 9.571428571428571) internal successors, (67), 7 states have internal predecessors, (67), 0 states have call successors, (0), 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 72 [2024-10-12 20:05:16,299 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 20:05:16,350 INFO L225 Difference]: With dead ends: 19427 [2024-10-12 20:05:16,351 INFO L226 Difference]: Without dead ends: 16625 [2024-10-12 20:05:16,358 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=40, Invalid=70, Unknown=0, NotChecked=0, Total=110 [2024-10-12 20:05:16,359 INFO L432 NwaCegarLoop]: 157 mSDtfsCounter, 586 mSDsluCounter, 540 mSDsCounter, 0 mSdLazyCounter, 100 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 586 SdHoareTripleChecker+Valid, 697 SdHoareTripleChecker+Invalid, 100 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 100 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-12 20:05:16,360 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [586 Valid, 697 Invalid, 100 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 100 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-12 20:05:16,374 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16625 states. [2024-10-12 20:05:16,758 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16625 to 9031. [2024-10-12 20:05:16,773 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9031 states, 9030 states have (on average 1.4358803986710964) internal successors, (12966), 9030 states have internal predecessors, (12966), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 20:05:16,801 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9031 states to 9031 states and 12966 transitions. [2024-10-12 20:05:16,802 INFO L78 Accepts]: Start accepts. Automaton has 9031 states and 12966 transitions. Word has length 72 [2024-10-12 20:05:16,802 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 20:05:16,803 INFO L471 AbstractCegarLoop]: Abstraction has 9031 states and 12966 transitions. [2024-10-12 20:05:16,803 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 9.571428571428571) internal successors, (67), 7 states have internal predecessors, (67), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 20:05:16,803 INFO L276 IsEmpty]: Start isEmpty. Operand 9031 states and 12966 transitions. [2024-10-12 20:05:16,805 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 73 [2024-10-12 20:05:16,805 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 20:05:16,805 INFO L215 NwaCegarLoop]: trace histogram [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] [2024-10-12 20:05:16,805 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2024-10-12 20:05:16,805 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 20:05:16,806 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 20:05:16,806 INFO L85 PathProgramCache]: Analyzing trace with hash -30250683, now seen corresponding path program 1 times [2024-10-12 20:05:16,806 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 20:05:16,806 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1377629882] [2024-10-12 20:05:16,806 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 20:05:16,806 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 20:05:16,825 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 20:05:16,947 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2024-10-12 20:05:16,947 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 20:05:16,948 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1377629882] [2024-10-12 20:05:16,948 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1377629882] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 20:05:16,948 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 20:05:16,948 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-10-12 20:05:16,948 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1919022438] [2024-10-12 20:05:16,948 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 20:05:16,949 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-12 20:05:16,949 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 20:05:16,949 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-12 20:05:16,950 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2024-10-12 20:05:16,950 INFO L87 Difference]: Start difference. First operand 9031 states and 12966 transitions. Second operand has 7 states, 7 states have (on average 9.285714285714286) internal successors, (65), 7 states have internal predecessors, (65), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 20:05:17,452 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 20:05:17,452 INFO L93 Difference]: Finished difference Result 22227 states and 32140 transitions. [2024-10-12 20:05:17,452 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-10-12 20:05:17,453 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 9.285714285714286) internal successors, (65), 7 states have internal predecessors, (65), 0 states have call successors, (0), 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 72 [2024-10-12 20:05:17,453 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 20:05:17,492 INFO L225 Difference]: With dead ends: 22227 [2024-10-12 20:05:17,492 INFO L226 Difference]: Without dead ends: 19425 [2024-10-12 20:05:17,502 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=40, Invalid=70, Unknown=0, NotChecked=0, Total=110 [2024-10-12 20:05:17,503 INFO L432 NwaCegarLoop]: 155 mSDtfsCounter, 631 mSDsluCounter, 507 mSDsCounter, 0 mSdLazyCounter, 101 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 631 SdHoareTripleChecker+Valid, 662 SdHoareTripleChecker+Invalid, 101 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 101 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-12 20:05:17,503 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [631 Valid, 662 Invalid, 101 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 101 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-12 20:05:17,522 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19425 states. [2024-10-12 20:05:17,927 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19425 to 11831. [2024-10-12 20:05:17,947 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 11831 states, 11830 states have (on average 1.4355029585798817) internal successors, (16982), 11830 states have internal predecessors, (16982), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 20:05:17,972 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11831 states to 11831 states and 16982 transitions. [2024-10-12 20:05:17,974 INFO L78 Accepts]: Start accepts. Automaton has 11831 states and 16982 transitions. Word has length 72 [2024-10-12 20:05:17,974 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 20:05:17,974 INFO L471 AbstractCegarLoop]: Abstraction has 11831 states and 16982 transitions. [2024-10-12 20:05:17,974 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 9.285714285714286) internal successors, (65), 7 states have internal predecessors, (65), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 20:05:17,975 INFO L276 IsEmpty]: Start isEmpty. Operand 11831 states and 16982 transitions. [2024-10-12 20:05:17,977 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 73 [2024-10-12 20:05:17,978 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 20:05:17,978 INFO L215 NwaCegarLoop]: trace histogram [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] [2024-10-12 20:05:17,978 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2024-10-12 20:05:17,978 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 20:05:17,979 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 20:05:17,980 INFO L85 PathProgramCache]: Analyzing trace with hash 858482757, now seen corresponding path program 1 times [2024-10-12 20:05:17,980 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 20:05:17,981 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1069385753] [2024-10-12 20:05:17,981 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 20:05:17,981 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 20:05:17,998 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 20:05:18,117 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2024-10-12 20:05:18,117 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 20:05:18,117 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1069385753] [2024-10-12 20:05:18,117 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1069385753] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 20:05:18,118 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 20:05:18,118 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-10-12 20:05:18,118 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1475691517] [2024-10-12 20:05:18,118 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 20:05:18,118 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-12 20:05:18,119 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 20:05:18,119 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-12 20:05:18,119 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2024-10-12 20:05:18,119 INFO L87 Difference]: Start difference. First operand 11831 states and 16982 transitions. Second operand has 7 states, 7 states have (on average 9.0) internal successors, (63), 7 states have internal predecessors, (63), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 20:05:18,796 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 20:05:18,796 INFO L93 Difference]: Finished difference Result 25027 states and 36156 transitions. [2024-10-12 20:05:18,797 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-10-12 20:05:18,797 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 9.0) internal successors, (63), 7 states have internal predecessors, (63), 0 states have call successors, (0), 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 72 [2024-10-12 20:05:18,797 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 20:05:18,839 INFO L225 Difference]: With dead ends: 25027 [2024-10-12 20:05:18,840 INFO L226 Difference]: Without dead ends: 22225 [2024-10-12 20:05:18,851 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=40, Invalid=70, Unknown=0, NotChecked=0, Total=110 [2024-10-12 20:05:18,852 INFO L432 NwaCegarLoop]: 155 mSDtfsCounter, 589 mSDsluCounter, 545 mSDsCounter, 0 mSdLazyCounter, 110 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 589 SdHoareTripleChecker+Valid, 700 SdHoareTripleChecker+Invalid, 110 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 110 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-12 20:05:18,852 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [589 Valid, 700 Invalid, 110 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 110 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-12 20:05:18,866 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22225 states. [2024-10-12 20:05:19,400 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22225 to 14631. [2024-10-12 20:05:19,420 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 14631 states, 14630 states have (on average 1.43526999316473) internal successors, (20998), 14630 states have internal predecessors, (20998), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 20:05:19,450 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14631 states to 14631 states and 20998 transitions. [2024-10-12 20:05:19,452 INFO L78 Accepts]: Start accepts. Automaton has 14631 states and 20998 transitions. Word has length 72 [2024-10-12 20:05:19,452 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 20:05:19,452 INFO L471 AbstractCegarLoop]: Abstraction has 14631 states and 20998 transitions. [2024-10-12 20:05:19,452 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 9.0) internal successors, (63), 7 states have internal predecessors, (63), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 20:05:19,452 INFO L276 IsEmpty]: Start isEmpty. Operand 14631 states and 20998 transitions. [2024-10-12 20:05:19,454 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 73 [2024-10-12 20:05:19,455 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 20:05:19,455 INFO L215 NwaCegarLoop]: trace histogram [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] [2024-10-12 20:05:19,455 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2024-10-12 20:05:19,455 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 20:05:19,456 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 20:05:19,456 INFO L85 PathProgramCache]: Analyzing trace with hash 555461445, now seen corresponding path program 1 times [2024-10-12 20:05:19,456 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 20:05:19,456 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1137407122] [2024-10-12 20:05:19,456 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 20:05:19,456 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 20:05:19,476 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 20:05:19,595 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 10 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-10-12 20:05:19,595 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 20:05:19,595 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1137407122] [2024-10-12 20:05:19,596 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1137407122] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 20:05:19,596 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 20:05:19,596 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-10-12 20:05:19,596 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1094676544] [2024-10-12 20:05:19,596 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 20:05:19,597 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-12 20:05:19,597 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 20:05:19,597 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-12 20:05:19,597 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2024-10-12 20:05:19,598 INFO L87 Difference]: Start difference. First operand 14631 states and 20998 transitions. Second operand has 7 states, 7 states have (on average 9.857142857142858) internal successors, (69), 7 states have internal predecessors, (69), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 20:05:20,208 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 20:05:20,208 INFO L93 Difference]: Finished difference Result 27827 states and 40172 transitions. [2024-10-12 20:05:20,209 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-10-12 20:05:20,209 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 9.857142857142858) internal successors, (69), 7 states have internal predecessors, (69), 0 states have call successors, (0), 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 72 [2024-10-12 20:05:20,209 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 20:05:20,258 INFO L225 Difference]: With dead ends: 27827 [2024-10-12 20:05:20,258 INFO L226 Difference]: Without dead ends: 25025 [2024-10-12 20:05:20,266 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=40, Invalid=70, Unknown=0, NotChecked=0, Total=110 [2024-10-12 20:05:20,267 INFO L432 NwaCegarLoop]: 154 mSDtfsCounter, 543 mSDsluCounter, 620 mSDsCounter, 0 mSdLazyCounter, 127 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 543 SdHoareTripleChecker+Valid, 774 SdHoareTripleChecker+Invalid, 127 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 127 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-12 20:05:20,267 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [543 Valid, 774 Invalid, 127 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 127 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-12 20:05:20,283 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25025 states. [2024-10-12 20:05:20,882 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25025 to 17431. [2024-10-12 20:05:20,907 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 17431 states, 17430 states have (on average 1.4351118760757315) internal successors, (25014), 17430 states have internal predecessors, (25014), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 20:05:20,939 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17431 states to 17431 states and 25014 transitions. [2024-10-12 20:05:20,941 INFO L78 Accepts]: Start accepts. Automaton has 17431 states and 25014 transitions. Word has length 72 [2024-10-12 20:05:20,941 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 20:05:20,941 INFO L471 AbstractCegarLoop]: Abstraction has 17431 states and 25014 transitions. [2024-10-12 20:05:20,941 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 9.857142857142858) internal successors, (69), 7 states have internal predecessors, (69), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 20:05:20,942 INFO L276 IsEmpty]: Start isEmpty. Operand 17431 states and 25014 transitions. [2024-10-12 20:05:20,944 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 74 [2024-10-12 20:05:20,944 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 20:05:20,944 INFO L215 NwaCegarLoop]: trace histogram [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-10-12 20:05:20,945 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2024-10-12 20:05:20,945 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 20:05:20,945 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 20:05:20,945 INFO L85 PathProgramCache]: Analyzing trace with hash 1054594028, now seen corresponding path program 1 times [2024-10-12 20:05:20,945 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 20:05:20,945 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1508286655] [2024-10-12 20:05:20,946 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 20:05:20,946 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 20:05:20,979 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 20:05:21,064 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 16 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-12 20:05:21,064 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 20:05:21,065 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1508286655] [2024-10-12 20:05:21,065 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1508286655] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 20:05:21,065 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 20:05:21,065 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-12 20:05:21,065 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1084122690] [2024-10-12 20:05:21,065 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 20:05:21,066 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-12 20:05:21,066 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 20:05:21,066 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-12 20:05:21,066 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-12 20:05:21,067 INFO L87 Difference]: Start difference. First operand 17431 states and 25014 transitions. Second operand has 3 states, 3 states have (on average 24.333333333333332) internal successors, (73), 3 states have internal predecessors, (73), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 20:05:21,524 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 20:05:21,524 INFO L93 Difference]: Finished difference Result 34827 states and 49992 transitions. [2024-10-12 20:05:21,524 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-12 20:05:21,524 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 24.333333333333332) internal successors, (73), 3 states have internal predecessors, (73), 0 states have call successors, (0), 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 73 [2024-10-12 20:05:21,525 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 20:05:21,556 INFO L225 Difference]: With dead ends: 34827 [2024-10-12 20:05:21,557 INFO L226 Difference]: Without dead ends: 17433 [2024-10-12 20:05:21,572 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-12 20:05:21,573 INFO L432 NwaCegarLoop]: 132 mSDtfsCounter, 45 mSDsluCounter, 88 mSDsCounter, 0 mSdLazyCounter, 9 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 45 SdHoareTripleChecker+Valid, 220 SdHoareTripleChecker+Invalid, 9 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 9 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-12 20:05:21,573 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [45 Valid, 220 Invalid, 9 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 9 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-12 20:05:21,584 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17433 states. [2024-10-12 20:05:22,155 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17433 to 17431. [2024-10-12 20:05:22,174 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 17431 states, 17430 states have (on average 1.4181296615031556) internal successors, (24718), 17430 states have internal predecessors, (24718), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 20:05:22,216 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17431 states to 17431 states and 24718 transitions. [2024-10-12 20:05:22,219 INFO L78 Accepts]: Start accepts. Automaton has 17431 states and 24718 transitions. Word has length 73 [2024-10-12 20:05:22,219 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 20:05:22,219 INFO L471 AbstractCegarLoop]: Abstraction has 17431 states and 24718 transitions. [2024-10-12 20:05:22,219 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 24.333333333333332) internal successors, (73), 3 states have internal predecessors, (73), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 20:05:22,220 INFO L276 IsEmpty]: Start isEmpty. Operand 17431 states and 24718 transitions. [2024-10-12 20:05:22,221 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 75 [2024-10-12 20:05:22,222 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 20:05:22,222 INFO L215 NwaCegarLoop]: trace histogram [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] [2024-10-12 20:05:22,222 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2024-10-12 20:05:22,222 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 20:05:22,223 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 20:05:22,223 INFO L85 PathProgramCache]: Analyzing trace with hash 464946093, now seen corresponding path program 1 times [2024-10-12 20:05:22,223 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 20:05:22,223 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1846505287] [2024-10-12 20:05:22,223 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 20:05:22,224 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 20:05:22,254 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 20:05:22,345 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 16 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-12 20:05:22,345 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 20:05:22,345 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1846505287] [2024-10-12 20:05:22,345 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1846505287] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 20:05:22,346 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 20:05:22,346 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-12 20:05:22,346 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2077657746] [2024-10-12 20:05:22,346 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 20:05:22,346 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-12 20:05:22,347 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 20:05:22,347 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-12 20:05:22,347 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-12 20:05:22,347 INFO L87 Difference]: Start difference. First operand 17431 states and 24718 transitions. Second operand has 3 states, 3 states have (on average 24.666666666666668) internal successors, (74), 3 states have internal predecessors, (74), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 20:05:22,639 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 20:05:22,640 INFO L93 Difference]: Finished difference Result 23901 states and 33995 transitions. [2024-10-12 20:05:22,640 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-12 20:05:22,640 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 24.666666666666668) internal successors, (74), 3 states have internal predecessors, (74), 0 states have call successors, (0), 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 74 [2024-10-12 20:05:22,640 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 20:05:22,652 INFO L225 Difference]: With dead ends: 23901 [2024-10-12 20:05:22,653 INFO L226 Difference]: Without dead ends: 6507 [2024-10-12 20:05:22,666 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-12 20:05:22,668 INFO L432 NwaCegarLoop]: 130 mSDtfsCounter, 39 mSDsluCounter, 87 mSDsCounter, 0 mSdLazyCounter, 9 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 39 SdHoareTripleChecker+Valid, 217 SdHoareTripleChecker+Invalid, 9 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 9 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-12 20:05:22,669 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [39 Valid, 217 Invalid, 9 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 9 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-12 20:05:22,673 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6507 states. [2024-10-12 20:05:22,807 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6507 to 6500. [2024-10-12 20:05:22,812 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6500 states, 6499 states have (on average 1.416064009847669) internal successors, (9203), 6499 states have internal predecessors, (9203), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 20:05:22,824 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6500 states to 6500 states and 9203 transitions. [2024-10-12 20:05:22,825 INFO L78 Accepts]: Start accepts. Automaton has 6500 states and 9203 transitions. Word has length 74 [2024-10-12 20:05:22,826 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 20:05:22,826 INFO L471 AbstractCegarLoop]: Abstraction has 6500 states and 9203 transitions. [2024-10-12 20:05:22,826 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 24.666666666666668) internal successors, (74), 3 states have internal predecessors, (74), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 20:05:22,826 INFO L276 IsEmpty]: Start isEmpty. Operand 6500 states and 9203 transitions. [2024-10-12 20:05:22,827 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 76 [2024-10-12 20:05:22,827 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 20:05:22,828 INFO L215 NwaCegarLoop]: trace histogram [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] [2024-10-12 20:05:22,828 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2024-10-12 20:05:22,828 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 20:05:22,828 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 20:05:22,828 INFO L85 PathProgramCache]: Analyzing trace with hash -543313446, now seen corresponding path program 1 times [2024-10-12 20:05:22,829 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 20:05:22,829 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [18055100] [2024-10-12 20:05:22,829 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 20:05:22,829 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 20:05:22,847 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 20:05:22,911 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 16 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-12 20:05:22,911 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 20:05:22,911 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [18055100] [2024-10-12 20:05:22,911 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [18055100] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 20:05:22,911 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 20:05:22,911 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-12 20:05:22,911 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1930268352] [2024-10-12 20:05:22,912 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 20:05:22,912 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-12 20:05:22,912 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 20:05:22,912 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-12 20:05:22,912 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-12 20:05:22,912 INFO L87 Difference]: Start difference. First operand 6500 states and 9203 transitions. Second operand has 3 states, 3 states have (on average 25.0) internal successors, (75), 3 states have internal predecessors, (75), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 20:05:22,990 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 20:05:22,991 INFO L93 Difference]: Finished difference Result 9728 states and 13781 transitions. [2024-10-12 20:05:22,991 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-12 20:05:22,991 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 25.0) internal successors, (75), 3 states have internal predecessors, (75), 0 states have call successors, (0), 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 75 [2024-10-12 20:05:22,991 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 20:05:22,999 INFO L225 Difference]: With dead ends: 9728 [2024-10-12 20:05:22,999 INFO L226 Difference]: Without dead ends: 3278 [2024-10-12 20:05:23,005 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-12 20:05:23,007 INFO L432 NwaCegarLoop]: 124 mSDtfsCounter, 41 mSDsluCounter, 72 mSDsCounter, 0 mSdLazyCounter, 9 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 41 SdHoareTripleChecker+Valid, 196 SdHoareTripleChecker+Invalid, 9 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 9 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-12 20:05:23,008 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [41 Valid, 196 Invalid, 9 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 9 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-12 20:05:23,011 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3278 states. [2024-10-12 20:05:23,083 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3278 to 3276. [2024-10-12 20:05:23,086 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3276 states, 3275 states have (on average 1.3969465648854962) internal successors, (4575), 3275 states have internal predecessors, (4575), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 20:05:23,091 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3276 states to 3276 states and 4575 transitions. [2024-10-12 20:05:23,093 INFO L78 Accepts]: Start accepts. Automaton has 3276 states and 4575 transitions. Word has length 75 [2024-10-12 20:05:23,093 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 20:05:23,093 INFO L471 AbstractCegarLoop]: Abstraction has 3276 states and 4575 transitions. [2024-10-12 20:05:23,094 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 25.0) internal successors, (75), 3 states have internal predecessors, (75), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 20:05:23,094 INFO L276 IsEmpty]: Start isEmpty. Operand 3276 states and 4575 transitions. [2024-10-12 20:05:23,095 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 78 [2024-10-12 20:05:23,095 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 20:05:23,095 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-12 20:05:23,095 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2024-10-12 20:05:23,095 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 20:05:23,096 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 20:05:23,096 INFO L85 PathProgramCache]: Analyzing trace with hash -2064813752, now seen corresponding path program 1 times [2024-10-12 20:05:23,096 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 20:05:23,096 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1518186554] [2024-10-12 20:05:23,096 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 20:05:23,096 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 20:05:23,119 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 20:05:23,195 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 16 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-12 20:05:23,195 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 20:05:23,195 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1518186554] [2024-10-12 20:05:23,196 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1518186554] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 20:05:23,197 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 20:05:23,197 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-12 20:05:23,197 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [982352440] [2024-10-12 20:05:23,197 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 20:05:23,197 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-12 20:05:23,198 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 20:05:23,198 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-12 20:05:23,198 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-12 20:05:23,198 INFO L87 Difference]: Start difference. First operand 3276 states and 4575 transitions. Second operand has 3 states, 3 states have (on average 25.666666666666668) internal successors, (77), 3 states have internal predecessors, (77), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 20:05:23,246 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 20:05:23,246 INFO L93 Difference]: Finished difference Result 4892 states and 6839 transitions. [2024-10-12 20:05:23,247 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-12 20:05:23,247 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 25.666666666666668) internal successors, (77), 3 states have internal predecessors, (77), 0 states have call successors, (0), 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 77 [2024-10-12 20:05:23,247 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 20:05:23,251 INFO L225 Difference]: With dead ends: 4892 [2024-10-12 20:05:23,251 INFO L226 Difference]: Without dead ends: 1666 [2024-10-12 20:05:23,254 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-12 20:05:23,255 INFO L432 NwaCegarLoop]: 117 mSDtfsCounter, 38 mSDsluCounter, 64 mSDsCounter, 0 mSdLazyCounter, 9 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 38 SdHoareTripleChecker+Valid, 181 SdHoareTripleChecker+Invalid, 9 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 9 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-12 20:05:23,255 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [38 Valid, 181 Invalid, 9 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 9 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-12 20:05:23,257 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1666 states. [2024-10-12 20:05:23,292 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1666 to 1664. [2024-10-12 20:05:23,294 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1664 states, 1663 states have (on average 1.375225496091401) internal successors, (2287), 1663 states have internal predecessors, (2287), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 20:05:23,296 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1664 states to 1664 states and 2287 transitions. [2024-10-12 20:05:23,298 INFO L78 Accepts]: Start accepts. Automaton has 1664 states and 2287 transitions. Word has length 77 [2024-10-12 20:05:23,298 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 20:05:23,299 INFO L471 AbstractCegarLoop]: Abstraction has 1664 states and 2287 transitions. [2024-10-12 20:05:23,300 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 25.666666666666668) internal successors, (77), 3 states have internal predecessors, (77), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 20:05:23,300 INFO L276 IsEmpty]: Start isEmpty. Operand 1664 states and 2287 transitions. [2024-10-12 20:05:23,302 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 80 [2024-10-12 20:05:23,302 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 20:05:23,302 INFO L215 NwaCegarLoop]: trace histogram [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] [2024-10-12 20:05:23,302 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2024-10-12 20:05:23,302 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 20:05:23,303 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 20:05:23,303 INFO L85 PathProgramCache]: Analyzing trace with hash 603845174, now seen corresponding path program 1 times [2024-10-12 20:05:23,303 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 20:05:23,303 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [955272218] [2024-10-12 20:05:23,303 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 20:05:23,304 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 20:05:23,324 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 20:05:23,386 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 16 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-12 20:05:23,387 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 20:05:23,387 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [955272218] [2024-10-12 20:05:23,387 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [955272218] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 20:05:23,387 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 20:05:23,387 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-12 20:05:23,388 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [680487747] [2024-10-12 20:05:23,388 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 20:05:23,389 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-12 20:05:23,389 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 20:05:23,389 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-12 20:05:23,390 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-12 20:05:23,390 INFO L87 Difference]: Start difference. First operand 1664 states and 2287 transitions. Second operand has 3 states, 3 states have (on average 26.333333333333332) internal successors, (79), 3 states have internal predecessors, (79), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 20:05:23,427 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 20:05:23,427 INFO L93 Difference]: Finished difference Result 2474 states and 3407 transitions. [2024-10-12 20:05:23,428 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-12 20:05:23,428 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 26.333333333333332) internal successors, (79), 3 states have internal predecessors, (79), 0 states have call successors, (0), 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 79 [2024-10-12 20:05:23,428 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 20:05:23,431 INFO L225 Difference]: With dead ends: 2474 [2024-10-12 20:05:23,431 INFO L226 Difference]: Without dead ends: 860 [2024-10-12 20:05:23,433 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-12 20:05:23,435 INFO L432 NwaCegarLoop]: 110 mSDtfsCounter, 35 mSDsluCounter, 56 mSDsCounter, 0 mSdLazyCounter, 9 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 35 SdHoareTripleChecker+Valid, 166 SdHoareTripleChecker+Invalid, 9 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 9 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-12 20:05:23,435 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [35 Valid, 166 Invalid, 9 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 9 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-12 20:05:23,436 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 860 states. [2024-10-12 20:05:23,463 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 860 to 858. [2024-10-12 20:05:23,464 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 858 states, 857 states have (on average 1.3488914819136524) internal successors, (1156), 857 states have internal predecessors, (1156), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 20:05:23,466 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 858 states to 858 states and 1156 transitions. [2024-10-12 20:05:23,467 INFO L78 Accepts]: Start accepts. Automaton has 858 states and 1156 transitions. Word has length 79 [2024-10-12 20:05:23,468 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 20:05:23,468 INFO L471 AbstractCegarLoop]: Abstraction has 858 states and 1156 transitions. [2024-10-12 20:05:23,468 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 26.333333333333332) internal successors, (79), 3 states have internal predecessors, (79), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 20:05:23,468 INFO L276 IsEmpty]: Start isEmpty. Operand 858 states and 1156 transitions. [2024-10-12 20:05:23,469 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 82 [2024-10-12 20:05:23,469 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 20:05:23,469 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-12 20:05:23,470 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2024-10-12 20:05:23,470 INFO L396 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 20:05:23,470 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 20:05:23,471 INFO L85 PathProgramCache]: Analyzing trace with hash -1189473116, now seen corresponding path program 1 times [2024-10-12 20:05:23,471 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 20:05:23,471 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [150181569] [2024-10-12 20:05:23,471 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 20:05:23,471 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 20:05:23,506 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 20:05:24,451 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 6 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-12 20:05:24,451 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 20:05:24,451 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [150181569] [2024-10-12 20:05:24,451 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [150181569] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-12 20:05:24,452 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [762297581] [2024-10-12 20:05:24,452 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 20:05:24,452 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-12 20:05:24,452 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-12 20:05:24,454 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-12 20:05:24,456 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2024-10-12 20:05:24,586 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 20:05:24,590 INFO L255 TraceCheckSpWp]: Trace formula consists of 337 conjuncts, 11 conjuncts are in the unsatisfiable core [2024-10-12 20:05:24,599 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-12 20:05:24,877 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 3 proven. 11 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-10-12 20:05:24,877 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-12 20:05:25,093 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 3 proven. 11 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-10-12 20:05:25,093 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [762297581] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-12 20:05:25,093 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-12 20:05:25,094 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 5, 4] total 17 [2024-10-12 20:05:25,094 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [355482674] [2024-10-12 20:05:25,094 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-12 20:05:25,094 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2024-10-12 20:05:25,095 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 20:05:25,095 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2024-10-12 20:05:25,095 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=41, Invalid=231, Unknown=0, NotChecked=0, Total=272 [2024-10-12 20:05:25,096 INFO L87 Difference]: Start difference. First operand 858 states and 1156 transitions. Second operand has 17 states, 17 states have (on average 13.529411764705882) internal successors, (230), 17 states have internal predecessors, (230), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 20:05:27,510 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 20:05:27,511 INFO L93 Difference]: Finished difference Result 7107 states and 9626 transitions. [2024-10-12 20:05:27,511 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 49 states. [2024-10-12 20:05:27,511 INFO L78 Accepts]: Start accepts. Automaton has has 17 states, 17 states have (on average 13.529411764705882) internal successors, (230), 17 states have internal predecessors, (230), 0 states have call successors, (0), 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 81 [2024-10-12 20:05:27,512 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 20:05:27,523 INFO L225 Difference]: With dead ends: 7107 [2024-10-12 20:05:27,524 INFO L226 Difference]: Without dead ends: 6299 [2024-10-12 20:05:27,528 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 217 GetRequests, 156 SyntacticMatches, 0 SemanticMatches, 61 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1172 ImplicationChecksByTransitivity, 1.7s TimeCoverageRelationStatistics Valid=696, Invalid=3210, Unknown=0, NotChecked=0, Total=3906 [2024-10-12 20:05:27,529 INFO L432 NwaCegarLoop]: 71 mSDtfsCounter, 2400 mSDsluCounter, 610 mSDsCounter, 0 mSdLazyCounter, 871 mSolverCounterSat, 40 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2400 SdHoareTripleChecker+Valid, 681 SdHoareTripleChecker+Invalid, 911 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 40 IncrementalHoareTripleChecker+Valid, 871 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2024-10-12 20:05:27,529 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [2400 Valid, 681 Invalid, 911 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [40 Valid, 871 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2024-10-12 20:05:27,533 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6299 states. [2024-10-12 20:05:27,673 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6299 to 6151. [2024-10-12 20:05:27,678 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6151 states, 6150 states have (on average 1.3107317073170732) internal successors, (8061), 6150 states have internal predecessors, (8061), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 20:05:27,687 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6151 states to 6151 states and 8061 transitions. [2024-10-12 20:05:27,689 INFO L78 Accepts]: Start accepts. Automaton has 6151 states and 8061 transitions. Word has length 81 [2024-10-12 20:05:27,689 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 20:05:27,689 INFO L471 AbstractCegarLoop]: Abstraction has 6151 states and 8061 transitions. [2024-10-12 20:05:27,690 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 17 states have (on average 13.529411764705882) internal successors, (230), 17 states have internal predecessors, (230), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 20:05:27,690 INFO L276 IsEmpty]: Start isEmpty. Operand 6151 states and 8061 transitions. [2024-10-12 20:05:27,691 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 83 [2024-10-12 20:05:27,691 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 20:05:27,691 INFO L215 NwaCegarLoop]: trace histogram [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] [2024-10-12 20:05:27,709 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2024-10-12 20:05:27,894 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,SelfDestructingSolverStorable21 [2024-10-12 20:05:27,894 INFO L396 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 20:05:27,894 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 20:05:27,895 INFO L85 PathProgramCache]: Analyzing trace with hash -950834443, now seen corresponding path program 1 times [2024-10-12 20:05:27,895 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 20:05:27,895 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [77256401] [2024-10-12 20:05:27,895 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 20:05:27,895 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 20:05:27,926 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 20:05:28,355 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 14 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-12 20:05:28,355 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 20:05:28,355 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [77256401] [2024-10-12 20:05:28,355 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [77256401] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-12 20:05:28,355 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [620461022] [2024-10-12 20:05:28,355 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 20:05:28,355 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-12 20:05:28,356 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-12 20:05:28,361 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-12 20:05:28,362 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2024-10-12 20:05:28,473 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 20:05:28,476 INFO L255 TraceCheckSpWp]: Trace formula consists of 340 conjuncts, 16 conjuncts are in the unsatisfiable core [2024-10-12 20:05:28,478 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-12 20:05:28,949 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 12 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-12 20:05:28,949 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-12 20:05:29,786 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 12 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-12 20:05:29,787 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [620461022] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-12 20:05:29,787 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-12 20:05:29,787 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8, 8] total 22 [2024-10-12 20:05:29,787 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1771322462] [2024-10-12 20:05:29,787 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-12 20:05:29,788 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 23 states [2024-10-12 20:05:29,788 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 20:05:29,788 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2024-10-12 20:05:29,789 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=56, Invalid=450, Unknown=0, NotChecked=0, Total=506 [2024-10-12 20:05:29,789 INFO L87 Difference]: Start difference. First operand 6151 states and 8061 transitions. Second operand has 23 states, 23 states have (on average 8.782608695652174) internal successors, (202), 22 states have internal predecessors, (202), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 20:05:31,599 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 20:05:31,600 INFO L93 Difference]: Finished difference Result 27911 states and 36695 transitions. [2024-10-12 20:05:31,600 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2024-10-12 20:05:31,600 INFO L78 Accepts]: Start accepts. Automaton has has 23 states, 23 states have (on average 8.782608695652174) internal successors, (202), 22 states have internal predecessors, (202), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 82 [2024-10-12 20:05:31,601 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 20:05:31,626 INFO L225 Difference]: With dead ends: 27911 [2024-10-12 20:05:31,627 INFO L226 Difference]: Without dead ends: 21856 [2024-10-12 20:05:31,639 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 198 GetRequests, 149 SyntacticMatches, 0 SemanticMatches, 49 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 429 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=500, Invalid=2050, Unknown=0, NotChecked=0, Total=2550 [2024-10-12 20:05:31,640 INFO L432 NwaCegarLoop]: 90 mSDtfsCounter, 1512 mSDsluCounter, 979 mSDsCounter, 0 mSdLazyCounter, 949 mSolverCounterSat, 22 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1512 SdHoareTripleChecker+Valid, 1069 SdHoareTripleChecker+Invalid, 971 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 22 IncrementalHoareTripleChecker+Valid, 949 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-10-12 20:05:31,640 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1512 Valid, 1069 Invalid, 971 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [22 Valid, 949 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2024-10-12 20:05:31,657 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21856 states. [2024-10-12 20:05:32,299 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21856 to 21556. [2024-10-12 20:05:32,315 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 21556 states, 21555 states have (on average 1.2842959870099744) internal successors, (27683), 21555 states have internal predecessors, (27683), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 20:05:32,346 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21556 states to 21556 states and 27683 transitions. [2024-10-12 20:05:32,349 INFO L78 Accepts]: Start accepts. Automaton has 21556 states and 27683 transitions. Word has length 82 [2024-10-12 20:05:32,350 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 20:05:32,350 INFO L471 AbstractCegarLoop]: Abstraction has 21556 states and 27683 transitions. [2024-10-12 20:05:32,350 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 23 states, 23 states have (on average 8.782608695652174) internal successors, (202), 22 states have internal predecessors, (202), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 20:05:32,350 INFO L276 IsEmpty]: Start isEmpty. Operand 21556 states and 27683 transitions. [2024-10-12 20:05:32,352 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 83 [2024-10-12 20:05:32,352 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 20:05:32,352 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-12 20:05:32,368 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2024-10-12 20:05:32,556 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,SelfDestructingSolverStorable22 [2024-10-12 20:05:32,557 INFO L396 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 20:05:32,557 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 20:05:32,557 INFO L85 PathProgramCache]: Analyzing trace with hash -1272397501, now seen corresponding path program 1 times [2024-10-12 20:05:32,557 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 20:05:32,557 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1737146275] [2024-10-12 20:05:32,558 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 20:05:32,558 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 20:05:32,596 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 20:05:32,979 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 8 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-12 20:05:32,979 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 20:05:32,979 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1737146275] [2024-10-12 20:05:32,979 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1737146275] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-12 20:05:32,980 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [584539658] [2024-10-12 20:05:32,980 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 20:05:32,980 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-12 20:05:32,981 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-12 20:05:32,982 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-12 20:05:32,983 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2024-10-12 20:05:33,085 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 20:05:33,087 INFO L255 TraceCheckSpWp]: Trace formula consists of 342 conjuncts, 16 conjuncts are in the unsatisfiable core [2024-10-12 20:05:33,090 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-12 20:05:33,499 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 8 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-12 20:05:33,500 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-12 20:05:34,090 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 8 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-12 20:05:34,090 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [584539658] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-12 20:05:34,090 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-12 20:05:34,090 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8, 8] total 18 [2024-10-12 20:05:34,090 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1214127159] [2024-10-12 20:05:34,090 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-12 20:05:34,091 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2024-10-12 20:05:34,091 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 20:05:34,092 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2024-10-12 20:05:34,092 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=55, Invalid=287, Unknown=0, NotChecked=0, Total=342 [2024-10-12 20:05:34,093 INFO L87 Difference]: Start difference. First operand 21556 states and 27683 transitions. Second operand has 19 states, 19 states have (on average 9.736842105263158) internal successors, (185), 18 states have internal predecessors, (185), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 20:05:35,411 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 20:05:35,411 INFO L93 Difference]: Finished difference Result 65058 states and 84091 transitions. [2024-10-12 20:05:35,412 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2024-10-12 20:05:35,412 INFO L78 Accepts]: Start accepts. Automaton has has 19 states, 19 states have (on average 9.736842105263158) internal successors, (185), 18 states have internal predecessors, (185), 0 states have call successors, (0), 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 82 [2024-10-12 20:05:35,412 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 20:05:35,462 INFO L225 Difference]: With dead ends: 65058 [2024-10-12 20:05:35,463 INFO L226 Difference]: Without dead ends: 44451 [2024-10-12 20:05:35,485 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 180 GetRequests, 153 SyntacticMatches, 0 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 136 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=186, Invalid=626, Unknown=0, NotChecked=0, Total=812 [2024-10-12 20:05:35,486 INFO L432 NwaCegarLoop]: 82 mSDtfsCounter, 605 mSDsluCounter, 430 mSDsCounter, 0 mSdLazyCounter, 456 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 605 SdHoareTripleChecker+Valid, 512 SdHoareTripleChecker+Invalid, 465 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 456 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-10-12 20:05:35,486 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [605 Valid, 512 Invalid, 465 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 456 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-10-12 20:05:35,525 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 44451 states. [2024-10-12 20:05:36,655 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 44451 to 43731. [2024-10-12 20:05:36,690 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 43731 states, 43730 states have (on average 1.2673908072261606) internal successors, (55423), 43730 states have internal predecessors, (55423), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 20:05:36,742 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43731 states to 43731 states and 55423 transitions. [2024-10-12 20:05:36,746 INFO L78 Accepts]: Start accepts. Automaton has 43731 states and 55423 transitions. Word has length 82 [2024-10-12 20:05:36,746 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 20:05:36,747 INFO L471 AbstractCegarLoop]: Abstraction has 43731 states and 55423 transitions. [2024-10-12 20:05:36,747 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 19 states, 19 states have (on average 9.736842105263158) internal successors, (185), 18 states have internal predecessors, (185), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 20:05:36,747 INFO L276 IsEmpty]: Start isEmpty. Operand 43731 states and 55423 transitions. [2024-10-12 20:05:36,749 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 84 [2024-10-12 20:05:36,749 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 20:05:36,750 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-12 20:05:36,766 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2024-10-12 20:05:36,950 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-12 20:05:36,951 INFO L396 AbstractCegarLoop]: === Iteration 25 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 20:05:36,951 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 20:05:36,951 INFO L85 PathProgramCache]: Analyzing trace with hash 1662700962, now seen corresponding path program 1 times [2024-10-12 20:05:36,951 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 20:05:36,951 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1943330449] [2024-10-12 20:05:36,951 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 20:05:36,952 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 20:05:36,986 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 20:05:37,502 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 4 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-12 20:05:37,502 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 20:05:37,502 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1943330449] [2024-10-12 20:05:37,503 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1943330449] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-12 20:05:37,503 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [847844645] [2024-10-12 20:05:37,504 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 20:05:37,504 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-12 20:05:37,504 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-12 20:05:37,506 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-12 20:05:37,507 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2024-10-12 20:05:37,621 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 20:05:37,623 INFO L255 TraceCheckSpWp]: Trace formula consists of 344 conjuncts, 17 conjuncts are in the unsatisfiable core [2024-10-12 20:05:37,626 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-12 20:05:38,325 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 10 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-12 20:05:38,325 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-12 20:05:39,223 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 10 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-12 20:05:39,223 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [847844645] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-12 20:05:39,223 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-12 20:05:39,223 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 11, 11] total 28 [2024-10-12 20:05:39,223 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1936597330] [2024-10-12 20:05:39,223 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-12 20:05:39,224 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 29 states [2024-10-12 20:05:39,224 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 20:05:39,224 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2024-10-12 20:05:39,225 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=92, Invalid=720, Unknown=0, NotChecked=0, Total=812 [2024-10-12 20:05:39,225 INFO L87 Difference]: Start difference. First operand 43731 states and 55423 transitions. Second operand has 29 states, 29 states have (on average 7.689655172413793) internal successors, (223), 28 states have internal predecessors, (223), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 20:05:43,130 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 20:05:43,131 INFO L93 Difference]: Finished difference Result 89671 states and 113714 transitions. [2024-10-12 20:05:43,131 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 46 states. [2024-10-12 20:05:43,131 INFO L78 Accepts]: Start accepts. Automaton has has 29 states, 29 states have (on average 7.689655172413793) internal successors, (223), 28 states have internal predecessors, (223), 0 states have call successors, (0), 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 83 [2024-10-12 20:05:43,132 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 20:05:43,193 INFO L225 Difference]: With dead ends: 89671 [2024-10-12 20:05:43,193 INFO L226 Difference]: Without dead ends: 51916 [2024-10-12 20:05:43,219 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 216 GetRequests, 145 SyntacticMatches, 0 SemanticMatches, 71 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1213 ImplicationChecksByTransitivity, 2.5s TimeCoverageRelationStatistics Valid=1020, Invalid=4236, Unknown=0, NotChecked=0, Total=5256 [2024-10-12 20:05:43,220 INFO L432 NwaCegarLoop]: 85 mSDtfsCounter, 2166 mSDsluCounter, 1078 mSDsCounter, 0 mSdLazyCounter, 1290 mSolverCounterSat, 31 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2166 SdHoareTripleChecker+Valid, 1163 SdHoareTripleChecker+Invalid, 1321 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 31 IncrementalHoareTripleChecker+Valid, 1290 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2024-10-12 20:05:43,220 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [2166 Valid, 1163 Invalid, 1321 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [31 Valid, 1290 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2024-10-12 20:05:43,258 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 51916 states. [2024-10-12 20:05:44,197 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 51916 to 37664. [2024-10-12 20:05:44,225 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 37664 states, 37663 states have (on average 1.2464753206064307) internal successors, (46946), 37663 states have internal predecessors, (46946), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 20:05:44,267 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37664 states to 37664 states and 46946 transitions. [2024-10-12 20:05:44,271 INFO L78 Accepts]: Start accepts. Automaton has 37664 states and 46946 transitions. Word has length 83 [2024-10-12 20:05:44,271 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 20:05:44,271 INFO L471 AbstractCegarLoop]: Abstraction has 37664 states and 46946 transitions. [2024-10-12 20:05:44,272 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 29 states, 29 states have (on average 7.689655172413793) internal successors, (223), 28 states have internal predecessors, (223), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 20:05:44,272 INFO L276 IsEmpty]: Start isEmpty. Operand 37664 states and 46946 transitions. [2024-10-12 20:05:44,273 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 85 [2024-10-12 20:05:44,273 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 20:05:44,273 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-12 20:05:44,286 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2024-10-12 20:05:44,474 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-12 20:05:44,474 INFO L396 AbstractCegarLoop]: === Iteration 26 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 20:05:44,475 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 20:05:44,475 INFO L85 PathProgramCache]: Analyzing trace with hash -1856131661, now seen corresponding path program 1 times [2024-10-12 20:05:44,475 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 20:05:44,475 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [118081123] [2024-10-12 20:05:44,475 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 20:05:44,475 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 20:05:44,503 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 20:05:44,952 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 6 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-12 20:05:44,953 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 20:05:44,953 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [118081123] [2024-10-12 20:05:44,954 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [118081123] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-12 20:05:44,954 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1239080809] [2024-10-12 20:05:44,954 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 20:05:44,954 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-12 20:05:44,954 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-12 20:05:44,956 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-12 20:05:44,958 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2024-10-12 20:05:45,078 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 20:05:45,081 INFO L255 TraceCheckSpWp]: Trace formula consists of 346 conjuncts, 19 conjuncts are in the unsatisfiable core [2024-10-12 20:05:45,084 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-12 20:05:45,729 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 6 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-12 20:05:45,730 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-12 20:05:46,825 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 6 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-12 20:05:46,825 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1239080809] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-12 20:05:46,825 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-12 20:05:46,825 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 11, 11] total 26 [2024-10-12 20:05:46,826 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [545975377] [2024-10-12 20:05:46,826 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-12 20:05:46,826 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 27 states [2024-10-12 20:05:46,826 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 20:05:46,827 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2024-10-12 20:05:46,827 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=140, Invalid=562, Unknown=0, NotChecked=0, Total=702 [2024-10-12 20:05:46,828 INFO L87 Difference]: Start difference. First operand 37664 states and 46946 transitions. Second operand has 27 states, 27 states have (on average 8.296296296296296) internal successors, (224), 26 states have internal predecessors, (224), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 20:05:49,212 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 20:05:49,213 INFO L93 Difference]: Finished difference Result 108708 states and 136330 transitions. [2024-10-12 20:05:49,213 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2024-10-12 20:05:49,213 INFO L78 Accepts]: Start accepts. Automaton has has 27 states, 27 states have (on average 8.296296296296296) internal successors, (224), 26 states have internal predecessors, (224), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 84 [2024-10-12 20:05:49,213 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 20:05:49,294 INFO L225 Difference]: With dead ends: 108708 [2024-10-12 20:05:49,295 INFO L226 Difference]: Without dead ends: 76272 [2024-10-12 20:05:49,311 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 184 GetRequests, 149 SyntacticMatches, 0 SemanticMatches, 35 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 274 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=311, Invalid=1021, Unknown=0, NotChecked=0, Total=1332 [2024-10-12 20:05:49,312 INFO L432 NwaCegarLoop]: 80 mSDtfsCounter, 751 mSDsluCounter, 635 mSDsCounter, 0 mSdLazyCounter, 578 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 751 SdHoareTripleChecker+Valid, 715 SdHoareTripleChecker+Invalid, 589 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 578 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-10-12 20:05:49,312 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [751 Valid, 715 Invalid, 589 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 578 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-10-12 20:05:49,350 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 76272 states. [2024-10-12 20:05:51,415 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 76272 to 75236. [2024-10-12 20:05:51,466 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 75236 states, 75235 states have (on average 1.2328703396025786) internal successors, (92755), 75235 states have internal predecessors, (92755), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 20:05:51,563 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 75236 states to 75236 states and 92755 transitions. [2024-10-12 20:05:51,568 INFO L78 Accepts]: Start accepts. Automaton has 75236 states and 92755 transitions. Word has length 84 [2024-10-12 20:05:51,568 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 20:05:51,568 INFO L471 AbstractCegarLoop]: Abstraction has 75236 states and 92755 transitions. [2024-10-12 20:05:51,568 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 27 states, 27 states have (on average 8.296296296296296) internal successors, (224), 26 states have internal predecessors, (224), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 20:05:51,568 INFO L276 IsEmpty]: Start isEmpty. Operand 75236 states and 92755 transitions. [2024-10-12 20:05:51,570 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 86 [2024-10-12 20:05:51,570 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 20:05:51,571 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-12 20:05:51,589 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Ended with exit code 0 [2024-10-12 20:05:51,771 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable25 [2024-10-12 20:05:51,772 INFO L396 AbstractCegarLoop]: === Iteration 27 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 20:05:51,772 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 20:05:51,772 INFO L85 PathProgramCache]: Analyzing trace with hash -1263514798, now seen corresponding path program 1 times [2024-10-12 20:05:51,772 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 20:05:51,772 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [540221058] [2024-10-12 20:05:51,772 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 20:05:51,772 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 20:05:51,982 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 20:05:54,934 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 4 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-12 20:05:54,935 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 20:05:54,935 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [540221058] [2024-10-12 20:05:54,935 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [540221058] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-12 20:05:54,935 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1279363699] [2024-10-12 20:05:54,935 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 20:05:54,935 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-12 20:05:54,935 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-12 20:05:54,936 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-12 20:05:54,938 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2024-10-12 20:05:55,063 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 20:05:55,066 INFO L255 TraceCheckSpWp]: Trace formula consists of 348 conjuncts, 20 conjuncts are in the unsatisfiable core [2024-10-12 20:05:55,068 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-12 20:05:56,000 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 6 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-12 20:05:56,000 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-12 20:05:57,332 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 6 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-12 20:05:57,332 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1279363699] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-12 20:05:57,332 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-12 20:05:57,332 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [29, 12, 12] total 51 [2024-10-12 20:05:57,332 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2076015980] [2024-10-12 20:05:57,332 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-12 20:05:57,332 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 52 states [2024-10-12 20:05:57,333 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 20:05:57,333 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 52 interpolants. [2024-10-12 20:05:57,334 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=154, Invalid=2498, Unknown=0, NotChecked=0, Total=2652 [2024-10-12 20:05:57,334 INFO L87 Difference]: Start difference. First operand 75236 states and 92755 transitions. Second operand has 52 states, 52 states have (on average 4.5576923076923075) internal successors, (237), 51 states have internal predecessors, (237), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)