./Ultimate.py --spec /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/properties/unreach-call.prp --file /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/eca-rers2012/Problem13_label48.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 61a67961 Calling Ultimate with: /root/.sdkman/candidates/java/current/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/eca-rers2012/Problem13_label48.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 c03a342c0e8f0bfba399e237ba210df18813842785480d8c5bf35ca28242fc9f --- Real Ultimate output --- This is Ultimate 0.2.5-wip.fs.cvc5-61a6796-m [2024-10-13 23:40:14,466 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-13 23:40:14,549 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-10-13 23:40:14,556 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-13 23:40:14,557 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-13 23:40:14,581 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-13 23:40:14,582 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-13 23:40:14,582 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-13 23:40:14,583 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-10-13 23:40:14,583 INFO L153 SettingsManager]: * Use memory slicer=true [2024-10-13 23:40:14,584 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-10-13 23:40:14,584 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-10-13 23:40:14,584 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-13 23:40:14,585 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-13 23:40:14,586 INFO L153 SettingsManager]: * Use SBE=true [2024-10-13 23:40:14,587 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-13 23:40:14,587 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-10-13 23:40:14,587 INFO L153 SettingsManager]: * sizeof long=4 [2024-10-13 23:40:14,588 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-10-13 23:40:14,588 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-10-13 23:40:14,588 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-13 23:40:14,592 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-10-13 23:40:14,592 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-10-13 23:40:14,593 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-10-13 23:40:14,593 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-13 23:40:14,593 INFO L153 SettingsManager]: * sizeof long double=12 [2024-10-13 23:40:14,593 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-10-13 23:40:14,593 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-13 23:40:14,594 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-13 23:40:14,594 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-13 23:40:14,594 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-10-13 23:40:14,594 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-10-13 23:40:14,595 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-13 23:40:14,595 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-13 23:40:14,595 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-10-13 23:40:14,595 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-10-13 23:40:14,596 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-10-13 23:40:14,596 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-10-13 23:40:14,597 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-10-13 23:40:14,598 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-10-13 23:40:14,598 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-10-13 23:40:14,599 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-10-13 23:40:14,599 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 -> c03a342c0e8f0bfba399e237ba210df18813842785480d8c5bf35ca28242fc9f [2024-10-13 23:40:14,833 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-13 23:40:14,858 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-13 23:40:14,862 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-13 23:40:14,863 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-13 23:40:14,864 INFO L274 PluginConnector]: CDTParser initialized [2024-10-13 23:40:14,865 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/eca-rers2012/Problem13_label48.c [2024-10-13 23:40:16,367 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-13 23:40:16,827 INFO L384 CDTParser]: Found 1 translation units. [2024-10-13 23:40:16,829 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/eca-rers2012/Problem13_label48.c [2024-10-13 23:40:16,873 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/02eda500c/281991aec3d94bde9a5fb0c68aff5302/FLAGee539c005 [2024-10-13 23:40:16,892 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/02eda500c/281991aec3d94bde9a5fb0c68aff5302 [2024-10-13 23:40:16,895 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-13 23:40:16,896 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-13 23:40:16,898 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-13 23:40:16,899 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-13 23:40:16,905 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-13 23:40:16,906 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.10 11:40:16" (1/1) ... [2024-10-13 23:40:16,908 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@36fc5d82 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 11:40:16, skipping insertion in model container [2024-10-13 23:40:16,908 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.10 11:40:16" (1/1) ... [2024-10-13 23:40:17,027 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-13 23:40:17,264 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/eca-rers2012/Problem13_label48.c[1234,1247] [2024-10-13 23:40:18,177 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-13 23:40:18,187 INFO L200 MainTranslator]: Completed pre-run [2024-10-13 23:40:18,204 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/eca-rers2012/Problem13_label48.c[1234,1247] [2024-10-13 23:40:18,709 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-13 23:40:18,738 INFO L204 MainTranslator]: Completed translation [2024-10-13 23:40:18,738 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 11:40:18 WrapperNode [2024-10-13 23:40:18,739 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-13 23:40:18,740 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-10-13 23:40:18,740 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-10-13 23:40:18,741 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-10-13 23:40:18,747 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 11:40:18" (1/1) ... [2024-10-13 23:40:18,816 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 11:40:18" (1/1) ... [2024-10-13 23:40:19,416 INFO L138 Inliner]: procedures = 17, calls = 11, calls flagged for inlining = 6, calls inlined = 6, statements flattened = 5587 [2024-10-13 23:40:19,417 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-10-13 23:40:19,417 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-10-13 23:40:19,417 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-10-13 23:40:19,418 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-10-13 23:40:19,428 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 11:40:18" (1/1) ... [2024-10-13 23:40:19,429 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 11:40:18" (1/1) ... [2024-10-13 23:40:19,589 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 11:40:18" (1/1) ... [2024-10-13 23:40:19,940 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2024-10-13 23:40:19,941 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 11:40:18" (1/1) ... [2024-10-13 23:40:19,941 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 11:40:18" (1/1) ... [2024-10-13 23:40:20,149 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 11:40:18" (1/1) ... [2024-10-13 23:40:20,182 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 11:40:18" (1/1) ... [2024-10-13 23:40:20,211 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 11:40:18" (1/1) ... [2024-10-13 23:40:20,234 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 11:40:18" (1/1) ... [2024-10-13 23:40:20,334 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-10-13 23:40:20,336 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-10-13 23:40:20,337 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-10-13 23:40:20,337 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-10-13 23:40:20,338 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 11:40:18" (1/1) ... [2024-10-13 23:40:20,343 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-13 23:40:20,354 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-13 23:40:20,371 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-10-13 23:40:20,374 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-10-13 23:40:20,424 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-10-13 23:40:20,424 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-10-13 23:40:20,424 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-10-13 23:40:20,424 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-10-13 23:40:20,499 INFO L238 CfgBuilder]: Building ICFG [2024-10-13 23:40:20,501 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-10-13 23:40:26,417 INFO L? ?]: Removed 738 outVars from TransFormulas that were not future-live. [2024-10-13 23:40:26,418 INFO L287 CfgBuilder]: Performing block encoding [2024-10-13 23:40:26,497 INFO L309 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-10-13 23:40:26,498 INFO L314 CfgBuilder]: Removed 1 assume(true) statements. [2024-10-13 23:40:26,499 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.10 11:40:26 BoogieIcfgContainer [2024-10-13 23:40:26,499 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-10-13 23:40:26,501 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-10-13 23:40:26,501 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-10-13 23:40:26,504 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-10-13 23:40:26,505 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 13.10 11:40:16" (1/3) ... [2024-10-13 23:40:26,505 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@37c31b51 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.10 11:40:26, skipping insertion in model container [2024-10-13 23:40:26,505 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 11:40:18" (2/3) ... [2024-10-13 23:40:26,506 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@37c31b51 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.10 11:40:26, skipping insertion in model container [2024-10-13 23:40:26,506 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.10 11:40:26" (3/3) ... [2024-10-13 23:40:26,507 INFO L112 eAbstractionObserver]: Analyzing ICFG Problem13_label48.c [2024-10-13 23:40:26,524 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-10-13 23:40:26,524 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-10-13 23:40:26,622 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-10-13 23:40:26,632 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;@4d5c4620, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-13 23:40:26,632 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-10-13 23:40:26,640 INFO L276 IsEmpty]: Start isEmpty. Operand has 1036 states, 1034 states have (on average 1.877176015473888) internal successors, (1941), 1035 states have internal predecessors, (1941), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-13 23:40:26,646 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2024-10-13 23:40:26,646 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 23:40:26,647 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2024-10-13 23:40:26,648 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-13 23:40:26,652 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 23:40:26,652 INFO L85 PathProgramCache]: Analyzing trace with hash 326675475, now seen corresponding path program 1 times [2024-10-13 23:40:26,661 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 23:40:26,661 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1785830507] [2024-10-13 23:40:26,661 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 23:40:26,662 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 23:40:26,769 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 23:40:26,876 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-13 23:40:26,876 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 23:40:26,876 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1785830507] [2024-10-13 23:40:26,877 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1785830507] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 23:40:26,877 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 23:40:26,877 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-13 23:40:26,879 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [187078457] [2024-10-13 23:40:26,879 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 23:40:26,883 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-13 23:40:26,883 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 23:40:26,904 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-13 23:40:26,905 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-13 23:40:26,909 INFO L87 Difference]: Start difference. First operand has 1036 states, 1034 states have (on average 1.877176015473888) internal successors, (1941), 1035 states have internal predecessors, (1941), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 3 states, 3 states have (on average 1.6666666666666667) internal successors, (5), 2 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-13 23:40:30,639 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 23:40:30,640 INFO L93 Difference]: Finished difference Result 2911 states and 5519 transitions. [2024-10-13 23:40:30,641 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-13 23:40:30,642 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 1.6666666666666667) internal successors, (5), 2 states have internal predecessors, (5), 0 states have call successors, (0), 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 5 [2024-10-13 23:40:30,642 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 23:40:30,671 INFO L225 Difference]: With dead ends: 2911 [2024-10-13 23:40:30,671 INFO L226 Difference]: Without dead ends: 1872 [2024-10-13 23:40:30,677 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-10-13 23:40:30,680 INFO L432 NwaCegarLoop]: 940 mSDtfsCounter, 885 mSDsluCounter, 152 mSDsCounter, 0 mSdLazyCounter, 2448 mSolverCounterSat, 798 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 885 SdHoareTripleChecker+Valid, 1092 SdHoareTripleChecker+Invalid, 3246 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 798 IncrementalHoareTripleChecker+Valid, 2448 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.6s IncrementalHoareTripleChecker+Time [2024-10-13 23:40:30,681 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [885 Valid, 1092 Invalid, 3246 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [798 Valid, 2448 Invalid, 0 Unknown, 0 Unchecked, 3.6s Time] [2024-10-13 23:40:30,701 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1872 states. [2024-10-13 23:40:30,802 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1872 to 1858. [2024-10-13 23:40:30,807 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1858 states, 1857 states have (on average 1.5444264943457189) internal successors, (2868), 1857 states have internal predecessors, (2868), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-13 23:40:30,812 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1858 states to 1858 states and 2868 transitions. [2024-10-13 23:40:30,814 INFO L78 Accepts]: Start accepts. Automaton has 1858 states and 2868 transitions. Word has length 5 [2024-10-13 23:40:30,815 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 23:40:30,815 INFO L471 AbstractCegarLoop]: Abstraction has 1858 states and 2868 transitions. [2024-10-13 23:40:30,815 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 1.6666666666666667) internal successors, (5), 2 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-13 23:40:30,815 INFO L276 IsEmpty]: Start isEmpty. Operand 1858 states and 2868 transitions. [2024-10-13 23:40:30,817 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 78 [2024-10-13 23:40:30,817 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 23:40:30,818 INFO L215 NwaCegarLoop]: trace histogram [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] [2024-10-13 23:40:30,818 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-10-13 23:40:30,818 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-13 23:40:30,819 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 23:40:30,819 INFO L85 PathProgramCache]: Analyzing trace with hash 247773310, now seen corresponding path program 1 times [2024-10-13 23:40:30,819 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 23:40:30,820 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1832582710] [2024-10-13 23:40:30,820 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 23:40:30,820 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 23:40:30,908 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 23:40:31,133 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-13 23:40:31,133 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 23:40:31,133 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1832582710] [2024-10-13 23:40:31,134 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1832582710] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 23:40:31,134 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 23:40:31,134 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-13 23:40:31,134 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2071764999] [2024-10-13 23:40:31,135 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 23:40:31,136 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-13 23:40:31,136 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 23:40:31,137 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-13 23:40:31,137 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-13 23:40:31,137 INFO L87 Difference]: Start difference. First operand 1858 states and 2868 transitions. Second operand has 3 states, 3 states have (on average 25.666666666666668) internal successors, (77), 2 states have internal predecessors, (77), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-13 23:40:34,938 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 23:40:34,939 INFO L93 Difference]: Finished difference Result 5316 states and 8228 transitions. [2024-10-13 23:40:34,939 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-13 23:40:34,940 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 25.666666666666668) internal successors, (77), 2 states have internal predecessors, (77), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 77 [2024-10-13 23:40:34,940 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 23:40:34,954 INFO L225 Difference]: With dead ends: 5316 [2024-10-13 23:40:34,954 INFO L226 Difference]: Without dead ends: 3459 [2024-10-13 23:40:34,958 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-10-13 23:40:34,960 INFO L432 NwaCegarLoop]: 1037 mSDtfsCounter, 826 mSDsluCounter, 153 mSDsCounter, 0 mSdLazyCounter, 2403 mSolverCounterSat, 877 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 826 SdHoareTripleChecker+Valid, 1190 SdHoareTripleChecker+Invalid, 3280 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 877 IncrementalHoareTripleChecker+Valid, 2403 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.7s IncrementalHoareTripleChecker+Time [2024-10-13 23:40:34,961 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [826 Valid, 1190 Invalid, 3280 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [877 Valid, 2403 Invalid, 0 Unknown, 0 Unchecked, 3.7s Time] [2024-10-13 23:40:34,967 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3459 states. [2024-10-13 23:40:35,024 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3459 to 3458. [2024-10-13 23:40:35,030 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3458 states, 3457 states have (on average 1.380676887474689) internal successors, (4773), 3457 states have internal predecessors, (4773), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-13 23:40:35,038 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3458 states to 3458 states and 4773 transitions. [2024-10-13 23:40:35,038 INFO L78 Accepts]: Start accepts. Automaton has 3458 states and 4773 transitions. Word has length 77 [2024-10-13 23:40:35,039 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 23:40:35,039 INFO L471 AbstractCegarLoop]: Abstraction has 3458 states and 4773 transitions. [2024-10-13 23:40:35,039 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 25.666666666666668) internal successors, (77), 2 states have internal predecessors, (77), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-13 23:40:35,039 INFO L276 IsEmpty]: Start isEmpty. Operand 3458 states and 4773 transitions. [2024-10-13 23:40:35,041 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 92 [2024-10-13 23:40:35,041 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 23:40:35,042 INFO L215 NwaCegarLoop]: trace histogram [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] [2024-10-13 23:40:35,042 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-10-13 23:40:35,042 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-13 23:40:35,043 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 23:40:35,043 INFO L85 PathProgramCache]: Analyzing trace with hash 1417229941, now seen corresponding path program 1 times [2024-10-13 23:40:35,043 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 23:40:35,044 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1135879404] [2024-10-13 23:40:35,044 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 23:40:35,044 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 23:40:35,075 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 23:40:35,444 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-13 23:40:35,444 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 23:40:35,445 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1135879404] [2024-10-13 23:40:35,445 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1135879404] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 23:40:35,445 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 23:40:35,445 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-13 23:40:35,445 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2063226788] [2024-10-13 23:40:35,445 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 23:40:35,446 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-13 23:40:35,449 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 23:40:35,450 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-13 23:40:35,450 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-13 23:40:35,450 INFO L87 Difference]: Start difference. First operand 3458 states and 4773 transitions. Second operand has 4 states, 4 states have (on average 22.75) internal successors, (91), 3 states have internal predecessors, (91), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-13 23:40:39,667 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 23:40:39,667 INFO L93 Difference]: Finished difference Result 10869 states and 14767 transitions. [2024-10-13 23:40:39,668 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-13 23:40:39,668 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 22.75) internal successors, (91), 3 states have internal predecessors, (91), 0 states have call successors, (0), 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 91 [2024-10-13 23:40:39,668 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 23:40:39,694 INFO L225 Difference]: With dead ends: 10869 [2024-10-13 23:40:39,694 INFO L226 Difference]: Without dead ends: 7412 [2024-10-13 23:40:39,701 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-10-13 23:40:39,704 INFO L432 NwaCegarLoop]: 707 mSDtfsCounter, 2581 mSDsluCounter, 294 mSDsCounter, 0 mSdLazyCounter, 4118 mSolverCounterSat, 831 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2581 SdHoareTripleChecker+Valid, 1001 SdHoareTripleChecker+Invalid, 4949 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 831 IncrementalHoareTripleChecker+Valid, 4118 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.1s IncrementalHoareTripleChecker+Time [2024-10-13 23:40:39,705 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [2581 Valid, 1001 Invalid, 4949 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [831 Valid, 4118 Invalid, 0 Unknown, 0 Unchecked, 4.1s Time] [2024-10-13 23:40:39,714 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7412 states. [2024-10-13 23:40:39,808 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7412 to 7411. [2024-10-13 23:40:39,820 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7411 states, 7410 states have (on average 1.269905533063428) internal successors, (9410), 7410 states have internal predecessors, (9410), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-13 23:40:39,834 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7411 states to 7411 states and 9410 transitions. [2024-10-13 23:40:39,834 INFO L78 Accepts]: Start accepts. Automaton has 7411 states and 9410 transitions. Word has length 91 [2024-10-13 23:40:39,835 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 23:40:39,837 INFO L471 AbstractCegarLoop]: Abstraction has 7411 states and 9410 transitions. [2024-10-13 23:40:39,838 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 22.75) internal successors, (91), 3 states have internal predecessors, (91), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-13 23:40:39,838 INFO L276 IsEmpty]: Start isEmpty. Operand 7411 states and 9410 transitions. [2024-10-13 23:40:39,840 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 173 [2024-10-13 23:40:39,840 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 23:40:39,841 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 23:40:39,841 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-10-13 23:40:39,841 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-13 23:40:39,845 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 23:40:39,845 INFO L85 PathProgramCache]: Analyzing trace with hash 311801849, now seen corresponding path program 1 times [2024-10-13 23:40:39,845 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 23:40:39,845 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [107166862] [2024-10-13 23:40:39,845 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 23:40:39,847 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 23:40:39,898 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 23:40:40,086 INFO L134 CoverageAnalysis]: Checked inductivity of 77 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 70 trivial. 0 not checked. [2024-10-13 23:40:40,088 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 23:40:40,088 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [107166862] [2024-10-13 23:40:40,088 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [107166862] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 23:40:40,088 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 23:40:40,089 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-13 23:40:40,089 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [883166768] [2024-10-13 23:40:40,089 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 23:40:40,089 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-13 23:40:40,091 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 23:40:40,091 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-13 23:40:40,091 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-13 23:40:40,092 INFO L87 Difference]: Start difference. First operand 7411 states and 9410 transitions. Second operand has 3 states, 3 states have (on average 34.333333333333336) internal successors, (103), 2 states have internal predecessors, (103), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-13 23:40:43,833 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 23:40:43,833 INFO L93 Difference]: Finished difference Result 20356 states and 26251 transitions. [2024-10-13 23:40:43,833 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-13 23:40:43,834 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 34.333333333333336) internal successors, (103), 2 states have internal predecessors, (103), 0 states have call successors, (0), 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 172 [2024-10-13 23:40:43,834 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 23:40:43,873 INFO L225 Difference]: With dead ends: 20356 [2024-10-13 23:40:43,873 INFO L226 Difference]: Without dead ends: 13733 [2024-10-13 23:40:43,884 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-10-13 23:40:43,885 INFO L432 NwaCegarLoop]: 849 mSDtfsCounter, 889 mSDsluCounter, 129 mSDsCounter, 0 mSdLazyCounter, 2577 mSolverCounterSat, 747 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 889 SdHoareTripleChecker+Valid, 978 SdHoareTripleChecker+Invalid, 3324 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 747 IncrementalHoareTripleChecker+Valid, 2577 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.6s IncrementalHoareTripleChecker+Time [2024-10-13 23:40:43,885 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [889 Valid, 978 Invalid, 3324 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [747 Valid, 2577 Invalid, 0 Unknown, 0 Unchecked, 3.6s Time] [2024-10-13 23:40:43,899 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13733 states. [2024-10-13 23:40:44,053 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13733 to 12936. [2024-10-13 23:40:44,076 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 12936 states, 12935 states have (on average 1.2152299961345188) internal successors, (15719), 12935 states have internal predecessors, (15719), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-13 23:40:44,106 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12936 states to 12936 states and 15719 transitions. [2024-10-13 23:40:44,106 INFO L78 Accepts]: Start accepts. Automaton has 12936 states and 15719 transitions. Word has length 172 [2024-10-13 23:40:44,107 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 23:40:44,108 INFO L471 AbstractCegarLoop]: Abstraction has 12936 states and 15719 transitions. [2024-10-13 23:40:44,109 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 34.333333333333336) internal successors, (103), 2 states have internal predecessors, (103), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-13 23:40:44,113 INFO L276 IsEmpty]: Start isEmpty. Operand 12936 states and 15719 transitions. [2024-10-13 23:40:44,116 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 205 [2024-10-13 23:40:44,117 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 23:40:44,117 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 23:40:44,121 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-10-13 23:40:44,122 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-13 23:40:44,122 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 23:40:44,122 INFO L85 PathProgramCache]: Analyzing trace with hash 1297162409, now seen corresponding path program 1 times [2024-10-13 23:40:44,125 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 23:40:44,125 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1887047008] [2024-10-13 23:40:44,126 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 23:40:44,126 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 23:40:44,184 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 23:40:44,348 INFO L134 CoverageAnalysis]: Checked inductivity of 102 backedges. 102 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-13 23:40:44,350 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 23:40:44,350 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1887047008] [2024-10-13 23:40:44,350 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1887047008] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 23:40:44,351 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 23:40:44,351 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-13 23:40:44,351 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [493817518] [2024-10-13 23:40:44,351 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 23:40:44,352 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-13 23:40:44,354 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 23:40:44,354 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-13 23:40:44,354 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-13 23:40:44,355 INFO L87 Difference]: Start difference. First operand 12936 states and 15719 transitions. Second operand has 3 states, 3 states have (on average 68.0) internal successors, (204), 3 states have internal predecessors, (204), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-13 23:40:47,280 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 23:40:47,281 INFO L93 Difference]: Finished difference Result 31391 states and 39118 transitions. [2024-10-13 23:40:47,281 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-13 23:40:47,281 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 68.0) internal successors, (204), 3 states have internal predecessors, (204), 0 states have call successors, (0), 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 204 [2024-10-13 23:40:47,282 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 23:40:47,330 INFO L225 Difference]: With dead ends: 31391 [2024-10-13 23:40:47,331 INFO L226 Difference]: Without dead ends: 19243 [2024-10-13 23:40:47,347 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-13 23:40:47,349 INFO L432 NwaCegarLoop]: 807 mSDtfsCounter, 857 mSDsluCounter, 117 mSDsCounter, 0 mSdLazyCounter, 2382 mSolverCounterSat, 914 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 857 SdHoareTripleChecker+Valid, 924 SdHoareTripleChecker+Invalid, 3296 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 914 IncrementalHoareTripleChecker+Valid, 2382 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.8s IncrementalHoareTripleChecker+Time [2024-10-13 23:40:47,349 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [857 Valid, 924 Invalid, 3296 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [914 Valid, 2382 Invalid, 0 Unknown, 0 Unchecked, 2.8s Time] [2024-10-13 23:40:47,366 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19243 states. [2024-10-13 23:40:47,687 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19243 to 18446. [2024-10-13 23:40:47,706 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 18446 states, 18445 states have (on average 1.20243968555164) internal successors, (22179), 18445 states have internal predecessors, (22179), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-13 23:40:47,730 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18446 states to 18446 states and 22179 transitions. [2024-10-13 23:40:47,731 INFO L78 Accepts]: Start accepts. Automaton has 18446 states and 22179 transitions. Word has length 204 [2024-10-13 23:40:47,731 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 23:40:47,732 INFO L471 AbstractCegarLoop]: Abstraction has 18446 states and 22179 transitions. [2024-10-13 23:40:47,732 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 68.0) internal successors, (204), 3 states have internal predecessors, (204), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-13 23:40:47,732 INFO L276 IsEmpty]: Start isEmpty. Operand 18446 states and 22179 transitions. [2024-10-13 23:40:47,736 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 294 [2024-10-13 23:40:47,737 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 23:40:47,737 INFO L215 NwaCegarLoop]: trace histogram [4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 23:40:47,737 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-10-13 23:40:47,737 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-13 23:40:47,738 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 23:40:47,738 INFO L85 PathProgramCache]: Analyzing trace with hash 1419422385, now seen corresponding path program 1 times [2024-10-13 23:40:47,738 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 23:40:47,738 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1159958027] [2024-10-13 23:40:47,738 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 23:40:47,738 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 23:40:47,799 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 23:40:47,991 INFO L134 CoverageAnalysis]: Checked inductivity of 283 backedges. 11 proven. 0 refuted. 0 times theorem prover too weak. 272 trivial. 0 not checked. [2024-10-13 23:40:47,991 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 23:40:47,991 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1159958027] [2024-10-13 23:40:47,991 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1159958027] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 23:40:47,991 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 23:40:47,991 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-13 23:40:47,992 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [512136682] [2024-10-13 23:40:47,992 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 23:40:47,992 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-13 23:40:47,992 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 23:40:47,993 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-13 23:40:47,993 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-13 23:40:47,993 INFO L87 Difference]: Start difference. First operand 18446 states and 22179 transitions. Second operand has 3 states, 3 states have (on average 37.0) internal successors, (111), 3 states have internal predecessors, (111), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-13 23:40:51,065 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 23:40:51,066 INFO L93 Difference]: Finished difference Result 42411 states and 52036 transitions. [2024-10-13 23:40:51,066 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-13 23:40:51,066 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 37.0) internal successors, (111), 3 states have internal predecessors, (111), 0 states have call successors, (0), 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 293 [2024-10-13 23:40:51,067 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 23:40:51,117 INFO L225 Difference]: With dead ends: 42411 [2024-10-13 23:40:51,117 INFO L226 Difference]: Without dead ends: 24753 [2024-10-13 23:40:51,137 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-13 23:40:51,138 INFO L432 NwaCegarLoop]: 1794 mSDtfsCounter, 864 mSDsluCounter, 150 mSDsCounter, 0 mSdLazyCounter, 2543 mSolverCounterSat, 723 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 864 SdHoareTripleChecker+Valid, 1944 SdHoareTripleChecker+Invalid, 3266 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 723 IncrementalHoareTripleChecker+Valid, 2543 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.9s IncrementalHoareTripleChecker+Time [2024-10-13 23:40:51,138 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [864 Valid, 1944 Invalid, 3266 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [723 Valid, 2543 Invalid, 0 Unknown, 0 Unchecked, 2.9s Time] [2024-10-13 23:40:51,160 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24753 states. [2024-10-13 23:40:51,363 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24753 to 23961. [2024-10-13 23:40:51,387 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 23961 states, 23960 states have (on average 1.1787145242070116) internal successors, (28242), 23960 states have internal predecessors, (28242), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-13 23:40:51,415 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23961 states to 23961 states and 28242 transitions. [2024-10-13 23:40:51,419 INFO L78 Accepts]: Start accepts. Automaton has 23961 states and 28242 transitions. Word has length 293 [2024-10-13 23:40:51,419 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 23:40:51,419 INFO L471 AbstractCegarLoop]: Abstraction has 23961 states and 28242 transitions. [2024-10-13 23:40:51,419 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 37.0) internal successors, (111), 3 states have internal predecessors, (111), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-13 23:40:51,419 INFO L276 IsEmpty]: Start isEmpty. Operand 23961 states and 28242 transitions. [2024-10-13 23:40:51,425 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 303 [2024-10-13 23:40:51,426 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 23:40:51,426 INFO L215 NwaCegarLoop]: trace histogram [4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 23:40:51,426 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-10-13 23:40:51,426 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-13 23:40:51,427 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 23:40:51,427 INFO L85 PathProgramCache]: Analyzing trace with hash -734831771, now seen corresponding path program 1 times [2024-10-13 23:40:51,427 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 23:40:51,427 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1677370252] [2024-10-13 23:40:51,427 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 23:40:51,428 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 23:40:51,486 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 23:40:51,861 INFO L134 CoverageAnalysis]: Checked inductivity of 301 backedges. 297 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-10-13 23:40:51,861 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 23:40:51,861 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1677370252] [2024-10-13 23:40:51,862 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1677370252] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 23:40:51,862 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 23:40:51,862 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-13 23:40:51,863 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1260953807] [2024-10-13 23:40:51,863 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 23:40:51,863 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-13 23:40:51,864 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 23:40:51,864 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-13 23:40:51,865 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-10-13 23:40:51,865 INFO L87 Difference]: Start difference. First operand 23961 states and 28242 transitions. Second operand has 4 states, 4 states have (on average 74.75) internal successors, (299), 3 states have internal predecessors, (299), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-13 23:40:57,863 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 23:40:57,864 INFO L93 Difference]: Finished difference Result 89063 states and 105283 transitions. [2024-10-13 23:40:57,864 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-13 23:40:57,864 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 74.75) internal successors, (299), 3 states have internal predecessors, (299), 0 states have call successors, (0), 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 302 [2024-10-13 23:40:57,865 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 23:40:57,990 INFO L225 Difference]: With dead ends: 89063 [2024-10-13 23:40:57,990 INFO L226 Difference]: Without dead ends: 65890 [2024-10-13 23:40:58,028 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-10-13 23:40:58,029 INFO L432 NwaCegarLoop]: 434 mSDtfsCounter, 1742 mSDsluCounter, 201 mSDsCounter, 0 mSdLazyCounter, 6026 mSolverCounterSat, 1213 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1742 SdHoareTripleChecker+Valid, 635 SdHoareTripleChecker+Invalid, 7239 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1213 IncrementalHoareTripleChecker+Valid, 6026 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 5.7s IncrementalHoareTripleChecker+Time [2024-10-13 23:40:58,032 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1742 Valid, 635 Invalid, 7239 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1213 Valid, 6026 Invalid, 0 Unknown, 0 Unchecked, 5.7s Time] [2024-10-13 23:40:58,091 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 65890 states. [2024-10-13 23:40:58,766 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 65890 to 64188. [2024-10-13 23:40:58,820 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 64188 states, 64187 states have (on average 1.1559350024148192) internal successors, (74196), 64187 states have internal predecessors, (74196), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-13 23:40:58,907 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 64188 states to 64188 states and 74196 transitions. [2024-10-13 23:40:58,909 INFO L78 Accepts]: Start accepts. Automaton has 64188 states and 74196 transitions. Word has length 302 [2024-10-13 23:40:58,909 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 23:40:58,910 INFO L471 AbstractCegarLoop]: Abstraction has 64188 states and 74196 transitions. [2024-10-13 23:40:58,910 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 74.75) internal successors, (299), 3 states have internal predecessors, (299), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-13 23:40:58,910 INFO L276 IsEmpty]: Start isEmpty. Operand 64188 states and 74196 transitions. [2024-10-13 23:40:58,914 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 303 [2024-10-13 23:40:58,914 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 23:40:58,915 INFO L215 NwaCegarLoop]: trace histogram [4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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] [2024-10-13 23:40:58,915 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-10-13 23:40:58,915 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-13 23:40:58,915 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 23:40:58,916 INFO L85 PathProgramCache]: Analyzing trace with hash -1450367310, now seen corresponding path program 1 times [2024-10-13 23:40:58,916 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 23:40:58,916 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [445333605] [2024-10-13 23:40:58,916 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 23:40:58,916 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 23:40:58,962 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 23:40:59,255 INFO L134 CoverageAnalysis]: Checked inductivity of 275 backedges. 176 proven. 0 refuted. 0 times theorem prover too weak. 99 trivial. 0 not checked. [2024-10-13 23:40:59,255 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 23:40:59,255 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [445333605] [2024-10-13 23:40:59,256 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [445333605] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 23:40:59,256 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 23:40:59,257 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-13 23:40:59,258 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1790548760] [2024-10-13 23:40:59,258 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 23:40:59,259 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-13 23:40:59,259 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 23:40:59,259 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-13 23:40:59,260 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-13 23:40:59,260 INFO L87 Difference]: Start difference. First operand 64188 states and 74196 transitions. Second operand has 3 states, 3 states have (on average 68.33333333333333) internal successors, (205), 2 states have internal predecessors, (205), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-13 23:41:02,345 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 23:41:02,345 INFO L93 Difference]: Finished difference Result 140991 states and 162392 transitions. [2024-10-13 23:41:02,345 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-13 23:41:02,346 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 68.33333333333333) internal successors, (205), 2 states have internal predecessors, (205), 0 states have call successors, (0), 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 302 [2024-10-13 23:41:02,346 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 23:41:02,458 INFO L225 Difference]: With dead ends: 140991 [2024-10-13 23:41:02,458 INFO L226 Difference]: Without dead ends: 77591 [2024-10-13 23:41:02,512 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-10-13 23:41:02,513 INFO L432 NwaCegarLoop]: 1017 mSDtfsCounter, 730 mSDsluCounter, 180 mSDsCounter, 0 mSdLazyCounter, 2706 mSolverCounterSat, 180 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 730 SdHoareTripleChecker+Valid, 1197 SdHoareTripleChecker+Invalid, 2886 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 180 IncrementalHoareTripleChecker+Valid, 2706 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.7s IncrementalHoareTripleChecker+Time [2024-10-13 23:41:02,514 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [730 Valid, 1197 Invalid, 2886 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [180 Valid, 2706 Invalid, 0 Unknown, 0 Unchecked, 2.7s Time] [2024-10-13 23:41:02,589 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 77591 states. [2024-10-13 23:41:03,603 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 77591 to 76793. [2024-10-13 23:41:03,658 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 76793 states, 76792 states have (on average 1.1395848525888113) internal successors, (87511), 76792 states have internal predecessors, (87511), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-13 23:41:03,765 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 76793 states to 76793 states and 87511 transitions. [2024-10-13 23:41:03,766 INFO L78 Accepts]: Start accepts. Automaton has 76793 states and 87511 transitions. Word has length 302 [2024-10-13 23:41:03,766 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 23:41:03,767 INFO L471 AbstractCegarLoop]: Abstraction has 76793 states and 87511 transitions. [2024-10-13 23:41:03,767 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 68.33333333333333) internal successors, (205), 2 states have internal predecessors, (205), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-13 23:41:03,767 INFO L276 IsEmpty]: Start isEmpty. Operand 76793 states and 87511 transitions. [2024-10-13 23:41:03,774 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 332 [2024-10-13 23:41:03,774 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 23:41:03,774 INFO L215 NwaCegarLoop]: trace histogram [4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 23:41:03,774 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-10-13 23:41:03,775 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-13 23:41:03,775 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 23:41:03,775 INFO L85 PathProgramCache]: Analyzing trace with hash -656525062, now seen corresponding path program 1 times [2024-10-13 23:41:03,775 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 23:41:03,775 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [897774529] [2024-10-13 23:41:03,776 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 23:41:03,776 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 23:41:03,825 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 23:41:05,636 INFO L134 CoverageAnalysis]: Checked inductivity of 293 backedges. 176 proven. 113 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-10-13 23:41:05,637 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 23:41:05,637 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [897774529] [2024-10-13 23:41:05,637 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [897774529] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-13 23:41:05,637 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1931077977] [2024-10-13 23:41:05,637 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 23:41:05,638 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-13 23:41:05,638 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-13 23:41:05,640 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-13 23:41:05,641 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2024-10-13 23:41:05,789 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 23:41:05,793 INFO L255 TraceCheckSpWp]: Trace formula consists of 468 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-10-13 23:41:05,812 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-13 23:41:05,987 INFO L134 CoverageAnalysis]: Checked inductivity of 293 backedges. 176 proven. 0 refuted. 0 times theorem prover too weak. 117 trivial. 0 not checked. [2024-10-13 23:41:05,990 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-13 23:41:05,990 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1931077977] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 23:41:05,990 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-10-13 23:41:05,990 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [7] total 9 [2024-10-13 23:41:05,991 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2134153230] [2024-10-13 23:41:05,991 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 23:41:05,992 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-13 23:41:05,992 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 23:41:05,992 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-13 23:41:05,993 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=50, Unknown=0, NotChecked=0, Total=72 [2024-10-13 23:41:05,995 INFO L87 Difference]: Start difference. First operand 76793 states and 87511 transitions. Second operand has 3 states, 3 states have (on average 72.0) internal successors, (216), 3 states have internal predecessors, (216), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-13 23:41:09,162 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 23:41:09,162 INFO L93 Difference]: Finished difference Result 152796 states and 174228 transitions. [2024-10-13 23:41:09,163 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-13 23:41:09,163 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 72.0) internal successors, (216), 3 states have internal predecessors, (216), 0 states have call successors, (0), 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 331 [2024-10-13 23:41:09,164 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 23:41:09,240 INFO L225 Difference]: With dead ends: 152796 [2024-10-13 23:41:09,241 INFO L226 Difference]: Without dead ends: 76791 [2024-10-13 23:41:09,273 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 337 GetRequests, 330 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=22, Invalid=50, Unknown=0, NotChecked=0, Total=72 [2024-10-13 23:41:09,274 INFO L432 NwaCegarLoop]: 1360 mSDtfsCounter, 1122 mSDsluCounter, 80 mSDsCounter, 0 mSdLazyCounter, 2467 mSolverCounterSat, 450 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1122 SdHoareTripleChecker+Valid, 1440 SdHoareTripleChecker+Invalid, 2917 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 450 IncrementalHoareTripleChecker+Valid, 2467 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.7s IncrementalHoareTripleChecker+Time [2024-10-13 23:41:09,274 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1122 Valid, 1440 Invalid, 2917 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [450 Valid, 2467 Invalid, 0 Unknown, 0 Unchecked, 2.7s Time] [2024-10-13 23:41:09,320 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 76791 states. [2024-10-13 23:41:09,929 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 76791 to 76003. [2024-10-13 23:41:09,980 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 76003 states, 76002 states have (on average 1.1082339938422674) internal successors, (84228), 76002 states have internal predecessors, (84228), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-13 23:41:10,052 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 76003 states to 76003 states and 84228 transitions. [2024-10-13 23:41:10,053 INFO L78 Accepts]: Start accepts. Automaton has 76003 states and 84228 transitions. Word has length 331 [2024-10-13 23:41:10,053 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 23:41:10,054 INFO L471 AbstractCegarLoop]: Abstraction has 76003 states and 84228 transitions. [2024-10-13 23:41:10,054 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 72.0) internal successors, (216), 3 states have internal predecessors, (216), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-13 23:41:10,054 INFO L276 IsEmpty]: Start isEmpty. Operand 76003 states and 84228 transitions. [2024-10-13 23:41:10,061 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 362 [2024-10-13 23:41:10,062 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 23:41:10,062 INFO L215 NwaCegarLoop]: trace histogram [5, 5, 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, 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, 4, 4, 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] [2024-10-13 23:41:10,080 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2024-10-13 23:41:10,262 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-13 23:41:10,263 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-13 23:41:10,263 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 23:41:10,264 INFO L85 PathProgramCache]: Analyzing trace with hash -178835400, now seen corresponding path program 1 times [2024-10-13 23:41:10,264 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 23:41:10,264 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1052195465] [2024-10-13 23:41:10,264 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 23:41:10,264 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 23:41:10,639 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 23:41:10,995 INFO L134 CoverageAnalysis]: Checked inductivity of 505 backedges. 344 proven. 0 refuted. 0 times theorem prover too weak. 161 trivial. 0 not checked. [2024-10-13 23:41:10,995 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 23:41:10,995 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1052195465] [2024-10-13 23:41:10,996 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1052195465] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 23:41:10,996 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 23:41:10,996 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-13 23:41:10,996 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1617594182] [2024-10-13 23:41:10,996 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 23:41:10,997 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-13 23:41:10,997 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 23:41:10,997 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-13 23:41:10,997 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-13 23:41:10,998 INFO L87 Difference]: Start difference. First operand 76003 states and 84228 transitions. Second operand has 3 states, 3 states have (on average 67.33333333333333) internal successors, (202), 3 states have internal predecessors, (202), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-13 23:41:14,656 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 23:41:14,656 INFO L93 Difference]: Finished difference Result 170116 states and 190567 transitions. [2024-10-13 23:41:14,657 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-13 23:41:14,657 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 67.33333333333333) internal successors, (202), 3 states have internal predecessors, (202), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 361 [2024-10-13 23:41:14,657 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 23:41:14,762 INFO L225 Difference]: With dead ends: 170116 [2024-10-13 23:41:14,762 INFO L226 Difference]: Without dead ends: 94901 [2024-10-13 23:41:14,786 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-13 23:41:14,786 INFO L432 NwaCegarLoop]: 822 mSDtfsCounter, 904 mSDsluCounter, 83 mSDsCounter, 0 mSdLazyCounter, 2416 mSolverCounterSat, 944 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 904 SdHoareTripleChecker+Valid, 905 SdHoareTripleChecker+Invalid, 3360 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 944 IncrementalHoareTripleChecker+Valid, 2416 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.1s IncrementalHoareTripleChecker+Time [2024-10-13 23:41:14,787 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [904 Valid, 905 Invalid, 3360 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [944 Valid, 2416 Invalid, 0 Unknown, 0 Unchecked, 3.1s Time] [2024-10-13 23:41:14,844 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 94901 states. [2024-10-13 23:41:15,770 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 94901 to 94883. [2024-10-13 23:41:15,824 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 94883 states, 94882 states have (on average 1.1142366307624207) internal successors, (105721), 94882 states have internal predecessors, (105721), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-13 23:41:15,916 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 94883 states to 94883 states and 105721 transitions. [2024-10-13 23:41:15,917 INFO L78 Accepts]: Start accepts. Automaton has 94883 states and 105721 transitions. Word has length 361 [2024-10-13 23:41:15,918 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 23:41:15,918 INFO L471 AbstractCegarLoop]: Abstraction has 94883 states and 105721 transitions. [2024-10-13 23:41:15,918 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 67.33333333333333) internal successors, (202), 3 states have internal predecessors, (202), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-13 23:41:15,918 INFO L276 IsEmpty]: Start isEmpty. Operand 94883 states and 105721 transitions. [2024-10-13 23:41:15,926 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 395 [2024-10-13 23:41:15,926 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 23:41:15,927 INFO L215 NwaCegarLoop]: trace histogram [4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 23:41:15,927 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2024-10-13 23:41:15,927 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-13 23:41:15,928 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 23:41:15,928 INFO L85 PathProgramCache]: Analyzing trace with hash 1156136841, now seen corresponding path program 1 times [2024-10-13 23:41:15,928 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 23:41:15,928 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [58581190] [2024-10-13 23:41:15,928 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 23:41:15,928 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 23:41:16,252 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 23:41:16,513 INFO L134 CoverageAnalysis]: Checked inductivity of 330 backedges. 11 proven. 0 refuted. 0 times theorem prover too weak. 319 trivial. 0 not checked. [2024-10-13 23:41:16,513 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 23:41:16,513 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [58581190] [2024-10-13 23:41:16,514 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [58581190] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 23:41:16,514 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 23:41:16,514 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-13 23:41:16,514 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1409278384] [2024-10-13 23:41:16,514 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 23:41:16,515 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-13 23:41:16,515 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 23:41:16,515 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-13 23:41:16,516 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-13 23:41:16,516 INFO L87 Difference]: Start difference. First operand 94883 states and 105721 transitions. Second operand has 3 states, 3 states have (on average 58.0) internal successors, (174), 3 states have internal predecessors, (174), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-13 23:41:20,072 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 23:41:20,072 INFO L93 Difference]: Finished difference Result 208750 states and 232951 transitions. [2024-10-13 23:41:20,073 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-13 23:41:20,073 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 58.0) internal successors, (174), 3 states have internal predecessors, (174), 0 states have call successors, (0), 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 394 [2024-10-13 23:41:20,074 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 23:41:20,227 INFO L225 Difference]: With dead ends: 208750 [2024-10-13 23:41:20,227 INFO L226 Difference]: Without dead ends: 128830 [2024-10-13 23:41:20,282 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-13 23:41:20,283 INFO L432 NwaCegarLoop]: 1920 mSDtfsCounter, 962 mSDsluCounter, 179 mSDsCounter, 0 mSdLazyCounter, 2704 mSolverCounterSat, 233 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 962 SdHoareTripleChecker+Valid, 2099 SdHoareTripleChecker+Invalid, 2937 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 233 IncrementalHoareTripleChecker+Valid, 2704 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.0s IncrementalHoareTripleChecker+Time [2024-10-13 23:41:20,283 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [962 Valid, 2099 Invalid, 2937 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [233 Valid, 2704 Invalid, 0 Unknown, 0 Unchecked, 3.0s Time] [2024-10-13 23:41:20,368 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 128830 states. [2024-10-13 23:41:21,513 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 128830 to 117799. [2024-10-13 23:41:21,588 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 117799 states, 117798 states have (on average 1.1065977351058591) internal successors, (130355), 117798 states have internal predecessors, (130355), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-13 23:41:21,706 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 117799 states to 117799 states and 130355 transitions. [2024-10-13 23:41:21,707 INFO L78 Accepts]: Start accepts. Automaton has 117799 states and 130355 transitions. Word has length 394 [2024-10-13 23:41:21,707 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 23:41:21,707 INFO L471 AbstractCegarLoop]: Abstraction has 117799 states and 130355 transitions. [2024-10-13 23:41:21,707 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 58.0) internal successors, (174), 3 states have internal predecessors, (174), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-13 23:41:21,708 INFO L276 IsEmpty]: Start isEmpty. Operand 117799 states and 130355 transitions. [2024-10-13 23:41:21,713 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 400 [2024-10-13 23:41:21,713 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 23:41:21,713 INFO L215 NwaCegarLoop]: trace histogram [5, 5, 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, 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, 4, 4, 4, 4, 4, 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] [2024-10-13 23:41:21,713 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2024-10-13 23:41:21,714 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-13 23:41:21,714 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 23:41:21,714 INFO L85 PathProgramCache]: Analyzing trace with hash -415989251, now seen corresponding path program 1 times [2024-10-13 23:41:21,714 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 23:41:21,715 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1430172819] [2024-10-13 23:41:21,715 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 23:41:21,715 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 23:41:22,168 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 23:41:22,508 INFO L134 CoverageAnalysis]: Checked inductivity of 514 backedges. 242 proven. 0 refuted. 0 times theorem prover too weak. 272 trivial. 0 not checked. [2024-10-13 23:41:22,508 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 23:41:22,508 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1430172819] [2024-10-13 23:41:22,508 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1430172819] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 23:41:22,508 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 23:41:22,509 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-13 23:41:22,509 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1302375872] [2024-10-13 23:41:22,509 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 23:41:22,510 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-13 23:41:22,510 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 23:41:22,510 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-13 23:41:22,510 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-13 23:41:22,511 INFO L87 Difference]: Start difference. First operand 117799 states and 130355 transitions. Second operand has 3 states, 3 states have (on average 72.33333333333333) internal successors, (217), 3 states have internal predecessors, (217), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-13 23:41:26,264 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 23:41:26,265 INFO L93 Difference]: Finished difference Result 236398 states and 261531 transitions. [2024-10-13 23:41:26,265 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-13 23:41:26,265 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 72.33333333333333) internal successors, (217), 3 states have internal predecessors, (217), 0 states have call successors, (0), 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 399 [2024-10-13 23:41:26,266 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 23:41:26,677 INFO L225 Difference]: With dead ends: 236398 [2024-10-13 23:41:26,678 INFO L226 Difference]: Without dead ends: 117813 [2024-10-13 23:41:26,736 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-13 23:41:26,737 INFO L432 NwaCegarLoop]: 1716 mSDtfsCounter, 793 mSDsluCounter, 150 mSDsCounter, 0 mSdLazyCounter, 2507 mSolverCounterSat, 681 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 793 SdHoareTripleChecker+Valid, 1866 SdHoareTripleChecker+Invalid, 3188 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 681 IncrementalHoareTripleChecker+Valid, 2507 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.1s IncrementalHoareTripleChecker+Time [2024-10-13 23:41:26,737 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [793 Valid, 1866 Invalid, 3188 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [681 Valid, 2507 Invalid, 0 Unknown, 0 Unchecked, 3.1s Time] [2024-10-13 23:41:26,819 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 117813 states. [2024-10-13 23:41:27,714 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 117813 to 116214. [2024-10-13 23:41:27,790 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 116214 states, 116213 states have (on average 1.0753099911369641) internal successors, (124965), 116213 states have internal predecessors, (124965), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-13 23:41:27,903 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 116214 states to 116214 states and 124965 transitions. [2024-10-13 23:41:27,904 INFO L78 Accepts]: Start accepts. Automaton has 116214 states and 124965 transitions. Word has length 399 [2024-10-13 23:41:27,904 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 23:41:27,904 INFO L471 AbstractCegarLoop]: Abstraction has 116214 states and 124965 transitions. [2024-10-13 23:41:27,904 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 72.33333333333333) internal successors, (217), 3 states have internal predecessors, (217), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-13 23:41:27,904 INFO L276 IsEmpty]: Start isEmpty. Operand 116214 states and 124965 transitions. [2024-10-13 23:41:27,908 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 410 [2024-10-13 23:41:27,909 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 23:41:27,909 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 23:41:27,909 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2024-10-13 23:41:27,909 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-13 23:41:27,909 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 23:41:27,910 INFO L85 PathProgramCache]: Analyzing trace with hash -311650913, now seen corresponding path program 1 times [2024-10-13 23:41:27,910 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 23:41:27,910 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1832408906] [2024-10-13 23:41:27,910 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 23:41:27,910 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 23:41:27,977 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 23:41:28,850 INFO L134 CoverageAnalysis]: Checked inductivity of 102 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 95 trivial. 0 not checked. [2024-10-13 23:41:28,851 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 23:41:28,851 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1832408906] [2024-10-13 23:41:28,851 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1832408906] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 23:41:28,851 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 23:41:28,851 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-13 23:41:28,851 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [403993421] [2024-10-13 23:41:28,852 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 23:41:28,852 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-13 23:41:28,852 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 23:41:28,853 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-13 23:41:28,853 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-10-13 23:41:28,853 INFO L87 Difference]: Start difference. First operand 116214 states and 124965 transitions. Second operand has 4 states, 4 states have (on average 78.75) internal successors, (315), 3 states have internal predecessors, (315), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)