./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/eca-rers2012/Problem12_label52.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 023d838f Calling Ultimate with: /root/.sdkman/candidates/java/11.0.12-open/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/eca-rers2012/Problem12_label52.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 ddbc486d8837447489a9f02b29f9b0c86837a784a73349e3a6819c320282b326 --- Real Ultimate output --- This is Ultimate 0.2.5-tmp.fs.icfgbuilder-eval-023d838-m [2024-11-09 19:29:13,734 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-09 19:29:13,811 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-11-09 19:29:13,816 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-09 19:29:13,817 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-09 19:29:13,845 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-09 19:29:13,845 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-09 19:29:13,846 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-09 19:29:13,846 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-09 19:29:13,848 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-09 19:29:13,849 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-09 19:29:13,849 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-09 19:29:13,849 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-09 19:29:13,852 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-09 19:29:13,852 INFO L153 SettingsManager]: * Use SBE=true [2024-11-09 19:29:13,852 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-09 19:29:13,852 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-09 19:29:13,853 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-09 19:29:13,853 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-09 19:29:13,853 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-09 19:29:13,853 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-09 19:29:13,854 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-09 19:29:13,858 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-09 19:29:13,858 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-09 19:29:13,859 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-09 19:29:13,859 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-09 19:29:13,859 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-09 19:29:13,859 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-09 19:29:13,859 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2024-11-09 19:29:13,859 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-09 19:29:13,860 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-09 19:29:13,860 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-09 19:29:13,860 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-09 19:29:13,860 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-09 19:29:13,860 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-09 19:29:13,861 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-09 19:29:13,861 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-09 19:29:13,861 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-09 19:29:13,862 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-09 19:29:13,862 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-09 19:29:13,863 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-09 19:29:13,864 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-09 19:29:13,864 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 -> ddbc486d8837447489a9f02b29f9b0c86837a784a73349e3a6819c320282b326 [2024-11-09 19:29:14,085 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-09 19:29:14,110 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-09 19:29:14,112 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-09 19:29:14,113 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-09 19:29:14,114 INFO L274 PluginConnector]: CDTParser initialized [2024-11-09 19:29:14,116 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/eca-rers2012/Problem12_label52.c [2024-11-09 19:29:15,597 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-09 19:29:16,044 INFO L384 CDTParser]: Found 1 translation units. [2024-11-09 19:29:16,046 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/eca-rers2012/Problem12_label52.c [2024-11-09 19:29:16,083 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/814f8809e/cdf276da170e4e7187d18517e1ea5ea5/FLAG25c30036f [2024-11-09 19:29:16,101 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/814f8809e/cdf276da170e4e7187d18517e1ea5ea5 [2024-11-09 19:29:16,105 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-09 19:29:16,106 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-09 19:29:16,107 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-09 19:29:16,107 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-09 19:29:16,114 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-09 19:29:16,115 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.11 07:29:16" (1/1) ... [2024-11-09 19:29:16,116 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@336d6ebf and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 07:29:16, skipping insertion in model container [2024-11-09 19:29:16,116 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.11 07:29:16" (1/1) ... [2024-11-09 19:29:16,248 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-09 19:29:16,508 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/eca-rers2012/Problem12_label52.c[3994,4007] [2024-11-09 19:29:17,202 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-09 19:29:17,242 INFO L200 MainTranslator]: Completed pre-run [2024-11-09 19:29:17,264 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/eca-rers2012/Problem12_label52.c[3994,4007] [2024-11-09 19:29:17,626 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-09 19:29:17,653 INFO L204 MainTranslator]: Completed translation [2024-11-09 19:29:17,654 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 07:29:17 WrapperNode [2024-11-09 19:29:17,654 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-09 19:29:17,655 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-09 19:29:17,655 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-09 19:29:17,655 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-09 19:29:17,662 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 07:29:17" (1/1) ... [2024-11-09 19:29:17,712 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 07:29:17" (1/1) ... [2024-11-09 19:29:18,075 INFO L138 Inliner]: procedures = 17, calls = 11, calls flagged for inlining = 6, calls inlined = 6, statements flattened = 4760 [2024-11-09 19:29:18,075 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-09 19:29:18,076 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-09 19:29:18,076 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-09 19:29:18,076 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-09 19:29:18,092 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 07:29:17" (1/1) ... [2024-11-09 19:29:18,092 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 07:29:17" (1/1) ... [2024-11-09 19:29:18,159 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 07:29:17" (1/1) ... [2024-11-09 19:29:18,337 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2024-11-09 19:29:18,338 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 07:29:17" (1/1) ... [2024-11-09 19:29:18,338 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 07:29:17" (1/1) ... [2024-11-09 19:29:18,545 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 07:29:17" (1/1) ... [2024-11-09 19:29:18,563 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 07:29:17" (1/1) ... [2024-11-09 19:29:18,581 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 07:29:17" (1/1) ... [2024-11-09 19:29:18,596 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 07:29:17" (1/1) ... [2024-11-09 19:29:18,684 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-09 19:29:18,685 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2024-11-09 19:29:18,685 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2024-11-09 19:29:18,685 INFO L274 PluginConnector]: IcfgBuilder initialized [2024-11-09 19:29:18,685 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 07:29:17" (1/1) ... [2024-11-09 19:29:18,704 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-09 19:29:18,724 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 19:29:18,755 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-11-09 19:29:18,767 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-11-09 19:29:18,833 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-09 19:29:18,834 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-11-09 19:29:18,834 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-09 19:29:18,834 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-09 19:29:18,976 INFO L256 CfgBuilder]: Building ICFG [2024-11-09 19:29:18,978 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-09 19:29:24,243 INFO L1247 $ProcedureCfgBuilder]: dead code at ProgramPoint L4665: havoc calculate_output3_#t~ret11#1; [2024-11-09 19:29:24,244 INFO L1247 $ProcedureCfgBuilder]: dead code at ProgramPoint L1696: havoc calculate_output_#t~ret9#1; [2024-11-09 19:29:24,245 INFO L1247 $ProcedureCfgBuilder]: dead code at ProgramPoint L3175: havoc calculate_output2_#t~ret10#1; [2024-11-09 19:29:24,611 INFO L? ?]: Removed 2039 outVars from TransFormulas that were not future-live. [2024-11-09 19:29:24,612 INFO L307 CfgBuilder]: Performing block encoding [2024-11-09 19:29:24,658 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-09 19:29:24,658 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2024-11-09 19:29:24,659 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 09.11 07:29:24 BoogieIcfgContainer [2024-11-09 19:29:24,659 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2024-11-09 19:29:24,662 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-09 19:29:24,662 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-09 19:29:24,665 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-09 19:29:24,666 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 09.11 07:29:16" (1/3) ... [2024-11-09 19:29:24,667 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6566e778 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.11 07:29:24, skipping insertion in model container [2024-11-09 19:29:24,667 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 07:29:17" (2/3) ... [2024-11-09 19:29:24,667 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6566e778 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.11 07:29:24, skipping insertion in model container [2024-11-09 19:29:24,668 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 09.11 07:29:24" (3/3) ... [2024-11-09 19:29:24,669 INFO L112 eAbstractionObserver]: Analyzing ICFG Problem12_label52.c [2024-11-09 19:29:24,684 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-09 19:29:24,685 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-11-09 19:29:24,778 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-09 19:29:24,784 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;@73fdfdb1, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-09 19:29:24,785 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-09 19:29:24,794 INFO L276 IsEmpty]: Start isEmpty. Operand has 821 states, 819 states have (on average 2.744810744810745) internal successors, (2248), 820 states have internal predecessors, (2248), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 19:29:24,801 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2024-11-09 19:29:24,801 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 19:29:24,802 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 19:29:24,803 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 19:29:24,807 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 19:29:24,808 INFO L85 PathProgramCache]: Analyzing trace with hash -537325484, now seen corresponding path program 1 times [2024-11-09 19:29:24,815 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 19:29:24,815 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [309466018] [2024-11-09 19:29:24,815 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 19:29:24,815 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 19:29:24,932 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 19:29:25,143 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 19:29:25,143 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 19:29:25,144 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [309466018] [2024-11-09 19:29:25,144 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [309466018] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 19:29:25,144 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 19:29:25,145 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-09 19:29:25,146 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [967000445] [2024-11-09 19:29:25,147 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 19:29:25,151 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-09 19:29:25,151 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 19:29:25,171 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-09 19:29:25,171 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-09 19:29:25,175 INFO L87 Difference]: Start difference. First operand has 821 states, 819 states have (on average 2.744810744810745) internal successors, (2248), 820 states have internal predecessors, (2248), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 3 states, 3 states have (on average 10.666666666666666) internal successors, (32), 2 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 19:29:29,900 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 19:29:29,901 INFO L93 Difference]: Finished difference Result 2410 states and 6691 transitions. [2024-11-09 19:29:29,902 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-09 19:29:29,903 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 10.666666666666666) internal successors, (32), 2 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 32 [2024-11-09 19:29:29,903 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 19:29:29,927 INFO L225 Difference]: With dead ends: 2410 [2024-11-09 19:29:29,927 INFO L226 Difference]: Without dead ends: 1509 [2024-11-09 19:29:29,934 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-09 19:29:29,937 INFO L432 NwaCegarLoop]: 517 mSDtfsCounter, 1470 mSDsluCounter, 12 mSDsCounter, 0 mSdLazyCounter, 3697 mSolverCounterSat, 696 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1470 SdHoareTripleChecker+Valid, 529 SdHoareTripleChecker+Invalid, 4393 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 696 IncrementalHoareTripleChecker+Valid, 3697 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.6s IncrementalHoareTripleChecker+Time [2024-11-09 19:29:29,938 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1470 Valid, 529 Invalid, 4393 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [696 Valid, 3697 Invalid, 0 Unknown, 0 Unchecked, 4.6s Time] [2024-11-09 19:29:29,961 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1509 states. [2024-11-09 19:29:30,045 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1509 to 1509. [2024-11-09 19:29:30,052 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1509 states, 1508 states have (on average 2.5072944297082227) internal successors, (3781), 1508 states have internal predecessors, (3781), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 19:29:30,058 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1509 states to 1509 states and 3781 transitions. [2024-11-09 19:29:30,060 INFO L78 Accepts]: Start accepts. Automaton has 1509 states and 3781 transitions. Word has length 32 [2024-11-09 19:29:30,060 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 19:29:30,060 INFO L471 AbstractCegarLoop]: Abstraction has 1509 states and 3781 transitions. [2024-11-09 19:29:30,061 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 10.666666666666666) internal successors, (32), 2 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 19:29:30,061 INFO L276 IsEmpty]: Start isEmpty. Operand 1509 states and 3781 transitions. [2024-11-09 19:29:30,065 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 109 [2024-11-09 19:29:30,066 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 19:29:30,067 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 19:29:30,067 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-09 19:29:30,067 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 19:29:30,068 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 19:29:30,068 INFO L85 PathProgramCache]: Analyzing trace with hash 2139499526, now seen corresponding path program 1 times [2024-11-09 19:29:30,068 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 19:29:30,068 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1570633455] [2024-11-09 19:29:30,068 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 19:29:30,069 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 19:29:30,141 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 19:29:30,583 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 28 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 19:29:30,584 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 19:29:30,584 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1570633455] [2024-11-09 19:29:30,584 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1570633455] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 19:29:30,584 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 19:29:30,584 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-09 19:29:30,584 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [243625818] [2024-11-09 19:29:30,585 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 19:29:30,587 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-09 19:29:30,587 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 19:29:30,588 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-09 19:29:30,589 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-11-09 19:29:30,589 INFO L87 Difference]: Start difference. First operand 1509 states and 3781 transitions. Second operand has 5 states, 5 states have (on average 21.6) internal successors, (108), 4 states have internal predecessors, (108), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 19:29:35,471 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 19:29:35,471 INFO L93 Difference]: Finished difference Result 3768 states and 9220 transitions. [2024-11-09 19:29:35,471 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-09 19:29:35,472 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 21.6) internal successors, (108), 4 states have internal predecessors, (108), 0 states have call successors, (0), 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 108 [2024-11-09 19:29:35,472 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 19:29:35,482 INFO L225 Difference]: With dead ends: 3768 [2024-11-09 19:29:35,482 INFO L226 Difference]: Without dead ends: 2261 [2024-11-09 19:29:35,484 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2024-11-09 19:29:35,485 INFO L432 NwaCegarLoop]: 693 mSDtfsCounter, 2938 mSDsluCounter, 482 mSDsCounter, 0 mSdLazyCounter, 5192 mSolverCounterSat, 221 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2938 SdHoareTripleChecker+Valid, 1175 SdHoareTripleChecker+Invalid, 5413 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 221 IncrementalHoareTripleChecker+Valid, 5192 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.7s IncrementalHoareTripleChecker+Time [2024-11-09 19:29:35,486 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [2938 Valid, 1175 Invalid, 5413 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [221 Valid, 5192 Invalid, 0 Unknown, 0 Unchecked, 4.7s Time] [2024-11-09 19:29:35,488 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2261 states. [2024-11-09 19:29:35,519 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2261 to 2261. [2024-11-09 19:29:35,522 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2261 states, 2260 states have (on average 2.3092920353982302) internal successors, (5219), 2260 states have internal predecessors, (5219), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 19:29:35,527 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2261 states to 2261 states and 5219 transitions. [2024-11-09 19:29:35,528 INFO L78 Accepts]: Start accepts. Automaton has 2261 states and 5219 transitions. Word has length 108 [2024-11-09 19:29:35,528 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 19:29:35,528 INFO L471 AbstractCegarLoop]: Abstraction has 2261 states and 5219 transitions. [2024-11-09 19:29:35,529 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 21.6) internal successors, (108), 4 states have internal predecessors, (108), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 19:29:35,529 INFO L276 IsEmpty]: Start isEmpty. Operand 2261 states and 5219 transitions. [2024-11-09 19:29:35,533 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 175 [2024-11-09 19:29:35,534 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 19:29:35,535 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 19:29:35,535 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-09 19:29:35,535 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 19:29:35,536 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 19:29:35,536 INFO L85 PathProgramCache]: Analyzing trace with hash 2016692864, now seen corresponding path program 1 times [2024-11-09 19:29:35,536 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 19:29:35,536 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1892411714] [2024-11-09 19:29:35,537 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 19:29:35,537 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 19:29:35,583 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 19:29:35,981 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 20 trivial. 0 not checked. [2024-11-09 19:29:35,982 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 19:29:35,983 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1892411714] [2024-11-09 19:29:35,984 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1892411714] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-09 19:29:35,984 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [537806143] [2024-11-09 19:29:35,984 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 19:29:35,984 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 19:29:35,984 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 19:29:35,987 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-09 19:29:35,988 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2024-11-09 19:29:36,124 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 19:29:36,129 INFO L255 TraceCheckSpWp]: Trace formula consists of 252 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-11-09 19:29:36,138 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 19:29:36,383 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 28 trivial. 0 not checked. [2024-11-09 19:29:36,383 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-09 19:29:36,384 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [537806143] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 19:29:36,384 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-09 19:29:36,384 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [3] total 4 [2024-11-09 19:29:36,384 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1692197610] [2024-11-09 19:29:36,384 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 19:29:36,385 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-09 19:29:36,385 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 19:29:36,388 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-09 19:29:36,388 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-11-09 19:29:36,388 INFO L87 Difference]: Start difference. First operand 2261 states and 5219 transitions. Second operand has 3 states, 3 states have (on average 49.0) internal successors, (147), 2 states have internal predecessors, (147), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 19:29:39,984 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 19:29:39,985 INFO L93 Difference]: Finished difference Result 5272 states and 12775 transitions. [2024-11-09 19:29:39,985 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-09 19:29:39,986 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 49.0) internal successors, (147), 2 states have internal predecessors, (147), 0 states have call successors, (0), 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 174 [2024-11-09 19:29:39,987 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 19:29:40,008 INFO L225 Difference]: With dead ends: 5272 [2024-11-09 19:29:40,009 INFO L226 Difference]: Without dead ends: 3765 [2024-11-09 19:29:40,012 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 176 GetRequests, 173 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-11-09 19:29:40,015 INFO L432 NwaCegarLoop]: 506 mSDtfsCounter, 1342 mSDsluCounter, 9 mSDsCounter, 0 mSdLazyCounter, 3701 mSolverCounterSat, 585 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1342 SdHoareTripleChecker+Valid, 515 SdHoareTripleChecker+Invalid, 4286 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 585 IncrementalHoareTripleChecker+Valid, 3701 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.5s IncrementalHoareTripleChecker+Time [2024-11-09 19:29:40,016 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1342 Valid, 515 Invalid, 4286 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [585 Valid, 3701 Invalid, 0 Unknown, 0 Unchecked, 3.5s Time] [2024-11-09 19:29:40,022 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3765 states. [2024-11-09 19:29:40,082 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3765 to 3765. [2024-11-09 19:29:40,091 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3765 states, 3764 states have (on average 2.2446865037194472) internal successors, (8449), 3764 states have internal predecessors, (8449), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 19:29:40,099 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3765 states to 3765 states and 8449 transitions. [2024-11-09 19:29:40,100 INFO L78 Accepts]: Start accepts. Automaton has 3765 states and 8449 transitions. Word has length 174 [2024-11-09 19:29:40,102 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 19:29:40,102 INFO L471 AbstractCegarLoop]: Abstraction has 3765 states and 8449 transitions. [2024-11-09 19:29:40,102 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 49.0) internal successors, (147), 2 states have internal predecessors, (147), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 19:29:40,102 INFO L276 IsEmpty]: Start isEmpty. Operand 3765 states and 8449 transitions. [2024-11-09 19:29:40,104 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 181 [2024-11-09 19:29:40,105 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 19:29:40,105 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 19:29:40,122 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2024-11-09 19:29:40,309 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 19:29:40,309 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 19:29:40,310 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 19:29:40,310 INFO L85 PathProgramCache]: Analyzing trace with hash -809364412, now seen corresponding path program 1 times [2024-11-09 19:29:40,310 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 19:29:40,310 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [822564968] [2024-11-09 19:29:40,310 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 19:29:40,310 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 19:29:40,348 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 19:29:40,610 INFO L134 CoverageAnalysis]: Checked inductivity of 128 backedges. 128 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 19:29:40,610 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 19:29:40,610 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [822564968] [2024-11-09 19:29:40,611 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [822564968] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 19:29:40,614 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 19:29:40,614 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-09 19:29:40,614 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [687249954] [2024-11-09 19:29:40,615 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 19:29:40,615 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-09 19:29:40,615 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 19:29:40,616 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-09 19:29:40,616 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-11-09 19:29:40,616 INFO L87 Difference]: Start difference. First operand 3765 states and 8449 transitions. Second operand has 4 states, 4 states have (on average 45.0) internal successors, (180), 3 states have internal predecessors, (180), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 19:29:44,693 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 19:29:44,693 INFO L93 Difference]: Finished difference Result 8318 states and 18678 transitions. [2024-11-09 19:29:44,694 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-09 19:29:44,694 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 45.0) internal successors, (180), 3 states have internal predecessors, (180), 0 states have call successors, (0), 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 180 [2024-11-09 19:29:44,695 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 19:29:44,715 INFO L225 Difference]: With dead ends: 8318 [2024-11-09 19:29:44,716 INFO L226 Difference]: Without dead ends: 5269 [2024-11-09 19:29:44,720 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-11-09 19:29:44,721 INFO L432 NwaCegarLoop]: 697 mSDtfsCounter, 1382 mSDsluCounter, 17 mSDsCounter, 0 mSdLazyCounter, 5147 mSolverCounterSat, 272 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1382 SdHoareTripleChecker+Valid, 714 SdHoareTripleChecker+Invalid, 5419 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 272 IncrementalHoareTripleChecker+Valid, 5147 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.0s IncrementalHoareTripleChecker+Time [2024-11-09 19:29:44,721 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1382 Valid, 714 Invalid, 5419 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [272 Valid, 5147 Invalid, 0 Unknown, 0 Unchecked, 4.0s Time] [2024-11-09 19:29:44,726 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5269 states. [2024-11-09 19:29:44,800 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5269 to 5269. [2024-11-09 19:29:44,810 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5269 states, 5268 states have (on average 2.1575550493545936) internal successors, (11366), 5268 states have internal predecessors, (11366), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 19:29:44,822 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5269 states to 5269 states and 11366 transitions. [2024-11-09 19:29:44,822 INFO L78 Accepts]: Start accepts. Automaton has 5269 states and 11366 transitions. Word has length 180 [2024-11-09 19:29:44,823 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 19:29:44,823 INFO L471 AbstractCegarLoop]: Abstraction has 5269 states and 11366 transitions. [2024-11-09 19:29:44,823 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 45.0) internal successors, (180), 3 states have internal predecessors, (180), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 19:29:44,823 INFO L276 IsEmpty]: Start isEmpty. Operand 5269 states and 11366 transitions. [2024-11-09 19:29:44,826 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 247 [2024-11-09 19:29:44,827 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 19:29:44,827 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 19:29:44,828 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-11-09 19:29:44,829 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 19:29:44,829 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 19:29:44,829 INFO L85 PathProgramCache]: Analyzing trace with hash 611763134, now seen corresponding path program 1 times [2024-11-09 19:29:44,830 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 19:29:44,831 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1679735542] [2024-11-09 19:29:44,832 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 19:29:44,832 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 19:29:44,872 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 19:29:45,010 INFO L134 CoverageAnalysis]: Checked inductivity of 128 backedges. 57 proven. 0 refuted. 0 times theorem prover too weak. 71 trivial. 0 not checked. [2024-11-09 19:29:45,011 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 19:29:45,011 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1679735542] [2024-11-09 19:29:45,011 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1679735542] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 19:29:45,011 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 19:29:45,011 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-09 19:29:45,012 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1084158427] [2024-11-09 19:29:45,012 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 19:29:45,013 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-09 19:29:45,013 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 19:29:45,014 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-09 19:29:45,014 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-09 19:29:45,014 INFO L87 Difference]: Start difference. First operand 5269 states and 11366 transitions. Second operand has 3 states, 3 states have (on average 58.666666666666664) internal successors, (176), 3 states have internal predecessors, (176), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 19:29:48,929 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 19:29:48,929 INFO L93 Difference]: Finished difference Result 11288 states and 25057 transitions. [2024-11-09 19:29:48,930 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-09 19:29:48,930 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 58.666666666666664) internal successors, (176), 3 states have internal predecessors, (176), 0 states have call successors, (0), 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 246 [2024-11-09 19:29:48,930 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 19:29:48,956 INFO L225 Difference]: With dead ends: 11288 [2024-11-09 19:29:48,957 INFO L226 Difference]: Without dead ends: 6773 [2024-11-09 19:29:48,963 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-09 19:29:48,964 INFO L432 NwaCegarLoop]: 520 mSDtfsCounter, 1434 mSDsluCounter, 9 mSDsCounter, 0 mSdLazyCounter, 3599 mSolverCounterSat, 620 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1434 SdHoareTripleChecker+Valid, 529 SdHoareTripleChecker+Invalid, 4219 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 620 IncrementalHoareTripleChecker+Valid, 3599 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.8s IncrementalHoareTripleChecker+Time [2024-11-09 19:29:48,964 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1434 Valid, 529 Invalid, 4219 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [620 Valid, 3599 Invalid, 0 Unknown, 0 Unchecked, 3.8s Time] [2024-11-09 19:29:48,971 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6773 states. [2024-11-09 19:29:49,050 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6773 to 5269. [2024-11-09 19:29:49,066 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5269 states, 5268 states have (on average 2.1575550493545936) internal successors, (11366), 5268 states have internal predecessors, (11366), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 19:29:49,077 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5269 states to 5269 states and 11366 transitions. [2024-11-09 19:29:49,077 INFO L78 Accepts]: Start accepts. Automaton has 5269 states and 11366 transitions. Word has length 246 [2024-11-09 19:29:49,078 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 19:29:49,078 INFO L471 AbstractCegarLoop]: Abstraction has 5269 states and 11366 transitions. [2024-11-09 19:29:49,078 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 58.666666666666664) internal successors, (176), 3 states have internal predecessors, (176), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 19:29:49,078 INFO L276 IsEmpty]: Start isEmpty. Operand 5269 states and 11366 transitions. [2024-11-09 19:29:49,081 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 248 [2024-11-09 19:29:49,082 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 19:29:49,083 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 19:29:49,083 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-11-09 19:29:49,083 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 19:29:49,084 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 19:29:49,084 INFO L85 PathProgramCache]: Analyzing trace with hash 1626600866, now seen corresponding path program 1 times [2024-11-09 19:29:49,084 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 19:29:49,084 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1860960308] [2024-11-09 19:29:49,085 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 19:29:49,085 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 19:29:49,130 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 19:29:49,289 INFO L134 CoverageAnalysis]: Checked inductivity of 129 backedges. 57 proven. 0 refuted. 0 times theorem prover too weak. 72 trivial. 0 not checked. [2024-11-09 19:29:49,290 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 19:29:49,290 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1860960308] [2024-11-09 19:29:49,290 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1860960308] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 19:29:49,290 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 19:29:49,290 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-09 19:29:49,290 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [514420411] [2024-11-09 19:29:49,291 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 19:29:49,291 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-09 19:29:49,293 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 19:29:49,294 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-09 19:29:49,294 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-09 19:29:49,294 INFO L87 Difference]: Start difference. First operand 5269 states and 11366 transitions. Second operand has 3 states, 3 states have (on average 58.666666666666664) internal successors, (176), 2 states have internal predecessors, (176), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 19:29:52,984 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 19:29:52,985 INFO L93 Difference]: Finished difference Result 12795 states and 28229 transitions. [2024-11-09 19:29:52,985 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-09 19:29:52,986 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 58.666666666666664) internal successors, (176), 2 states have internal predecessors, (176), 0 states have call successors, (0), 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 247 [2024-11-09 19:29:52,986 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 19:29:53,004 INFO L225 Difference]: With dead ends: 12795 [2024-11-09 19:29:53,004 INFO L226 Difference]: Without dead ends: 8280 [2024-11-09 19:29:53,011 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-09 19:29:53,013 INFO L432 NwaCegarLoop]: 428 mSDtfsCounter, 1529 mSDsluCounter, 9 mSDsCounter, 0 mSdLazyCounter, 3706 mSolverCounterSat, 466 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1529 SdHoareTripleChecker+Valid, 437 SdHoareTripleChecker+Invalid, 4172 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 466 IncrementalHoareTripleChecker+Valid, 3706 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.6s IncrementalHoareTripleChecker+Time [2024-11-09 19:29:53,013 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1529 Valid, 437 Invalid, 4172 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [466 Valid, 3706 Invalid, 0 Unknown, 0 Unchecked, 3.6s Time] [2024-11-09 19:29:53,021 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8280 states. [2024-11-09 19:29:53,129 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8280 to 8277. [2024-11-09 19:29:53,141 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8277 states, 8276 states have (on average 2.1497100048332527) internal successors, (17791), 8276 states have internal predecessors, (17791), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 19:29:53,157 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8277 states to 8277 states and 17791 transitions. [2024-11-09 19:29:53,157 INFO L78 Accepts]: Start accepts. Automaton has 8277 states and 17791 transitions. Word has length 247 [2024-11-09 19:29:53,158 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 19:29:53,158 INFO L471 AbstractCegarLoop]: Abstraction has 8277 states and 17791 transitions. [2024-11-09 19:29:53,158 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 58.666666666666664) internal successors, (176), 2 states have internal predecessors, (176), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 19:29:53,158 INFO L276 IsEmpty]: Start isEmpty. Operand 8277 states and 17791 transitions. [2024-11-09 19:29:53,160 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 250 [2024-11-09 19:29:53,161 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 19:29:53,161 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 19:29:53,161 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-11-09 19:29:53,161 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 19:29:53,162 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 19:29:53,162 INFO L85 PathProgramCache]: Analyzing trace with hash -12005348, now seen corresponding path program 1 times [2024-11-09 19:29:53,162 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 19:29:53,162 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2121348431] [2024-11-09 19:29:53,162 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 19:29:53,162 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 19:29:53,212 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 19:29:53,347 INFO L134 CoverageAnalysis]: Checked inductivity of 131 backedges. 57 proven. 0 refuted. 0 times theorem prover too weak. 74 trivial. 0 not checked. [2024-11-09 19:29:53,348 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 19:29:53,348 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2121348431] [2024-11-09 19:29:53,348 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2121348431] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 19:29:53,348 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 19:29:53,349 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-09 19:29:53,349 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1892362453] [2024-11-09 19:29:53,349 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 19:29:53,350 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-09 19:29:53,350 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 19:29:53,350 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-09 19:29:53,350 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-09 19:29:53,351 INFO L87 Difference]: Start difference. First operand 8277 states and 17791 transitions. Second operand has 3 states, 3 states have (on average 58.666666666666664) internal successors, (176), 2 states have internal predecessors, (176), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 19:29:57,084 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 19:29:57,084 INFO L93 Difference]: Finished difference Result 23320 states and 50493 transitions. [2024-11-09 19:29:57,085 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-09 19:29:57,085 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 58.666666666666664) internal successors, (176), 2 states have internal predecessors, (176), 0 states have call successors, (0), 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 249 [2024-11-09 19:29:57,085 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 19:29:57,117 INFO L225 Difference]: With dead ends: 23320 [2024-11-09 19:29:57,117 INFO L226 Difference]: Without dead ends: 15797 [2024-11-09 19:29:57,127 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-09 19:29:57,127 INFO L432 NwaCegarLoop]: 424 mSDtfsCounter, 1377 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 3333 mSolverCounterSat, 860 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1377 SdHoareTripleChecker+Valid, 431 SdHoareTripleChecker+Invalid, 4193 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 860 IncrementalHoareTripleChecker+Valid, 3333 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.6s IncrementalHoareTripleChecker+Time [2024-11-09 19:29:57,128 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1377 Valid, 431 Invalid, 4193 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [860 Valid, 3333 Invalid, 0 Unknown, 0 Unchecked, 3.6s Time] [2024-11-09 19:29:57,140 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15797 states. [2024-11-09 19:29:57,313 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15797 to 14293. [2024-11-09 19:29:57,338 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 14293 states, 14292 states have (on average 2.0850825636719845) internal successors, (29800), 14292 states have internal predecessors, (29800), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 19:29:57,378 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14293 states to 14293 states and 29800 transitions. [2024-11-09 19:29:57,379 INFO L78 Accepts]: Start accepts. Automaton has 14293 states and 29800 transitions. Word has length 249 [2024-11-09 19:29:57,379 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 19:29:57,379 INFO L471 AbstractCegarLoop]: Abstraction has 14293 states and 29800 transitions. [2024-11-09 19:29:57,380 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 58.666666666666664) internal successors, (176), 2 states have internal predecessors, (176), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 19:29:57,380 INFO L276 IsEmpty]: Start isEmpty. Operand 14293 states and 29800 transitions. [2024-11-09 19:29:57,382 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 261 [2024-11-09 19:29:57,383 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 19:29:57,384 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 19:29:57,384 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-11-09 19:29:57,384 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 19:29:57,385 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 19:29:57,385 INFO L85 PathProgramCache]: Analyzing trace with hash -291716780, now seen corresponding path program 1 times [2024-11-09 19:29:57,385 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 19:29:57,385 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [963291468] [2024-11-09 19:29:57,385 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 19:29:57,386 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 19:29:57,426 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 19:29:57,545 INFO L134 CoverageAnalysis]: Checked inductivity of 142 backedges. 142 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 19:29:57,545 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 19:29:57,546 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [963291468] [2024-11-09 19:29:57,546 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [963291468] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 19:29:57,546 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 19:29:57,546 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-09 19:29:57,546 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [339314514] [2024-11-09 19:29:57,546 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 19:29:57,547 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-09 19:29:57,547 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 19:29:57,547 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-09 19:29:57,547 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-09 19:29:57,548 INFO L87 Difference]: Start difference. First operand 14293 states and 29800 transitions. Second operand has 3 states, 3 states have (on average 86.66666666666667) internal successors, (260), 3 states have internal predecessors, (260), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 19:30:01,557 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 19:30:01,557 INFO L93 Difference]: Finished difference Result 41368 states and 86520 transitions. [2024-11-09 19:30:01,557 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-09 19:30:01,557 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 86.66666666666667) internal successors, (260), 3 states have internal predecessors, (260), 0 states have call successors, (0), 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 260 [2024-11-09 19:30:01,558 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 19:30:01,609 INFO L225 Difference]: With dead ends: 41368 [2024-11-09 19:30:01,609 INFO L226 Difference]: Without dead ends: 27829 [2024-11-09 19:30:01,628 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-09 19:30:01,630 INFO L432 NwaCegarLoop]: 2066 mSDtfsCounter, 1349 mSDsluCounter, 8 mSDsCounter, 0 mSdLazyCounter, 4099 mSolverCounterSat, 365 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1349 SdHoareTripleChecker+Valid, 2074 SdHoareTripleChecker+Invalid, 4464 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 365 IncrementalHoareTripleChecker+Valid, 4099 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.8s IncrementalHoareTripleChecker+Time [2024-11-09 19:30:01,630 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1349 Valid, 2074 Invalid, 4464 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [365 Valid, 4099 Invalid, 0 Unknown, 0 Unchecked, 3.8s Time] [2024-11-09 19:30:01,656 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27829 states. [2024-11-09 19:30:01,952 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27829 to 25573. [2024-11-09 19:30:01,990 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 25573 states, 25572 states have (on average 2.073948068199593) internal successors, (53035), 25572 states have internal predecessors, (53035), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 19:30:02,037 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25573 states to 25573 states and 53035 transitions. [2024-11-09 19:30:02,038 INFO L78 Accepts]: Start accepts. Automaton has 25573 states and 53035 transitions. Word has length 260 [2024-11-09 19:30:02,039 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 19:30:02,039 INFO L471 AbstractCegarLoop]: Abstraction has 25573 states and 53035 transitions. [2024-11-09 19:30:02,039 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 86.66666666666667) internal successors, (260), 3 states have internal predecessors, (260), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 19:30:02,039 INFO L276 IsEmpty]: Start isEmpty. Operand 25573 states and 53035 transitions. [2024-11-09 19:30:02,042 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 265 [2024-11-09 19:30:02,042 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 19:30:02,042 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 19:30:02,043 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-11-09 19:30:02,043 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 19:30:02,044 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 19:30:02,044 INFO L85 PathProgramCache]: Analyzing trace with hash -1323394872, now seen corresponding path program 1 times [2024-11-09 19:30:02,044 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 19:30:02,045 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2122560972] [2024-11-09 19:30:02,045 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 19:30:02,046 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 19:30:02,237 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 19:30:02,825 INFO L134 CoverageAnalysis]: Checked inductivity of 142 backedges. 42 proven. 100 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 19:30:02,826 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 19:30:02,826 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2122560972] [2024-11-09 19:30:02,826 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2122560972] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-09 19:30:02,826 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1022675918] [2024-11-09 19:30:02,826 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 19:30:02,826 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 19:30:02,827 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 19:30:02,830 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-09 19:30:02,831 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2024-11-09 19:30:02,974 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 19:30:02,976 INFO L255 TraceCheckSpWp]: Trace formula consists of 366 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-11-09 19:30:02,983 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 19:30:03,047 INFO L134 CoverageAnalysis]: Checked inductivity of 142 backedges. 57 proven. 0 refuted. 0 times theorem prover too weak. 85 trivial. 0 not checked. [2024-11-09 19:30:03,048 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-09 19:30:03,048 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1022675918] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 19:30:03,048 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-09 19:30:03,048 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [6] total 8 [2024-11-09 19:30:03,049 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1252495495] [2024-11-09 19:30:03,049 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 19:30:03,049 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-09 19:30:03,049 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 19:30:03,050 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-09 19:30:03,050 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2024-11-09 19:30:03,050 INFO L87 Difference]: Start difference. First operand 25573 states and 53035 transitions. Second operand has 3 states, 3 states have (on average 60.0) internal successors, (180), 3 states have internal predecessors, (180), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 19:30:06,430 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 19:30:06,430 INFO L93 Difference]: Finished difference Result 50392 states and 104631 transitions. [2024-11-09 19:30:06,431 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-09 19:30:06,431 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 60.0) internal successors, (180), 3 states have internal predecessors, (180), 0 states have call successors, (0), 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 264 [2024-11-09 19:30:06,431 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 19:30:06,467 INFO L225 Difference]: With dead ends: 50392 [2024-11-09 19:30:06,467 INFO L226 Difference]: Without dead ends: 25573 [2024-11-09 19:30:06,492 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 269 GetRequests, 263 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2024-11-09 19:30:06,493 INFO L432 NwaCegarLoop]: 1674 mSDtfsCounter, 1477 mSDsluCounter, 10 mSDsCounter, 0 mSdLazyCounter, 3673 mSolverCounterSat, 396 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1477 SdHoareTripleChecker+Valid, 1684 SdHoareTripleChecker+Invalid, 4069 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 396 IncrementalHoareTripleChecker+Valid, 3673 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.2s IncrementalHoareTripleChecker+Time [2024-11-09 19:30:06,493 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1477 Valid, 1684 Invalid, 4069 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [396 Valid, 3673 Invalid, 0 Unknown, 0 Unchecked, 3.2s Time] [2024-11-09 19:30:06,509 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25573 states. [2024-11-09 19:30:06,887 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25573 to 25573. [2024-11-09 19:30:06,913 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 25573 states, 25572 states have (on average 2.0418426403879244) internal successors, (52214), 25572 states have internal predecessors, (52214), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 19:30:06,957 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25573 states to 25573 states and 52214 transitions. [2024-11-09 19:30:06,958 INFO L78 Accepts]: Start accepts. Automaton has 25573 states and 52214 transitions. Word has length 264 [2024-11-09 19:30:06,959 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 19:30:06,959 INFO L471 AbstractCegarLoop]: Abstraction has 25573 states and 52214 transitions. [2024-11-09 19:30:06,959 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 60.0) internal successors, (180), 3 states have internal predecessors, (180), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 19:30:06,959 INFO L276 IsEmpty]: Start isEmpty. Operand 25573 states and 52214 transitions. [2024-11-09 19:30:06,965 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 335 [2024-11-09 19:30:06,965 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 19:30:06,965 INFO L215 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 19:30:06,983 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2024-11-09 19:30:07,169 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,SelfDestructingSolverStorable8 [2024-11-09 19:30:07,171 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 19:30:07,171 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 19:30:07,171 INFO L85 PathProgramCache]: Analyzing trace with hash -2053834804, now seen corresponding path program 1 times [2024-11-09 19:30:07,171 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 19:30:07,172 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1214917707] [2024-11-09 19:30:07,172 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 19:30:07,172 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 19:30:07,231 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 19:30:07,489 INFO L134 CoverageAnalysis]: Checked inductivity of 310 backedges. 225 proven. 0 refuted. 0 times theorem prover too weak. 85 trivial. 0 not checked. [2024-11-09 19:30:07,490 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 19:30:07,490 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1214917707] [2024-11-09 19:30:07,490 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1214917707] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 19:30:07,490 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 19:30:07,490 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-09 19:30:07,490 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2057774610] [2024-11-09 19:30:07,491 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 19:30:07,491 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-09 19:30:07,491 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 19:30:07,492 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-09 19:30:07,492 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-09 19:30:07,492 INFO L87 Difference]: Start difference. First operand 25573 states and 52214 transitions. Second operand has 3 states, 3 states have (on average 83.33333333333333) internal successors, (250), 3 states have internal predecessors, (250), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 19:30:11,261 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 19:30:11,262 INFO L93 Difference]: Finished difference Result 62424 states and 128346 transitions. [2024-11-09 19:30:11,262 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-09 19:30:11,262 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 83.33333333333333) internal successors, (250), 3 states have internal predecessors, (250), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 334 [2024-11-09 19:30:11,263 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 19:30:11,307 INFO L225 Difference]: With dead ends: 62424 [2024-11-09 19:30:11,307 INFO L226 Difference]: Without dead ends: 37605 [2024-11-09 19:30:11,321 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-09 19:30:11,322 INFO L432 NwaCegarLoop]: 421 mSDtfsCounter, 1404 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 3607 mSolverCounterSat, 699 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1404 SdHoareTripleChecker+Valid, 428 SdHoareTripleChecker+Invalid, 4306 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 699 IncrementalHoareTripleChecker+Valid, 3607 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.4s IncrementalHoareTripleChecker+Time [2024-11-09 19:30:11,322 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1404 Valid, 428 Invalid, 4306 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [699 Valid, 3607 Invalid, 0 Unknown, 0 Unchecked, 3.4s Time] [2024-11-09 19:30:11,350 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 37605 states. [2024-11-09 19:30:11,720 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 37605 to 37605. [2024-11-09 19:30:11,757 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 37605 states, 37604 states have (on average 2.037708754387831) internal successors, (76626), 37604 states have internal predecessors, (76626), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 19:30:11,825 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37605 states to 37605 states and 76626 transitions. [2024-11-09 19:30:11,825 INFO L78 Accepts]: Start accepts. Automaton has 37605 states and 76626 transitions. Word has length 334 [2024-11-09 19:30:11,826 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 19:30:11,826 INFO L471 AbstractCegarLoop]: Abstraction has 37605 states and 76626 transitions. [2024-11-09 19:30:11,826 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 83.33333333333333) internal successors, (250), 3 states have internal predecessors, (250), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 19:30:11,826 INFO L276 IsEmpty]: Start isEmpty. Operand 37605 states and 76626 transitions. [2024-11-09 19:30:11,831 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 367 [2024-11-09 19:30:11,831 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 19:30:11,831 INFO L215 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 19:30:11,832 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2024-11-09 19:30:11,832 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 19:30:11,832 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 19:30:11,833 INFO L85 PathProgramCache]: Analyzing trace with hash -905317524, now seen corresponding path program 1 times [2024-11-09 19:30:11,833 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 19:30:11,833 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [630220341] [2024-11-09 19:30:11,833 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 19:30:11,833 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 19:30:11,891 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 19:30:12,100 INFO L134 CoverageAnalysis]: Checked inductivity of 342 backedges. 86 proven. 0 refuted. 0 times theorem prover too weak. 256 trivial. 0 not checked. [2024-11-09 19:30:12,100 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 19:30:12,100 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [630220341] [2024-11-09 19:30:12,100 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [630220341] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 19:30:12,101 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 19:30:12,101 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-09 19:30:12,101 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [107802020] [2024-11-09 19:30:12,101 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 19:30:12,101 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-09 19:30:12,102 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 19:30:12,102 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-09 19:30:12,102 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-09 19:30:12,103 INFO L87 Difference]: Start difference. First operand 37605 states and 76626 transitions. Second operand has 3 states, 3 states have (on average 60.333333333333336) internal successors, (181), 3 states have internal predecessors, (181), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 19:30:15,460 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 19:30:15,460 INFO L93 Difference]: Finished difference Result 88744 states and 180306 transitions. [2024-11-09 19:30:15,461 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-09 19:30:15,461 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 60.333333333333336) internal successors, (181), 3 states have internal predecessors, (181), 0 states have call successors, (0), 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 366 [2024-11-09 19:30:15,461 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 19:30:15,523 INFO L225 Difference]: With dead ends: 88744 [2024-11-09 19:30:15,523 INFO L226 Difference]: Without dead ends: 45877 [2024-11-09 19:30:15,555 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-09 19:30:15,555 INFO L432 NwaCegarLoop]: 1999 mSDtfsCounter, 1448 mSDsluCounter, 10 mSDsCounter, 0 mSdLazyCounter, 3325 mSolverCounterSat, 398 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1448 SdHoareTripleChecker+Valid, 2009 SdHoareTripleChecker+Invalid, 3723 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 398 IncrementalHoareTripleChecker+Valid, 3325 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.1s IncrementalHoareTripleChecker+Time [2024-11-09 19:30:15,555 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1448 Valid, 2009 Invalid, 3723 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [398 Valid, 3325 Invalid, 0 Unknown, 0 Unchecked, 3.1s Time] [2024-11-09 19:30:15,590 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 45877 states. [2024-11-09 19:30:16,163 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 45877 to 42117. [2024-11-09 19:30:16,197 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 42117 states, 42116 states have (on average 2.0102098964763986) internal successors, (84662), 42116 states have internal predecessors, (84662), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 19:30:16,277 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42117 states to 42117 states and 84662 transitions. [2024-11-09 19:30:16,278 INFO L78 Accepts]: Start accepts. Automaton has 42117 states and 84662 transitions. Word has length 366 [2024-11-09 19:30:16,279 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 19:30:16,279 INFO L471 AbstractCegarLoop]: Abstraction has 42117 states and 84662 transitions. [2024-11-09 19:30:16,279 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 60.333333333333336) internal successors, (181), 3 states have internal predecessors, (181), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 19:30:16,279 INFO L276 IsEmpty]: Start isEmpty. Operand 42117 states and 84662 transitions. [2024-11-09 19:30:16,287 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 408 [2024-11-09 19:30:16,287 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 19:30:16,288 INFO L215 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 19:30:16,288 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2024-11-09 19:30:16,288 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 19:30:16,289 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 19:30:16,289 INFO L85 PathProgramCache]: Analyzing trace with hash -1183434908, now seen corresponding path program 1 times [2024-11-09 19:30:16,289 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 19:30:16,289 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1378595174] [2024-11-09 19:30:16,290 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 19:30:16,290 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 19:30:16,374 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 19:30:16,690 INFO L134 CoverageAnalysis]: Checked inductivity of 390 backedges. 311 proven. 0 refuted. 0 times theorem prover too weak. 79 trivial. 0 not checked. [2024-11-09 19:30:16,690 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 19:30:16,690 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1378595174] [2024-11-09 19:30:16,690 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1378595174] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 19:30:16,691 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 19:30:16,691 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-09 19:30:16,691 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2024259680] [2024-11-09 19:30:16,691 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 19:30:16,692 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-09 19:30:16,692 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 19:30:16,693 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-09 19:30:16,693 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-09 19:30:16,693 INFO L87 Difference]: Start difference. First operand 42117 states and 84662 transitions. Second operand has 3 states, 3 states have (on average 109.66666666666667) internal successors, (329), 3 states have internal predecessors, (329), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 19:30:20,669 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 19:30:20,670 INFO L93 Difference]: Finished difference Result 105288 states and 212039 transitions. [2024-11-09 19:30:20,670 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-09 19:30:20,671 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 109.66666666666667) internal successors, (329), 3 states have internal predecessors, (329), 0 states have call successors, (0), 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 407 [2024-11-09 19:30:20,671 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 19:30:20,752 INFO L225 Difference]: With dead ends: 105288 [2024-11-09 19:30:20,753 INFO L226 Difference]: Without dead ends: 63925 [2024-11-09 19:30:20,776 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-09 19:30:20,777 INFO L432 NwaCegarLoop]: 375 mSDtfsCounter, 1298 mSDsluCounter, 9 mSDsCounter, 0 mSdLazyCounter, 3793 mSolverCounterSat, 423 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1298 SdHoareTripleChecker+Valid, 384 SdHoareTripleChecker+Invalid, 4216 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 423 IncrementalHoareTripleChecker+Valid, 3793 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.4s IncrementalHoareTripleChecker+Time [2024-11-09 19:30:20,777 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1298 Valid, 384 Invalid, 4216 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [423 Valid, 3793 Invalid, 0 Unknown, 0 Unchecked, 3.4s Time] [2024-11-09 19:30:20,817 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 63925 states. [2024-11-09 19:30:21,589 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 63925 to 60917. [2024-11-09 19:30:21,634 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 60917 states, 60916 states have (on average 2.0070424847330752) internal successors, (122261), 60916 states have internal predecessors, (122261), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 19:30:21,768 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 60917 states to 60917 states and 122261 transitions. [2024-11-09 19:30:21,769 INFO L78 Accepts]: Start accepts. Automaton has 60917 states and 122261 transitions. Word has length 407 [2024-11-09 19:30:21,769 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 19:30:21,769 INFO L471 AbstractCegarLoop]: Abstraction has 60917 states and 122261 transitions. [2024-11-09 19:30:21,769 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 109.66666666666667) internal successors, (329), 3 states have internal predecessors, (329), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 19:30:21,770 INFO L276 IsEmpty]: Start isEmpty. Operand 60917 states and 122261 transitions. [2024-11-09 19:30:21,778 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 414 [2024-11-09 19:30:21,778 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 19:30:21,779 INFO L215 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 19:30:21,779 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2024-11-09 19:30:21,779 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 19:30:21,780 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 19:30:21,780 INFO L85 PathProgramCache]: Analyzing trace with hash 1990367862, now seen corresponding path program 1 times [2024-11-09 19:30:21,780 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 19:30:21,780 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1172755410] [2024-11-09 19:30:21,780 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 19:30:21,781 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 19:30:21,865 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 19:30:22,389 INFO L134 CoverageAnalysis]: Checked inductivity of 402 backedges. 317 proven. 0 refuted. 0 times theorem prover too weak. 85 trivial. 0 not checked. [2024-11-09 19:30:22,389 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 19:30:22,389 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1172755410] [2024-11-09 19:30:22,389 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1172755410] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 19:30:22,390 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 19:30:22,390 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-09 19:30:22,390 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [236639627] [2024-11-09 19:30:22,390 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 19:30:22,390 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-09 19:30:22,391 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 19:30:22,392 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-09 19:30:22,392 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-09 19:30:22,392 INFO L87 Difference]: Start difference. First operand 60917 states and 122261 transitions. Second operand has 3 states, 3 states have (on average 109.66666666666667) internal successors, (329), 3 states have internal predecessors, (329), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 19:30:26,244 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 19:30:26,244 INFO L93 Difference]: Finished difference Result 150408 states and 303159 transitions. [2024-11-09 19:30:26,245 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-09 19:30:26,245 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 109.66666666666667) internal successors, (329), 3 states have internal predecessors, (329), 0 states have call successors, (0), 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 413 [2024-11-09 19:30:26,245 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 19:30:26,576 INFO L225 Difference]: With dead ends: 150408 [2024-11-09 19:30:26,580 INFO L226 Difference]: Without dead ends: 90245 [2024-11-09 19:30:26,661 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-09 19:30:26,662 INFO L432 NwaCegarLoop]: 1942 mSDtfsCounter, 1319 mSDsluCounter, 10 mSDsCounter, 0 mSdLazyCounter, 3483 mSolverCounterSat, 639 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1319 SdHoareTripleChecker+Valid, 1952 SdHoareTripleChecker+Invalid, 4122 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 639 IncrementalHoareTripleChecker+Valid, 3483 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.4s IncrementalHoareTripleChecker+Time [2024-11-09 19:30:26,662 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1319 Valid, 1952 Invalid, 4122 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [639 Valid, 3483 Invalid, 0 Unknown, 0 Unchecked, 3.4s Time] [2024-11-09 19:30:26,731 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 90245 states. [2024-11-09 19:30:27,887 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 90245 to 84981. [2024-11-09 19:30:27,987 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 84981 states, 84980 states have (on average 1.997140503647917) internal successors, (169717), 84980 states have internal predecessors, (169717), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 19:30:28,120 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 84981 states to 84981 states and 169717 transitions. [2024-11-09 19:30:28,120 INFO L78 Accepts]: Start accepts. Automaton has 84981 states and 169717 transitions. Word has length 413 [2024-11-09 19:30:28,121 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 19:30:28,121 INFO L471 AbstractCegarLoop]: Abstraction has 84981 states and 169717 transitions. [2024-11-09 19:30:28,121 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 109.66666666666667) internal successors, (329), 3 states have internal predecessors, (329), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 19:30:28,121 INFO L276 IsEmpty]: Start isEmpty. Operand 84981 states and 169717 transitions. [2024-11-09 19:30:28,127 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 424 [2024-11-09 19:30:28,127 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 19:30:28,127 INFO L215 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 19:30:28,127 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2024-11-09 19:30:28,127 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 19:30:28,127 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 19:30:28,128 INFO L85 PathProgramCache]: Analyzing trace with hash -1665739372, now seen corresponding path program 1 times [2024-11-09 19:30:28,128 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 19:30:28,128 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [988122475] [2024-11-09 19:30:28,128 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 19:30:28,128 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 19:30:28,452 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 19:30:28,693 INFO L134 CoverageAnalysis]: Checked inductivity of 426 backedges. 327 proven. 0 refuted. 0 times theorem prover too weak. 99 trivial. 0 not checked. [2024-11-09 19:30:28,694 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 19:30:28,694 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [988122475] [2024-11-09 19:30:28,694 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [988122475] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 19:30:28,694 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 19:30:28,694 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-09 19:30:28,696 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2045361395] [2024-11-09 19:30:28,696 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 19:30:28,697 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-09 19:30:28,697 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 19:30:28,698 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-09 19:30:28,698 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-09 19:30:28,698 INFO L87 Difference]: Start difference. First operand 84981 states and 169717 transitions. Second operand has 3 states, 3 states have (on average 108.33333333333333) internal successors, (325), 3 states have internal predecessors, (325), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)