./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/eca-rers2012/Problem13_label39.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 8be7027f Calling Ultimate with: /root/.sdkman/candidates/java/11.0.12-open/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/eca-rers2012/Problem13_label39.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 458d694afbb3bfd6aed28352ce176f8d7e28b3da8c081e4ca83ee27f62e7ab73 --- Real Ultimate output --- This is Ultimate 0.2.5-wip.dk.perfect-tracechecks-8be7027-m [2024-11-11 17:00:49,639 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-11 17:00:49,695 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-11-11 17:00:49,700 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-11 17:00:49,703 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-11 17:00:49,725 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-11 17:00:49,725 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-11 17:00:49,725 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-11 17:00:49,726 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-11 17:00:49,726 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-11 17:00:49,726 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-11 17:00:49,727 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-11 17:00:49,727 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-11 17:00:49,728 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-11 17:00:49,729 INFO L153 SettingsManager]: * Use SBE=true [2024-11-11 17:00:49,729 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-11 17:00:49,730 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-11 17:00:49,730 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-11 17:00:49,730 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-11 17:00:49,730 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-11 17:00:49,730 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-11 17:00:49,734 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-11 17:00:49,734 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-11 17:00:49,734 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-11 17:00:49,734 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-11 17:00:49,734 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-11 17:00:49,735 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-11 17:00:49,735 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-11 17:00:49,735 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-11 17:00:49,735 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-11 17:00:49,735 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-11 17:00:49,735 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-11 17:00:49,735 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-11 17:00:49,736 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-11 17:00:49,736 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-11 17:00:49,736 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-11 17:00:49,736 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-11 17:00:49,736 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-11 17:00:49,736 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-11 17:00:49,736 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-11 17:00:49,736 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-11 17:00:49,738 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-11 17:00:49,738 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 -> 458d694afbb3bfd6aed28352ce176f8d7e28b3da8c081e4ca83ee27f62e7ab73 [2024-11-11 17:00:50,031 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-11 17:00:50,056 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-11 17:00:50,059 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-11 17:00:50,060 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-11 17:00:50,060 INFO L274 PluginConnector]: CDTParser initialized [2024-11-11 17:00:50,062 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/eca-rers2012/Problem13_label39.c [2024-11-11 17:00:51,295 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-11 17:00:51,648 INFO L384 CDTParser]: Found 1 translation units. [2024-11-11 17:00:51,650 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/eca-rers2012/Problem13_label39.c [2024-11-11 17:00:51,677 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/5a9f68637/d717c5b086944c10a23fb9d5c17ca80b/FLAG60cd47f12 [2024-11-11 17:00:51,858 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/5a9f68637/d717c5b086944c10a23fb9d5c17ca80b [2024-11-11 17:00:51,860 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-11 17:00:51,861 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-11 17:00:51,863 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-11 17:00:51,863 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-11 17:00:51,867 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-11 17:00:51,868 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.11 05:00:51" (1/1) ... [2024-11-11 17:00:51,869 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@1f83c88f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.11 05:00:51, skipping insertion in model container [2024-11-11 17:00:51,869 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.11 05:00:51" (1/1) ... [2024-11-11 17:00:51,992 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-11 17:00:52,241 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/eca-rers2012/Problem13_label39.c[7279,7292] [2024-11-11 17:00:52,864 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-11 17:00:52,871 INFO L200 MainTranslator]: Completed pre-run [2024-11-11 17:00:52,895 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/eca-rers2012/Problem13_label39.c[7279,7292] [2024-11-11 17:00:53,237 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-11 17:00:53,263 INFO L204 MainTranslator]: Completed translation [2024-11-11 17:00:53,263 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.11 05:00:53 WrapperNode [2024-11-11 17:00:53,263 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-11 17:00:53,264 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-11 17:00:53,264 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-11 17:00:53,265 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-11 17:00:53,270 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.11 05:00:53" (1/1) ... [2024-11-11 17:00:53,320 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.11 05:00:53" (1/1) ... [2024-11-11 17:00:53,724 INFO L138 Inliner]: procedures = 17, calls = 11, calls flagged for inlining = 6, calls inlined = 6, statements flattened = 5587 [2024-11-11 17:00:53,724 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-11 17:00:53,725 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-11 17:00:53,725 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-11 17:00:53,725 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-11 17:00:53,734 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.11 05:00:53" (1/1) ... [2024-11-11 17:00:53,734 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.11 05:00:53" (1/1) ... [2024-11-11 17:00:53,845 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.11 05:00:53" (1/1) ... [2024-11-11 17:00:54,152 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2024-11-11 17:00:54,156 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.11 05:00:53" (1/1) ... [2024-11-11 17:00:54,156 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.11 05:00:53" (1/1) ... [2024-11-11 17:00:54,336 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.11 05:00:53" (1/1) ... [2024-11-11 17:00:54,361 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.11 05:00:53" (1/1) ... [2024-11-11 17:00:54,391 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.11 05:00:53" (1/1) ... [2024-11-11 17:00:54,412 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.11 05:00:53" (1/1) ... [2024-11-11 17:00:54,500 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-11 17:00:54,502 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-11 17:00:54,502 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-11 17:00:54,502 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-11 17:00:54,503 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.11 05:00:53" (1/1) ... [2024-11-11 17:00:54,507 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-11 17:00:54,517 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-11 17:00:54,532 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-11-11 17:00:54,536 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-11-11 17:00:54,576 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-11 17:00:54,576 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-11-11 17:00:54,576 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-11 17:00:54,576 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-11 17:00:54,637 INFO L238 CfgBuilder]: Building ICFG [2024-11-11 17:00:54,639 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-11 17:00:59,192 INFO L? ?]: Removed 738 outVars from TransFormulas that were not future-live. [2024-11-11 17:00:59,193 INFO L287 CfgBuilder]: Performing block encoding [2024-11-11 17:00:59,224 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-11 17:00:59,224 INFO L316 CfgBuilder]: Removed 1 assume(true) statements. [2024-11-11 17:00:59,225 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.11 05:00:59 BoogieIcfgContainer [2024-11-11 17:00:59,225 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-11 17:00:59,227 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-11 17:00:59,227 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-11 17:00:59,230 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-11 17:00:59,230 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 11.11 05:00:51" (1/3) ... [2024-11-11 17:00:59,230 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2d0e573a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.11 05:00:59, skipping insertion in model container [2024-11-11 17:00:59,230 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.11 05:00:53" (2/3) ... [2024-11-11 17:00:59,231 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2d0e573a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.11 05:00:59, skipping insertion in model container [2024-11-11 17:00:59,231 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.11 05:00:59" (3/3) ... [2024-11-11 17:00:59,232 INFO L112 eAbstractionObserver]: Analyzing ICFG Problem13_label39.c [2024-11-11 17:00:59,246 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-11 17:00:59,246 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-11-11 17:00:59,321 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-11 17:00:59,331 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;@4340e523, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-11 17:00:59,335 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-11 17:00:59,344 INFO L276 IsEmpty]: Start isEmpty. Operand has 1098 states, 1096 states have (on average 1.8275547445255473) internal successors, (2003), 1097 states have internal predecessors, (2003), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-11 17:00:59,350 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2024-11-11 17:00:59,351 INFO L210 NwaCegarLoop]: Found error trace [2024-11-11 17:00:59,351 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-11 17:00:59,352 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-11 17:00:59,356 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-11 17:00:59,357 INFO L85 PathProgramCache]: Analyzing trace with hash 2122806209, now seen corresponding path program 1 times [2024-11-11 17:00:59,364 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-11 17:00:59,364 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [95605738] [2024-11-11 17:00:59,365 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 17:00:59,365 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-11 17:00:59,486 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 17:00:59,696 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-11 17:00:59,698 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-11 17:00:59,698 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [95605738] [2024-11-11 17:00:59,699 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [95605738] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-11 17:00:59,699 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-11 17:00:59,699 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-11 17:00:59,701 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [460043413] [2024-11-11 17:00:59,701 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-11 17:00:59,706 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-11 17:00:59,707 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-11 17:00:59,726 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-11 17:00:59,726 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-11 17:00:59,730 INFO L87 Difference]: Start difference. First operand has 1098 states, 1096 states have (on average 1.8275547445255473) internal successors, (2003), 1097 states have internal predecessors, (2003), 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 17.0) internal successors, (51), 2 states have internal predecessors, (51), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-11 17:01:03,380 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-11 17:01:03,381 INFO L93 Difference]: Finished difference Result 3160 states and 5843 transitions. [2024-11-11 17:01:03,382 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-11 17:01:03,383 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 17.0) internal successors, (51), 2 states have internal predecessors, (51), 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 51 [2024-11-11 17:01:03,383 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-11 17:01:03,409 INFO L225 Difference]: With dead ends: 3160 [2024-11-11 17:01:03,409 INFO L226 Difference]: Without dead ends: 1983 [2024-11-11 17:01:03,415 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-11 17:01:03,417 INFO L435 NwaCegarLoop]: 243 mSDtfsCounter, 1052 mSDsluCounter, 97 mSDsCounter, 0 mSdLazyCounter, 3030 mSolverCounterSat, 974 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1052 SdHoareTripleChecker+Valid, 340 SdHoareTripleChecker+Invalid, 4004 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 974 IncrementalHoareTripleChecker+Valid, 3030 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.5s IncrementalHoareTripleChecker+Time [2024-11-11 17:01:03,418 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1052 Valid, 340 Invalid, 4004 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [974 Valid, 3030 Invalid, 0 Unknown, 0 Unchecked, 3.5s Time] [2024-11-11 17:01:03,435 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1983 states. [2024-11-11 17:01:03,526 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1983 to 1930. [2024-11-11 17:01:03,530 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1930 states, 1929 states have (on average 1.7973043027475375) internal successors, (3467), 1929 states have internal predecessors, (3467), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-11 17:01:03,535 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1930 states to 1930 states and 3467 transitions. [2024-11-11 17:01:03,537 INFO L78 Accepts]: Start accepts. Automaton has 1930 states and 3467 transitions. Word has length 51 [2024-11-11 17:01:03,537 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-11 17:01:03,537 INFO L471 AbstractCegarLoop]: Abstraction has 1930 states and 3467 transitions. [2024-11-11 17:01:03,538 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 17.0) internal successors, (51), 2 states have internal predecessors, (51), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-11 17:01:03,538 INFO L276 IsEmpty]: Start isEmpty. Operand 1930 states and 3467 transitions. [2024-11-11 17:01:03,540 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 117 [2024-11-11 17:01:03,541 INFO L210 NwaCegarLoop]: Found error trace [2024-11-11 17:01:03,541 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-11 17:01:03,541 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-11 17:01:03,541 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-11 17:01:03,542 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-11 17:01:03,542 INFO L85 PathProgramCache]: Analyzing trace with hash -1942547750, now seen corresponding path program 1 times [2024-11-11 17:01:03,542 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-11 17:01:03,542 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2069162196] [2024-11-11 17:01:03,543 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 17:01:03,543 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-11 17:01:03,590 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 17:01:03,738 INFO L134 CoverageAnalysis]: Checked inductivity of 48 backedges. 48 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-11 17:01:03,738 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-11 17:01:03,738 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2069162196] [2024-11-11 17:01:03,738 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2069162196] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-11 17:01:03,738 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-11 17:01:03,739 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-11 17:01:03,739 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [744214648] [2024-11-11 17:01:03,739 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-11 17:01:03,740 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-11 17:01:03,740 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-11 17:01:03,741 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-11 17:01:03,741 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-11 17:01:03,741 INFO L87 Difference]: Start difference. First operand 1930 states and 3467 transitions. Second operand has 3 states, 3 states have (on average 38.666666666666664) internal successors, (116), 2 states have internal predecessors, (116), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-11 17:01:06,623 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-11 17:01:06,623 INFO L93 Difference]: Finished difference Result 5456 states and 9917 transitions. [2024-11-11 17:01:06,624 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-11 17:01:06,624 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 38.666666666666664) internal successors, (116), 2 states have internal predecessors, (116), 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 116 [2024-11-11 17:01:06,625 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-11 17:01:06,635 INFO L225 Difference]: With dead ends: 5456 [2024-11-11 17:01:06,635 INFO L226 Difference]: Without dead ends: 3528 [2024-11-11 17:01:06,638 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-11 17:01:06,639 INFO L435 NwaCegarLoop]: 855 mSDtfsCounter, 923 mSDsluCounter, 152 mSDsCounter, 0 mSdLazyCounter, 2309 mSolverCounterSat, 878 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 923 SdHoareTripleChecker+Valid, 1007 SdHoareTripleChecker+Invalid, 3187 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 878 IncrementalHoareTripleChecker+Valid, 2309 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.8s IncrementalHoareTripleChecker+Time [2024-11-11 17:01:06,639 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [923 Valid, 1007 Invalid, 3187 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [878 Valid, 2309 Invalid, 0 Unknown, 0 Unchecked, 2.8s Time] [2024-11-11 17:01:06,643 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3528 states. [2024-11-11 17:01:06,679 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3528 to 3526. [2024-11-11 17:01:06,683 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3526 states, 3525 states have (on average 1.5670921985815602) internal successors, (5524), 3525 states have internal predecessors, (5524), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-11 17:01:06,689 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3526 states to 3526 states and 5524 transitions. [2024-11-11 17:01:06,689 INFO L78 Accepts]: Start accepts. Automaton has 3526 states and 5524 transitions. Word has length 116 [2024-11-11 17:01:06,689 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-11 17:01:06,690 INFO L471 AbstractCegarLoop]: Abstraction has 3526 states and 5524 transitions. [2024-11-11 17:01:06,690 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 38.666666666666664) internal successors, (116), 2 states have internal predecessors, (116), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-11 17:01:06,690 INFO L276 IsEmpty]: Start isEmpty. Operand 3526 states and 5524 transitions. [2024-11-11 17:01:06,691 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 123 [2024-11-11 17:01:06,691 INFO L210 NwaCegarLoop]: Found error trace [2024-11-11 17:01:06,692 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-11 17:01:06,692 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-11 17:01:06,692 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-11 17:01:06,692 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-11 17:01:06,693 INFO L85 PathProgramCache]: Analyzing trace with hash -1167655959, now seen corresponding path program 1 times [2024-11-11 17:01:06,693 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-11 17:01:06,693 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [229442573] [2024-11-11 17:01:06,693 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 17:01:06,693 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-11 17:01:06,717 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 17:01:06,839 INFO L134 CoverageAnalysis]: Checked inductivity of 48 backedges. 48 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-11 17:01:06,839 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-11 17:01:06,839 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [229442573] [2024-11-11 17:01:06,840 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [229442573] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-11 17:01:06,840 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-11 17:01:06,840 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-11 17:01:06,840 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [823434978] [2024-11-11 17:01:06,840 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-11 17:01:06,840 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-11 17:01:06,840 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-11 17:01:06,841 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-11 17:01:06,841 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-11 17:01:06,841 INFO L87 Difference]: Start difference. First operand 3526 states and 5524 transitions. Second operand has 3 states, 3 states have (on average 40.666666666666664) internal successors, (122), 2 states have internal predecessors, (122), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-11 17:01:09,386 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-11 17:01:09,387 INFO L93 Difference]: Finished difference Result 10234 states and 16098 transitions. [2024-11-11 17:01:09,387 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-11 17:01:09,387 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 40.666666666666664) internal successors, (122), 2 states have internal predecessors, (122), 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 122 [2024-11-11 17:01:09,387 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-11 17:01:09,408 INFO L225 Difference]: With dead ends: 10234 [2024-11-11 17:01:09,408 INFO L226 Difference]: Without dead ends: 6710 [2024-11-11 17:01:09,413 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-11 17:01:09,415 INFO L435 NwaCegarLoop]: 718 mSDtfsCounter, 973 mSDsluCounter, 134 mSDsCounter, 0 mSdLazyCounter, 2535 mSolverCounterSat, 774 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 973 SdHoareTripleChecker+Valid, 852 SdHoareTripleChecker+Invalid, 3309 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 774 IncrementalHoareTripleChecker+Valid, 2535 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.5s IncrementalHoareTripleChecker+Time [2024-11-11 17:01:09,417 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [973 Valid, 852 Invalid, 3309 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [774 Valid, 2535 Invalid, 0 Unknown, 0 Unchecked, 2.5s Time] [2024-11-11 17:01:09,424 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6710 states. [2024-11-11 17:01:09,524 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6710 to 6700. [2024-11-11 17:01:09,534 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6700 states, 6699 states have (on average 1.413046723391551) internal successors, (9466), 6699 states have internal predecessors, (9466), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-11 17:01:09,546 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6700 states to 6700 states and 9466 transitions. [2024-11-11 17:01:09,548 INFO L78 Accepts]: Start accepts. Automaton has 6700 states and 9466 transitions. Word has length 122 [2024-11-11 17:01:09,548 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-11 17:01:09,548 INFO L471 AbstractCegarLoop]: Abstraction has 6700 states and 9466 transitions. [2024-11-11 17:01:09,548 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 40.666666666666664) internal successors, (122), 2 states have internal predecessors, (122), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-11 17:01:09,549 INFO L276 IsEmpty]: Start isEmpty. Operand 6700 states and 9466 transitions. [2024-11-11 17:01:09,552 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 153 [2024-11-11 17:01:09,553 INFO L210 NwaCegarLoop]: Found error trace [2024-11-11 17:01:09,553 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2024-11-11 17:01:09,553 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-11-11 17:01:09,553 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-11 17:01:09,554 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-11 17:01:09,554 INFO L85 PathProgramCache]: Analyzing trace with hash -1922930380, now seen corresponding path program 1 times [2024-11-11 17:01:09,554 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-11 17:01:09,554 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [56204754] [2024-11-11 17:01:09,554 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 17:01:09,554 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-11 17:01:09,593 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 17:01:09,730 INFO L134 CoverageAnalysis]: Checked inductivity of 48 backedges. 48 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-11 17:01:09,731 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-11 17:01:09,731 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [56204754] [2024-11-11 17:01:09,731 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [56204754] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-11 17:01:09,731 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-11 17:01:09,731 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-11 17:01:09,731 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1319772641] [2024-11-11 17:01:09,732 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-11 17:01:09,732 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-11 17:01:09,732 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-11 17:01:09,733 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-11 17:01:09,733 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-11 17:01:09,733 INFO L87 Difference]: Start difference. First operand 6700 states and 9466 transitions. Second operand has 3 states, 3 states have (on average 50.666666666666664) internal successors, (152), 2 states have internal predecessors, (152), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-11 17:01:12,648 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-11 17:01:12,649 INFO L93 Difference]: Finished difference Result 17443 states and 24479 transitions. [2024-11-11 17:01:12,649 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-11 17:01:12,649 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 50.666666666666664) internal successors, (152), 2 states have internal predecessors, (152), 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 152 [2024-11-11 17:01:12,649 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-11 17:01:12,677 INFO L225 Difference]: With dead ends: 17443 [2024-11-11 17:01:12,678 INFO L226 Difference]: Without dead ends: 10745 [2024-11-11 17:01:12,691 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-11 17:01:12,692 INFO L435 NwaCegarLoop]: 834 mSDtfsCounter, 844 mSDsluCounter, 131 mSDsCounter, 0 mSdLazyCounter, 3291 mSolverCounterSat, 450 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 844 SdHoareTripleChecker+Valid, 965 SdHoareTripleChecker+Invalid, 3741 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 450 IncrementalHoareTripleChecker+Valid, 3291 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.8s IncrementalHoareTripleChecker+Time [2024-11-11 17:01:12,694 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [844 Valid, 965 Invalid, 3741 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [450 Valid, 3291 Invalid, 0 Unknown, 0 Unchecked, 2.8s Time] [2024-11-11 17:01:12,704 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10745 states. [2024-11-11 17:01:12,806 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10745 to 10669. [2024-11-11 17:01:12,820 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10669 states, 10668 states have (on average 1.3562992125984252) internal successors, (14469), 10668 states have internal predecessors, (14469), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-11 17:01:12,834 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10669 states to 10669 states and 14469 transitions. [2024-11-11 17:01:12,834 INFO L78 Accepts]: Start accepts. Automaton has 10669 states and 14469 transitions. Word has length 152 [2024-11-11 17:01:12,836 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-11 17:01:12,836 INFO L471 AbstractCegarLoop]: Abstraction has 10669 states and 14469 transitions. [2024-11-11 17:01:12,836 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 50.666666666666664) internal successors, (152), 2 states have internal predecessors, (152), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-11 17:01:12,836 INFO L276 IsEmpty]: Start isEmpty. Operand 10669 states and 14469 transitions. [2024-11-11 17:01:12,838 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 163 [2024-11-11 17:01:12,838 INFO L210 NwaCegarLoop]: Found error trace [2024-11-11 17:01:12,838 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-11 17:01:12,839 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-11-11 17:01:12,839 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-11 17:01:12,840 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-11 17:01:12,840 INFO L85 PathProgramCache]: Analyzing trace with hash -528449331, now seen corresponding path program 1 times [2024-11-11 17:01:12,840 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-11 17:01:12,840 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1039776446] [2024-11-11 17:01:12,841 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 17:01:12,841 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-11 17:01:12,872 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 17:01:13,121 INFO L134 CoverageAnalysis]: Checked inductivity of 48 backedges. 48 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-11 17:01:13,122 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-11 17:01:13,122 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1039776446] [2024-11-11 17:01:13,122 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1039776446] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-11 17:01:13,122 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-11 17:01:13,122 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-11 17:01:13,122 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [508669558] [2024-11-11 17:01:13,122 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-11 17:01:13,122 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-11 17:01:13,122 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-11 17:01:13,123 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-11 17:01:13,123 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-11 17:01:13,123 INFO L87 Difference]: Start difference. First operand 10669 states and 14469 transitions. Second operand has 3 states, 3 states have (on average 54.0) internal successors, (162), 2 states have internal predecessors, (162), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-11 17:01:15,192 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-11 17:01:15,192 INFO L93 Difference]: Finished difference Result 20549 states and 28119 transitions. [2024-11-11 17:01:15,193 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-11 17:01:15,193 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 54.0) internal successors, (162), 2 states have internal predecessors, (162), 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 162 [2024-11-11 17:01:15,193 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-11 17:01:15,223 INFO L225 Difference]: With dead ends: 20549 [2024-11-11 17:01:15,223 INFO L226 Difference]: Without dead ends: 10669 [2024-11-11 17:01:15,233 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-11 17:01:15,234 INFO L435 NwaCegarLoop]: 1083 mSDtfsCounter, 678 mSDsluCounter, 129 mSDsCounter, 0 mSdLazyCounter, 2520 mSolverCounterSat, 24 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 678 SdHoareTripleChecker+Valid, 1212 SdHoareTripleChecker+Invalid, 2544 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 24 IncrementalHoareTripleChecker+Valid, 2520 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.0s IncrementalHoareTripleChecker+Time [2024-11-11 17:01:15,235 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [678 Valid, 1212 Invalid, 2544 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [24 Valid, 2520 Invalid, 0 Unknown, 0 Unchecked, 2.0s Time] [2024-11-11 17:01:15,244 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10669 states. [2024-11-11 17:01:15,330 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10669 to 10669. [2024-11-11 17:01:15,348 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10669 states, 10668 states have (on average 1.3539557555305586) internal successors, (14444), 10668 states have internal predecessors, (14444), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-11 17:01:15,364 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10669 states to 10669 states and 14444 transitions. [2024-11-11 17:01:15,365 INFO L78 Accepts]: Start accepts. Automaton has 10669 states and 14444 transitions. Word has length 162 [2024-11-11 17:01:15,365 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-11 17:01:15,366 INFO L471 AbstractCegarLoop]: Abstraction has 10669 states and 14444 transitions. [2024-11-11 17:01:15,366 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 54.0) internal successors, (162), 2 states have internal predecessors, (162), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-11 17:01:15,366 INFO L276 IsEmpty]: Start isEmpty. Operand 10669 states and 14444 transitions. [2024-11-11 17:01:15,367 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 177 [2024-11-11 17:01:15,368 INFO L210 NwaCegarLoop]: Found error trace [2024-11-11 17:01:15,368 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2024-11-11 17:01:15,368 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-11-11 17:01:15,368 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-11 17:01:15,369 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-11 17:01:15,369 INFO L85 PathProgramCache]: Analyzing trace with hash -1216054921, now seen corresponding path program 1 times [2024-11-11 17:01:15,369 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-11 17:01:15,369 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1742747643] [2024-11-11 17:01:15,369 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 17:01:15,369 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-11 17:01:15,400 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 17:01:15,561 INFO L134 CoverageAnalysis]: Checked inductivity of 48 backedges. 0 proven. 48 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-11 17:01:15,561 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-11 17:01:15,561 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1742747643] [2024-11-11 17:01:15,562 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1742747643] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-11 17:01:15,562 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [641006548] [2024-11-11 17:01:15,562 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 17:01:15,563 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-11 17:01:15,563 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-11 17:01:15,564 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-11 17:01:15,565 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2024-11-11 17:01:15,641 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 17:01:15,643 INFO L256 TraceCheckSpWp]: Trace formula consists of 261 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-11-11 17:01:15,649 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-11 17:01:15,896 INFO L134 CoverageAnalysis]: Checked inductivity of 48 backedges. 0 proven. 48 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-11 17:01:15,897 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2024-11-11 17:01:16,816 INFO L134 CoverageAnalysis]: Checked inductivity of 48 backedges. 0 proven. 48 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-11 17:01:16,817 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [641006548] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-11 17:01:16,817 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-11 17:01:16,817 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 5 [2024-11-11 17:01:16,817 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [167519356] [2024-11-11 17:01:16,818 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-11 17:01:16,818 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-11 17:01:16,818 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-11 17:01:16,819 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-11 17:01:16,819 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2024-11-11 17:01:16,819 INFO L87 Difference]: Start difference. First operand 10669 states and 14444 transitions. Second operand has 6 states, 6 states have (on average 58.5) internal successors, (351), 5 states have internal predecessors, (351), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-11 17:01:26,679 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-11 17:01:26,679 INFO L93 Difference]: Finished difference Result 57154 states and 77638 transitions. [2024-11-11 17:01:26,681 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-11-11 17:01:26,682 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 58.5) internal successors, (351), 5 states have internal predecessors, (351), 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 176 [2024-11-11 17:01:26,684 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-11 17:01:26,762 INFO L225 Difference]: With dead ends: 57154 [2024-11-11 17:01:26,762 INFO L226 Difference]: Without dead ends: 47274 [2024-11-11 17:01:26,778 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 355 GetRequests, 349 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=35, Unknown=0, NotChecked=0, Total=56 [2024-11-11 17:01:26,782 INFO L435 NwaCegarLoop]: 307 mSDtfsCounter, 6980 mSDsluCounter, 792 mSDsCounter, 0 mSdLazyCounter, 9975 mSolverCounterSat, 4014 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 7.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6980 SdHoareTripleChecker+Valid, 1099 SdHoareTripleChecker+Invalid, 13989 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4014 IncrementalHoareTripleChecker+Valid, 9975 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 9.3s IncrementalHoareTripleChecker+Time [2024-11-11 17:01:26,783 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [6980 Valid, 1099 Invalid, 13989 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4014 Valid, 9975 Invalid, 0 Unknown, 0 Unchecked, 9.3s Time] [2024-11-11 17:01:26,823 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 47274 states. [2024-11-11 17:01:27,142 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 47274 to 24091. [2024-11-11 17:01:27,307 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 24091 states, 24090 states have (on average 1.2878372768783728) internal successors, (31024), 24090 states have internal predecessors, (31024), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-11 17:01:27,347 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24091 states to 24091 states and 31024 transitions. [2024-11-11 17:01:27,348 INFO L78 Accepts]: Start accepts. Automaton has 24091 states and 31024 transitions. Word has length 176 [2024-11-11 17:01:27,348 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-11 17:01:27,349 INFO L471 AbstractCegarLoop]: Abstraction has 24091 states and 31024 transitions. [2024-11-11 17:01:27,349 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 58.5) internal successors, (351), 5 states have internal predecessors, (351), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-11 17:01:27,349 INFO L276 IsEmpty]: Start isEmpty. Operand 24091 states and 31024 transitions. [2024-11-11 17:01:27,352 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 249 [2024-11-11 17:01:27,352 INFO L210 NwaCegarLoop]: Found error trace [2024-11-11 17:01:27,352 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-11 17:01:27,372 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2024-11-11 17:01:27,553 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable5 [2024-11-11 17:01:27,553 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-11 17:01:27,556 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-11 17:01:27,556 INFO L85 PathProgramCache]: Analyzing trace with hash -1810841034, now seen corresponding path program 1 times [2024-11-11 17:01:27,556 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-11 17:01:27,556 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [976174093] [2024-11-11 17:01:27,557 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 17:01:27,557 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-11 17:01:27,613 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 17:01:27,788 INFO L134 CoverageAnalysis]: Checked inductivity of 192 backedges. 192 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-11 17:01:27,788 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-11 17:01:27,788 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [976174093] [2024-11-11 17:01:27,788 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [976174093] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-11 17:01:27,788 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-11 17:01:27,789 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-11 17:01:27,789 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [947612994] [2024-11-11 17:01:27,789 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-11 17:01:27,790 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-11 17:01:27,790 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-11 17:01:27,790 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-11 17:01:27,790 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-11-11 17:01:27,791 INFO L87 Difference]: Start difference. First operand 24091 states and 31024 transitions. Second operand has 4 states, 4 states have (on average 62.0) internal successors, (248), 3 states have internal predecessors, (248), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-11 17:01:32,941 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-11 17:01:32,941 INFO L93 Difference]: Finished difference Result 66524 states and 87195 transitions. [2024-11-11 17:01:32,942 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-11 17:01:32,942 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 62.0) internal successors, (248), 3 states have internal predecessors, (248), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 248 [2024-11-11 17:01:32,942 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-11 17:01:33,176 INFO L225 Difference]: With dead ends: 66524 [2024-11-11 17:01:33,176 INFO L226 Difference]: Without dead ends: 43222 [2024-11-11 17:01:33,193 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-11-11 17:01:33,193 INFO L435 NwaCegarLoop]: 1022 mSDtfsCounter, 1727 mSDsluCounter, 203 mSDsCounter, 0 mSdLazyCounter, 6224 mSolverCounterSat, 994 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1727 SdHoareTripleChecker+Valid, 1225 SdHoareTripleChecker+Invalid, 7218 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 994 IncrementalHoareTripleChecker+Valid, 6224 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.8s IncrementalHoareTripleChecker+Time [2024-11-11 17:01:33,194 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1727 Valid, 1225 Invalid, 7218 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [994 Valid, 6224 Invalid, 0 Unknown, 0 Unchecked, 4.8s Time] [2024-11-11 17:01:33,217 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 43222 states. [2024-11-11 17:01:33,481 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 43222 to 31196. [2024-11-11 17:01:33,506 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 31196 states, 31195 states have (on average 1.263888443660843) internal successors, (39427), 31195 states have internal predecessors, (39427), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-11 17:01:33,538 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31196 states to 31196 states and 39427 transitions. [2024-11-11 17:01:33,538 INFO L78 Accepts]: Start accepts. Automaton has 31196 states and 39427 transitions. Word has length 248 [2024-11-11 17:01:33,539 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-11 17:01:33,539 INFO L471 AbstractCegarLoop]: Abstraction has 31196 states and 39427 transitions. [2024-11-11 17:01:33,539 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 62.0) internal successors, (248), 3 states have internal predecessors, (248), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-11 17:01:33,539 INFO L276 IsEmpty]: Start isEmpty. Operand 31196 states and 39427 transitions. [2024-11-11 17:01:33,541 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 264 [2024-11-11 17:01:33,541 INFO L210 NwaCegarLoop]: Found error trace [2024-11-11 17:01:33,541 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-11 17:01:33,542 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-11-11 17:01:33,542 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-11 17:01:33,542 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-11 17:01:33,542 INFO L85 PathProgramCache]: Analyzing trace with hash 1470073660, now seen corresponding path program 1 times [2024-11-11 17:01:33,542 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-11 17:01:33,543 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [273325667] [2024-11-11 17:01:33,543 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 17:01:33,543 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-11 17:01:33,575 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 17:01:33,747 INFO L134 CoverageAnalysis]: Checked inductivity of 192 backedges. 97 proven. 0 refuted. 0 times theorem prover too weak. 95 trivial. 0 not checked. [2024-11-11 17:01:33,748 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-11 17:01:33,748 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [273325667] [2024-11-11 17:01:33,748 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [273325667] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-11 17:01:33,748 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-11 17:01:33,748 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-11 17:01:33,748 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [370453587] [2024-11-11 17:01:33,749 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-11 17:01:33,749 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-11 17:01:33,749 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-11 17:01:33,749 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-11 17:01:33,750 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-11 17:01:33,750 INFO L87 Difference]: Start difference. First operand 31196 states and 39427 transitions. Second operand has 3 states, 3 states have (on average 56.333333333333336) internal successors, (169), 2 states have internal predecessors, (169), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-11 17:01:36,244 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-11 17:01:36,244 INFO L93 Difference]: Finished difference Result 55308 states and 71092 transitions. [2024-11-11 17:01:36,244 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-11 17:01:36,244 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 56.333333333333336) internal successors, (169), 2 states have internal predecessors, (169), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 263 [2024-11-11 17:01:36,244 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-11 17:01:36,277 INFO L225 Difference]: With dead ends: 55308 [2024-11-11 17:01:36,277 INFO L226 Difference]: Without dead ends: 31210 [2024-11-11 17:01:36,287 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-11 17:01:36,288 INFO L435 NwaCegarLoop]: 1027 mSDtfsCounter, 730 mSDsluCounter, 184 mSDsCounter, 0 mSdLazyCounter, 2711 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 730 SdHoareTripleChecker+Valid, 1211 SdHoareTripleChecker+Invalid, 2715 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 2711 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.3s IncrementalHoareTripleChecker+Time [2024-11-11 17:01:36,289 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [730 Valid, 1211 Invalid, 2715 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 2711 Invalid, 0 Unknown, 0 Unchecked, 2.3s Time] [2024-11-11 17:01:36,307 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31210 states. [2024-11-11 17:01:36,530 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31210 to 31196. [2024-11-11 17:01:36,553 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 31196 states, 31195 states have (on average 1.2626061868889245) internal successors, (39387), 31195 states have internal predecessors, (39387), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-11 17:01:36,585 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31196 states to 31196 states and 39387 transitions. [2024-11-11 17:01:36,585 INFO L78 Accepts]: Start accepts. Automaton has 31196 states and 39387 transitions. Word has length 263 [2024-11-11 17:01:36,586 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-11 17:01:36,586 INFO L471 AbstractCegarLoop]: Abstraction has 31196 states and 39387 transitions. [2024-11-11 17:01:36,586 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 56.333333333333336) internal successors, (169), 2 states have internal predecessors, (169), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-11 17:01:36,586 INFO L276 IsEmpty]: Start isEmpty. Operand 31196 states and 39387 transitions. [2024-11-11 17:01:36,588 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 279 [2024-11-11 17:01:36,588 INFO L210 NwaCegarLoop]: Found error trace [2024-11-11 17:01:36,589 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-11 17:01:36,589 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-11-11 17:01:36,589 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-11 17:01:36,589 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-11 17:01:36,589 INFO L85 PathProgramCache]: Analyzing trace with hash 722056462, now seen corresponding path program 1 times [2024-11-11 17:01:36,589 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-11 17:01:36,590 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [241670199] [2024-11-11 17:01:36,590 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 17:01:36,590 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-11 17:01:36,627 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 17:01:36,723 INFO L134 CoverageAnalysis]: Checked inductivity of 192 backedges. 192 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-11 17:01:36,724 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-11 17:01:36,724 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [241670199] [2024-11-11 17:01:36,725 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [241670199] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-11 17:01:36,725 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-11 17:01:36,725 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-11 17:01:36,725 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [209983886] [2024-11-11 17:01:36,726 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-11 17:01:36,726 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-11 17:01:36,727 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-11 17:01:36,728 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-11 17:01:36,728 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-11 17:01:36,728 INFO L87 Difference]: Start difference. First operand 31196 states and 39387 transitions. Second operand has 3 states, 3 states have (on average 92.66666666666667) internal successors, (278), 3 states have internal predecessors, (278), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-11 17:01:39,533 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-11 17:01:39,534 INFO L93 Difference]: Finished difference Result 88375 states and 112490 transitions. [2024-11-11 17:01:39,534 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-11 17:01:39,534 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 92.66666666666667) internal successors, (278), 3 states have internal predecessors, (278), 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 278 [2024-11-11 17:01:39,535 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-11 17:01:39,605 INFO L225 Difference]: With dead ends: 88375 [2024-11-11 17:01:39,605 INFO L226 Difference]: Without dead ends: 57968 [2024-11-11 17:01:39,636 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-11 17:01:39,637 INFO L435 NwaCegarLoop]: 1001 mSDtfsCounter, 789 mSDsluCounter, 119 mSDsCounter, 0 mSdLazyCounter, 2471 mSolverCounterSat, 850 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 789 SdHoareTripleChecker+Valid, 1120 SdHoareTripleChecker+Invalid, 3321 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 850 IncrementalHoareTripleChecker+Valid, 2471 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.5s IncrementalHoareTripleChecker+Time [2024-11-11 17:01:39,637 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [789 Valid, 1120 Invalid, 3321 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [850 Valid, 2471 Invalid, 0 Unknown, 0 Unchecked, 2.5s Time] [2024-11-11 17:01:39,681 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 57968 states. [2024-11-11 17:01:40,188 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 57968 to 56379. [2024-11-11 17:01:40,228 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 56379 states, 56378 states have (on average 1.2060378161694278) internal successors, (67994), 56378 states have internal predecessors, (67994), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-11 17:01:40,290 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 56379 states to 56379 states and 67994 transitions. [2024-11-11 17:01:40,291 INFO L78 Accepts]: Start accepts. Automaton has 56379 states and 67994 transitions. Word has length 278 [2024-11-11 17:01:40,291 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-11 17:01:40,291 INFO L471 AbstractCegarLoop]: Abstraction has 56379 states and 67994 transitions. [2024-11-11 17:01:40,291 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 92.66666666666667) internal successors, (278), 3 states have internal predecessors, (278), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-11 17:01:40,291 INFO L276 IsEmpty]: Start isEmpty. Operand 56379 states and 67994 transitions. [2024-11-11 17:01:40,295 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 338 [2024-11-11 17:01:40,295 INFO L210 NwaCegarLoop]: Found error trace [2024-11-11 17:01:40,295 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-11 17:01:40,296 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-11-11 17:01:40,296 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-11 17:01:40,296 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-11 17:01:40,296 INFO L85 PathProgramCache]: Analyzing trace with hash 196849213, now seen corresponding path program 1 times [2024-11-11 17:01:40,296 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-11 17:01:40,297 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [655322646] [2024-11-11 17:01:40,297 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 17:01:40,297 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-11 17:01:40,336 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 17:01:40,439 INFO L134 CoverageAnalysis]: Checked inductivity of 418 backedges. 330 proven. 0 refuted. 0 times theorem prover too weak. 88 trivial. 0 not checked. [2024-11-11 17:01:40,439 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-11 17:01:40,439 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [655322646] [2024-11-11 17:01:40,440 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [655322646] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-11 17:01:40,440 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-11 17:01:40,440 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-11 17:01:40,440 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2142534110] [2024-11-11 17:01:40,440 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-11 17:01:40,440 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-11 17:01:40,441 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-11 17:01:40,441 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-11 17:01:40,441 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-11 17:01:40,442 INFO L87 Difference]: Start difference. First operand 56379 states and 67994 transitions. Second operand has 3 states, 3 states have (on average 83.33333333333333) internal successors, (250), 3 states have internal predecessors, (250), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-11 17:01:43,172 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-11 17:01:43,172 INFO L93 Difference]: Finished difference Result 113552 states and 136795 transitions. [2024-11-11 17:01:43,172 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-11 17:01:43,173 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 83.33333333333333) internal successors, (250), 3 states have internal predecessors, (250), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 337 [2024-11-11 17:01:43,173 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-11 17:01:43,244 INFO L225 Difference]: With dead ends: 113552 [2024-11-11 17:01:43,244 INFO L226 Difference]: Without dead ends: 57962 [2024-11-11 17:01:43,281 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-11 17:01:43,282 INFO L435 NwaCegarLoop]: 1407 mSDtfsCounter, 944 mSDsluCounter, 94 mSDsCounter, 0 mSdLazyCounter, 2486 mSolverCounterSat, 624 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 944 SdHoareTripleChecker+Valid, 1501 SdHoareTripleChecker+Invalid, 3110 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 624 IncrementalHoareTripleChecker+Valid, 2486 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.3s IncrementalHoareTripleChecker+Time [2024-11-11 17:01:43,282 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [944 Valid, 1501 Invalid, 3110 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [624 Valid, 2486 Invalid, 0 Unknown, 0 Unchecked, 2.3s Time] [2024-11-11 17:01:43,324 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 57962 states. [2024-11-11 17:01:43,793 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 57962 to 56373. [2024-11-11 17:01:43,832 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 56373 states, 56372 states have (on average 1.1599198183495352) internal successors, (65387), 56372 states have internal predecessors, (65387), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-11 17:01:43,890 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 56373 states to 56373 states and 65387 transitions. [2024-11-11 17:01:43,891 INFO L78 Accepts]: Start accepts. Automaton has 56373 states and 65387 transitions. Word has length 337 [2024-11-11 17:01:43,891 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-11 17:01:43,891 INFO L471 AbstractCegarLoop]: Abstraction has 56373 states and 65387 transitions. [2024-11-11 17:01:43,891 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 83.33333333333333) internal successors, (250), 3 states have internal predecessors, (250), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-11 17:01:43,892 INFO L276 IsEmpty]: Start isEmpty. Operand 56373 states and 65387 transitions. [2024-11-11 17:01:43,896 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 368 [2024-11-11 17:01:43,896 INFO L210 NwaCegarLoop]: Found error trace [2024-11-11 17:01:43,897 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-11 17:01:43,897 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2024-11-11 17:01:43,897 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-11 17:01:43,897 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-11 17:01:43,897 INFO L85 PathProgramCache]: Analyzing trace with hash -471969901, now seen corresponding path program 1 times [2024-11-11 17:01:43,898 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-11 17:01:43,898 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [39386589] [2024-11-11 17:01:43,898 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 17:01:43,898 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-11 17:01:43,936 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 17:01:44,350 INFO L134 CoverageAnalysis]: Checked inductivity of 418 backedges. 146 proven. 0 refuted. 0 times theorem prover too weak. 272 trivial. 0 not checked. [2024-11-11 17:01:44,350 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-11 17:01:44,350 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [39386589] [2024-11-11 17:01:44,350 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [39386589] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-11 17:01:44,350 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-11 17:01:44,351 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-11 17:01:44,351 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2047953920] [2024-11-11 17:01:44,351 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-11 17:01:44,351 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-11 17:01:44,351 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-11 17:01:44,352 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-11 17:01:44,352 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-11 17:01:44,352 INFO L87 Difference]: Start difference. First operand 56373 states and 65387 transitions. Second operand has 3 states, 3 states have (on average 61.666666666666664) internal successors, (185), 3 states have internal predecessors, (185), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-11 17:01:47,136 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-11 17:01:47,136 INFO L93 Difference]: Finished difference Result 120604 states and 140999 transitions. [2024-11-11 17:01:47,136 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-11 17:01:47,137 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 61.666666666666664) internal successors, (185), 3 states have internal predecessors, (185), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 367 [2024-11-11 17:01:47,137 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-11 17:01:47,209 INFO L225 Difference]: With dead ends: 120604 [2024-11-11 17:01:47,210 INFO L226 Difference]: Without dead ends: 65020 [2024-11-11 17:01:47,243 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-11 17:01:47,244 INFO L435 NwaCegarLoop]: 1461 mSDtfsCounter, 1111 mSDsluCounter, 88 mSDsCounter, 0 mSdLazyCounter, 2399 mSolverCounterSat, 770 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1111 SdHoareTripleChecker+Valid, 1549 SdHoareTripleChecker+Invalid, 3169 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 770 IncrementalHoareTripleChecker+Valid, 2399 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.3s IncrementalHoareTripleChecker+Time [2024-11-11 17:01:47,244 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1111 Valid, 1549 Invalid, 3169 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [770 Valid, 2399 Invalid, 0 Unknown, 0 Unchecked, 2.3s Time] [2024-11-11 17:01:47,289 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 65020 states. [2024-11-11 17:01:47,895 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 65020 to 65018. [2024-11-11 17:01:47,928 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 65018 states, 65017 states have (on average 1.1308273220849931) internal successors, (73523), 65017 states have internal predecessors, (73523), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-11 17:01:48,019 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 65018 states to 65018 states and 73523 transitions. [2024-11-11 17:01:48,020 INFO L78 Accepts]: Start accepts. Automaton has 65018 states and 73523 transitions. Word has length 367 [2024-11-11 17:01:48,020 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-11 17:01:48,020 INFO L471 AbstractCegarLoop]: Abstraction has 65018 states and 73523 transitions. [2024-11-11 17:01:48,020 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 61.666666666666664) internal successors, (185), 3 states have internal predecessors, (185), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-11 17:01:48,020 INFO L276 IsEmpty]: Start isEmpty. Operand 65018 states and 73523 transitions. [2024-11-11 17:01:48,026 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 381 [2024-11-11 17:01:48,026 INFO L210 NwaCegarLoop]: Found error trace [2024-11-11 17:01:48,026 INFO L218 NwaCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 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, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-11 17:01:48,027 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2024-11-11 17:01:48,027 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-11 17:01:48,027 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-11 17:01:48,027 INFO L85 PathProgramCache]: Analyzing trace with hash 1657202739, now seen corresponding path program 1 times [2024-11-11 17:01:48,027 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-11 17:01:48,027 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [696908244] [2024-11-11 17:01:48,027 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 17:01:48,028 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-11 17:01:48,086 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 17:01:48,252 INFO L134 CoverageAnalysis]: Checked inductivity of 640 backedges. 195 proven. 0 refuted. 0 times theorem prover too weak. 445 trivial. 0 not checked. [2024-11-11 17:01:48,252 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-11 17:01:48,252 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [696908244] [2024-11-11 17:01:48,253 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [696908244] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-11 17:01:48,253 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-11 17:01:48,253 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-11 17:01:48,254 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1709176503] [2024-11-11 17:01:48,254 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-11 17:01:48,254 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-11 17:01:48,255 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-11 17:01:48,255 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-11 17:01:48,255 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-11 17:01:48,255 INFO L87 Difference]: Start difference. First operand 65018 states and 73523 transitions. Second operand has 3 states, 3 states have (on average 50.333333333333336) internal successors, (151), 3 states have internal predecessors, (151), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-11 17:01:51,096 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-11 17:01:51,097 INFO L93 Difference]: Finished difference Result 152095 states and 171572 transitions. [2024-11-11 17:01:51,097 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-11 17:01:51,097 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 50.333333333333336) internal successors, (151), 3 states have internal predecessors, (151), 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 380 [2024-11-11 17:01:51,098 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-11 17:01:51,191 INFO L225 Difference]: With dead ends: 152095 [2024-11-11 17:01:51,192 INFO L226 Difference]: Without dead ends: 87866 [2024-11-11 17:01:51,221 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-11 17:01:51,221 INFO L435 NwaCegarLoop]: 1322 mSDtfsCounter, 1052 mSDsluCounter, 50 mSDsCounter, 0 mSdLazyCounter, 2474 mSolverCounterSat, 701 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1052 SdHoareTripleChecker+Valid, 1372 SdHoareTripleChecker+Invalid, 3175 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 701 IncrementalHoareTripleChecker+Valid, 2474 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.3s IncrementalHoareTripleChecker+Time [2024-11-11 17:01:51,221 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1052 Valid, 1372 Invalid, 3175 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [701 Valid, 2474 Invalid, 0 Unknown, 0 Unchecked, 2.3s Time] [2024-11-11 17:01:51,280 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 87866 states. [2024-11-11 17:01:51,915 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 87866 to 85477. [2024-11-11 17:01:51,967 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 85477 states, 85476 states have (on average 1.1183607094389068) internal successors, (95593), 85476 states have internal predecessors, (95593), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-11 17:01:52,305 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 85477 states to 85477 states and 95593 transitions. [2024-11-11 17:01:52,305 INFO L78 Accepts]: Start accepts. Automaton has 85477 states and 95593 transitions. Word has length 380 [2024-11-11 17:01:52,313 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-11 17:01:52,314 INFO L471 AbstractCegarLoop]: Abstraction has 85477 states and 95593 transitions. [2024-11-11 17:01:52,314 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 50.333333333333336) internal successors, (151), 3 states have internal predecessors, (151), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-11 17:01:52,314 INFO L276 IsEmpty]: Start isEmpty. Operand 85477 states and 95593 transitions. [2024-11-11 17:01:52,333 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 420 [2024-11-11 17:01:52,333 INFO L210 NwaCegarLoop]: Found error trace [2024-11-11 17:01:52,333 INFO L218 NwaCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 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, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-11 17:01:52,334 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2024-11-11 17:01:52,334 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-11 17:01:52,334 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-11 17:01:52,335 INFO L85 PathProgramCache]: Analyzing trace with hash -26732311, now seen corresponding path program 1 times [2024-11-11 17:01:52,335 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-11 17:01:52,335 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [175997131] [2024-11-11 17:01:52,335 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 17:01:52,335 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-11 17:01:52,410 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 17:01:52,665 INFO L134 CoverageAnalysis]: Checked inductivity of 712 backedges. 575 proven. 0 refuted. 0 times theorem prover too weak. 137 trivial. 0 not checked. [2024-11-11 17:01:52,666 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-11 17:01:52,666 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [175997131] [2024-11-11 17:01:52,666 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [175997131] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-11 17:01:52,666 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-11 17:01:52,666 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-11 17:01:52,666 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1389723229] [2024-11-11 17:01:52,666 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-11 17:01:52,667 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-11 17:01:52,667 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-11 17:01:52,668 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-11 17:01:52,668 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-11 17:01:52,668 INFO L87 Difference]: Start difference. First operand 85477 states and 95593 transitions. Second operand has 3 states, 3 states have (on average 94.66666666666667) internal successors, (284), 3 states have internal predecessors, (284), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-11 17:01:55,710 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-11 17:01:55,711 INFO L93 Difference]: Finished difference Result 194571 states and 218926 transitions. [2024-11-11 17:01:55,711 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-11 17:01:55,712 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 94.66666666666667) internal successors, (284), 3 states have internal predecessors, (284), 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 419 [2024-11-11 17:01:55,712 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-11 17:01:55,856 INFO L225 Difference]: With dead ends: 194571 [2024-11-11 17:01:55,856 INFO L226 Difference]: Without dead ends: 109883 [2024-11-11 17:01:55,869 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-11 17:01:55,870 INFO L435 NwaCegarLoop]: 718 mSDtfsCounter, 950 mSDsluCounter, 86 mSDsCounter, 0 mSdLazyCounter, 2396 mSolverCounterSat, 803 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 950 SdHoareTripleChecker+Valid, 804 SdHoareTripleChecker+Invalid, 3199 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 803 IncrementalHoareTripleChecker+Valid, 2396 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.4s IncrementalHoareTripleChecker+Time [2024-11-11 17:01:55,870 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [950 Valid, 804 Invalid, 3199 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [803 Valid, 2396 Invalid, 0 Unknown, 0 Unchecked, 2.4s Time] [2024-11-11 17:01:55,950 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 109883 states. [2024-11-11 17:01:57,040 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 109883 to 108287. [2024-11-11 17:01:57,112 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 108287 states, 108286 states have (on average 1.1078994514526348) internal successors, (119970), 108286 states have internal predecessors, (119970), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-11 17:01:57,441 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 108287 states to 108287 states and 119970 transitions. [2024-11-11 17:01:57,442 INFO L78 Accepts]: Start accepts. Automaton has 108287 states and 119970 transitions. Word has length 419 [2024-11-11 17:01:57,442 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-11 17:01:57,442 INFO L471 AbstractCegarLoop]: Abstraction has 108287 states and 119970 transitions. [2024-11-11 17:01:57,442 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 94.66666666666667) internal successors, (284), 3 states have internal predecessors, (284), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-11 17:01:57,442 INFO L276 IsEmpty]: Start isEmpty. Operand 108287 states and 119970 transitions. [2024-11-11 17:01:57,455 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 435 [2024-11-11 17:01:57,456 INFO L210 NwaCegarLoop]: Found error trace [2024-11-11 17:01:57,456 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2024-11-11 17:01:57,456 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2024-11-11 17:01:57,460 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-11 17:01:57,461 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-11 17:01:57,461 INFO L85 PathProgramCache]: Analyzing trace with hash 543900027, now seen corresponding path program 1 times [2024-11-11 17:01:57,461 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-11 17:01:57,461 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1163732542] [2024-11-11 17:01:57,461 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 17:01:57,461 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-11 17:01:57,561 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 17:01:57,772 INFO L134 CoverageAnalysis]: Checked inductivity of 405 backedges. 281 proven. 0 refuted. 0 times theorem prover too weak. 124 trivial. 0 not checked. [2024-11-11 17:01:57,772 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-11 17:01:57,772 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1163732542] [2024-11-11 17:01:57,772 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1163732542] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-11 17:01:57,772 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-11 17:01:57,772 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-11 17:01:57,773 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1613468506] [2024-11-11 17:01:57,773 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-11 17:01:57,773 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-11 17:01:57,773 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-11 17:01:57,774 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-11 17:01:57,774 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-11 17:01:57,774 INFO L87 Difference]: Start difference. First operand 108287 states and 119970 transitions. Second operand has 3 states, 3 states have (on average 103.66666666666667) internal successors, (311), 3 states have internal predecessors, (311), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-11 17:02:01,520 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-11 17:02:01,520 INFO L93 Difference]: Finished difference Result 291509 states and 323010 transitions. [2024-11-11 17:02:01,521 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-11 17:02:01,521 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 103.66666666666667) internal successors, (311), 3 states have internal predecessors, (311), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 434 [2024-11-11 17:02:01,522 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-11 17:02:01,741 INFO L225 Difference]: With dead ends: 291509 [2024-11-11 17:02:01,741 INFO L226 Difference]: Without dead ends: 184011 [2024-11-11 17:02:01,763 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-11 17:02:01,763 INFO L435 NwaCegarLoop]: 844 mSDtfsCounter, 1056 mSDsluCounter, 198 mSDsCounter, 0 mSdLazyCounter, 2675 mSolverCounterSat, 523 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1056 SdHoareTripleChecker+Valid, 1042 SdHoareTripleChecker+Invalid, 3198 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 523 IncrementalHoareTripleChecker+Valid, 2675 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.7s IncrementalHoareTripleChecker+Time [2024-11-11 17:02:01,763 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1056 Valid, 1042 Invalid, 3198 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [523 Valid, 2675 Invalid, 0 Unknown, 0 Unchecked, 2.7s Time] [2024-11-11 17:02:01,920 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 184011 states. [2024-11-11 17:02:03,627 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 184011 to 180824. [2024-11-11 17:02:03,706 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 180824 states, 180823 states have (on average 1.0902097631385388) internal successors, (197135), 180823 states have internal predecessors, (197135), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-11 17:02:03,913 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 180824 states to 180824 states and 197135 transitions. [2024-11-11 17:02:03,915 INFO L78 Accepts]: Start accepts. Automaton has 180824 states and 197135 transitions. Word has length 434 [2024-11-11 17:02:03,915 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-11 17:02:03,915 INFO L471 AbstractCegarLoop]: Abstraction has 180824 states and 197135 transitions. [2024-11-11 17:02:03,915 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 103.66666666666667) internal successors, (311), 3 states have internal predecessors, (311), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-11 17:02:03,915 INFO L276 IsEmpty]: Start isEmpty. Operand 180824 states and 197135 transitions. [2024-11-11 17:02:03,921 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 446 [2024-11-11 17:02:03,921 INFO L210 NwaCegarLoop]: Found error trace [2024-11-11 17:02:03,921 INFO L218 NwaCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 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] [2024-11-11 17:02:03,921 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2024-11-11 17:02:03,921 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-11 17:02:03,922 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-11 17:02:03,922 INFO L85 PathProgramCache]: Analyzing trace with hash 1008979966, now seen corresponding path program 1 times [2024-11-11 17:02:03,922 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-11 17:02:03,922 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1245539976] [2024-11-11 17:02:03,922 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 17:02:03,922 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-11 17:02:03,967 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 17:02:05,294 INFO L134 CoverageAnalysis]: Checked inductivity of 680 backedges. 404 proven. 110 refuted. 0 times theorem prover too weak. 166 trivial. 0 not checked. [2024-11-11 17:02:05,294 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-11 17:02:05,294 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1245539976] [2024-11-11 17:02:05,295 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1245539976] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-11 17:02:05,295 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [4365057] [2024-11-11 17:02:05,295 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 17:02:05,295 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-11 17:02:05,295 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-11 17:02:05,296 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-11 17:02:05,298 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2024-11-11 17:02:05,437 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 17:02:05,439 INFO L256 TraceCheckSpWp]: Trace formula consists of 609 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-11-11 17:02:05,449 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-11 17:02:05,972 INFO L134 CoverageAnalysis]: Checked inductivity of 680 backedges. 401 proven. 0 refuted. 0 times theorem prover too weak. 279 trivial. 0 not checked. [2024-11-11 17:02:05,972 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-11 17:02:05,973 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [4365057] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-11 17:02:05,973 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-11 17:02:05,973 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [5] total 6 [2024-11-11 17:02:05,973 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [455105786] [2024-11-11 17:02:05,973 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-11 17:02:05,973 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-11 17:02:05,974 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-11 17:02:05,974 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-11 17:02:05,974 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2024-11-11 17:02:05,974 INFO L87 Difference]: Start difference. First operand 180824 states and 197135 transitions. Second operand has 3 states, 3 states have (on average 72.66666666666667) internal successors, (218), 2 states have internal predecessors, (218), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-11 17:02:09,127 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-11 17:02:09,127 INFO L93 Difference]: Finished difference Result 345918 states and 378381 transitions. [2024-11-11 17:02:09,128 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-11 17:02:09,128 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 72.66666666666667) internal successors, (218), 2 states have internal predecessors, (218), 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 445 [2024-11-11 17:02:09,128 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-11 17:02:09,392 INFO L225 Difference]: With dead ends: 345918 [2024-11-11 17:02:09,393 INFO L226 Difference]: Without dead ends: 187139 [2024-11-11 17:02:09,466 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 449 GetRequests, 444 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2024-11-11 17:02:09,466 INFO L435 NwaCegarLoop]: 1010 mSDtfsCounter, 684 mSDsluCounter, 134 mSDsCounter, 0 mSdLazyCounter, 2448 mSolverCounterSat, 152 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 684 SdHoareTripleChecker+Valid, 1144 SdHoareTripleChecker+Invalid, 2600 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 152 IncrementalHoareTripleChecker+Valid, 2448 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.1s IncrementalHoareTripleChecker+Time [2024-11-11 17:02:09,466 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [684 Valid, 1144 Invalid, 2600 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [152 Valid, 2448 Invalid, 0 Unknown, 0 Unchecked, 2.1s Time] [2024-11-11 17:02:09,630 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 187139 states. [2024-11-11 17:02:11,382 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 187139 to 187121. [2024-11-11 17:02:11,512 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 187121 states, 187120 states have (on average 1.0806861906797778) internal successors, (202218), 187120 states have internal predecessors, (202218), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-11 17:02:11,801 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 187121 states to 187121 states and 202218 transitions. [2024-11-11 17:02:11,802 INFO L78 Accepts]: Start accepts. Automaton has 187121 states and 202218 transitions. Word has length 445 [2024-11-11 17:02:11,802 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-11 17:02:11,802 INFO L471 AbstractCegarLoop]: Abstraction has 187121 states and 202218 transitions. [2024-11-11 17:02:11,802 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 72.66666666666667) internal successors, (218), 2 states have internal predecessors, (218), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-11 17:02:11,803 INFO L276 IsEmpty]: Start isEmpty. Operand 187121 states and 202218 transitions. [2024-11-11 17:02:11,810 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 482 [2024-11-11 17:02:11,810 INFO L210 NwaCegarLoop]: Found error trace [2024-11-11 17:02:11,810 INFO L218 NwaCegarLoop]: trace histogram [6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 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, 1, 1, 1, 1, 1] [2024-11-11 17:02:11,823 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2024-11-11 17:02:12,011 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable14 [2024-11-11 17:02:12,011 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-11 17:02:12,012 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-11 17:02:12,012 INFO L85 PathProgramCache]: Analyzing trace with hash 252167170, now seen corresponding path program 1 times [2024-11-11 17:02:12,012 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-11 17:02:12,012 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [873909636] [2024-11-11 17:02:12,012 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 17:02:12,012 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-11 17:02:12,086 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 17:02:12,647 INFO L134 CoverageAnalysis]: Checked inductivity of 1017 backedges. 572 proven. 0 refuted. 0 times theorem prover too weak. 445 trivial. 0 not checked. [2024-11-11 17:02:12,647 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-11 17:02:12,647 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [873909636] [2024-11-11 17:02:12,647 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [873909636] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-11 17:02:12,647 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-11 17:02:12,647 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-11 17:02:12,648 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1180199822] [2024-11-11 17:02:12,648 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-11 17:02:12,648 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-11 17:02:12,648 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-11 17:02:12,649 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-11 17:02:12,649 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-11 17:02:12,649 INFO L87 Difference]: Start difference. First operand 187121 states and 202218 transitions. Second operand has 3 states, 3 states have (on average 84.0) internal successors, (252), 3 states have internal predecessors, (252), 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)