./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/eca-rers2012/Problem19_label42.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 3289d67d 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/Problem19_label42.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 07b24adb8d1690a690440be2a1429dd427e8718e8ee7383841282dfd2e0d0b82 --- Real Ultimate output --- This is Ultimate 0.2.5-tmp.fs.icfgbuilder-eval-3289d67-m [2024-11-16 04:31:15,147 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-16 04:31:15,215 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-11-16 04:31:15,219 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-16 04:31:15,220 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-16 04:31:15,247 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-16 04:31:15,248 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-16 04:31:15,248 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-16 04:31:15,249 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-16 04:31:15,250 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-16 04:31:15,250 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-16 04:31:15,250 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-16 04:31:15,251 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-16 04:31:15,251 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-16 04:31:15,253 INFO L153 SettingsManager]: * Use SBE=true [2024-11-16 04:31:15,253 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-16 04:31:15,253 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-16 04:31:15,254 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-16 04:31:15,254 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-16 04:31:15,254 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-16 04:31:15,254 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-16 04:31:15,258 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-16 04:31:15,258 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-16 04:31:15,258 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-16 04:31:15,259 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-16 04:31:15,259 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-16 04:31:15,259 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-16 04:31:15,259 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-16 04:31:15,259 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2024-11-16 04:31:15,260 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-16 04:31:15,260 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-16 04:31:15,260 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-16 04:31:15,260 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-16 04:31:15,261 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-16 04:31:15,261 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-16 04:31:15,261 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-16 04:31:15,261 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-16 04:31:15,262 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-16 04:31:15,263 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-16 04:31:15,263 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-16 04:31:15,263 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-16 04:31:15,263 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-16 04:31:15,264 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 -> 07b24adb8d1690a690440be2a1429dd427e8718e8ee7383841282dfd2e0d0b82 [2024-11-16 04:31:15,495 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-16 04:31:15,521 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-16 04:31:15,524 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-16 04:31:15,525 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-16 04:31:15,525 INFO L274 PluginConnector]: CDTParser initialized [2024-11-16 04:31:15,526 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/eca-rers2012/Problem19_label42.c [2024-11-16 04:31:17,003 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-16 04:31:17,530 INFO L384 CDTParser]: Found 1 translation units. [2024-11-16 04:31:17,532 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/eca-rers2012/Problem19_label42.c [2024-11-16 04:31:17,576 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/09dbfa6f7/c561a0a2ad4c476bb7cf154899d66d35/FLAG492b5e34b [2024-11-16 04:31:17,590 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/09dbfa6f7/c561a0a2ad4c476bb7cf154899d66d35 [2024-11-16 04:31:17,595 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-16 04:31:17,597 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-16 04:31:17,598 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-16 04:31:17,601 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-16 04:31:17,606 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-16 04:31:17,607 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.11 04:31:17" (1/1) ... [2024-11-16 04:31:17,608 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@22dfb35c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 04:31:17, skipping insertion in model container [2024-11-16 04:31:17,608 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.11 04:31:17" (1/1) ... [2024-11-16 04:31:17,755 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-16 04:31:18,037 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/Problem19_label42.c[1692,1705] [2024-11-16 04:31:19,234 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-16 04:31:19,244 INFO L200 MainTranslator]: Completed pre-run [2024-11-16 04:31:19,258 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/Problem19_label42.c[1692,1705] [2024-11-16 04:31:19,986 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-16 04:31:20,023 INFO L204 MainTranslator]: Completed translation [2024-11-16 04:31:20,024 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 04:31:20 WrapperNode [2024-11-16 04:31:20,024 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-16 04:31:20,025 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-16 04:31:20,025 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-16 04:31:20,025 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-16 04:31:20,031 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 04:31:20" (1/1) ... [2024-11-16 04:31:20,129 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 04:31:20" (1/1) ... [2024-11-16 04:31:21,210 INFO L138 Inliner]: procedures = 19, calls = 13, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 9430 [2024-11-16 04:31:21,211 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-16 04:31:21,212 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-16 04:31:21,212 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-16 04:31:21,212 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-16 04:31:21,222 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 04:31:20" (1/1) ... [2024-11-16 04:31:21,223 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 04:31:20" (1/1) ... [2024-11-16 04:31:21,474 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 04:31:20" (1/1) ... [2024-11-16 04:31:21,782 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-16 04:31:21,782 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 04:31:20" (1/1) ... [2024-11-16 04:31:21,782 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 04:31:20" (1/1) ... [2024-11-16 04:31:22,194 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 04:31:20" (1/1) ... [2024-11-16 04:31:22,269 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 04:31:20" (1/1) ... [2024-11-16 04:31:22,343 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 04:31:20" (1/1) ... [2024-11-16 04:31:22,470 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 04:31:20" (1/1) ... [2024-11-16 04:31:22,587 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-16 04:31:22,588 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2024-11-16 04:31:22,588 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2024-11-16 04:31:22,588 INFO L274 PluginConnector]: IcfgBuilder initialized [2024-11-16 04:31:22,589 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 04:31:20" (1/1) ... [2024-11-16 04:31:22,594 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-16 04:31:22,603 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-16 04:31:22,619 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-16 04:31:22,621 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-16 04:31:22,667 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-16 04:31:22,667 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-11-16 04:31:22,667 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-16 04:31:22,667 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-16 04:31:22,753 INFO L256 CfgBuilder]: Building ICFG [2024-11-16 04:31:22,756 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-16 04:31:30,481 INFO L1250 $ProcedureCfgBuilder]: dead code at ProgramPoint L6717: havoc calculate_output4_#t~ret14#1; [2024-11-16 04:31:30,482 INFO L1250 $ProcedureCfgBuilder]: dead code at ProgramPoint L3435: havoc calculate_output2_#t~ret12#1; [2024-11-16 04:31:30,482 INFO L1250 $ProcedureCfgBuilder]: dead code at ProgramPoint L1859: havoc calculate_output_#t~ret11#1; [2024-11-16 04:31:30,482 INFO L1250 $ProcedureCfgBuilder]: dead code at ProgramPoint L8350: havoc calculate_output5_#t~ret15#1; [2024-11-16 04:31:30,483 INFO L1250 $ProcedureCfgBuilder]: dead code at ProgramPoint L5079: havoc calculate_output3_#t~ret13#1; [2024-11-16 04:31:31,094 INFO L? ?]: Removed 1320 outVars from TransFormulas that were not future-live. [2024-11-16 04:31:31,095 INFO L307 CfgBuilder]: Performing block encoding [2024-11-16 04:31:31,153 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-16 04:31:31,153 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2024-11-16 04:31:31,153 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 16.11 04:31:31 BoogieIcfgContainer [2024-11-16 04:31:31,154 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2024-11-16 04:31:31,155 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-16 04:31:31,156 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-16 04:31:31,159 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-16 04:31:31,159 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 16.11 04:31:17" (1/3) ... [2024-11-16 04:31:31,160 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@702ed4b9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.11 04:31:31, skipping insertion in model container [2024-11-16 04:31:31,160 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 04:31:20" (2/3) ... [2024-11-16 04:31:31,160 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@702ed4b9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.11 04:31:31, skipping insertion in model container [2024-11-16 04:31:31,161 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 16.11 04:31:31" (3/3) ... [2024-11-16 04:31:31,162 INFO L112 eAbstractionObserver]: Analyzing ICFG Problem19_label42.c [2024-11-16 04:31:31,177 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-16 04:31:31,177 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-11-16 04:31:31,282 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-16 04:31:31,290 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;@5ebf92b8, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-16 04:31:31,291 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-16 04:31:31,302 INFO L276 IsEmpty]: Start isEmpty. Operand has 1751 states, 1749 states have (on average 1.8684962835906231) internal successors, (3268), 1750 states have internal predecessors, (3268), 0 states have call successors, (0), 0 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-16 04:31:31,308 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2024-11-16 04:31:31,309 INFO L207 NwaCegarLoop]: Found error trace [2024-11-16 04:31:31,309 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-16 04:31:31,309 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-16 04:31:31,313 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 04:31:31,314 INFO L85 PathProgramCache]: Analyzing trace with hash -1846101409, now seen corresponding path program 1 times [2024-11-16 04:31:31,322 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-16 04:31:31,323 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [98915331] [2024-11-16 04:31:31,323 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 04:31:31,323 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-16 04:31:31,416 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 04:31:31,520 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-16 04:31:31,521 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-16 04:31:31,521 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [98915331] [2024-11-16 04:31:31,522 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [98915331] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-16 04:31:31,522 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-16 04:31:31,522 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-16 04:31:31,524 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [455064846] [2024-11-16 04:31:31,525 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-16 04:31:31,528 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-16 04:31:31,529 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-16 04:31:31,553 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-16 04:31:31,554 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-16 04:31:31,561 INFO L87 Difference]: Start difference. First operand has 1751 states, 1749 states have (on average 1.8684962835906231) internal successors, (3268), 1750 states have internal predecessors, (3268), 0 states have call successors, (0), 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 3.6666666666666665) internal successors, (11), 2 states have internal predecessors, (11), 0 states have call successors, (0), 0 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-16 04:31:37,632 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-16 04:31:37,632 INFO L93 Difference]: Finished difference Result 4925 states and 9319 transitions. [2024-11-16 04:31:37,634 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-16 04:31:37,635 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 2 states have internal predecessors, (11), 0 states have call successors, (0), 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 11 [2024-11-16 04:31:37,635 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-16 04:31:37,672 INFO L225 Difference]: With dead ends: 4925 [2024-11-16 04:31:37,673 INFO L226 Difference]: Without dead ends: 3110 [2024-11-16 04:31:37,685 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-16 04:31:37,688 INFO L432 NwaCegarLoop]: 1279 mSDtfsCounter, 1544 mSDsluCounter, 183 mSDsCounter, 0 mSdLazyCounter, 4638 mSolverCounterSat, 1110 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1544 SdHoareTripleChecker+Valid, 1462 SdHoareTripleChecker+Invalid, 5748 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1110 IncrementalHoareTripleChecker+Valid, 4638 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 5.9s IncrementalHoareTripleChecker+Time [2024-11-16 04:31:37,689 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1544 Valid, 1462 Invalid, 5748 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1110 Valid, 4638 Invalid, 0 Unknown, 0 Unchecked, 5.9s Time] [2024-11-16 04:31:37,712 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3110 states. [2024-11-16 04:31:37,815 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3110 to 3109. [2024-11-16 04:31:37,821 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3109 states, 3108 states have (on average 1.6521879021879022) internal successors, (5135), 3108 states have internal predecessors, (5135), 0 states have call successors, (0), 0 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-16 04:31:37,830 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3109 states to 3109 states and 5135 transitions. [2024-11-16 04:31:37,832 INFO L78 Accepts]: Start accepts. Automaton has 3109 states and 5135 transitions. Word has length 11 [2024-11-16 04:31:37,832 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-16 04:31:37,833 INFO L471 AbstractCegarLoop]: Abstraction has 3109 states and 5135 transitions. [2024-11-16 04:31:37,833 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 2 states have internal predecessors, (11), 0 states have call successors, (0), 0 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-16 04:31:37,833 INFO L276 IsEmpty]: Start isEmpty. Operand 3109 states and 5135 transitions. [2024-11-16 04:31:37,835 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 82 [2024-11-16 04:31:37,835 INFO L207 NwaCegarLoop]: Found error trace [2024-11-16 04:31:37,836 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-16 04:31:37,836 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-16 04:31:37,836 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-16 04:31:37,837 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 04:31:37,837 INFO L85 PathProgramCache]: Analyzing trace with hash -235064380, now seen corresponding path program 1 times [2024-11-16 04:31:37,837 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-16 04:31:37,837 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [402455229] [2024-11-16 04:31:37,838 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 04:31:37,838 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-16 04:31:37,910 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 04:31:38,138 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-16 04:31:38,138 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-16 04:31:38,138 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [402455229] [2024-11-16 04:31:38,139 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [402455229] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-16 04:31:38,139 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-16 04:31:38,139 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-16 04:31:38,139 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [133816669] [2024-11-16 04:31:38,139 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-16 04:31:38,142 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-16 04:31:38,142 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-16 04:31:38,143 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-16 04:31:38,143 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-16 04:31:38,144 INFO L87 Difference]: Start difference. First operand 3109 states and 5135 transitions. Second operand has 3 states, 3 states have (on average 27.0) internal successors, (81), 2 states have internal predecessors, (81), 0 states have call successors, (0), 0 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-16 04:31:44,471 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-16 04:31:44,472 INFO L93 Difference]: Finished difference Result 9106 states and 15093 transitions. [2024-11-16 04:31:44,472 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-16 04:31:44,472 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 27.0) internal successors, (81), 2 states have internal predecessors, (81), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 81 [2024-11-16 04:31:44,473 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-16 04:31:44,496 INFO L225 Difference]: With dead ends: 9106 [2024-11-16 04:31:44,497 INFO L226 Difference]: Without dead ends: 5999 [2024-11-16 04:31:44,502 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-16 04:31:44,503 INFO L432 NwaCegarLoop]: 722 mSDtfsCounter, 2534 mSDsluCounter, 272 mSDsCounter, 0 mSdLazyCounter, 5120 mSolverCounterSat, 434 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 5.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2534 SdHoareTripleChecker+Valid, 994 SdHoareTripleChecker+Invalid, 5554 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 434 IncrementalHoareTripleChecker+Valid, 5120 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 6.2s IncrementalHoareTripleChecker+Time [2024-11-16 04:31:44,503 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [2534 Valid, 994 Invalid, 5554 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [434 Valid, 5120 Invalid, 0 Unknown, 0 Unchecked, 6.2s Time] [2024-11-16 04:31:44,510 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5999 states. [2024-11-16 04:31:44,613 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5999 to 5996. [2024-11-16 04:31:44,624 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5996 states, 5995 states have (on average 1.605671392827356) internal successors, (9626), 5995 states have internal predecessors, (9626), 0 states have call successors, (0), 0 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-16 04:31:44,638 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5996 states to 5996 states and 9626 transitions. [2024-11-16 04:31:44,640 INFO L78 Accepts]: Start accepts. Automaton has 5996 states and 9626 transitions. Word has length 81 [2024-11-16 04:31:44,641 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-16 04:31:44,641 INFO L471 AbstractCegarLoop]: Abstraction has 5996 states and 9626 transitions. [2024-11-16 04:31:44,641 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 27.0) internal successors, (81), 2 states have internal predecessors, (81), 0 states have call successors, (0), 0 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-16 04:31:44,642 INFO L276 IsEmpty]: Start isEmpty. Operand 5996 states and 9626 transitions. [2024-11-16 04:31:44,644 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 87 [2024-11-16 04:31:44,644 INFO L207 NwaCegarLoop]: Found error trace [2024-11-16 04:31:44,644 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-16 04:31:44,644 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-16 04:31:44,645 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-16 04:31:44,649 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 04:31:44,649 INFO L85 PathProgramCache]: Analyzing trace with hash 899020940, now seen corresponding path program 1 times [2024-11-16 04:31:44,650 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-16 04:31:44,650 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1869010844] [2024-11-16 04:31:44,650 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 04:31:44,650 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-16 04:31:44,691 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 04:31:44,867 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-16 04:31:44,868 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-16 04:31:44,869 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1869010844] [2024-11-16 04:31:44,869 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1869010844] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-16 04:31:44,870 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-16 04:31:44,870 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-16 04:31:44,870 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [607752354] [2024-11-16 04:31:44,870 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-16 04:31:44,871 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-16 04:31:44,872 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-16 04:31:44,873 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-16 04:31:44,873 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-16 04:31:44,874 INFO L87 Difference]: Start difference. First operand 5996 states and 9626 transitions. Second operand has 3 states, 3 states have (on average 28.666666666666668) internal successors, (86), 2 states have internal predecessors, (86), 0 states have call successors, (0), 0 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-16 04:31:50,352 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-16 04:31:50,353 INFO L93 Difference]: Finished difference Result 17573 states and 28322 transitions. [2024-11-16 04:31:50,353 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-16 04:31:50,353 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 28.666666666666668) internal successors, (86), 2 states have internal predecessors, (86), 0 states have call successors, (0), 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 86 [2024-11-16 04:31:50,355 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-16 04:31:50,394 INFO L225 Difference]: With dead ends: 17573 [2024-11-16 04:31:50,395 INFO L226 Difference]: Without dead ends: 11579 [2024-11-16 04:31:50,405 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-16 04:31:50,406 INFO L432 NwaCegarLoop]: 1566 mSDtfsCounter, 1445 mSDsluCounter, 170 mSDsCounter, 0 mSdLazyCounter, 4825 mSolverCounterSat, 1045 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1445 SdHoareTripleChecker+Valid, 1736 SdHoareTripleChecker+Invalid, 5870 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1045 IncrementalHoareTripleChecker+Valid, 4825 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 5.3s IncrementalHoareTripleChecker+Time [2024-11-16 04:31:50,406 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1445 Valid, 1736 Invalid, 5870 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1045 Valid, 4825 Invalid, 0 Unknown, 0 Unchecked, 5.3s Time] [2024-11-16 04:31:50,417 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11579 states. [2024-11-16 04:31:50,549 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11579 to 11526. [2024-11-16 04:31:50,568 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 11526 states, 11525 states have (on average 1.4293275488069415) internal successors, (16473), 11525 states have internal predecessors, (16473), 0 states have call successors, (0), 0 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-16 04:31:50,588 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11526 states to 11526 states and 16473 transitions. [2024-11-16 04:31:50,588 INFO L78 Accepts]: Start accepts. Automaton has 11526 states and 16473 transitions. Word has length 86 [2024-11-16 04:31:50,589 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-16 04:31:50,589 INFO L471 AbstractCegarLoop]: Abstraction has 11526 states and 16473 transitions. [2024-11-16 04:31:50,589 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 28.666666666666668) internal successors, (86), 2 states have internal predecessors, (86), 0 states have call successors, (0), 0 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-16 04:31:50,589 INFO L276 IsEmpty]: Start isEmpty. Operand 11526 states and 16473 transitions. [2024-11-16 04:31:50,592 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 110 [2024-11-16 04:31:50,592 INFO L207 NwaCegarLoop]: Found error trace [2024-11-16 04:31:50,592 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-16 04:31:50,592 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-11-16 04:31:50,594 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-16 04:31:50,594 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 04:31:50,594 INFO L85 PathProgramCache]: Analyzing trace with hash -864489090, now seen corresponding path program 1 times [2024-11-16 04:31:50,594 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-16 04:31:50,594 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1516472582] [2024-11-16 04:31:50,595 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 04:31:50,595 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-16 04:31:50,631 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 04:31:50,806 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-16 04:31:50,807 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-16 04:31:50,807 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1516472582] [2024-11-16 04:31:50,807 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1516472582] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-16 04:31:50,807 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-16 04:31:50,808 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-16 04:31:50,808 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1388678158] [2024-11-16 04:31:50,808 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-16 04:31:50,808 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-16 04:31:50,809 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-16 04:31:50,809 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-16 04:31:50,809 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-16 04:31:50,810 INFO L87 Difference]: Start difference. First operand 11526 states and 16473 transitions. Second operand has 3 states, 3 states have (on average 36.333333333333336) internal successors, (109), 2 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-16 04:31:56,641 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-16 04:31:56,642 INFO L93 Difference]: Finished difference Result 34195 states and 48938 transitions. [2024-11-16 04:31:56,642 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-16 04:31:56,643 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 36.333333333333336) internal successors, (109), 2 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-16 04:31:56,643 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-16 04:31:56,707 INFO L225 Difference]: With dead ends: 34195 [2024-11-16 04:31:56,707 INFO L226 Difference]: Without dead ends: 22671 [2024-11-16 04:31:56,729 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-16 04:31:56,731 INFO L432 NwaCegarLoop]: 1806 mSDtfsCounter, 1749 mSDsluCounter, 274 mSDsCounter, 0 mSdLazyCounter, 4312 mSolverCounterSat, 1430 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1749 SdHoareTripleChecker+Valid, 2080 SdHoareTripleChecker+Invalid, 5742 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1430 IncrementalHoareTripleChecker+Valid, 4312 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 5.6s IncrementalHoareTripleChecker+Time [2024-11-16 04:31:56,733 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1749 Valid, 2080 Invalid, 5742 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1430 Valid, 4312 Invalid, 0 Unknown, 0 Unchecked, 5.6s Time] [2024-11-16 04:31:56,760 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22671 states. [2024-11-16 04:31:57,095 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22671 to 21287. [2024-11-16 04:31:57,136 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 21287 states, 21286 states have (on average 1.2864323968805789) internal successors, (27383), 21286 states have internal predecessors, (27383), 0 states have call successors, (0), 0 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-16 04:31:57,176 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21287 states to 21287 states and 27383 transitions. [2024-11-16 04:31:57,177 INFO L78 Accepts]: Start accepts. Automaton has 21287 states and 27383 transitions. Word has length 109 [2024-11-16 04:31:57,177 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-16 04:31:57,177 INFO L471 AbstractCegarLoop]: Abstraction has 21287 states and 27383 transitions. [2024-11-16 04:31:57,178 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 36.333333333333336) internal successors, (109), 2 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-16 04:31:57,178 INFO L276 IsEmpty]: Start isEmpty. Operand 21287 states and 27383 transitions. [2024-11-16 04:31:57,182 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 151 [2024-11-16 04:31:57,182 INFO L207 NwaCegarLoop]: Found error trace [2024-11-16 04:31:57,182 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-16 04:31:57,182 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-11-16 04:31:57,183 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-16 04:31:57,183 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 04:31:57,183 INFO L85 PathProgramCache]: Analyzing trace with hash 237391518, now seen corresponding path program 1 times [2024-11-16 04:31:57,183 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-16 04:31:57,184 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [697977595] [2024-11-16 04:31:57,184 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 04:31:57,184 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-16 04:31:57,242 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 04:31:57,402 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-16 04:31:57,405 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-16 04:31:57,405 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [697977595] [2024-11-16 04:31:57,405 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [697977595] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-16 04:31:57,405 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-16 04:31:57,405 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-16 04:31:57,406 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1966613090] [2024-11-16 04:31:57,406 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-16 04:31:57,406 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-16 04:31:57,406 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-16 04:31:57,407 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-16 04:31:57,409 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-16 04:31:57,410 INFO L87 Difference]: Start difference. First operand 21287 states and 27383 transitions. Second operand has 3 states, 3 states have (on average 50.0) internal successors, (150), 2 states have internal predecessors, (150), 0 states have call successors, (0), 0 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-16 04:32:03,029 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-16 04:32:03,029 INFO L93 Difference]: Finished difference Result 63207 states and 81317 transitions. [2024-11-16 04:32:03,029 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-16 04:32:03,029 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 50.0) internal successors, (150), 2 states have internal predecessors, (150), 0 states have call successors, (0), 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 150 [2024-11-16 04:32:03,030 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-16 04:32:03,104 INFO L225 Difference]: With dead ends: 63207 [2024-11-16 04:32:03,104 INFO L226 Difference]: Without dead ends: 41922 [2024-11-16 04:32:03,133 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-16 04:32:03,137 INFO L432 NwaCegarLoop]: 1669 mSDtfsCounter, 1470 mSDsluCounter, 221 mSDsCounter, 0 mSdLazyCounter, 4396 mSolverCounterSat, 1424 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1470 SdHoareTripleChecker+Valid, 1890 SdHoareTripleChecker+Invalid, 5820 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1424 IncrementalHoareTripleChecker+Valid, 4396 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 5.4s IncrementalHoareTripleChecker+Time [2024-11-16 04:32:03,137 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1470 Valid, 1890 Invalid, 5820 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1424 Valid, 4396 Invalid, 0 Unknown, 0 Unchecked, 5.4s Time] [2024-11-16 04:32:03,179 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 41922 states. [2024-11-16 04:32:03,634 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 41922 to 41869. [2024-11-16 04:32:03,688 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 41869 states, 41868 states have (on average 1.1879717206458393) internal successors, (49738), 41868 states have internal predecessors, (49738), 0 states have call successors, (0), 0 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-16 04:32:03,744 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41869 states to 41869 states and 49738 transitions. [2024-11-16 04:32:03,744 INFO L78 Accepts]: Start accepts. Automaton has 41869 states and 49738 transitions. Word has length 150 [2024-11-16 04:32:03,746 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-16 04:32:03,746 INFO L471 AbstractCegarLoop]: Abstraction has 41869 states and 49738 transitions. [2024-11-16 04:32:03,746 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 50.0) internal successors, (150), 2 states have internal predecessors, (150), 0 states have call successors, (0), 0 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-16 04:32:03,746 INFO L276 IsEmpty]: Start isEmpty. Operand 41869 states and 49738 transitions. [2024-11-16 04:32:03,748 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 220 [2024-11-16 04:32:03,748 INFO L207 NwaCegarLoop]: Found error trace [2024-11-16 04:32:03,748 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-16 04:32:03,748 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-11-16 04:32:03,749 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-16 04:32:03,749 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 04:32:03,749 INFO L85 PathProgramCache]: Analyzing trace with hash -20755311, now seen corresponding path program 1 times [2024-11-16 04:32:03,749 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-16 04:32:03,750 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1279552223] [2024-11-16 04:32:03,750 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 04:32:03,750 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-16 04:32:03,807 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 04:32:04,007 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-16 04:32:04,008 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-16 04:32:04,008 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1279552223] [2024-11-16 04:32:04,008 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1279552223] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-16 04:32:04,008 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-16 04:32:04,009 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-16 04:32:04,009 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1490869789] [2024-11-16 04:32:04,009 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-16 04:32:04,009 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-16 04:32:04,009 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-16 04:32:04,010 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-16 04:32:04,010 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-16 04:32:04,010 INFO L87 Difference]: Start difference. First operand 41869 states and 49738 transitions. Second operand has 3 states, 3 states have (on average 73.0) internal successors, (219), 3 states have internal predecessors, (219), 0 states have call successors, (0), 0 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-16 04:32:09,250 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-16 04:32:09,250 INFO L93 Difference]: Finished difference Result 102886 states and 123704 transitions. [2024-11-16 04:32:09,251 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-16 04:32:09,251 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 73.0) internal successors, (219), 3 states have internal predecessors, (219), 0 states have call successors, (0), 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 219 [2024-11-16 04:32:09,251 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-16 04:32:09,341 INFO L225 Difference]: With dead ends: 102886 [2024-11-16 04:32:09,341 INFO L226 Difference]: Without dead ends: 59651 [2024-11-16 04:32:09,388 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-16 04:32:09,389 INFO L432 NwaCegarLoop]: 3091 mSDtfsCounter, 1471 mSDsluCounter, 192 mSDsCounter, 0 mSdLazyCounter, 3732 mSolverCounterSat, 1895 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1471 SdHoareTripleChecker+Valid, 3283 SdHoareTripleChecker+Invalid, 5627 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1895 IncrementalHoareTripleChecker+Valid, 3732 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.8s IncrementalHoareTripleChecker+Time [2024-11-16 04:32:09,389 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1471 Valid, 3283 Invalid, 5627 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1895 Valid, 3732 Invalid, 0 Unknown, 0 Unchecked, 4.8s Time] [2024-11-16 04:32:09,442 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 59651 states. [2024-11-16 04:32:10,144 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 59651 to 59640. [2024-11-16 04:32:10,200 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 59640 states, 59639 states have (on average 1.1473364744546355) internal successors, (68426), 59639 states have internal predecessors, (68426), 0 states have call successors, (0), 0 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-16 04:32:10,281 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 59640 states to 59640 states and 68426 transitions. [2024-11-16 04:32:10,282 INFO L78 Accepts]: Start accepts. Automaton has 59640 states and 68426 transitions. Word has length 219 [2024-11-16 04:32:10,282 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-16 04:32:10,282 INFO L471 AbstractCegarLoop]: Abstraction has 59640 states and 68426 transitions. [2024-11-16 04:32:10,283 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 73.0) internal successors, (219), 3 states have internal predecessors, (219), 0 states have call successors, (0), 0 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-16 04:32:10,283 INFO L276 IsEmpty]: Start isEmpty. Operand 59640 states and 68426 transitions. [2024-11-16 04:32:10,288 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 440 [2024-11-16 04:32:10,288 INFO L207 NwaCegarLoop]: Found error trace [2024-11-16 04:32:10,289 INFO L215 NwaCegarLoop]: trace histogram [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, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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-16 04:32:10,289 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-11-16 04:32:10,289 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-16 04:32:10,290 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 04:32:10,290 INFO L85 PathProgramCache]: Analyzing trace with hash 42148167, now seen corresponding path program 1 times [2024-11-16 04:32:10,290 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-16 04:32:10,290 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2011728398] [2024-11-16 04:32:10,291 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 04:32:10,291 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-16 04:32:10,360 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 04:32:11,926 INFO L134 CoverageAnalysis]: Checked inductivity of 222 backedges. 214 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2024-11-16 04:32:11,927 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-16 04:32:11,927 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2011728398] [2024-11-16 04:32:11,927 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2011728398] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-16 04:32:11,927 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-16 04:32:11,927 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-16 04:32:11,928 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1807151934] [2024-11-16 04:32:11,928 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-16 04:32:11,929 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-16 04:32:11,929 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-16 04:32:11,929 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-16 04:32:11,930 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-16 04:32:11,930 INFO L87 Difference]: Start difference. First operand 59640 states and 68426 transitions. Second operand has 4 states, 4 states have (on average 108.0) internal successors, (432), 3 states have internal predecessors, (432), 0 states have call successors, (0), 0 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-16 04:32:20,278 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-16 04:32:20,278 INFO L93 Difference]: Finished difference Result 146681 states and 166279 transitions. [2024-11-16 04:32:20,279 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-16 04:32:20,279 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 108.0) internal successors, (432), 3 states have internal predecessors, (432), 0 states have call successors, (0), 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 439 [2024-11-16 04:32:20,279 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-16 04:32:20,401 INFO L225 Difference]: With dead ends: 146681 [2024-11-16 04:32:20,401 INFO L226 Difference]: Without dead ends: 87043 [2024-11-16 04:32:20,436 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-11-16 04:32:20,437 INFO L432 NwaCegarLoop]: 1800 mSDtfsCounter, 3763 mSDsluCounter, 362 mSDsCounter, 0 mSdLazyCounter, 9421 mSolverCounterSat, 267 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 6.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3763 SdHoareTripleChecker+Valid, 2162 SdHoareTripleChecker+Invalid, 9688 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 267 IncrementalHoareTripleChecker+Valid, 9421 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 7.8s IncrementalHoareTripleChecker+Time [2024-11-16 04:32:20,437 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [3763 Valid, 2162 Invalid, 9688 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [267 Valid, 9421 Invalid, 0 Unknown, 0 Unchecked, 7.8s Time] [2024-11-16 04:32:20,516 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 87043 states. [2024-11-16 04:32:21,241 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 87043 to 84265. [2024-11-16 04:32:21,301 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 84265 states, 84264 states have (on average 1.1178083167188835) internal successors, (94191), 84264 states have internal predecessors, (94191), 0 states have call successors, (0), 0 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-16 04:32:21,413 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 84265 states to 84265 states and 94191 transitions. [2024-11-16 04:32:21,414 INFO L78 Accepts]: Start accepts. Automaton has 84265 states and 94191 transitions. Word has length 439 [2024-11-16 04:32:21,414 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-16 04:32:21,414 INFO L471 AbstractCegarLoop]: Abstraction has 84265 states and 94191 transitions. [2024-11-16 04:32:21,415 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 108.0) internal successors, (432), 3 states have internal predecessors, (432), 0 states have call successors, (0), 0 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-16 04:32:21,415 INFO L276 IsEmpty]: Start isEmpty. Operand 84265 states and 94191 transitions. [2024-11-16 04:32:21,421 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 468 [2024-11-16 04:32:21,421 INFO L207 NwaCegarLoop]: Found error trace [2024-11-16 04:32:21,422 INFO L215 NwaCegarLoop]: trace histogram [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, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2024-11-16 04:32:21,422 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-11-16 04:32:21,422 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-16 04:32:21,423 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 04:32:21,423 INFO L85 PathProgramCache]: Analyzing trace with hash 1293478645, now seen corresponding path program 1 times [2024-11-16 04:32:21,423 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-16 04:32:21,423 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1385137191] [2024-11-16 04:32:21,423 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 04:32:21,424 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-16 04:32:21,502 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 04:32:22,630 INFO L134 CoverageAnalysis]: Checked inductivity of 234 backedges. 234 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-16 04:32:22,631 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-16 04:32:22,632 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1385137191] [2024-11-16 04:32:22,632 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1385137191] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-16 04:32:22,632 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-16 04:32:22,632 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-16 04:32:22,633 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1076780531] [2024-11-16 04:32:22,633 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-16 04:32:22,633 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-16 04:32:22,634 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-16 04:32:22,634 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-16 04:32:22,635 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-11-16 04:32:22,635 INFO L87 Difference]: Start difference. First operand 84265 states and 94191 transitions. Second operand has 4 states, 4 states have (on average 116.75) internal successors, (467), 3 states have internal predecessors, (467), 0 states have call successors, (0), 0 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-16 04:32:28,008 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-16 04:32:28,008 INFO L93 Difference]: Finished difference Result 171292 states and 191162 transitions. [2024-11-16 04:32:28,009 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-16 04:32:28,009 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 116.75) internal successors, (467), 3 states have internal predecessors, (467), 0 states have call successors, (0), 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 467 [2024-11-16 04:32:28,010 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-16 04:32:28,113 INFO L225 Difference]: With dead ends: 171292 [2024-11-16 04:32:28,113 INFO L226 Difference]: Without dead ends: 86997 [2024-11-16 04:32:28,154 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-16 04:32:28,154 INFO L432 NwaCegarLoop]: 1772 mSDtfsCounter, 1151 mSDsluCounter, 182 mSDsCounter, 0 mSdLazyCounter, 5709 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1151 SdHoareTripleChecker+Valid, 1954 SdHoareTripleChecker+Invalid, 5717 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 5709 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 5.0s IncrementalHoareTripleChecker+Time [2024-11-16 04:32:28,154 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1151 Valid, 1954 Invalid, 5717 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 5709 Invalid, 0 Unknown, 0 Unchecked, 5.0s Time] [2024-11-16 04:32:28,242 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 86997 states. [2024-11-16 04:32:29,162 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 86997 to 86997. [2024-11-16 04:32:29,218 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 86997 states, 86996 states have (on average 1.114166168559474) internal successors, (96928), 86996 states have internal predecessors, (96928), 0 states have call successors, (0), 0 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-16 04:32:29,329 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 86997 states to 86997 states and 96928 transitions. [2024-11-16 04:32:29,330 INFO L78 Accepts]: Start accepts. Automaton has 86997 states and 96928 transitions. Word has length 467 [2024-11-16 04:32:29,330 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-16 04:32:29,331 INFO L471 AbstractCegarLoop]: Abstraction has 86997 states and 96928 transitions. [2024-11-16 04:32:29,331 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 116.75) internal successors, (467), 3 states have internal predecessors, (467), 0 states have call successors, (0), 0 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-16 04:32:29,331 INFO L276 IsEmpty]: Start isEmpty. Operand 86997 states and 96928 transitions. [2024-11-16 04:32:29,337 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 586 [2024-11-16 04:32:29,337 INFO L207 NwaCegarLoop]: Found error trace [2024-11-16 04:32:29,338 INFO L215 NwaCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-16 04:32:29,338 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-11-16 04:32:29,338 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-16 04:32:29,339 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 04:32:29,339 INFO L85 PathProgramCache]: Analyzing trace with hash -2129496943, now seen corresponding path program 1 times [2024-11-16 04:32:29,339 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-16 04:32:29,340 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2036096878] [2024-11-16 04:32:29,340 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 04:32:29,340 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-16 04:32:29,488 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 04:32:30,110 INFO L134 CoverageAnalysis]: Checked inductivity of 100 backedges. 15 proven. 0 refuted. 0 times theorem prover too weak. 85 trivial. 0 not checked. [2024-11-16 04:32:30,110 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-16 04:32:30,111 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2036096878] [2024-11-16 04:32:30,111 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2036096878] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-16 04:32:30,111 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-16 04:32:30,111 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-16 04:32:30,111 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [859509086] [2024-11-16 04:32:30,111 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-16 04:32:30,112 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-16 04:32:30,113 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-16 04:32:30,114 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-16 04:32:30,116 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-16 04:32:30,116 INFO L87 Difference]: Start difference. First operand 86997 states and 96928 transitions. Second operand has 3 states, 3 states have (on average 167.0) internal successors, (501), 2 states have internal predecessors, (501), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)