./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/eca-rers2012/Problem12_label27.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_label27.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 a6bf1264929a0645d918c583a519b6be036274699656a22f3fed375c55deb5c8 --- Real Ultimate output --- This is Ultimate 0.2.5-tmp.fs.icfgbuilder-eval-023d838-m [2024-11-09 19:26:45,937 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-09 19:26:46,015 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-11-09 19:26:46,019 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-09 19:26:46,019 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-09 19:26:46,037 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-09 19:26:46,039 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-09 19:26:46,039 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-09 19:26:46,040 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-09 19:26:46,040 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-09 19:26:46,041 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-09 19:26:46,041 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-09 19:26:46,042 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-09 19:26:46,043 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-09 19:26:46,043 INFO L153 SettingsManager]: * Use SBE=true [2024-11-09 19:26:46,044 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-09 19:26:46,044 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-09 19:26:46,044 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-09 19:26:46,044 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-09 19:26:46,044 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-09 19:26:46,045 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-09 19:26:46,048 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-09 19:26:46,048 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-09 19:26:46,048 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-09 19:26:46,048 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-09 19:26:46,048 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-09 19:26:46,049 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-09 19:26:46,049 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-09 19:26:46,049 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2024-11-09 19:26:46,049 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-09 19:26:46,049 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-09 19:26:46,049 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-09 19:26:46,050 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-09 19:26:46,050 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-09 19:26:46,050 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-09 19:26:46,050 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-09 19:26:46,050 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-09 19:26:46,050 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-09 19:26:46,050 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-09 19:26:46,051 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-09 19:26:46,051 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-09 19:26:46,051 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-09 19:26:46,051 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 -> a6bf1264929a0645d918c583a519b6be036274699656a22f3fed375c55deb5c8 [2024-11-09 19:26:46,280 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-09 19:26:46,302 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-09 19:26:46,306 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-09 19:26:46,307 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-09 19:26:46,311 INFO L274 PluginConnector]: CDTParser initialized [2024-11-09 19:26:46,313 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/eca-rers2012/Problem12_label27.c [2024-11-09 19:26:47,655 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-09 19:26:47,997 INFO L384 CDTParser]: Found 1 translation units. [2024-11-09 19:26:47,998 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/eca-rers2012/Problem12_label27.c [2024-11-09 19:26:48,030 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/613769a59/42554371b8874c1187a652bd99d01973/FLAGb6c013bfe [2024-11-09 19:26:48,042 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/613769a59/42554371b8874c1187a652bd99d01973 [2024-11-09 19:26:48,044 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-09 19:26:48,047 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-09 19:26:48,049 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-09 19:26:48,049 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-09 19:26:48,053 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-09 19:26:48,054 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.11 07:26:48" (1/1) ... [2024-11-09 19:26:48,055 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@613c43c0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 07:26:48, skipping insertion in model container [2024-11-09 19:26:48,055 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.11 07:26:48" (1/1) ... [2024-11-09 19:26:48,136 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-09 19:26:48,327 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_label27.c[4120,4133] [2024-11-09 19:26:48,933 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-09 19:26:48,941 INFO L200 MainTranslator]: Completed pre-run [2024-11-09 19:26:48,960 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_label27.c[4120,4133] [2024-11-09 19:26:49,357 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-09 19:26:49,377 INFO L204 MainTranslator]: Completed translation [2024-11-09 19:26:49,377 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 07:26:49 WrapperNode [2024-11-09 19:26:49,377 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-09 19:26:49,378 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-09 19:26:49,378 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-09 19:26:49,378 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-09 19:26:49,384 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:26:49" (1/1) ... [2024-11-09 19:26:49,431 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:26:49" (1/1) ... [2024-11-09 19:26:49,629 INFO L138 Inliner]: procedures = 17, calls = 11, calls flagged for inlining = 6, calls inlined = 6, statements flattened = 4760 [2024-11-09 19:26:49,630 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-09 19:26:49,630 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-09 19:26:49,631 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-09 19:26:49,631 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-09 19:26:49,639 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 07:26:49" (1/1) ... [2024-11-09 19:26:49,639 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 07:26:49" (1/1) ... [2024-11-09 19:26:49,673 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 07:26:49" (1/1) ... [2024-11-09 19:26:49,866 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:26:49,867 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 07:26:49" (1/1) ... [2024-11-09 19:26:49,867 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 07:26:49" (1/1) ... [2024-11-09 19:26:49,987 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 07:26:49" (1/1) ... [2024-11-09 19:26:49,997 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 07:26:49" (1/1) ... [2024-11-09 19:26:50,011 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 07:26:49" (1/1) ... [2024-11-09 19:26:50,028 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 07:26:49" (1/1) ... [2024-11-09 19:26:50,074 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-09 19:26:50,076 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2024-11-09 19:26:50,076 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2024-11-09 19:26:50,076 INFO L274 PluginConnector]: IcfgBuilder initialized [2024-11-09 19:26:50,077 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 07:26:49" (1/1) ... [2024-11-09 19:26:50,081 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-09 19:26:50,090 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 19:26:50,109 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:26:50,112 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:26:50,148 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-09 19:26:50,149 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-11-09 19:26:50,149 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-09 19:26:50,149 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-09 19:26:50,216 INFO L256 CfgBuilder]: Building ICFG [2024-11-09 19:26:50,218 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-09 19:26:54,357 INFO L1247 $ProcedureCfgBuilder]: dead code at ProgramPoint L4665: havoc calculate_output3_#t~ret11#1; [2024-11-09 19:26:54,358 INFO L1247 $ProcedureCfgBuilder]: dead code at ProgramPoint L1696: havoc calculate_output_#t~ret9#1; [2024-11-09 19:26:54,358 INFO L1247 $ProcedureCfgBuilder]: dead code at ProgramPoint L3175: havoc calculate_output2_#t~ret10#1; [2024-11-09 19:26:54,594 INFO L? ?]: Removed 2039 outVars from TransFormulas that were not future-live. [2024-11-09 19:26:54,595 INFO L307 CfgBuilder]: Performing block encoding [2024-11-09 19:26:54,624 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-09 19:26:54,624 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2024-11-09 19:26:54,624 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 09.11 07:26:54 BoogieIcfgContainer [2024-11-09 19:26:54,624 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2024-11-09 19:26:54,626 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-09 19:26:54,626 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-09 19:26:54,628 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-09 19:26:54,629 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 09.11 07:26:48" (1/3) ... [2024-11-09 19:26:54,629 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@13983e0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.11 07:26:54, skipping insertion in model container [2024-11-09 19:26:54,629 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 07:26:49" (2/3) ... [2024-11-09 19:26:54,630 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@13983e0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.11 07:26:54, skipping insertion in model container [2024-11-09 19:26:54,630 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 09.11 07:26:54" (3/3) ... [2024-11-09 19:26:54,634 INFO L112 eAbstractionObserver]: Analyzing ICFG Problem12_label27.c [2024-11-09 19:26:54,648 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-09 19:26:54,648 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-11-09 19:26:54,721 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-09 19:26:54,726 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;@55d04f39, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-09 19:26:54,726 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-09 19:26:54,732 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:26:54,737 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2024-11-09 19:26:54,737 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 19:26:54,738 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 19:26:54,738 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 19:26:54,742 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 19:26:54,742 INFO L85 PathProgramCache]: Analyzing trace with hash 522809846, now seen corresponding path program 1 times [2024-11-09 19:26:54,748 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 19:26:54,748 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [740331993] [2024-11-09 19:26:54,749 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 19:26:54,749 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 19:26:54,842 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 19:26:54,993 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:26:54,993 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 19:26:54,993 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [740331993] [2024-11-09 19:26:54,994 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [740331993] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 19:26:54,994 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 19:26:54,994 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-09 19:26:54,995 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [444311316] [2024-11-09 19:26:54,996 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 19:26:54,999 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-09 19:26:54,999 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 19:26:55,015 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-09 19:26:55,016 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-09 19:26:55,019 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 11.0) internal successors, (33), 2 states have internal predecessors, (33), 0 states have call successors, (0), 0 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:26:59,291 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 19:26:59,292 INFO L93 Difference]: Finished difference Result 2410 states and 6691 transitions. [2024-11-09 19:26:59,293 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-09 19:26:59,294 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 11.0) internal successors, (33), 2 states have internal predecessors, (33), 0 states have call successors, (0), 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 33 [2024-11-09 19:26:59,294 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 19:26:59,316 INFO L225 Difference]: With dead ends: 2410 [2024-11-09 19:26:59,316 INFO L226 Difference]: Without dead ends: 1509 [2024-11-09 19:26:59,323 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:26:59,327 INFO L432 NwaCegarLoop]: 517 mSDtfsCounter, 1469 mSDsluCounter, 12 mSDsCounter, 0 mSdLazyCounter, 3697 mSolverCounterSat, 696 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1469 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.1s IncrementalHoareTripleChecker+Time [2024-11-09 19:26:59,328 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1469 Valid, 529 Invalid, 4393 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [696 Valid, 3697 Invalid, 0 Unknown, 0 Unchecked, 4.1s Time] [2024-11-09 19:26:59,351 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1509 states. [2024-11-09 19:26:59,484 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1509 to 1509. [2024-11-09 19:26:59,488 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:26:59,493 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1509 states to 1509 states and 3781 transitions. [2024-11-09 19:26:59,495 INFO L78 Accepts]: Start accepts. Automaton has 1509 states and 3781 transitions. Word has length 33 [2024-11-09 19:26:59,495 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 19:26:59,495 INFO L471 AbstractCegarLoop]: Abstraction has 1509 states and 3781 transitions. [2024-11-09 19:26:59,495 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 11.0) internal successors, (33), 2 states have internal predecessors, (33), 0 states have call successors, (0), 0 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:26:59,496 INFO L276 IsEmpty]: Start isEmpty. Operand 1509 states and 3781 transitions. [2024-11-09 19:26:59,498 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 110 [2024-11-09 19:26:59,498 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 19:26:59,499 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 19:26:59,499 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-09 19:26:59,499 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 19:26:59,500 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 19:26:59,501 INFO L85 PathProgramCache]: Analyzing trace with hash -2034601145, now seen corresponding path program 1 times [2024-11-09 19:26:59,501 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 19:26:59,501 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1250066621] [2024-11-09 19:26:59,501 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 19:26:59,501 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 19:26:59,560 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 19:27:00,011 INFO L134 CoverageAnalysis]: Checked inductivity of 29 backedges. 29 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 19:27:00,012 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 19:27:00,012 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1250066621] [2024-11-09 19:27:00,012 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1250066621] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 19:27:00,012 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 19:27:00,012 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-09 19:27:00,012 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1334825252] [2024-11-09 19:27:00,012 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 19:27:00,014 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-09 19:27:00,016 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 19:27:00,018 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-09 19:27:00,018 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-11-09 19:27:00,018 INFO L87 Difference]: Start difference. First operand 1509 states and 3781 transitions. Second operand has 5 states, 5 states have (on average 21.8) internal successors, (109), 4 states have internal predecessors, (109), 0 states have call successors, (0), 0 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:27:04,462 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 19:27:04,463 INFO L93 Difference]: Finished difference Result 3768 states and 9220 transitions. [2024-11-09 19:27:04,463 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-09 19:27:04,463 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 21.8) internal successors, (109), 4 states have internal predecessors, (109), 0 states have call successors, (0), 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 109 [2024-11-09 19:27:04,464 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 19:27:04,471 INFO L225 Difference]: With dead ends: 3768 [2024-11-09 19:27:04,471 INFO L226 Difference]: Without dead ends: 2261 [2024-11-09 19:27:04,473 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:27:04,473 INFO L432 NwaCegarLoop]: 693 mSDtfsCounter, 2938 mSDsluCounter, 482 mSDsCounter, 0 mSdLazyCounter, 5192 mSolverCounterSat, 221 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.7s 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.3s IncrementalHoareTripleChecker+Time [2024-11-09 19:27:04,474 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.3s Time] [2024-11-09 19:27:04,476 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2261 states. [2024-11-09 19:27:04,500 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2261 to 2261. [2024-11-09 19:27:04,503 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:27:04,507 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2261 states to 2261 states and 5219 transitions. [2024-11-09 19:27:04,507 INFO L78 Accepts]: Start accepts. Automaton has 2261 states and 5219 transitions. Word has length 109 [2024-11-09 19:27:04,508 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 19:27:04,508 INFO L471 AbstractCegarLoop]: Abstraction has 2261 states and 5219 transitions. [2024-11-09 19:27:04,508 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 21.8) internal successors, (109), 4 states have internal predecessors, (109), 0 states have call successors, (0), 0 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:27:04,508 INFO L276 IsEmpty]: Start isEmpty. Operand 2261 states and 5219 transitions. [2024-11-09 19:27:04,510 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 176 [2024-11-09 19:27:04,510 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 19:27:04,510 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:27:04,511 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-09 19:27:04,511 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 19:27:04,511 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 19:27:04,511 INFO L85 PathProgramCache]: Analyzing trace with hash 938469197, now seen corresponding path program 1 times [2024-11-09 19:27:04,512 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 19:27:04,512 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [336265472] [2024-11-09 19:27:04,512 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 19:27:04,512 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 19:27:04,540 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 19:27:04,673 INFO L134 CoverageAnalysis]: Checked inductivity of 29 backedges. 29 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 19:27:04,674 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 19:27:04,674 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [336265472] [2024-11-09 19:27:04,674 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [336265472] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 19:27:04,674 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 19:27:04,674 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-09 19:27:04,674 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [136077862] [2024-11-09 19:27:04,674 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 19:27:04,675 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-09 19:27:04,675 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 19:27:04,675 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-09 19:27:04,676 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-09 19:27:04,676 INFO L87 Difference]: Start difference. First operand 2261 states and 5219 transitions. Second operand has 3 states, 3 states have (on average 58.333333333333336) internal successors, (175), 3 states have internal predecessors, (175), 0 states have call successors, (0), 0 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:27:07,790 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 19:27:07,790 INFO L93 Difference]: Finished difference Result 5272 states and 12775 transitions. [2024-11-09 19:27:07,790 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-09 19:27:07,791 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 58.333333333333336) internal successors, (175), 3 states have internal predecessors, (175), 0 states have call successors, (0), 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 175 [2024-11-09 19:27:07,791 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 19:27:07,809 INFO L225 Difference]: With dead ends: 5272 [2024-11-09 19:27:07,809 INFO L226 Difference]: Without dead ends: 3765 [2024-11-09 19:27:07,813 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:27:07,814 INFO L432 NwaCegarLoop]: 1828 mSDtfsCounter, 1412 mSDsluCounter, 10 mSDsCounter, 0 mSdLazyCounter, 3987 mSolverCounterSat, 438 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1412 SdHoareTripleChecker+Valid, 1838 SdHoareTripleChecker+Invalid, 4425 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 438 IncrementalHoareTripleChecker+Valid, 3987 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.0s IncrementalHoareTripleChecker+Time [2024-11-09 19:27:07,814 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1412 Valid, 1838 Invalid, 4425 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [438 Valid, 3987 Invalid, 0 Unknown, 0 Unchecked, 3.0s Time] [2024-11-09 19:27:07,819 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3765 states. [2024-11-09 19:27:07,858 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3765 to 3765. [2024-11-09 19:27:07,865 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3765 states, 3764 states have (on average 2.3196068012752393) internal successors, (8731), 3764 states have internal predecessors, (8731), 0 states have call successors, (0), 0 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:27:07,872 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3765 states to 3765 states and 8731 transitions. [2024-11-09 19:27:07,873 INFO L78 Accepts]: Start accepts. Automaton has 3765 states and 8731 transitions. Word has length 175 [2024-11-09 19:27:07,876 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 19:27:07,876 INFO L471 AbstractCegarLoop]: Abstraction has 3765 states and 8731 transitions. [2024-11-09 19:27:07,876 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 58.333333333333336) internal successors, (175), 3 states have internal predecessors, (175), 0 states have call successors, (0), 0 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:27:07,876 INFO L276 IsEmpty]: Start isEmpty. Operand 3765 states and 8731 transitions. [2024-11-09 19:27:07,882 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 180 [2024-11-09 19:27:07,882 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 19:27:07,882 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:27:07,882 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-11-09 19:27:07,882 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 19:27:07,883 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 19:27:07,883 INFO L85 PathProgramCache]: Analyzing trace with hash -421562919, now seen corresponding path program 1 times [2024-11-09 19:27:07,883 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 19:27:07,883 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [257019949] [2024-11-09 19:27:07,883 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 19:27:07,883 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 19:27:07,929 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 19:27:08,071 INFO L134 CoverageAnalysis]: Checked inductivity of 29 backedges. 29 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 19:27:08,072 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 19:27:08,072 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [257019949] [2024-11-09 19:27:08,072 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [257019949] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 19:27:08,072 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 19:27:08,072 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-09 19:27:08,073 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [457533321] [2024-11-09 19:27:08,073 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 19:27:08,074 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-09 19:27:08,074 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 19:27:08,074 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-09 19:27:08,074 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-09 19:27:08,075 INFO L87 Difference]: Start difference. First operand 3765 states and 8731 transitions. Second operand has 3 states, 3 states have (on average 59.666666666666664) internal successors, (179), 3 states have internal predecessors, (179), 0 states have call successors, (0), 0 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:27:12,126 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 19:27:12,126 INFO L93 Difference]: Finished difference Result 8280 states and 19799 transitions. [2024-11-09 19:27:12,127 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-09 19:27:12,127 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 59.666666666666664) internal successors, (179), 3 states have internal predecessors, (179), 0 states have call successors, (0), 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 179 [2024-11-09 19:27:12,128 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 19:27:12,144 INFO L225 Difference]: With dead ends: 8280 [2024-11-09 19:27:12,144 INFO L226 Difference]: Without dead ends: 5269 [2024-11-09 19:27:12,148 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:27:12,149 INFO L432 NwaCegarLoop]: 1845 mSDtfsCounter, 1439 mSDsluCounter, 10 mSDsCounter, 0 mSdLazyCounter, 3777 mSolverCounterSat, 652 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1439 SdHoareTripleChecker+Valid, 1855 SdHoareTripleChecker+Invalid, 4429 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 652 IncrementalHoareTripleChecker+Valid, 3777 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.0s IncrementalHoareTripleChecker+Time [2024-11-09 19:27:12,149 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1439 Valid, 1855 Invalid, 4429 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [652 Valid, 3777 Invalid, 0 Unknown, 0 Unchecked, 4.0s Time] [2024-11-09 19:27:12,153 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5269 states. [2024-11-09 19:27:12,204 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5269 to 5269. [2024-11-09 19:27:12,212 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5269 states, 5268 states have (on average 2.3263097949886107) internal successors, (12255), 5268 states have internal predecessors, (12255), 0 states have call successors, (0), 0 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:27:12,223 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5269 states to 5269 states and 12255 transitions. [2024-11-09 19:27:12,223 INFO L78 Accepts]: Start accepts. Automaton has 5269 states and 12255 transitions. Word has length 179 [2024-11-09 19:27:12,223 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 19:27:12,224 INFO L471 AbstractCegarLoop]: Abstraction has 5269 states and 12255 transitions. [2024-11-09 19:27:12,224 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 59.666666666666664) internal successors, (179), 3 states have internal predecessors, (179), 0 states have call successors, (0), 0 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:27:12,224 INFO L276 IsEmpty]: Start isEmpty. Operand 5269 states and 12255 transitions. [2024-11-09 19:27:12,225 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 190 [2024-11-09 19:27:12,225 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 19:27:12,225 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 19:27:12,226 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-11-09 19:27:12,226 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 19:27:12,226 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 19:27:12,226 INFO L85 PathProgramCache]: Analyzing trace with hash -548456796, now seen corresponding path program 1 times [2024-11-09 19:27:12,226 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 19:27:12,227 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1876445535] [2024-11-09 19:27:12,227 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 19:27:12,227 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 19:27:12,247 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 19:27:12,446 INFO L134 CoverageAnalysis]: Checked inductivity of 130 backedges. 130 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 19:27:12,446 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 19:27:12,447 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1876445535] [2024-11-09 19:27:12,447 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1876445535] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 19:27:12,447 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 19:27:12,447 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-09 19:27:12,447 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [274486510] [2024-11-09 19:27:12,447 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 19:27:12,448 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-09 19:27:12,448 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 19:27:12,448 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-09 19:27:12,449 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-11-09 19:27:12,449 INFO L87 Difference]: Start difference. First operand 5269 states and 12255 transitions. Second operand has 4 states, 4 states have (on average 47.25) internal successors, (189), 3 states have internal predecessors, (189), 0 states have call successors, (0), 0 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:27:17,273 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 19:27:17,273 INFO L93 Difference]: Finished difference Result 12078 states and 27992 transitions. [2024-11-09 19:27:17,273 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-09 19:27:17,274 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 47.25) internal successors, (189), 3 states have internal predecessors, (189), 0 states have call successors, (0), 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 189 [2024-11-09 19:27:17,274 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 19:27:17,298 INFO L225 Difference]: With dead ends: 12078 [2024-11-09 19:27:17,298 INFO L226 Difference]: Without dead ends: 7525 [2024-11-09 19:27:17,304 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:27:17,305 INFO L432 NwaCegarLoop]: 691 mSDtfsCounter, 1368 mSDsluCounter, 22 mSDsCounter, 0 mSdLazyCounter, 5837 mSolverCounterSat, 207 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1368 SdHoareTripleChecker+Valid, 713 SdHoareTripleChecker+Invalid, 6044 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 207 IncrementalHoareTripleChecker+Valid, 5837 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.7s IncrementalHoareTripleChecker+Time [2024-11-09 19:27:17,305 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1368 Valid, 713 Invalid, 6044 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [207 Valid, 5837 Invalid, 0 Unknown, 0 Unchecked, 4.7s Time] [2024-11-09 19:27:17,311 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7525 states. [2024-11-09 19:27:17,412 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7525 to 7525. [2024-11-09 19:27:17,426 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7525 states, 7524 states have (on average 2.2107921318447636) internal successors, (16634), 7524 states have internal predecessors, (16634), 0 states have call successors, (0), 0 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:27:17,442 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7525 states to 7525 states and 16634 transitions. [2024-11-09 19:27:17,442 INFO L78 Accepts]: Start accepts. Automaton has 7525 states and 16634 transitions. Word has length 189 [2024-11-09 19:27:17,443 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 19:27:17,443 INFO L471 AbstractCegarLoop]: Abstraction has 7525 states and 16634 transitions. [2024-11-09 19:27:17,444 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 47.25) internal successors, (189), 3 states have internal predecessors, (189), 0 states have call successors, (0), 0 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:27:17,444 INFO L276 IsEmpty]: Start isEmpty. Operand 7525 states and 16634 transitions. [2024-11-09 19:27:17,445 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 246 [2024-11-09 19:27:17,445 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 19:27:17,446 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:27:17,446 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-11-09 19:27:17,446 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 19:27:17,446 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 19:27:17,446 INFO L85 PathProgramCache]: Analyzing trace with hash 2114937228, now seen corresponding path program 1 times [2024-11-09 19:27:17,447 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 19:27:17,447 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1564876954] [2024-11-09 19:27:17,447 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 19:27:17,447 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 19:27:17,480 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 19:27:17,742 INFO L134 CoverageAnalysis]: Checked inductivity of 128 backedges. 59 proven. 55 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2024-11-09 19:27:17,742 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 19:27:17,742 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1564876954] [2024-11-09 19:27:17,742 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1564876954] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-09 19:27:17,742 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1904961869] [2024-11-09 19:27:17,742 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 19:27:17,743 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 19:27:17,743 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 19:27:17,749 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:27:17,750 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:27:17,862 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 19:27:17,864 INFO L255 TraceCheckSpWp]: Trace formula consists of 350 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-11-09 19:27:17,872 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 19:27:18,071 INFO L134 CoverageAnalysis]: Checked inductivity of 128 backedges. 59 proven. 0 refuted. 0 times theorem prover too weak. 69 trivial. 0 not checked. [2024-11-09 19:27:18,071 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-09 19:27:18,071 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1904961869] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 19:27:18,071 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-09 19:27:18,072 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [3] total 4 [2024-11-09 19:27:18,072 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2049003522] [2024-11-09 19:27:18,072 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 19:27:18,072 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-09 19:27:18,072 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 19:27:18,073 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-09 19:27:18,073 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-11-09 19:27:18,073 INFO L87 Difference]: Start difference. First operand 7525 states and 16634 transitions. Second operand has 3 states, 3 states have (on average 59.0) internal successors, (177), 2 states have internal predecessors, (177), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 19:27:21,666 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 19:27:21,666 INFO L93 Difference]: Finished difference Result 20312 states and 45528 transitions. [2024-11-09 19:27:21,667 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-09 19:27:21,667 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 59.0) internal successors, (177), 2 states have internal predecessors, (177), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 245 [2024-11-09 19:27:21,667 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 19:27:21,707 INFO L225 Difference]: With dead ends: 20312 [2024-11-09 19:27:21,707 INFO L226 Difference]: Without dead ends: 13541 [2024-11-09 19:27:21,714 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 247 GetRequests, 244 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:27:21,714 INFO L432 NwaCegarLoop]: 452 mSDtfsCounter, 1360 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 3340 mSolverCounterSat, 856 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1360 SdHoareTripleChecker+Valid, 459 SdHoareTripleChecker+Invalid, 4196 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 856 IncrementalHoareTripleChecker+Valid, 3340 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.5s IncrementalHoareTripleChecker+Time [2024-11-09 19:27:21,715 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1360 Valid, 459 Invalid, 4196 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [856 Valid, 3340 Invalid, 0 Unknown, 0 Unchecked, 3.5s Time] [2024-11-09 19:27:21,725 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13541 states. [2024-11-09 19:27:21,852 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13541 to 12789. [2024-11-09 19:27:21,867 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 12789 states, 12788 states have (on average 2.1434939005317486) internal successors, (27411), 12788 states have internal predecessors, (27411), 0 states have call successors, (0), 0 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:27:21,885 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12789 states to 12789 states and 27411 transitions. [2024-11-09 19:27:21,886 INFO L78 Accepts]: Start accepts. Automaton has 12789 states and 27411 transitions. Word has length 245 [2024-11-09 19:27:21,886 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 19:27:21,886 INFO L471 AbstractCegarLoop]: Abstraction has 12789 states and 27411 transitions. [2024-11-09 19:27:21,886 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 59.0) internal successors, (177), 2 states have internal predecessors, (177), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 19:27:21,887 INFO L276 IsEmpty]: Start isEmpty. Operand 12789 states and 27411 transitions. [2024-11-09 19:27:21,888 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 264 [2024-11-09 19:27:21,888 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 19:27:21,889 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 19:27:21,903 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2024-11-09 19:27:22,092 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable5 [2024-11-09 19:27:22,093 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 19:27:22,094 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 19:27:22,094 INFO L85 PathProgramCache]: Analyzing trace with hash -1512756030, now seen corresponding path program 1 times [2024-11-09 19:27:22,094 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 19:27:22,094 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [889650249] [2024-11-09 19:27:22,094 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 19:27:22,094 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 19:27:22,128 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 19:27:22,234 INFO L134 CoverageAnalysis]: Checked inductivity of 142 backedges. 59 proven. 0 refuted. 0 times theorem prover too weak. 83 trivial. 0 not checked. [2024-11-09 19:27:22,234 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 19:27:22,234 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [889650249] [2024-11-09 19:27:22,236 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [889650249] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 19:27:22,236 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 19:27:22,236 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-09 19:27:22,236 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1831887332] [2024-11-09 19:27:22,236 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 19:27:22,236 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-09 19:27:22,237 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 19:27:22,237 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-09 19:27:22,237 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-09 19:27:22,237 INFO L87 Difference]: Start difference. First operand 12789 states and 27411 transitions. Second operand has 3 states, 3 states have (on average 60.333333333333336) internal successors, (181), 2 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:27:26,049 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 19:27:26,049 INFO L93 Difference]: Finished difference Result 33099 states and 71898 transitions. [2024-11-09 19:27:26,049 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-09 19:27:26,050 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 60.333333333333336) internal successors, (181), 2 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 263 [2024-11-09 19:27:26,050 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 19:27:26,087 INFO L225 Difference]: With dead ends: 33099 [2024-11-09 19:27:26,087 INFO L226 Difference]: Without dead ends: 21064 [2024-11-09 19:27:26,097 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:27:26,098 INFO L432 NwaCegarLoop]: 305 mSDtfsCounter, 1525 mSDsluCounter, 9 mSDsCounter, 0 mSdLazyCounter, 3669 mSolverCounterSat, 466 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1525 SdHoareTripleChecker+Valid, 314 SdHoareTripleChecker+Invalid, 4135 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 466 IncrementalHoareTripleChecker+Valid, 3669 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.6s IncrementalHoareTripleChecker+Time [2024-11-09 19:27:26,098 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1525 Valid, 314 Invalid, 4135 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [466 Valid, 3669 Invalid, 0 Unknown, 0 Unchecked, 3.6s Time] [2024-11-09 19:27:26,112 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21064 states. [2024-11-09 19:27:26,289 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21064 to 21061. [2024-11-09 19:27:26,311 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 21061 states, 21060 states have (on average 2.108309591642925) internal successors, (44401), 21060 states have internal predecessors, (44401), 0 states have call successors, (0), 0 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:27:26,338 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21061 states to 21061 states and 44401 transitions. [2024-11-09 19:27:26,339 INFO L78 Accepts]: Start accepts. Automaton has 21061 states and 44401 transitions. Word has length 263 [2024-11-09 19:27:26,339 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 19:27:26,339 INFO L471 AbstractCegarLoop]: Abstraction has 21061 states and 44401 transitions. [2024-11-09 19:27:26,339 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 60.333333333333336) internal successors, (181), 2 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:27:26,339 INFO L276 IsEmpty]: Start isEmpty. Operand 21061 states and 44401 transitions. [2024-11-09 19:27:26,342 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 313 [2024-11-09 19:27:26,343 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 19:27:26,344 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 19:27:26,344 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-11-09 19:27:26,345 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 19:27:26,345 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 19:27:26,345 INFO L85 PathProgramCache]: Analyzing trace with hash 1191823522, now seen corresponding path program 1 times [2024-11-09 19:27:26,345 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 19:27:26,345 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1233349851] [2024-11-09 19:27:26,345 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 19:27:26,346 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 19:27:26,381 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 19:27:26,484 INFO L134 CoverageAnalysis]: Checked inductivity of 195 backedges. 59 proven. 0 refuted. 0 times theorem prover too weak. 136 trivial. 0 not checked. [2024-11-09 19:27:26,484 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 19:27:26,484 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1233349851] [2024-11-09 19:27:26,485 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1233349851] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 19:27:26,485 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 19:27:26,485 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-09 19:27:26,485 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1870528521] [2024-11-09 19:27:26,485 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 19:27:26,485 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-09 19:27:26,486 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 19:27:26,486 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-09 19:27:26,486 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-09 19:27:26,486 INFO L87 Difference]: Start difference. First operand 21061 states and 44401 transitions. Second operand has 3 states, 3 states have (on average 59.0) internal successors, (177), 3 states have internal predecessors, (177), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 19:27:30,303 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 19:27:30,303 INFO L93 Difference]: Finished difference Result 59416 states and 125859 transitions. [2024-11-09 19:27:30,303 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-09 19:27:30,303 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 59.0) internal successors, (177), 3 states have internal predecessors, (177), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 312 [2024-11-09 19:27:30,304 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 19:27:30,362 INFO L225 Difference]: With dead ends: 59416 [2024-11-09 19:27:30,362 INFO L226 Difference]: Without dead ends: 39109 [2024-11-09 19:27:30,380 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:27:30,381 INFO L432 NwaCegarLoop]: 2026 mSDtfsCounter, 1439 mSDsluCounter, 10 mSDsCounter, 0 mSdLazyCounter, 3542 mSolverCounterSat, 693 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1439 SdHoareTripleChecker+Valid, 2036 SdHoareTripleChecker+Invalid, 4235 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 693 IncrementalHoareTripleChecker+Valid, 3542 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.6s IncrementalHoareTripleChecker+Time [2024-11-09 19:27:30,381 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1439 Valid, 2036 Invalid, 4235 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [693 Valid, 3542 Invalid, 0 Unknown, 0 Unchecked, 3.6s Time] [2024-11-09 19:27:30,402 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 39109 states. [2024-11-09 19:27:30,686 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 39109 to 35349. [2024-11-09 19:27:30,715 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 35349 states, 35348 states have (on average 2.0695088831051263) internal successors, (73153), 35348 states have internal predecessors, (73153), 0 states have call successors, (0), 0 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:27:30,759 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35349 states to 35349 states and 73153 transitions. [2024-11-09 19:27:30,760 INFO L78 Accepts]: Start accepts. Automaton has 35349 states and 73153 transitions. Word has length 312 [2024-11-09 19:27:30,760 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 19:27:30,761 INFO L471 AbstractCegarLoop]: Abstraction has 35349 states and 73153 transitions. [2024-11-09 19:27:30,761 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 59.0) internal successors, (177), 3 states have internal predecessors, (177), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 19:27:30,761 INFO L276 IsEmpty]: Start isEmpty. Operand 35349 states and 73153 transitions. [2024-11-09 19:27:30,765 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 336 [2024-11-09 19:27:30,765 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 19:27:30,765 INFO L215 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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:27:30,765 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-11-09 19:27:30,765 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 19:27:30,766 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 19:27:30,766 INFO L85 PathProgramCache]: Analyzing trace with hash -1070611129, now seen corresponding path program 1 times [2024-11-09 19:27:30,766 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 19:27:30,766 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1387847408] [2024-11-09 19:27:30,766 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 19:27:30,766 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 19:27:30,799 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 19:27:30,970 INFO L134 CoverageAnalysis]: Checked inductivity of 313 backedges. 228 proven. 0 refuted. 0 times theorem prover too weak. 85 trivial. 0 not checked. [2024-11-09 19:27:30,971 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 19:27:30,971 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1387847408] [2024-11-09 19:27:30,972 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1387847408] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 19:27:30,973 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 19:27:30,973 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-09 19:27:30,973 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1564307075] [2024-11-09 19:27:30,974 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 19:27:30,974 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-09 19:27:30,974 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 19:27:30,975 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-09 19:27:30,975 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-09 19:27:30,975 INFO L87 Difference]: Start difference. First operand 35349 states and 73153 transitions. Second operand has 3 states, 3 states have (on average 83.66666666666667) internal successors, (251), 3 states have internal predecessors, (251), 0 states have call successors, (0), 0 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:27:35,126 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 19:27:35,126 INFO L93 Difference]: Finished difference Result 86488 states and 180436 transitions. [2024-11-09 19:27:35,127 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-09 19:27:35,127 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 83.66666666666667) internal successors, (251), 3 states have internal predecessors, (251), 0 states have call successors, (0), 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 335 [2024-11-09 19:27:35,127 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 19:27:35,199 INFO L225 Difference]: With dead ends: 86488 [2024-11-09 19:27:35,199 INFO L226 Difference]: Without dead ends: 51893 [2024-11-09 19:27:35,226 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:27:35,227 INFO L432 NwaCegarLoop]: 464 mSDtfsCounter, 1398 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 3637 mSolverCounterSat, 692 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1398 SdHoareTripleChecker+Valid, 471 SdHoareTripleChecker+Invalid, 4329 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 692 IncrementalHoareTripleChecker+Valid, 3637 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.8s IncrementalHoareTripleChecker+Time [2024-11-09 19:27:35,227 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1398 Valid, 471 Invalid, 4329 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [692 Valid, 3637 Invalid, 0 Unknown, 0 Unchecked, 3.8s Time] [2024-11-09 19:27:35,263 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 51893 states. [2024-11-09 19:27:35,650 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 51893 to 51141. [2024-11-09 19:27:35,690 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 51141 states, 51140 states have (on average 2.0683418068048494) internal successors, (105775), 51140 states have internal predecessors, (105775), 0 states have call successors, (0), 0 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:27:36,060 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 51141 states to 51141 states and 105775 transitions. [2024-11-09 19:27:36,060 INFO L78 Accepts]: Start accepts. Automaton has 51141 states and 105775 transitions. Word has length 335 [2024-11-09 19:27:36,061 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 19:27:36,061 INFO L471 AbstractCegarLoop]: Abstraction has 51141 states and 105775 transitions. [2024-11-09 19:27:36,061 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 83.66666666666667) internal successors, (251), 3 states have internal predecessors, (251), 0 states have call successors, (0), 0 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:27:36,061 INFO L276 IsEmpty]: Start isEmpty. Operand 51141 states and 105775 transitions. [2024-11-09 19:27:36,063 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 340 [2024-11-09 19:27:36,063 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 19:27:36,064 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:27:36,064 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-11-09 19:27:36,064 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 19:27:36,065 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 19:27:36,065 INFO L85 PathProgramCache]: Analyzing trace with hash 1768636788, now seen corresponding path program 1 times [2024-11-09 19:27:36,065 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 19:27:36,065 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2083379661] [2024-11-09 19:27:36,065 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 19:27:36,065 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 19:27:36,103 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 19:27:36,500 INFO L134 CoverageAnalysis]: Checked inductivity of 29 backedges. 0 proven. 29 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 19:27:36,501 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 19:27:36,501 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2083379661] [2024-11-09 19:27:36,501 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2083379661] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-09 19:27:36,501 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [326114559] [2024-11-09 19:27:36,501 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 19:27:36,501 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 19:27:36,502 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 19:27:36,507 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:27:36,510 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:27:36,632 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 19:27:36,634 INFO L255 TraceCheckSpWp]: Trace formula consists of 424 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-11-09 19:27:36,642 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 19:27:36,954 INFO L134 CoverageAnalysis]: Checked inductivity of 29 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 29 trivial. 0 not checked. [2024-11-09 19:27:36,955 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-09 19:27:36,956 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [326114559] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 19:27:36,956 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-09 19:27:36,956 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [3] total 4 [2024-11-09 19:27:36,956 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [117800156] [2024-11-09 19:27:36,956 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 19:27:36,957 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-09 19:27:36,957 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 19:27:36,957 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-09 19:27:36,957 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-11-09 19:27:36,957 INFO L87 Difference]: Start difference. First operand 51141 states and 105775 transitions. Second operand has 3 states, 3 states have (on average 103.66666666666667) internal successors, (311), 2 states have internal predecessors, (311), 0 states have call successors, (0), 0 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:27:40,846 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 19:27:40,846 INFO L93 Difference]: Finished difference Result 120328 states and 247559 transitions. [2024-11-09 19:27:40,847 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-09 19:27:40,847 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 103.66666666666667) internal successors, (311), 2 states have internal predecessors, (311), 0 states have call successors, (0), 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 339 [2024-11-09 19:27:40,848 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 19:27:41,190 INFO L225 Difference]: With dead ends: 120328 [2024-11-09 19:27:41,192 INFO L226 Difference]: Without dead ends: 69941 [2024-11-09 19:27:41,234 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 341 GetRequests, 338 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:27:41,237 INFO L432 NwaCegarLoop]: 200 mSDtfsCounter, 1205 mSDsluCounter, 9 mSDsCounter, 0 mSdLazyCounter, 3690 mSolverCounterSat, 425 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1205 SdHoareTripleChecker+Valid, 209 SdHoareTripleChecker+Invalid, 4115 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 425 IncrementalHoareTripleChecker+Valid, 3690 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.3s IncrementalHoareTripleChecker+Time [2024-11-09 19:27:41,237 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1205 Valid, 209 Invalid, 4115 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [425 Valid, 3690 Invalid, 0 Unknown, 0 Unchecked, 3.3s Time] [2024-11-09 19:27:41,278 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 69941 states. [2024-11-09 19:27:42,015 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 69941 to 64677. [2024-11-09 19:27:42,061 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 64677 states, 64676 states have (on average 2.0376337435834) internal successors, (131786), 64676 states have internal predecessors, (131786), 0 states have call successors, (0), 0 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:27:42,328 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 64677 states to 64677 states and 131786 transitions. [2024-11-09 19:27:42,329 INFO L78 Accepts]: Start accepts. Automaton has 64677 states and 131786 transitions. Word has length 339 [2024-11-09 19:27:42,330 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 19:27:42,330 INFO L471 AbstractCegarLoop]: Abstraction has 64677 states and 131786 transitions. [2024-11-09 19:27:42,330 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 103.66666666666667) internal successors, (311), 2 states have internal predecessors, (311), 0 states have call successors, (0), 0 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:27:42,330 INFO L276 IsEmpty]: Start isEmpty. Operand 64677 states and 131786 transitions. [2024-11-09 19:27:42,333 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 364 [2024-11-09 19:27:42,333 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 19:27:42,334 INFO L215 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 19:27:42,348 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2024-11-09 19:27:42,534 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable9 [2024-11-09 19:27:42,535 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 19:27:42,535 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 19:27:42,536 INFO L85 PathProgramCache]: Analyzing trace with hash 800004507, now seen corresponding path program 1 times [2024-11-09 19:27:42,536 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 19:27:42,536 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [123161382] [2024-11-09 19:27:42,536 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 19:27:42,536 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 19:27:42,568 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 19:27:42,954 INFO L134 CoverageAnalysis]: Checked inductivity of 341 backedges. 89 proven. 110 refuted. 0 times theorem prover too weak. 142 trivial. 0 not checked. [2024-11-09 19:27:42,954 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 19:27:42,954 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [123161382] [2024-11-09 19:27:42,954 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [123161382] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-09 19:27:42,954 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1804630792] [2024-11-09 19:27:42,954 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 19:27:42,954 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 19:27:42,955 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 19:27:42,959 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-09 19:27:42,964 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2024-11-09 19:27:43,094 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 19:27:43,096 INFO L255 TraceCheckSpWp]: Trace formula consists of 490 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-11-09 19:27:43,099 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 19:27:43,165 INFO L134 CoverageAnalysis]: Checked inductivity of 341 backedges. 228 proven. 0 refuted. 0 times theorem prover too weak. 113 trivial. 0 not checked. [2024-11-09 19:27:43,165 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-09 19:27:43,166 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1804630792] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 19:27:43,166 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-09 19:27:43,166 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [3] total 5 [2024-11-09 19:27:43,166 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1291577176] [2024-11-09 19:27:43,166 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 19:27:43,166 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-09 19:27:43,167 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 19:27:43,167 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-09 19:27:43,167 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-11-09 19:27:43,167 INFO L87 Difference]: Start difference. First operand 64677 states and 131786 transitions. Second operand has 3 states, 3 states have (on average 83.66666666666667) internal successors, (251), 3 states have internal predecessors, (251), 0 states have call successors, (0), 0 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:27:47,702 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 19:27:47,702 INFO L93 Difference]: Finished difference Result 154920 states and 318076 transitions. [2024-11-09 19:27:47,703 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-09 19:27:47,703 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 83.66666666666667) internal successors, (251), 3 states have internal predecessors, (251), 0 states have call successors, (0), 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 363 [2024-11-09 19:27:47,704 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 19:27:47,888 INFO L225 Difference]: With dead ends: 154920 [2024-11-09 19:27:47,888 INFO L226 Difference]: Without dead ends: 90997 [2024-11-09 19:27:47,928 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 365 GetRequests, 362 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:27:47,932 INFO L432 NwaCegarLoop]: 246 mSDtfsCounter, 1473 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 3435 mSolverCounterSat, 822 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1473 SdHoareTripleChecker+Valid, 253 SdHoareTripleChecker+Invalid, 4257 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 822 IncrementalHoareTripleChecker+Valid, 3435 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.7s IncrementalHoareTripleChecker+Time [2024-11-09 19:27:47,933 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1473 Valid, 253 Invalid, 4257 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [822 Valid, 3435 Invalid, 0 Unknown, 0 Unchecked, 3.7s Time] [2024-11-09 19:27:47,987 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 90997 states. [2024-11-09 19:27:49,252 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 90997 to 90245. [2024-11-09 19:27:49,312 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 90245 states, 90244 states have (on average 2.0297415894685518) internal successors, (183172), 90244 states have internal predecessors, (183172), 0 states have call successors, (0), 0 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:27:49,493 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 90245 states to 90245 states and 183172 transitions. [2024-11-09 19:27:49,494 INFO L78 Accepts]: Start accepts. Automaton has 90245 states and 183172 transitions. Word has length 363 [2024-11-09 19:27:49,494 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 19:27:49,494 INFO L471 AbstractCegarLoop]: Abstraction has 90245 states and 183172 transitions. [2024-11-09 19:27:49,495 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 83.66666666666667) internal successors, (251), 3 states have internal predecessors, (251), 0 states have call successors, (0), 0 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:27:49,495 INFO L276 IsEmpty]: Start isEmpty. Operand 90245 states and 183172 transitions. [2024-11-09 19:27:49,500 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 368 [2024-11-09 19:27:49,500 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 19:27:49,500 INFO L215 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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:27:49,513 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2024-11-09 19:27:49,700 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 19:27:49,701 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 19:27:49,702 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 19:27:49,702 INFO L85 PathProgramCache]: Analyzing trace with hash -2091014745, now seen corresponding path program 1 times [2024-11-09 19:27:49,702 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 19:27:49,702 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1263389584] [2024-11-09 19:27:49,703 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 19:27:49,703 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 19:27:49,755 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 19:27:49,937 INFO L134 CoverageAnalysis]: Checked inductivity of 345 backedges. 89 proven. 0 refuted. 0 times theorem prover too weak. 256 trivial. 0 not checked. [2024-11-09 19:27:49,938 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 19:27:49,938 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1263389584] [2024-11-09 19:27:49,938 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1263389584] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 19:27:49,938 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 19:27:49,938 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-09 19:27:49,938 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [412510225] [2024-11-09 19:27:49,938 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 19:27:49,939 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-09 19:27:49,939 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 19:27:49,939 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-09 19:27:49,939 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-09 19:27:49,939 INFO L87 Difference]: Start difference. First operand 90245 states and 183172 transitions. Second operand has 3 states, 3 states have (on average 60.666666666666664) internal successors, (182), 3 states have internal predecessors, (182), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 19:27:54,727 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 19:27:54,727 INFO L93 Difference]: Finished difference Result 223352 states and 455756 transitions. [2024-11-09 19:27:54,728 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-09 19:27:54,728 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 60.666666666666664) internal successors, (182), 3 states have internal predecessors, (182), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 367 [2024-11-09 19:27:54,728 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 19:27:54,904 INFO L225 Difference]: With dead ends: 223352 [2024-11-09 19:27:54,904 INFO L226 Difference]: Without dead ends: 128597 [2024-11-09 19:27:54,924 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:27:54,925 INFO L432 NwaCegarLoop]: 1954 mSDtfsCounter, 1453 mSDsluCounter, 10 mSDsCounter, 0 mSdLazyCounter, 3569 mSolverCounterSat, 620 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1453 SdHoareTripleChecker+Valid, 1964 SdHoareTripleChecker+Invalid, 4189 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 620 IncrementalHoareTripleChecker+Valid, 3569 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.9s IncrementalHoareTripleChecker+Time [2024-11-09 19:27:54,925 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1453 Valid, 1964 Invalid, 4189 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [620 Valid, 3569 Invalid, 0 Unknown, 0 Unchecked, 3.9s Time] [2024-11-09 19:27:54,998 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 128597 states. [2024-11-09 19:27:56,640 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 128597 to 124837. [2024-11-09 19:27:56,722 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 124837 states, 124836 states have (on average 2.0113028293120574) internal successors, (251083), 124836 states have internal predecessors, (251083), 0 states have call successors, (0), 0 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:27:56,905 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 124837 states to 124837 states and 251083 transitions. [2024-11-09 19:27:56,906 INFO L78 Accepts]: Start accepts. Automaton has 124837 states and 251083 transitions. Word has length 367 [2024-11-09 19:27:56,912 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 19:27:56,913 INFO L471 AbstractCegarLoop]: Abstraction has 124837 states and 251083 transitions. [2024-11-09 19:27:56,913 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 60.666666666666664) internal successors, (182), 3 states have internal predecessors, (182), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 19:27:56,913 INFO L276 IsEmpty]: Start isEmpty. Operand 124837 states and 251083 transitions. [2024-11-09 19:27:56,920 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 472 [2024-11-09 19:27:56,920 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 19:27:56,920 INFO L215 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 19:27:56,920 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2024-11-09 19:27:56,920 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 19:27:56,921 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 19:27:56,921 INFO L85 PathProgramCache]: Analyzing trace with hash 419599839, now seen corresponding path program 1 times [2024-11-09 19:27:56,921 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 19:27:56,921 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [789749269] [2024-11-09 19:27:56,921 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 19:27:56,921 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 19:27:56,976 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 19:27:58,458 INFO L134 CoverageAnalysis]: Checked inductivity of 469 backedges. 409 proven. 60 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 19:27:58,458 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 19:27:58,458 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [789749269] [2024-11-09 19:27:58,459 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [789749269] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-09 19:27:58,459 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1984457725] [2024-11-09 19:27:58,459 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 19:27:58,459 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 19:27:58,459 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 19:27:58,462 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-09 19:27:58,470 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2024-11-09 19:27:58,612 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 19:27:58,614 INFO L255 TraceCheckSpWp]: Trace formula consists of 600 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-11-09 19:27:58,618 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 19:27:59,077 INFO L134 CoverageAnalysis]: Checked inductivity of 469 backedges. 89 proven. 0 refuted. 0 times theorem prover too weak. 380 trivial. 0 not checked. [2024-11-09 19:27:59,078 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-09 19:27:59,078 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1984457725] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 19:27:59,078 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-09 19:27:59,079 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [6] total 8 [2024-11-09 19:27:59,079 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1736080963] [2024-11-09 19:27:59,079 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 19:27:59,079 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-09 19:27:59,079 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 19:27:59,080 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-09 19:27:59,080 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2024-11-09 19:27:59,080 INFO L87 Difference]: Start difference. First operand 124837 states and 251083 transitions. Second operand has 4 states, 4 states have (on average 52.5) internal successors, (210), 3 states have internal predecessors, (210), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 19:28:06,493 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 19:28:06,494 INFO L93 Difference]: Finished difference Result 385035 states and 775624 transitions. [2024-11-09 19:28:06,494 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-09 19:28:06,494 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 52.5) internal successors, (210), 3 states have internal predecessors, (210), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 471 [2024-11-09 19:28:06,495 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 19:28:06,866 INFO L225 Difference]: With dead ends: 385035 [2024-11-09 19:28:06,867 INFO L226 Difference]: Without dead ends: 260952 [2024-11-09 19:28:06,916 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 476 GetRequests, 470 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2024-11-09 19:28:06,917 INFO L432 NwaCegarLoop]: 30 mSDtfsCounter, 3236 mSDsluCounter, 19 mSDsCounter, 0 mSdLazyCounter, 7324 mSolverCounterSat, 644 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3236 SdHoareTripleChecker+Valid, 49 SdHoareTripleChecker+Invalid, 7968 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 644 IncrementalHoareTripleChecker+Valid, 7324 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 5.8s IncrementalHoareTripleChecker+Time [2024-11-09 19:28:06,917 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [3236 Valid, 49 Invalid, 7968 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [644 Valid, 7324 Invalid, 0 Unknown, 0 Unchecked, 5.8s Time] [2024-11-09 19:28:07,081 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 260952 states. [2024-11-09 19:28:10,599 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 260952 to 260197. [2024-11-09 19:28:10,915 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 260197 states, 260196 states have (on average 2.0097349690233517) internal successors, (522925), 260196 states have internal predecessors, (522925), 0 states have call successors, (0), 0 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:28:12,289 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 260197 states to 260197 states and 522925 transitions. [2024-11-09 19:28:12,291 INFO L78 Accepts]: Start accepts. Automaton has 260197 states and 522925 transitions. Word has length 471 [2024-11-09 19:28:12,294 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 19:28:12,294 INFO L471 AbstractCegarLoop]: Abstraction has 260197 states and 522925 transitions. [2024-11-09 19:28:12,295 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 52.5) internal successors, (210), 3 states have internal predecessors, (210), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 19:28:12,295 INFO L276 IsEmpty]: Start isEmpty. Operand 260197 states and 522925 transitions. [2024-11-09 19:28:12,336 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 611 [2024-11-09 19:28:12,339 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 19:28:12,339 INFO L215 NwaCegarLoop]: trace histogram [6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:28:12,373 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2024-11-09 19:28:12,543 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 19:28:12,544 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 19:28:12,545 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 19:28:12,545 INFO L85 PathProgramCache]: Analyzing trace with hash -666342679, now seen corresponding path program 1 times [2024-11-09 19:28:12,545 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 19:28:12,545 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [637959560] [2024-11-09 19:28:12,545 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 19:28:12,545 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 19:28:12,608 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 19:28:12,864 INFO L134 CoverageAnalysis]: Checked inductivity of 1016 backedges. 805 proven. 0 refuted. 0 times theorem prover too weak. 211 trivial. 0 not checked. [2024-11-09 19:28:12,864 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 19:28:12,864 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [637959560] [2024-11-09 19:28:12,864 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [637959560] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 19:28:12,865 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 19:28:12,865 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-09 19:28:12,865 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1532810362] [2024-11-09 19:28:12,865 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 19:28:12,865 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-09 19:28:12,865 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 19:28:12,866 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-09 19:28:12,866 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-09 19:28:12,866 INFO L87 Difference]: Start difference. First operand 260197 states and 522925 transitions. Second operand has 3 states, 3 states have (on average 134.0) internal successors, (402), 3 states have internal predecessors, (402), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)