./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/eca-rers2012/Problem13_label00.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/Problem13_label00.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 1908a46c2d6c2885901135dd96252b8ed820acb687d93cae536846c5c1656ef1 --- Real Ultimate output --- This is Ultimate 0.2.5-tmp.fs.icfgbuilder-eval-023d838-m [2024-11-09 19:30:14,498 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-09 19:30:14,597 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-11-09 19:30:14,604 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-09 19:30:14,606 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-09 19:30:14,633 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-09 19:30:14,633 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-09 19:30:14,634 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-09 19:30:14,635 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-09 19:30:14,635 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-09 19:30:14,635 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-09 19:30:14,636 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-09 19:30:14,636 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-09 19:30:14,637 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-09 19:30:14,637 INFO L153 SettingsManager]: * Use SBE=true [2024-11-09 19:30:14,637 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-09 19:30:14,638 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-09 19:30:14,638 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-09 19:30:14,642 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-09 19:30:14,642 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-09 19:30:14,643 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-09 19:30:14,643 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-09 19:30:14,645 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-09 19:30:14,645 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-09 19:30:14,645 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-09 19:30:14,645 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-09 19:30:14,646 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-09 19:30:14,646 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-09 19:30:14,646 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2024-11-09 19:30:14,647 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-09 19:30:14,647 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-09 19:30:14,647 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-09 19:30:14,647 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-09 19:30:14,648 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-09 19:30:14,648 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-09 19:30:14,648 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-09 19:30:14,649 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-09 19:30:14,649 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-09 19:30:14,649 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-09 19:30:14,650 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-09 19:30:14,650 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-09 19:30:14,651 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-09 19:30:14,652 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 -> 1908a46c2d6c2885901135dd96252b8ed820acb687d93cae536846c5c1656ef1 [2024-11-09 19:30:14,885 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-09 19:30:14,913 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-09 19:30:14,917 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-09 19:30:14,918 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-09 19:30:14,919 INFO L274 PluginConnector]: CDTParser initialized [2024-11-09 19:30:14,920 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/eca-rers2012/Problem13_label00.c [2024-11-09 19:30:16,423 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-09 19:30:16,906 INFO L384 CDTParser]: Found 1 translation units. [2024-11-09 19:30:16,908 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/eca-rers2012/Problem13_label00.c [2024-11-09 19:30:16,948 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/3444c7ab1/7f5b586bb1cf4c6da62f054a170c58c9/FLAG8cfeb53e1 [2024-11-09 19:30:16,968 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/3444c7ab1/7f5b586bb1cf4c6da62f054a170c58c9 [2024-11-09 19:30:16,970 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-09 19:30:16,972 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-09 19:30:16,974 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-09 19:30:16,974 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-09 19:30:16,980 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-09 19:30:16,982 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.11 07:30:16" (1/1) ... [2024-11-09 19:30:16,984 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4701af04 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 07:30:16, skipping insertion in model container [2024-11-09 19:30:16,984 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.11 07:30:16" (1/1) ... [2024-11-09 19:30:17,113 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-09 19:30:17,422 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/eca-rers2012/Problem13_label00.c[5434,5447] [2024-11-09 19:30:18,395 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-09 19:30:18,408 INFO L200 MainTranslator]: Completed pre-run [2024-11-09 19:30:18,436 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/eca-rers2012/Problem13_label00.c[5434,5447] [2024-11-09 19:30:18,926 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-09 19:30:18,955 INFO L204 MainTranslator]: Completed translation [2024-11-09 19:30:18,955 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 07:30:18 WrapperNode [2024-11-09 19:30:18,955 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-09 19:30:18,956 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-09 19:30:18,957 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-09 19:30:18,957 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-09 19:30:18,964 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:30:18" (1/1) ... [2024-11-09 19:30:19,037 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:30:18" (1/1) ... [2024-11-09 19:30:19,450 INFO L138 Inliner]: procedures = 17, calls = 11, calls flagged for inlining = 6, calls inlined = 6, statements flattened = 5586 [2024-11-09 19:30:19,451 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-09 19:30:19,452 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-09 19:30:19,452 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-09 19:30:19,452 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-09 19:30:19,463 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 07:30:18" (1/1) ... [2024-11-09 19:30:19,464 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 07:30:18" (1/1) ... [2024-11-09 19:30:19,794 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 07:30:18" (1/1) ... [2024-11-09 19:30:20,024 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:30:20,025 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 07:30:18" (1/1) ... [2024-11-09 19:30:20,025 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 07:30:18" (1/1) ... [2024-11-09 19:30:20,420 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 07:30:18" (1/1) ... [2024-11-09 19:30:20,445 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 07:30:18" (1/1) ... [2024-11-09 19:30:20,474 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 07:30:18" (1/1) ... [2024-11-09 19:30:20,494 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 07:30:18" (1/1) ... [2024-11-09 19:30:20,555 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-09 19:30:20,556 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2024-11-09 19:30:20,556 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2024-11-09 19:30:20,557 INFO L274 PluginConnector]: IcfgBuilder initialized [2024-11-09 19:30:20,558 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 07:30:18" (1/1) ... [2024-11-09 19:30:20,564 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-09 19:30:20,578 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 19:30:20,596 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:30:20,601 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:30:20,651 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-09 19:30:20,652 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-11-09 19:30:20,652 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-09 19:30:20,652 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-09 19:30:20,734 INFO L256 CfgBuilder]: Building ICFG [2024-11-09 19:30:20,737 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-09 19:30:27,174 INFO L1247 $ProcedureCfgBuilder]: dead code at ProgramPoint L1894: havoc calculate_output_#t~ret9#1; [2024-11-09 19:30:27,175 INFO L1247 $ProcedureCfgBuilder]: dead code at ProgramPoint L3629: havoc calculate_output2_#t~ret10#1; [2024-11-09 19:30:27,175 INFO L1247 $ProcedureCfgBuilder]: dead code at ProgramPoint L5351: havoc calculate_output3_#t~ret11#1; [2024-11-09 19:30:27,490 INFO L? ?]: Removed 2111 outVars from TransFormulas that were not future-live. [2024-11-09 19:30:27,490 INFO L307 CfgBuilder]: Performing block encoding [2024-11-09 19:30:27,537 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-09 19:30:27,538 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2024-11-09 19:30:27,538 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 09.11 07:30:27 BoogieIcfgContainer [2024-11-09 19:30:27,538 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2024-11-09 19:30:27,540 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-09 19:30:27,540 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-09 19:30:27,548 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-09 19:30:27,549 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 09.11 07:30:16" (1/3) ... [2024-11-09 19:30:27,551 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@467a2a11 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.11 07:30:27, skipping insertion in model container [2024-11-09 19:30:27,551 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 07:30:18" (2/3) ... [2024-11-09 19:30:27,553 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@467a2a11 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.11 07:30:27, skipping insertion in model container [2024-11-09 19:30:27,553 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 09.11 07:30:27" (3/3) ... [2024-11-09 19:30:27,555 INFO L112 eAbstractionObserver]: Analyzing ICFG Problem13_label00.c [2024-11-09 19:30:27,574 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-09 19:30:27,575 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-11-09 19:30:27,672 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-09 19:30:27,680 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;@1caebc98, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-09 19:30:27,681 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-09 19:30:27,694 INFO L276 IsEmpty]: Start isEmpty. Operand has 1101 states, 1099 states have (on average 2.4767970882620562) internal successors, (2722), 1100 states have internal predecessors, (2722), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 19:30:27,702 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2024-11-09 19:30:27,702 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 19:30:27,703 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 19:30:27,703 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 19:30:27,708 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 19:30:27,708 INFO L85 PathProgramCache]: Analyzing trace with hash -821543221, now seen corresponding path program 1 times [2024-11-09 19:30:27,717 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 19:30:27,717 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [103925092] [2024-11-09 19:30:27,718 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 19:30:27,718 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 19:30:27,864 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 19:30:28,271 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:30:28,271 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 19:30:28,272 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [103925092] [2024-11-09 19:30:28,272 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [103925092] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 19:30:28,273 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 19:30:28,273 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-09 19:30:28,274 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [120528470] [2024-11-09 19:30:28,275 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 19:30:28,280 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-09 19:30:28,280 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 19:30:28,302 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-09 19:30:28,303 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-09 19:30:28,308 INFO L87 Difference]: Start difference. First operand has 1101 states, 1099 states have (on average 2.4767970882620562) internal successors, (2722), 1100 states have internal predecessors, (2722), 0 states have call successors, (0), 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 4 states, 4 states have (on average 9.75) internal successors, (39), 3 states have internal predecessors, (39), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 19:30:36,855 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 19:30:36,856 INFO L93 Difference]: Finished difference Result 3836 states and 10077 transitions. [2024-11-09 19:30:36,857 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-09 19:30:36,858 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 9.75) internal successors, (39), 3 states have internal predecessors, (39), 0 states have call successors, (0), 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 39 [2024-11-09 19:30:36,858 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 19:30:36,889 INFO L225 Difference]: With dead ends: 3836 [2024-11-09 19:30:36,889 INFO L226 Difference]: Without dead ends: 2668 [2024-11-09 19:30:36,894 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-09 19:30:36,897 INFO L432 NwaCegarLoop]: 761 mSDtfsCounter, 4869 mSDsluCounter, 308 mSDsCounter, 0 mSdLazyCounter, 6394 mSolverCounterSat, 1607 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 6.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4869 SdHoareTripleChecker+Valid, 1069 SdHoareTripleChecker+Invalid, 8001 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 1607 IncrementalHoareTripleChecker+Valid, 6394 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 8.2s IncrementalHoareTripleChecker+Time [2024-11-09 19:30:36,898 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [4869 Valid, 1069 Invalid, 8001 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [1607 Valid, 6394 Invalid, 0 Unknown, 0 Unchecked, 8.2s Time] [2024-11-09 19:30:36,921 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2668 states. [2024-11-09 19:30:37,038 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2668 to 2667. [2024-11-09 19:30:37,046 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2667 states, 2666 states have (on average 2.265941485371343) internal successors, (6041), 2666 states have internal predecessors, (6041), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 19:30:37,055 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2667 states to 2667 states and 6041 transitions. [2024-11-09 19:30:37,057 INFO L78 Accepts]: Start accepts. Automaton has 2667 states and 6041 transitions. Word has length 39 [2024-11-09 19:30:37,058 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 19:30:37,058 INFO L471 AbstractCegarLoop]: Abstraction has 2667 states and 6041 transitions. [2024-11-09 19:30:37,059 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 9.75) internal successors, (39), 3 states have internal predecessors, (39), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 19:30:37,059 INFO L276 IsEmpty]: Start isEmpty. Operand 2667 states and 6041 transitions. [2024-11-09 19:30:37,068 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 166 [2024-11-09 19:30:37,070 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 19:30:37,070 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, 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-09 19:30:37,071 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-09 19:30:37,074 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 19:30:37,074 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 19:30:37,074 INFO L85 PathProgramCache]: Analyzing trace with hash 1857253497, now seen corresponding path program 1 times [2024-11-09 19:30:37,075 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 19:30:37,075 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1627280539] [2024-11-09 19:30:37,075 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 19:30:37,075 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 19:30:37,139 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 19:30:37,467 INFO L134 CoverageAnalysis]: Checked inductivity of 35 backedges. 35 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 19:30:37,468 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 19:30:37,468 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1627280539] [2024-11-09 19:30:37,468 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1627280539] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 19:30:37,468 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 19:30:37,469 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-09 19:30:37,469 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [704050473] [2024-11-09 19:30:37,470 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 19:30:37,471 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-09 19:30:37,473 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 19:30:37,475 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-09 19:30:37,475 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-11-09 19:30:37,476 INFO L87 Difference]: Start difference. First operand 2667 states and 6041 transitions. Second operand has 4 states, 4 states have (on average 41.25) internal successors, (165), 3 states have internal predecessors, (165), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 19:30:46,243 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 19:30:46,244 INFO L93 Difference]: Finished difference Result 7878 states and 19126 transitions. [2024-11-09 19:30:46,244 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-09 19:30:46,245 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 41.25) internal successors, (165), 3 states have internal predecessors, (165), 0 states have call successors, (0), 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 165 [2024-11-09 19:30:46,245 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 19:30:46,272 INFO L225 Difference]: With dead ends: 7878 [2024-11-09 19:30:46,273 INFO L226 Difference]: Without dead ends: 6001 [2024-11-09 19:30:46,278 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:30:46,279 INFO L432 NwaCegarLoop]: 896 mSDtfsCounter, 3076 mSDsluCounter, 300 mSDsCounter, 0 mSdLazyCounter, 9199 mSolverCounterSat, 829 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 7.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3076 SdHoareTripleChecker+Valid, 1196 SdHoareTripleChecker+Invalid, 10028 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 829 IncrementalHoareTripleChecker+Valid, 9199 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 8.6s IncrementalHoareTripleChecker+Time [2024-11-09 19:30:46,280 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [3076 Valid, 1196 Invalid, 10028 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [829 Valid, 9199 Invalid, 0 Unknown, 0 Unchecked, 8.6s Time] [2024-11-09 19:30:46,288 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6001 states. [2024-11-09 19:30:46,373 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6001 to 5867. [2024-11-09 19:30:46,384 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5867 states, 5866 states have (on average 2.299181725196045) internal successors, (13487), 5866 states have internal predecessors, (13487), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 19:30:46,398 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5867 states to 5867 states and 13487 transitions. [2024-11-09 19:30:46,399 INFO L78 Accepts]: Start accepts. Automaton has 5867 states and 13487 transitions. Word has length 165 [2024-11-09 19:30:46,401 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 19:30:46,401 INFO L471 AbstractCegarLoop]: Abstraction has 5867 states and 13487 transitions. [2024-11-09 19:30:46,401 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 41.25) internal successors, (165), 3 states have internal predecessors, (165), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 19:30:46,402 INFO L276 IsEmpty]: Start isEmpty. Operand 5867 states and 13487 transitions. [2024-11-09 19:30:46,404 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 209 [2024-11-09 19:30:46,404 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 19:30:46,405 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, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 19:30:46,405 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-09 19:30:46,405 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 19:30:46,406 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 19:30:46,406 INFO L85 PathProgramCache]: Analyzing trace with hash -39510184, now seen corresponding path program 1 times [2024-11-09 19:30:46,406 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 19:30:46,406 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1387789674] [2024-11-09 19:30:46,406 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 19:30:46,407 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 19:30:46,462 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 19:30:46,662 INFO L134 CoverageAnalysis]: Checked inductivity of 142 backedges. 71 proven. 0 refuted. 0 times theorem prover too weak. 71 trivial. 0 not checked. [2024-11-09 19:30:46,663 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 19:30:46,663 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1387789674] [2024-11-09 19:30:46,663 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1387789674] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 19:30:46,663 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 19:30:46,663 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-09 19:30:46,664 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [204883017] [2024-11-09 19:30:46,664 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 19:30:46,664 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-09 19:30:46,665 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 19:30:46,665 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-09 19:30:46,665 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-09 19:30:46,666 INFO L87 Difference]: Start difference. First operand 5867 states and 13487 transitions. Second operand has 3 states, 3 states have (on average 46.0) internal successors, (138), 2 states have internal predecessors, (138), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 19:30:50,927 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 19:30:50,928 INFO L93 Difference]: Finished difference Result 15706 states and 37017 transitions. [2024-11-09 19:30:50,928 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-09 19:30:50,929 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 46.0) internal successors, (138), 2 states have internal predecessors, (138), 0 states have call successors, (0), 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 208 [2024-11-09 19:30:50,929 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 19:30:50,973 INFO L225 Difference]: With dead ends: 15706 [2024-11-09 19:30:50,974 INFO L226 Difference]: Without dead ends: 10629 [2024-11-09 19:30:50,983 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:30:50,985 INFO L432 NwaCegarLoop]: 788 mSDtfsCounter, 1635 mSDsluCounter, 133 mSDsCounter, 0 mSdLazyCounter, 3985 mSolverCounterSat, 757 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1635 SdHoareTripleChecker+Valid, 921 SdHoareTripleChecker+Invalid, 4742 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 757 IncrementalHoareTripleChecker+Valid, 3985 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.1s IncrementalHoareTripleChecker+Time [2024-11-09 19:30:50,985 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1635 Valid, 921 Invalid, 4742 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [757 Valid, 3985 Invalid, 0 Unknown, 0 Unchecked, 4.1s Time] [2024-11-09 19:30:50,998 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10629 states. [2024-11-09 19:30:51,156 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10629 to 10622. [2024-11-09 19:30:51,177 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10622 states, 10621 states have (on average 2.2312399962338763) internal successors, (23698), 10621 states have internal predecessors, (23698), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 19:30:51,207 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10622 states to 10622 states and 23698 transitions. [2024-11-09 19:30:51,208 INFO L78 Accepts]: Start accepts. Automaton has 10622 states and 23698 transitions. Word has length 208 [2024-11-09 19:30:51,208 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 19:30:51,209 INFO L471 AbstractCegarLoop]: Abstraction has 10622 states and 23698 transitions. [2024-11-09 19:30:51,209 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 46.0) internal successors, (138), 2 states have internal predecessors, (138), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 19:30:51,209 INFO L276 IsEmpty]: Start isEmpty. Operand 10622 states and 23698 transitions. [2024-11-09 19:30:51,214 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 223 [2024-11-09 19:30:51,214 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 19:30:51,215 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, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 19:30:51,215 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-11-09 19:30:51,215 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 19:30:51,216 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 19:30:51,216 INFO L85 PathProgramCache]: Analyzing trace with hash -403873178, now seen corresponding path program 1 times [2024-11-09 19:30:51,216 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 19:30:51,216 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [479061966] [2024-11-09 19:30:51,216 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 19:30:51,217 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 19:30:51,303 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 19:30:51,646 INFO L134 CoverageAnalysis]: Checked inductivity of 156 backedges. 156 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 19:30:51,646 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 19:30:51,646 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [479061966] [2024-11-09 19:30:51,647 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [479061966] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 19:30:51,647 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 19:30:51,647 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-09 19:30:51,648 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [964495454] [2024-11-09 19:30:51,648 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 19:30:51,649 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-09 19:30:51,650 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 19:30:51,650 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-09 19:30:51,651 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-11-09 19:30:51,651 INFO L87 Difference]: Start difference. First operand 10622 states and 23698 transitions. Second operand has 4 states, 4 states have (on average 55.5) internal successors, (222), 3 states have internal predecessors, (222), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 19:30:59,252 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 19:30:59,252 INFO L93 Difference]: Finished difference Result 26976 states and 61554 transitions. [2024-11-09 19:30:59,253 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-09 19:30:59,253 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 55.5) internal successors, (222), 3 states have internal predecessors, (222), 0 states have call successors, (0), 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 222 [2024-11-09 19:30:59,254 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 19:30:59,299 INFO L225 Difference]: With dead ends: 26976 [2024-11-09 19:30:59,299 INFO L226 Difference]: Without dead ends: 17144 [2024-11-09 19:30:59,311 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:30:59,313 INFO L432 NwaCegarLoop]: 597 mSDtfsCounter, 3219 mSDsluCounter, 208 mSDsCounter, 0 mSdLazyCounter, 8796 mSolverCounterSat, 1204 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 6.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3219 SdHoareTripleChecker+Valid, 805 SdHoareTripleChecker+Invalid, 10000 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1204 IncrementalHoareTripleChecker+Valid, 8796 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 7.3s IncrementalHoareTripleChecker+Time [2024-11-09 19:30:59,314 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [3219 Valid, 805 Invalid, 10000 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1204 Valid, 8796 Invalid, 0 Unknown, 0 Unchecked, 7.3s Time] [2024-11-09 19:30:59,330 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17144 states. [2024-11-09 19:30:59,575 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17144 to 17024. [2024-11-09 19:30:59,608 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 17024 states, 17023 states have (on average 2.2461963226223345) internal successors, (38237), 17023 states have internal predecessors, (38237), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 19:30:59,639 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17024 states to 17024 states and 38237 transitions. [2024-11-09 19:30:59,640 INFO L78 Accepts]: Start accepts. Automaton has 17024 states and 38237 transitions. Word has length 222 [2024-11-09 19:30:59,641 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 19:30:59,641 INFO L471 AbstractCegarLoop]: Abstraction has 17024 states and 38237 transitions. [2024-11-09 19:30:59,642 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 55.5) internal successors, (222), 3 states have internal predecessors, (222), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 19:30:59,642 INFO L276 IsEmpty]: Start isEmpty. Operand 17024 states and 38237 transitions. [2024-11-09 19:30:59,645 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 235 [2024-11-09 19:30:59,645 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 19:30:59,645 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, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 19:30:59,646 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-11-09 19:30:59,646 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 19:30:59,647 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 19:30:59,647 INFO L85 PathProgramCache]: Analyzing trace with hash 1833296622, now seen corresponding path program 1 times [2024-11-09 19:30:59,647 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 19:30:59,648 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1546040828] [2024-11-09 19:30:59,648 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 19:30:59,648 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 19:30:59,691 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 19:30:59,891 INFO L134 CoverageAnalysis]: Checked inductivity of 139 backedges. 71 proven. 0 refuted. 0 times theorem prover too weak. 68 trivial. 0 not checked. [2024-11-09 19:30:59,891 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 19:30:59,892 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1546040828] [2024-11-09 19:30:59,892 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1546040828] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 19:30:59,893 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 19:30:59,894 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-09 19:30:59,894 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1443416638] [2024-11-09 19:30:59,894 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 19:30:59,894 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-09 19:30:59,895 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 19:30:59,895 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-09 19:30:59,895 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-09 19:30:59,895 INFO L87 Difference]: Start difference. First operand 17024 states and 38237 transitions. Second operand has 3 states, 3 states have (on average 55.666666666666664) internal successors, (167), 2 states have internal predecessors, (167), 0 states have call successors, (0), 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:31:04,283 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 19:31:04,283 INFO L93 Difference]: Finished difference Result 48229 states and 109355 transitions. [2024-11-09 19:31:04,284 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-09 19:31:04,284 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 55.666666666666664) internal successors, (167), 2 states have internal predecessors, (167), 0 states have call successors, (0), 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 234 [2024-11-09 19:31:04,285 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 19:31:04,355 INFO L225 Difference]: With dead ends: 48229 [2024-11-09 19:31:04,355 INFO L226 Difference]: Without dead ends: 31995 [2024-11-09 19:31:04,373 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:31:04,374 INFO L432 NwaCegarLoop]: 936 mSDtfsCounter, 1545 mSDsluCounter, 147 mSDsCounter, 0 mSdLazyCounter, 3805 mSolverCounterSat, 869 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1545 SdHoareTripleChecker+Valid, 1083 SdHoareTripleChecker+Invalid, 4674 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 869 IncrementalHoareTripleChecker+Valid, 3805 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.1s IncrementalHoareTripleChecker+Time [2024-11-09 19:31:04,374 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1545 Valid, 1083 Invalid, 4674 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [869 Valid, 3805 Invalid, 0 Unknown, 0 Unchecked, 4.1s Time] [2024-11-09 19:31:04,401 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31995 states. [2024-11-09 19:31:04,744 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31995 to 30413. [2024-11-09 19:31:04,789 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 30413 states, 30412 states have (on average 2.1548401946600024) internal successors, (65533), 30412 states have internal predecessors, (65533), 0 states have call successors, (0), 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:31:04,840 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30413 states to 30413 states and 65533 transitions. [2024-11-09 19:31:04,841 INFO L78 Accepts]: Start accepts. Automaton has 30413 states and 65533 transitions. Word has length 234 [2024-11-09 19:31:04,841 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 19:31:04,841 INFO L471 AbstractCegarLoop]: Abstraction has 30413 states and 65533 transitions. [2024-11-09 19:31:04,842 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 55.666666666666664) internal successors, (167), 2 states have internal predecessors, (167), 0 states have call successors, (0), 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:31:04,842 INFO L276 IsEmpty]: Start isEmpty. Operand 30413 states and 65533 transitions. [2024-11-09 19:31:04,844 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 249 [2024-11-09 19:31:04,844 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 19:31:04,844 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, 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, 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:31:04,844 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-11-09 19:31:04,845 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 19:31:04,845 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 19:31:04,845 INFO L85 PathProgramCache]: Analyzing trace with hash 522535926, now seen corresponding path program 1 times [2024-11-09 19:31:04,845 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 19:31:04,845 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [747355394] [2024-11-09 19:31:04,846 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 19:31:04,846 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 19:31:04,888 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 19:31:05,168 INFO L134 CoverageAnalysis]: Checked inductivity of 167 backedges. 167 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 19:31:05,168 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 19:31:05,168 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [747355394] [2024-11-09 19:31:05,168 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [747355394] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 19:31:05,169 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 19:31:05,169 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-09 19:31:05,169 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1192984681] [2024-11-09 19:31:05,169 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 19:31:05,169 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-09 19:31:05,170 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 19:31:05,170 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-09 19:31:05,170 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-09 19:31:05,171 INFO L87 Difference]: Start difference. First operand 30413 states and 65533 transitions. Second operand has 3 states, 3 states have (on average 82.66666666666667) internal successors, (248), 3 states have internal predecessors, (248), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 19:31:09,894 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 19:31:09,894 INFO L93 Difference]: Finished difference Result 89209 states and 192995 transitions. [2024-11-09 19:31:09,895 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-09 19:31:09,895 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 82.66666666666667) internal successors, (248), 3 states have internal predecessors, (248), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 248 [2024-11-09 19:31:09,895 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 19:31:10,001 INFO L225 Difference]: With dead ends: 89209 [2024-11-09 19:31:10,002 INFO L226 Difference]: Without dead ends: 59586 [2024-11-09 19:31:10,041 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:31:10,042 INFO L432 NwaCegarLoop]: 897 mSDtfsCounter, 1536 mSDsluCounter, 117 mSDsCounter, 0 mSdLazyCounter, 3858 mSolverCounterSat, 897 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1536 SdHoareTripleChecker+Valid, 1014 SdHoareTripleChecker+Invalid, 4755 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 897 IncrementalHoareTripleChecker+Valid, 3858 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.2s IncrementalHoareTripleChecker+Time [2024-11-09 19:31:10,042 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1536 Valid, 1014 Invalid, 4755 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [897 Valid, 3858 Invalid, 0 Unknown, 0 Unchecked, 4.2s Time] [2024-11-09 19:31:10,095 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 59586 states. [2024-11-09 19:31:11,042 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 59586 to 59575. [2024-11-09 19:31:11,104 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 59575 states, 59574 states have (on average 2.0971061201195154) internal successors, (124933), 59574 states have internal predecessors, (124933), 0 states have call successors, (0), 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:31:11,256 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 59575 states to 59575 states and 124933 transitions. [2024-11-09 19:31:11,256 INFO L78 Accepts]: Start accepts. Automaton has 59575 states and 124933 transitions. Word has length 248 [2024-11-09 19:31:11,257 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 19:31:11,257 INFO L471 AbstractCegarLoop]: Abstraction has 59575 states and 124933 transitions. [2024-11-09 19:31:11,257 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 82.66666666666667) internal successors, (248), 3 states have internal predecessors, (248), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 19:31:11,258 INFO L276 IsEmpty]: Start isEmpty. Operand 59575 states and 124933 transitions. [2024-11-09 19:31:11,265 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 326 [2024-11-09 19:31:11,265 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 19:31:11,266 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, 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, 2, 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] [2024-11-09 19:31:11,266 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-11-09 19:31:11,266 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 19:31:11,266 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 19:31:11,267 INFO L85 PathProgramCache]: Analyzing trace with hash -63529757, now seen corresponding path program 1 times [2024-11-09 19:31:11,267 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 19:31:11,267 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [73946703] [2024-11-09 19:31:11,267 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 19:31:11,267 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 19:31:11,324 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 19:31:12,512 INFO L134 CoverageAnalysis]: Checked inductivity of 346 backedges. 284 proven. 26 refuted. 0 times theorem prover too weak. 36 trivial. 0 not checked. [2024-11-09 19:31:12,512 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 19:31:12,512 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [73946703] [2024-11-09 19:31:12,513 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [73946703] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-09 19:31:12,513 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1786840338] [2024-11-09 19:31:12,513 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 19:31:12,513 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 19:31:12,513 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 19:31:12,515 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:31:12,517 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:31:12,695 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 19:31:12,698 INFO L255 TraceCheckSpWp]: Trace formula consists of 459 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-11-09 19:31:12,711 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 19:31:12,856 INFO L134 CoverageAnalysis]: Checked inductivity of 346 backedges. 250 proven. 0 refuted. 0 times theorem prover too weak. 96 trivial. 0 not checked. [2024-11-09 19:31:12,856 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-09 19:31:12,856 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1786840338] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 19:31:12,856 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-09 19:31:12,857 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [4] total 6 [2024-11-09 19:31:12,857 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [657739186] [2024-11-09 19:31:12,857 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 19:31:12,861 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-09 19:31:12,861 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 19:31:12,862 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-09 19:31:12,862 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-11-09 19:31:12,862 INFO L87 Difference]: Start difference. First operand 59575 states and 124933 transitions. Second operand has 3 states, 3 states have (on average 76.66666666666667) internal successors, (230), 3 states have internal predecessors, (230), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 19:31:16,990 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 19:31:16,990 INFO L93 Difference]: Finished difference Result 118358 states and 248354 transitions. [2024-11-09 19:31:16,992 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-09 19:31:16,992 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 76.66666666666667) internal successors, (230), 3 states have internal predecessors, (230), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 325 [2024-11-09 19:31:16,993 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 19:31:17,073 INFO L225 Difference]: With dead ends: 118358 [2024-11-09 19:31:17,073 INFO L226 Difference]: Without dead ends: 59573 [2024-11-09 19:31:17,105 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 328 GetRequests, 324 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-11-09 19:31:17,105 INFO L432 NwaCegarLoop]: 2081 mSDtfsCounter, 1854 mSDsluCounter, 84 mSDsCounter, 0 mSdLazyCounter, 3899 mSolverCounterSat, 451 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1854 SdHoareTripleChecker+Valid, 2165 SdHoareTripleChecker+Invalid, 4350 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 451 IncrementalHoareTripleChecker+Valid, 3899 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.6s IncrementalHoareTripleChecker+Time [2024-11-09 19:31:17,105 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1854 Valid, 2165 Invalid, 4350 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [451 Valid, 3899 Invalid, 0 Unknown, 0 Unchecked, 3.6s Time] [2024-11-09 19:31:17,154 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 59573 states. [2024-11-09 19:31:18,052 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 59573 to 59572. [2024-11-09 19:31:18,107 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 59572 states, 59571 states have (on average 2.0535999059945276) internal successors, (122335), 59571 states have internal predecessors, (122335), 0 states have call successors, (0), 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:31:18,230 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 59572 states to 59572 states and 122335 transitions. [2024-11-09 19:31:18,231 INFO L78 Accepts]: Start accepts. Automaton has 59572 states and 122335 transitions. Word has length 325 [2024-11-09 19:31:18,232 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 19:31:18,232 INFO L471 AbstractCegarLoop]: Abstraction has 59572 states and 122335 transitions. [2024-11-09 19:31:18,232 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 76.66666666666667) internal successors, (230), 3 states have internal predecessors, (230), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 19:31:18,233 INFO L276 IsEmpty]: Start isEmpty. Operand 59572 states and 122335 transitions. [2024-11-09 19:31:18,238 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 329 [2024-11-09 19:31:18,238 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 19:31:18,238 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, 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, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 19:31:18,260 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:31:18,439 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 19:31:18,440 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 19:31:18,440 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 19:31:18,440 INFO L85 PathProgramCache]: Analyzing trace with hash 1231548079, now seen corresponding path program 1 times [2024-11-09 19:31:18,440 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 19:31:18,441 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [10027693] [2024-11-09 19:31:18,441 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 19:31:18,441 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 19:31:18,518 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 19:31:19,006 INFO L134 CoverageAnalysis]: Checked inductivity of 382 backedges. 293 proven. 0 refuted. 0 times theorem prover too weak. 89 trivial. 0 not checked. [2024-11-09 19:31:19,010 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 19:31:19,010 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [10027693] [2024-11-09 19:31:19,010 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [10027693] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 19:31:19,011 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 19:31:19,011 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-09 19:31:19,011 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [60393771] [2024-11-09 19:31:19,011 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 19:31:19,011 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-09 19:31:19,011 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 19:31:19,012 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-09 19:31:19,012 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-09 19:31:19,013 INFO L87 Difference]: Start difference. First operand 59572 states and 122335 transitions. Second operand has 3 states, 3 states have (on average 80.0) internal successors, (240), 3 states have internal predecessors, (240), 0 states have call successors, (0), 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:31:23,835 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 19:31:23,835 INFO L93 Difference]: Finished difference Result 118359 states and 243172 transitions. [2024-11-09 19:31:23,836 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-09 19:31:23,836 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 80.0) internal successors, (240), 3 states have internal predecessors, (240), 0 states have call successors, (0), 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 328 [2024-11-09 19:31:23,836 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 19:31:24,130 INFO L225 Difference]: With dead ends: 118359 [2024-11-09 19:31:24,130 INFO L226 Difference]: Without dead ends: 59577 [2024-11-09 19:31:24,187 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:31:24,189 INFO L432 NwaCegarLoop]: 2121 mSDtfsCounter, 1655 mSDsluCounter, 95 mSDsCounter, 0 mSdLazyCounter, 3926 mSolverCounterSat, 615 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1655 SdHoareTripleChecker+Valid, 2216 SdHoareTripleChecker+Invalid, 4541 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 615 IncrementalHoareTripleChecker+Valid, 3926 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.4s IncrementalHoareTripleChecker+Time [2024-11-09 19:31:24,189 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1655 Valid, 2216 Invalid, 4541 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [615 Valid, 3926 Invalid, 0 Unknown, 0 Unchecked, 4.4s Time] [2024-11-09 19:31:24,232 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 59577 states. [2024-11-09 19:31:25,061 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 59577 to 57200. [2024-11-09 19:31:25,101 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 57200 states, 57199 states have (on average 2.022850049826046) internal successors, (115705), 57199 states have internal predecessors, (115705), 0 states have call successors, (0), 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:31:25,201 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 57200 states to 57200 states and 115705 transitions. [2024-11-09 19:31:25,202 INFO L78 Accepts]: Start accepts. Automaton has 57200 states and 115705 transitions. Word has length 328 [2024-11-09 19:31:25,202 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 19:31:25,202 INFO L471 AbstractCegarLoop]: Abstraction has 57200 states and 115705 transitions. [2024-11-09 19:31:25,203 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 80.0) internal successors, (240), 3 states have internal predecessors, (240), 0 states have call successors, (0), 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:31:25,203 INFO L276 IsEmpty]: Start isEmpty. Operand 57200 states and 115705 transitions. [2024-11-09 19:31:25,207 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 339 [2024-11-09 19:31:25,207 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 19:31:25,207 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, 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, 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-09 19:31:25,208 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-11-09 19:31:25,208 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 19:31:25,208 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 19:31:25,209 INFO L85 PathProgramCache]: Analyzing trace with hash 431850959, now seen corresponding path program 1 times [2024-11-09 19:31:25,209 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 19:31:25,209 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2139203229] [2024-11-09 19:31:25,209 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 19:31:25,209 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 19:31:25,261 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 19:31:25,858 INFO L134 CoverageAnalysis]: Checked inductivity of 382 backedges. 293 proven. 0 refuted. 0 times theorem prover too weak. 89 trivial. 0 not checked. [2024-11-09 19:31:25,860 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 19:31:25,860 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2139203229] [2024-11-09 19:31:25,860 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2139203229] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 19:31:25,860 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 19:31:25,860 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-09 19:31:25,860 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [87995665] [2024-11-09 19:31:25,861 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 19:31:25,861 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-09 19:31:25,861 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 19:31:25,862 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-09 19:31:25,862 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-09 19:31:25,864 INFO L87 Difference]: Start difference. First operand 57200 states and 115705 transitions. Second operand has 3 states, 3 states have (on average 83.33333333333333) internal successors, (250), 3 states have internal predecessors, (250), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 19:31:30,573 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 19:31:30,573 INFO L93 Difference]: Finished difference Result 134114 states and 272142 transitions. [2024-11-09 19:31:30,574 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-09 19:31:30,574 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 83.33333333333333) internal successors, (250), 3 states have internal predecessors, (250), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 338 [2024-11-09 19:31:30,574 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 19:31:30,682 INFO L225 Difference]: With dead ends: 134114 [2024-11-09 19:31:30,683 INFO L226 Difference]: Without dead ends: 77704 [2024-11-09 19:31:30,705 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:31:30,706 INFO L432 NwaCegarLoop]: 775 mSDtfsCounter, 1628 mSDsluCounter, 83 mSDsCounter, 0 mSdLazyCounter, 3832 mSolverCounterSat, 788 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1628 SdHoareTripleChecker+Valid, 858 SdHoareTripleChecker+Invalid, 4620 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 788 IncrementalHoareTripleChecker+Valid, 3832 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.1s IncrementalHoareTripleChecker+Time [2024-11-09 19:31:30,706 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1628 Valid, 858 Invalid, 4620 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [788 Valid, 3832 Invalid, 0 Unknown, 0 Unchecked, 4.1s Time] [2024-11-09 19:31:30,765 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 77704 states. [2024-11-09 19:31:31,851 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 77704 to 77687. [2024-11-09 19:31:31,906 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 77687 states, 77686 states have (on average 2.012833715212522) internal successors, (156369), 77686 states have internal predecessors, (156369), 0 states have call successors, (0), 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:31:32,019 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 77687 states to 77687 states and 156369 transitions. [2024-11-09 19:31:32,020 INFO L78 Accepts]: Start accepts. Automaton has 77687 states and 156369 transitions. Word has length 338 [2024-11-09 19:31:32,021 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 19:31:32,021 INFO L471 AbstractCegarLoop]: Abstraction has 77687 states and 156369 transitions. [2024-11-09 19:31:32,021 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 83.33333333333333) internal successors, (250), 3 states have internal predecessors, (250), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 19:31:32,021 INFO L276 IsEmpty]: Start isEmpty. Operand 77687 states and 156369 transitions. [2024-11-09 19:31:32,026 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 370 [2024-11-09 19:31:32,026 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 19:31:32,027 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, 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, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 19:31:32,027 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-11-09 19:31:32,027 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 19:31:32,028 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 19:31:32,028 INFO L85 PathProgramCache]: Analyzing trace with hash -1260839151, now seen corresponding path program 1 times [2024-11-09 19:31:32,028 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 19:31:32,028 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [679096421] [2024-11-09 19:31:32,028 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 19:31:32,028 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 19:31:32,118 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat