./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/combinations/pals_lcr.8.ufo.BOUNDED-16.pals+Problem12_label04.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/combinations/pals_lcr.8.ufo.BOUNDED-16.pals+Problem12_label04.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 8d30821bc76d9d6de114a752bdb0189de63ec53e34d38d02148142a86b1fc84b --- Real Ultimate output --- This is Ultimate 0.2.5-wip.dk.perfect-tracechecks-8be7027-m [2024-11-11 22:51:10,555 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-11 22:51:10,612 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-11-11 22:51:10,615 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-11 22:51:10,615 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-11 22:51:10,628 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-11 22:51:10,628 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-11 22:51:10,628 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-11 22:51:10,629 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-11 22:51:10,629 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-11 22:51:10,629 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-11 22:51:10,630 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-11 22:51:10,630 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-11 22:51:10,630 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-11 22:51:10,631 INFO L153 SettingsManager]: * Use SBE=true [2024-11-11 22:51:10,631 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-11 22:51:10,631 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-11 22:51:10,631 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-11 22:51:10,632 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-11 22:51:10,632 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-11 22:51:10,632 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-11 22:51:10,638 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-11 22:51:10,639 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-11 22:51:10,639 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-11 22:51:10,639 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-11 22:51:10,639 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-11 22:51:10,640 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-11 22:51:10,640 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-11 22:51:10,640 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-11 22:51:10,640 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-11 22:51:10,640 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-11 22:51:10,641 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-11 22:51:10,641 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-11 22:51:10,641 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-11 22:51:10,641 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-11 22:51:10,641 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-11 22:51:10,642 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-11 22:51:10,642 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-11 22:51:10,642 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-11 22:51:10,642 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-11 22:51:10,642 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-11 22:51:10,642 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-11 22:51:10,643 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 -> 8d30821bc76d9d6de114a752bdb0189de63ec53e34d38d02148142a86b1fc84b [2024-11-11 22:51:10,990 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-11 22:51:11,010 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-11 22:51:11,012 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-11 22:51:11,013 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-11 22:51:11,013 INFO L274 PluginConnector]: CDTParser initialized [2024-11-11 22:51:11,015 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/combinations/pals_lcr.8.ufo.BOUNDED-16.pals+Problem12_label04.c [2024-11-11 22:51:12,509 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-11 22:51:12,832 INFO L384 CDTParser]: Found 1 translation units. [2024-11-11 22:51:12,833 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/combinations/pals_lcr.8.ufo.BOUNDED-16.pals+Problem12_label04.c [2024-11-11 22:51:12,864 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/a8aedc364/d619ff5c987f4fdbb466ac6f326e0c74/FLAGf277f32eb [2024-11-11 22:51:12,877 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/a8aedc364/d619ff5c987f4fdbb466ac6f326e0c74 [2024-11-11 22:51:12,880 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-11 22:51:12,881 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-11 22:51:12,882 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-11 22:51:12,882 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-11 22:51:12,887 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-11 22:51:12,887 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.11 10:51:12" (1/1) ... [2024-11-11 22:51:12,889 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@789d3f06 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.11 10:51:12, skipping insertion in model container [2024-11-11 22:51:12,889 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.11 10:51:12" (1/1) ... [2024-11-11 22:51:13,067 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-11 22:51:13,500 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/combinations/pals_lcr.8.ufo.BOUNDED-16.pals+Problem12_label04.c[26860,26873] [2024-11-11 22:51:13,541 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/combinations/pals_lcr.8.ufo.BOUNDED-16.pals+Problem12_label04.c[33921,33934] [2024-11-11 22:51:14,066 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-11 22:51:14,081 INFO L200 MainTranslator]: Completed pre-run [2024-11-11 22:51:14,175 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/combinations/pals_lcr.8.ufo.BOUNDED-16.pals+Problem12_label04.c[26860,26873] [2024-11-11 22:51:14,181 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/combinations/pals_lcr.8.ufo.BOUNDED-16.pals+Problem12_label04.c[33921,33934] [2024-11-11 22:51:14,446 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-11 22:51:14,472 INFO L204 MainTranslator]: Completed translation [2024-11-11 22:51:14,472 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.11 10:51:14 WrapperNode [2024-11-11 22:51:14,473 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-11 22:51:14,474 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-11 22:51:14,474 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-11 22:51:14,474 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-11 22:51:14,479 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.11 10:51:14" (1/1) ... [2024-11-11 22:51:14,518 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.11 10:51:14" (1/1) ... [2024-11-11 22:51:14,717 INFO L138 Inliner]: procedures = 39, calls = 25, calls flagged for inlining = 20, calls inlined = 20, statements flattened = 5293 [2024-11-11 22:51:14,718 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-11 22:51:14,718 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-11 22:51:14,718 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-11 22:51:14,718 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-11 22:51:14,727 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.11 10:51:14" (1/1) ... [2024-11-11 22:51:14,727 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.11 10:51:14" (1/1) ... [2024-11-11 22:51:14,766 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.11 10:51:14" (1/1) ... [2024-11-11 22:51:15,007 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 22:51:15,008 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.11 10:51:14" (1/1) ... [2024-11-11 22:51:15,008 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.11 10:51:14" (1/1) ... [2024-11-11 22:51:15,183 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.11 10:51:14" (1/1) ... [2024-11-11 22:51:15,207 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.11 10:51:14" (1/1) ... [2024-11-11 22:51:15,231 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.11 10:51:14" (1/1) ... [2024-11-11 22:51:15,247 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.11 10:51:14" (1/1) ... [2024-11-11 22:51:15,311 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-11 22:51:15,313 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-11 22:51:15,313 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-11 22:51:15,314 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-11 22:51:15,314 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.11 10:51:14" (1/1) ... [2024-11-11 22:51:15,319 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-11 22:51:15,330 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-11 22:51:15,347 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 22:51:15,349 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 22:51:15,389 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-11 22:51:15,390 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-11-11 22:51:15,390 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-11 22:51:15,390 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-11 22:51:15,539 INFO L238 CfgBuilder]: Building ICFG [2024-11-11 22:51:15,541 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-11 22:51:19,150 INFO L? ?]: Removed 759 outVars from TransFormulas that were not future-live. [2024-11-11 22:51:19,150 INFO L287 CfgBuilder]: Performing block encoding [2024-11-11 22:51:19,174 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-11 22:51:19,175 INFO L316 CfgBuilder]: Removed 2 assume(true) statements. [2024-11-11 22:51:19,175 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.11 10:51:19 BoogieIcfgContainer [2024-11-11 22:51:19,175 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-11 22:51:19,177 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-11 22:51:19,177 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-11 22:51:19,179 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-11 22:51:19,179 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 11.11 10:51:12" (1/3) ... [2024-11-11 22:51:19,180 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4d58f8fa and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.11 10:51:19, skipping insertion in model container [2024-11-11 22:51:19,180 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.11 10:51:14" (2/3) ... [2024-11-11 22:51:19,180 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4d58f8fa and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.11 10:51:19, skipping insertion in model container [2024-11-11 22:51:19,180 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.11 10:51:19" (3/3) ... [2024-11-11 22:51:19,181 INFO L112 eAbstractionObserver]: Analyzing ICFG pals_lcr.8.ufo.BOUNDED-16.pals+Problem12_label04.c [2024-11-11 22:51:19,193 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-11 22:51:19,193 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 2 error locations. [2024-11-11 22:51:19,256 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-11 22:51:19,260 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;@55ef3933, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-11 22:51:19,261 INFO L334 AbstractCegarLoop]: Starting to check reachability of 2 error locations. [2024-11-11 22:51:19,267 INFO L276 IsEmpty]: Start isEmpty. Operand has 947 states, 944 states have (on average 1.9036016949152543) internal successors, (1797), 946 states have internal predecessors, (1797), 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 22:51:19,273 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2024-11-11 22:51:19,273 INFO L210 NwaCegarLoop]: Found error trace [2024-11-11 22:51:19,274 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] [2024-11-11 22:51:19,274 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-11 22:51:19,279 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-11 22:51:19,279 INFO L85 PathProgramCache]: Analyzing trace with hash -60564882, now seen corresponding path program 1 times [2024-11-11 22:51:19,285 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-11 22:51:19,286 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1727912866] [2024-11-11 22:51:19,286 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 22:51:19,286 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-11 22:51:19,486 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 22:51:19,582 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 22:51:19,586 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-11 22:51:19,587 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1727912866] [2024-11-11 22:51:19,587 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1727912866] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-11 22:51:19,587 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-11 22:51:19,587 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-11 22:51:19,588 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1386806771] [2024-11-11 22:51:19,589 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-11 22:51:19,595 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-11-11 22:51:19,599 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-11 22:51:19,627 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-11-11 22:51:19,631 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-11 22:51:19,635 INFO L87 Difference]: Start difference. First operand has 947 states, 944 states have (on average 1.9036016949152543) internal successors, (1797), 946 states have internal predecessors, (1797), 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 2 states, 2 states have (on average 15.0) internal successors, (30), 2 states have internal predecessors, (30), 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 22:51:19,753 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-11 22:51:19,753 INFO L93 Difference]: Finished difference Result 1827 states and 3464 transitions. [2024-11-11 22:51:19,754 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-11 22:51:19,755 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 15.0) internal successors, (30), 2 states have internal predecessors, (30), 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 30 [2024-11-11 22:51:19,756 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-11 22:51:19,770 INFO L225 Difference]: With dead ends: 1827 [2024-11-11 22:51:19,770 INFO L226 Difference]: Without dead ends: 881 [2024-11-11 22:51:19,781 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-11 22:51:19,784 INFO L435 NwaCegarLoop]: 1731 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 0 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 1731 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-11 22:51:19,785 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 1731 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-11 22:51:19,801 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 881 states. [2024-11-11 22:51:19,842 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 881 to 881. [2024-11-11 22:51:19,845 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 881 states, 879 states have (on average 1.8930602957906713) internal successors, (1664), 880 states have internal predecessors, (1664), 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 22:51:19,849 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 881 states to 881 states and 1664 transitions. [2024-11-11 22:51:19,851 INFO L78 Accepts]: Start accepts. Automaton has 881 states and 1664 transitions. Word has length 30 [2024-11-11 22:51:19,851 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-11 22:51:19,851 INFO L471 AbstractCegarLoop]: Abstraction has 881 states and 1664 transitions. [2024-11-11 22:51:19,851 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 15.0) internal successors, (30), 2 states have internal predecessors, (30), 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 22:51:19,852 INFO L276 IsEmpty]: Start isEmpty. Operand 881 states and 1664 transitions. [2024-11-11 22:51:19,853 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2024-11-11 22:51:19,854 INFO L210 NwaCegarLoop]: Found error trace [2024-11-11 22:51:19,854 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] [2024-11-11 22:51:19,854 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-11 22:51:19,854 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-11 22:51:19,855 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-11 22:51:19,855 INFO L85 PathProgramCache]: Analyzing trace with hash -194578388, now seen corresponding path program 1 times [2024-11-11 22:51:19,855 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-11 22:51:19,855 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1917436913] [2024-11-11 22:51:19,856 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 22:51:19,856 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-11 22:51:19,900 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 22:51:20,055 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 22:51:20,055 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-11 22:51:20,056 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1917436913] [2024-11-11 22:51:20,056 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1917436913] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-11 22:51:20,056 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-11 22:51:20,056 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-11 22:51:20,056 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1943554712] [2024-11-11 22:51:20,056 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-11 22:51:20,057 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-11 22:51:20,057 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-11 22:51:20,058 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-11 22:51:20,058 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-11 22:51:20,058 INFO L87 Difference]: Start difference. First operand 881 states and 1664 transitions. Second operand has 5 states, 5 states have (on average 6.0) internal successors, (30), 5 states have internal predecessors, (30), 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 22:51:20,156 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-11 22:51:20,156 INFO L93 Difference]: Finished difference Result 945 states and 1765 transitions. [2024-11-11 22:51:20,157 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-11 22:51:20,157 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 6.0) internal successors, (30), 5 states have internal predecessors, (30), 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 30 [2024-11-11 22:51:20,157 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-11 22:51:20,160 INFO L225 Difference]: With dead ends: 945 [2024-11-11 22:51:20,161 INFO L226 Difference]: Without dead ends: 881 [2024-11-11 22:51:20,161 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-11 22:51:20,162 INFO L435 NwaCegarLoop]: 1662 mSDtfsCounter, 0 mSDsluCounter, 4920 mSDsCounter, 0 mSdLazyCounter, 13 mSolverCounterSat, 60 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 6582 SdHoareTripleChecker+Invalid, 73 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 60 IncrementalHoareTripleChecker+Valid, 13 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-11 22:51:20,163 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 6582 Invalid, 73 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [60 Valid, 13 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-11 22:51:20,164 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 881 states. [2024-11-11 22:51:20,179 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 881 to 881. [2024-11-11 22:51:20,180 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 881 states, 879 states have (on average 1.8236632536973834) internal successors, (1603), 880 states have internal predecessors, (1603), 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 22:51:20,183 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 881 states to 881 states and 1603 transitions. [2024-11-11 22:51:20,183 INFO L78 Accepts]: Start accepts. Automaton has 881 states and 1603 transitions. Word has length 30 [2024-11-11 22:51:20,183 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-11 22:51:20,184 INFO L471 AbstractCegarLoop]: Abstraction has 881 states and 1603 transitions. [2024-11-11 22:51:20,184 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 6.0) internal successors, (30), 5 states have internal predecessors, (30), 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 22:51:20,184 INFO L276 IsEmpty]: Start isEmpty. Operand 881 states and 1603 transitions. [2024-11-11 22:51:20,187 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2024-11-11 22:51:20,188 INFO L210 NwaCegarLoop]: Found error trace [2024-11-11 22:51:20,188 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-11 22:51:20,189 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-11 22:51:20,189 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-11 22:51:20,189 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-11 22:51:20,189 INFO L85 PathProgramCache]: Analyzing trace with hash 240567268, now seen corresponding path program 1 times [2024-11-11 22:51:20,189 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-11 22:51:20,190 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [164208445] [2024-11-11 22:51:20,190 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 22:51:20,190 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-11 22:51:20,222 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 22:51:20,368 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 22:51:20,370 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-11 22:51:20,370 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [164208445] [2024-11-11 22:51:20,370 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [164208445] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-11 22:51:20,370 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-11 22:51:20,370 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-11 22:51:20,371 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1496317208] [2024-11-11 22:51:20,371 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-11 22:51:20,372 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-11 22:51:20,372 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-11 22:51:20,373 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-11 22:51:20,375 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-11 22:51:20,375 INFO L87 Difference]: Start difference. First operand 881 states and 1603 transitions. Second operand has 4 states, 4 states have (on average 15.25) internal successors, (61), 3 states have internal predecessors, (61), 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 22:51:25,684 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-11 22:51:25,684 INFO L93 Difference]: Finished difference Result 3136 states and 5912 transitions. [2024-11-11 22:51:25,684 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-11 22:51:25,684 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 15.25) internal successors, (61), 3 states have internal predecessors, (61), 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 61 [2024-11-11 22:51:25,685 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-11 22:51:25,698 INFO L225 Difference]: With dead ends: 3136 [2024-11-11 22:51:25,702 INFO L226 Difference]: Without dead ends: 2383 [2024-11-11 22:51:25,703 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-11-11 22:51:25,704 INFO L435 NwaCegarLoop]: 839 mSDtfsCounter, 2519 mSDsluCounter, 18 mSDsCounter, 0 mSdLazyCounter, 5354 mSolverCounterSat, 1153 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2519 SdHoareTripleChecker+Valid, 857 SdHoareTripleChecker+Invalid, 6507 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1153 IncrementalHoareTripleChecker+Valid, 5354 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 5.2s IncrementalHoareTripleChecker+Time [2024-11-11 22:51:25,704 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2519 Valid, 857 Invalid, 6507 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1153 Valid, 5354 Invalid, 0 Unknown, 0 Unchecked, 5.2s Time] [2024-11-11 22:51:25,713 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2383 states. [2024-11-11 22:51:25,763 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2383 to 2383. [2024-11-11 22:51:25,767 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2383 states, 2381 states have (on average 1.5611087778244435) internal successors, (3717), 2382 states have internal predecessors, (3717), 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 22:51:25,771 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2383 states to 2383 states and 3717 transitions. [2024-11-11 22:51:25,772 INFO L78 Accepts]: Start accepts. Automaton has 2383 states and 3717 transitions. Word has length 61 [2024-11-11 22:51:25,772 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-11 22:51:25,775 INFO L471 AbstractCegarLoop]: Abstraction has 2383 states and 3717 transitions. [2024-11-11 22:51:25,776 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 15.25) internal successors, (61), 3 states have internal predecessors, (61), 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 22:51:25,776 INFO L276 IsEmpty]: Start isEmpty. Operand 2383 states and 3717 transitions. [2024-11-11 22:51:25,778 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 91 [2024-11-11 22:51:25,780 INFO L210 NwaCegarLoop]: Found error trace [2024-11-11 22:51:25,780 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 22:51:25,781 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-11-11 22:51:25,781 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-11 22:51:25,781 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-11 22:51:25,782 INFO L85 PathProgramCache]: Analyzing trace with hash 255619932, now seen corresponding path program 1 times [2024-11-11 22:51:25,782 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-11 22:51:25,782 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1525968416] [2024-11-11 22:51:25,782 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 22:51:25,782 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-11 22:51:25,824 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 22:51:26,160 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 22:51:26,161 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-11 22:51:26,161 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1525968416] [2024-11-11 22:51:26,161 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1525968416] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-11 22:51:26,161 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-11 22:51:26,161 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2024-11-11 22:51:26,162 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1369621139] [2024-11-11 22:51:26,162 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-11 22:51:26,162 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-11-11 22:51:26,162 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-11 22:51:26,163 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-11-11 22:51:26,163 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=73, Unknown=0, NotChecked=0, Total=90 [2024-11-11 22:51:26,163 INFO L87 Difference]: Start difference. First operand 2383 states and 3717 transitions. Second operand has 10 states, 10 states have (on average 9.0) internal successors, (90), 10 states have internal predecessors, (90), 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 22:51:26,603 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-11 22:51:26,603 INFO L93 Difference]: Finished difference Result 3343 states and 5269 transitions. [2024-11-11 22:51:26,604 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2024-11-11 22:51:26,604 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 9.0) internal successors, (90), 10 states have internal predecessors, (90), 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 90 [2024-11-11 22:51:26,604 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-11 22:51:26,612 INFO L225 Difference]: With dead ends: 3343 [2024-11-11 22:51:26,613 INFO L226 Difference]: Without dead ends: 3283 [2024-11-11 22:51:26,614 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 40 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=162, Invalid=344, Unknown=0, NotChecked=0, Total=506 [2024-11-11 22:51:26,615 INFO L435 NwaCegarLoop]: 1599 mSDtfsCounter, 13373 mSDsluCounter, 4789 mSDsCounter, 0 mSdLazyCounter, 363 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 13373 SdHoareTripleChecker+Valid, 6388 SdHoareTripleChecker+Invalid, 374 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 363 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-11 22:51:26,615 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [13373 Valid, 6388 Invalid, 374 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 363 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-11 22:51:26,618 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3283 states. [2024-11-11 22:51:26,647 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3283 to 2441. [2024-11-11 22:51:26,650 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2441 states, 2439 states have (on average 1.5625256252562525) internal successors, (3811), 2440 states have internal predecessors, (3811), 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 22:51:26,653 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2441 states to 2441 states and 3811 transitions. [2024-11-11 22:51:26,654 INFO L78 Accepts]: Start accepts. Automaton has 2441 states and 3811 transitions. Word has length 90 [2024-11-11 22:51:26,654 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-11 22:51:26,654 INFO L471 AbstractCegarLoop]: Abstraction has 2441 states and 3811 transitions. [2024-11-11 22:51:26,654 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 9.0) internal successors, (90), 10 states have internal predecessors, (90), 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 22:51:26,655 INFO L276 IsEmpty]: Start isEmpty. Operand 2441 states and 3811 transitions. [2024-11-11 22:51:26,655 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 93 [2024-11-11 22:51:26,655 INFO L210 NwaCegarLoop]: Found error trace [2024-11-11 22:51:26,656 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 22:51:26,656 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-11-11 22:51:26,656 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-11 22:51:26,656 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-11 22:51:26,656 INFO L85 PathProgramCache]: Analyzing trace with hash -578069748, now seen corresponding path program 1 times [2024-11-11 22:51:26,657 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-11 22:51:26,657 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [184349661] [2024-11-11 22:51:26,657 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 22:51:26,657 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-11 22:51:26,677 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 22:51:26,726 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 22:51:26,726 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-11 22:51:26,726 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [184349661] [2024-11-11 22:51:26,726 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [184349661] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-11 22:51:26,727 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-11 22:51:26,727 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-11 22:51:26,727 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1269023642] [2024-11-11 22:51:26,727 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-11 22:51:26,727 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-11 22:51:26,727 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-11 22:51:26,728 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-11 22:51:26,728 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-11 22:51:26,728 INFO L87 Difference]: Start difference. First operand 2441 states and 3811 transitions. Second operand has 3 states, 3 states have (on average 30.666666666666668) internal successors, (92), 3 states have internal predecessors, (92), 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 22:51:26,753 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-11 22:51:26,753 INFO L93 Difference]: Finished difference Result 2666 states and 4174 transitions. [2024-11-11 22:51:26,754 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-11 22:51:26,754 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 30.666666666666668) internal successors, (92), 3 states have internal predecessors, (92), 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 92 [2024-11-11 22:51:26,754 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-11 22:51:26,761 INFO L225 Difference]: With dead ends: 2666 [2024-11-11 22:51:26,762 INFO L226 Difference]: Without dead ends: 2548 [2024-11-11 22:51:26,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 22:51:26,764 INFO L435 NwaCegarLoop]: 1601 mSDtfsCounter, 1506 mSDsluCounter, 92 mSDsCounter, 0 mSdLazyCounter, 9 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1506 SdHoareTripleChecker+Valid, 1693 SdHoareTripleChecker+Invalid, 11 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 9 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-11 22:51:26,764 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1506 Valid, 1693 Invalid, 11 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 9 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-11 22:51:26,767 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2548 states. [2024-11-11 22:51:26,793 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2548 to 2546. [2024-11-11 22:51:26,796 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2546 states, 2544 states have (on average 1.564072327044025) internal successors, (3979), 2545 states have internal predecessors, (3979), 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 22:51:26,800 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2546 states to 2546 states and 3979 transitions. [2024-11-11 22:51:26,800 INFO L78 Accepts]: Start accepts. Automaton has 2546 states and 3979 transitions. Word has length 92 [2024-11-11 22:51:26,801 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-11 22:51:26,801 INFO L471 AbstractCegarLoop]: Abstraction has 2546 states and 3979 transitions. [2024-11-11 22:51:26,801 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 30.666666666666668) internal successors, (92), 3 states have internal predecessors, (92), 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 22:51:26,801 INFO L276 IsEmpty]: Start isEmpty. Operand 2546 states and 3979 transitions. [2024-11-11 22:51:26,802 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 93 [2024-11-11 22:51:26,802 INFO L210 NwaCegarLoop]: Found error trace [2024-11-11 22:51:26,802 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 22:51:26,802 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-11-11 22:51:26,802 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-11 22:51:26,803 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-11 22:51:26,803 INFO L85 PathProgramCache]: Analyzing trace with hash -511576236, now seen corresponding path program 1 times [2024-11-11 22:51:26,803 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-11 22:51:26,803 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1905151623] [2024-11-11 22:51:26,803 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 22:51:26,803 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-11 22:51:26,823 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 22:51:27,228 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 22:51:27,229 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-11 22:51:27,229 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1905151623] [2024-11-11 22:51:27,229 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1905151623] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-11 22:51:27,229 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-11 22:51:27,229 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2024-11-11 22:51:27,232 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1146592949] [2024-11-11 22:51:27,232 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-11 22:51:27,232 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-11-11 22:51:27,232 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-11 22:51:27,233 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-11-11 22:51:27,233 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=66, Unknown=0, NotChecked=0, Total=90 [2024-11-11 22:51:27,233 INFO L87 Difference]: Start difference. First operand 2546 states and 3979 transitions. Second operand has 10 states, 10 states have (on average 9.2) internal successors, (92), 10 states have internal predecessors, (92), 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 22:51:27,590 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-11 22:51:27,590 INFO L93 Difference]: Finished difference Result 2771 states and 4339 transitions. [2024-11-11 22:51:27,591 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-11-11 22:51:27,591 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 9.2) internal successors, (92), 10 states have internal predecessors, (92), 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 92 [2024-11-11 22:51:27,594 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-11 22:51:27,602 INFO L225 Difference]: With dead ends: 2771 [2024-11-11 22:51:27,603 INFO L226 Difference]: Without dead ends: 2548 [2024-11-11 22:51:27,604 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=84, Invalid=156, Unknown=0, NotChecked=0, Total=240 [2024-11-11 22:51:27,605 INFO L435 NwaCegarLoop]: 1593 mSDtfsCounter, 4602 mSDsluCounter, 667 mSDsCounter, 0 mSdLazyCounter, 132 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4602 SdHoareTripleChecker+Valid, 2260 SdHoareTripleChecker+Invalid, 138 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 132 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-11 22:51:27,605 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [4602 Valid, 2260 Invalid, 138 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 132 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-11 22:51:27,607 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2548 states. [2024-11-11 22:51:27,631 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2548 to 2546. [2024-11-11 22:51:27,635 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2546 states, 2544 states have (on average 1.5632861635220126) internal successors, (3977), 2545 states have internal predecessors, (3977), 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 22:51:27,638 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2546 states to 2546 states and 3977 transitions. [2024-11-11 22:51:27,638 INFO L78 Accepts]: Start accepts. Automaton has 2546 states and 3977 transitions. Word has length 92 [2024-11-11 22:51:27,639 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-11 22:51:27,639 INFO L471 AbstractCegarLoop]: Abstraction has 2546 states and 3977 transitions. [2024-11-11 22:51:27,640 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 9.2) internal successors, (92), 10 states have internal predecessors, (92), 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 22:51:27,640 INFO L276 IsEmpty]: Start isEmpty. Operand 2546 states and 3977 transitions. [2024-11-11 22:51:27,640 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 94 [2024-11-11 22:51:27,641 INFO L210 NwaCegarLoop]: Found error trace [2024-11-11 22:51:27,641 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 22:51:27,641 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-11-11 22:51:27,641 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-11 22:51:27,641 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-11 22:51:27,641 INFO L85 PathProgramCache]: Analyzing trace with hash 906283047, now seen corresponding path program 1 times [2024-11-11 22:51:27,642 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-11 22:51:27,642 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1871645970] [2024-11-11 22:51:27,642 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 22:51:27,642 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-11 22:51:27,694 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 22:51:27,953 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 22:51:27,954 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-11 22:51:27,954 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1871645970] [2024-11-11 22:51:27,954 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1871645970] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-11 22:51:27,954 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-11 22:51:27,955 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-11 22:51:27,955 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1470998543] [2024-11-11 22:51:27,955 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-11 22:51:27,955 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-11 22:51:27,955 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-11 22:51:27,956 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-11 22:51:27,956 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-11 22:51:27,956 INFO L87 Difference]: Start difference. First operand 2546 states and 3977 transitions. Second operand has 5 states, 5 states have (on average 18.6) internal successors, (93), 5 states have internal predecessors, (93), 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 22:51:27,995 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-11 22:51:27,995 INFO L93 Difference]: Finished difference Result 2554 states and 3986 transitions. [2024-11-11 22:51:27,996 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-11 22:51:27,996 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 18.6) internal successors, (93), 5 states have internal predecessors, (93), 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 93 [2024-11-11 22:51:27,997 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-11 22:51:28,005 INFO L225 Difference]: With dead ends: 2554 [2024-11-11 22:51:28,005 INFO L226 Difference]: Without dead ends: 2552 [2024-11-11 22:51:28,006 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-11 22:51:28,009 INFO L435 NwaCegarLoop]: 1600 mSDtfsCounter, 0 mSDsluCounter, 4791 mSDsCounter, 0 mSdLazyCounter, 19 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 6391 SdHoareTripleChecker+Invalid, 20 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 19 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-11 22:51:28,010 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 6391 Invalid, 20 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 19 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-11 22:51:28,014 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2552 states. [2024-11-11 22:51:28,051 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2552 to 2552. [2024-11-11 22:51:28,055 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2552 states, 2550 states have (on average 1.5615686274509804) internal successors, (3982), 2551 states have internal predecessors, (3982), 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 22:51:28,060 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2552 states to 2552 states and 3982 transitions. [2024-11-11 22:51:28,061 INFO L78 Accepts]: Start accepts. Automaton has 2552 states and 3982 transitions. Word has length 93 [2024-11-11 22:51:28,061 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-11 22:51:28,061 INFO L471 AbstractCegarLoop]: Abstraction has 2552 states and 3982 transitions. [2024-11-11 22:51:28,062 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 18.6) internal successors, (93), 5 states have internal predecessors, (93), 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 22:51:28,062 INFO L276 IsEmpty]: Start isEmpty. Operand 2552 states and 3982 transitions. [2024-11-11 22:51:28,063 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2024-11-11 22:51:28,063 INFO L210 NwaCegarLoop]: Found error trace [2024-11-11 22:51:28,063 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 22:51:28,063 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-11-11 22:51:28,063 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-11 22:51:28,064 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-11 22:51:28,064 INFO L85 PathProgramCache]: Analyzing trace with hash -1719553388, now seen corresponding path program 1 times [2024-11-11 22:51:28,064 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-11 22:51:28,064 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1175042972] [2024-11-11 22:51:28,064 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 22:51:28,065 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-11 22:51:28,102 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 22:51:28,158 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 22:51:28,158 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-11 22:51:28,158 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1175042972] [2024-11-11 22:51:28,158 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1175042972] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-11 22:51:28,159 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-11 22:51:28,159 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-11 22:51:28,159 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1018646406] [2024-11-11 22:51:28,159 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-11 22:51:28,159 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-11 22:51:28,159 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-11 22:51:28,160 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-11 22:51:28,160 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-11 22:51:28,160 INFO L87 Difference]: Start difference. First operand 2552 states and 3982 transitions. Second operand has 3 states, 3 states have (on average 31.333333333333332) internal successors, (94), 3 states have internal predecessors, (94), 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 22:51:28,192 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-11 22:51:28,192 INFO L93 Difference]: Finished difference Result 2794 states and 4363 transitions. [2024-11-11 22:51:28,193 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-11 22:51:28,193 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 31.333333333333332) internal successors, (94), 3 states have internal predecessors, (94), 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 94 [2024-11-11 22:51:28,193 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-11 22:51:28,201 INFO L225 Difference]: With dead ends: 2794 [2024-11-11 22:51:28,202 INFO L226 Difference]: Without dead ends: 2670 [2024-11-11 22:51:28,203 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 22:51:28,203 INFO L435 NwaCegarLoop]: 1685 mSDtfsCounter, 1526 mSDsluCounter, 98 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1526 SdHoareTripleChecker+Valid, 1783 SdHoareTripleChecker+Invalid, 6 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 4 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-11 22:51:28,203 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1526 Valid, 1783 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-11 22:51:28,206 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2670 states. [2024-11-11 22:51:28,239 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2670 to 2668. [2024-11-11 22:51:28,244 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2668 states, 2666 states have (on average 1.5615153788447111) internal successors, (4163), 2667 states have internal predecessors, (4163), 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 22:51:28,248 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2668 states to 2668 states and 4163 transitions. [2024-11-11 22:51:28,249 INFO L78 Accepts]: Start accepts. Automaton has 2668 states and 4163 transitions. Word has length 94 [2024-11-11 22:51:28,249 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-11 22:51:28,249 INFO L471 AbstractCegarLoop]: Abstraction has 2668 states and 4163 transitions. [2024-11-11 22:51:28,249 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 31.333333333333332) internal successors, (94), 3 states have internal predecessors, (94), 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 22:51:28,250 INFO L276 IsEmpty]: Start isEmpty. Operand 2668 states and 4163 transitions. [2024-11-11 22:51:28,250 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2024-11-11 22:51:28,251 INFO L210 NwaCegarLoop]: Found error trace [2024-11-11 22:51:28,251 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 22:51:28,251 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-11-11 22:51:28,251 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-11 22:51:28,252 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-11 22:51:28,252 INFO L85 PathProgramCache]: Analyzing trace with hash 593433492, now seen corresponding path program 1 times [2024-11-11 22:51:28,252 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-11 22:51:28,252 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [928652455] [2024-11-11 22:51:28,252 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 22:51:28,253 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-11 22:51:28,276 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 22:51:28,331 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 22:51:28,332 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-11 22:51:28,332 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [928652455] [2024-11-11 22:51:28,332 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [928652455] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-11 22:51:28,332 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-11 22:51:28,332 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-11 22:51:28,332 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1798134186] [2024-11-11 22:51:28,333 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-11 22:51:28,333 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-11 22:51:28,333 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-11 22:51:28,333 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-11 22:51:28,334 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-11 22:51:28,334 INFO L87 Difference]: Start difference. First operand 2668 states and 4163 transitions. Second operand has 3 states, 3 states have (on average 31.333333333333332) internal successors, (94), 3 states have internal predecessors, (94), 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 22:51:28,382 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-11 22:51:28,382 INFO L93 Difference]: Finished difference Result 3330 states and 5203 transitions. [2024-11-11 22:51:28,383 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-11 22:51:28,383 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 31.333333333333332) internal successors, (94), 3 states have internal predecessors, (94), 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 94 [2024-11-11 22:51:28,383 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-11 22:51:28,390 INFO L225 Difference]: With dead ends: 3330 [2024-11-11 22:51:28,390 INFO L226 Difference]: Without dead ends: 2987 [2024-11-11 22:51:28,392 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 22:51:28,393 INFO L435 NwaCegarLoop]: 1687 mSDtfsCounter, 1524 mSDsluCounter, 102 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1524 SdHoareTripleChecker+Valid, 1789 SdHoareTripleChecker+Invalid, 6 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 4 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-11 22:51:28,393 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1524 Valid, 1789 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-11 22:51:28,396 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2987 states. [2024-11-11 22:51:28,426 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2987 to 2985. [2024-11-11 22:51:28,486 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2985 states, 2983 states have (on average 1.5605095541401275) internal successors, (4655), 2984 states have internal predecessors, (4655), 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 22:51:28,491 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2985 states to 2985 states and 4655 transitions. [2024-11-11 22:51:28,492 INFO L78 Accepts]: Start accepts. Automaton has 2985 states and 4655 transitions. Word has length 94 [2024-11-11 22:51:28,492 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-11 22:51:28,492 INFO L471 AbstractCegarLoop]: Abstraction has 2985 states and 4655 transitions. [2024-11-11 22:51:28,492 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 31.333333333333332) internal successors, (94), 3 states have internal predecessors, (94), 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 22:51:28,492 INFO L276 IsEmpty]: Start isEmpty. Operand 2985 states and 4655 transitions. [2024-11-11 22:51:28,493 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2024-11-11 22:51:28,493 INFO L210 NwaCegarLoop]: Found error trace [2024-11-11 22:51:28,493 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 22:51:28,493 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-11-11 22:51:28,493 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-11 22:51:28,494 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-11 22:51:28,497 INFO L85 PathProgramCache]: Analyzing trace with hash -1596549740, now seen corresponding path program 1 times [2024-11-11 22:51:28,497 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-11 22:51:28,497 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1027424329] [2024-11-11 22:51:28,497 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 22:51:28,498 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-11 22:51:28,519 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 22:51:28,568 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 22:51:28,568 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-11 22:51:28,568 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1027424329] [2024-11-11 22:51:28,568 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1027424329] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-11 22:51:28,568 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-11 22:51:28,568 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-11 22:51:28,569 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [112844925] [2024-11-11 22:51:28,569 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-11 22:51:28,569 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-11 22:51:28,569 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-11 22:51:28,569 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-11 22:51:28,569 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-11 22:51:28,570 INFO L87 Difference]: Start difference. First operand 2985 states and 4655 transitions. Second operand has 3 states, 3 states have (on average 31.333333333333332) internal successors, (94), 3 states have internal predecessors, (94), 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 22:51:28,649 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-11 22:51:28,650 INFO L93 Difference]: Finished difference Result 4257 states and 6637 transitions. [2024-11-11 22:51:28,650 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-11 22:51:28,650 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 31.333333333333332) internal successors, (94), 3 states have internal predecessors, (94), 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 94 [2024-11-11 22:51:28,650 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-11 22:51:28,668 INFO L225 Difference]: With dead ends: 4257 [2024-11-11 22:51:28,668 INFO L226 Difference]: Without dead ends: 3597 [2024-11-11 22:51:28,670 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 22:51:28,674 INFO L435 NwaCegarLoop]: 1675 mSDtfsCounter, 1520 mSDsluCounter, 110 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1520 SdHoareTripleChecker+Valid, 1785 SdHoareTripleChecker+Invalid, 6 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 4 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-11 22:51:28,675 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1520 Valid, 1785 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-11 22:51:28,681 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3597 states. [2024-11-11 22:51:28,768 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3597 to 3595. [2024-11-11 22:51:28,780 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3595 states, 3593 states have (on average 1.5560812691344281) internal successors, (5591), 3594 states have internal predecessors, (5591), 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 22:51:28,789 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3595 states to 3595 states and 5591 transitions. [2024-11-11 22:51:28,789 INFO L78 Accepts]: Start accepts. Automaton has 3595 states and 5591 transitions. Word has length 94 [2024-11-11 22:51:28,789 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-11 22:51:28,790 INFO L471 AbstractCegarLoop]: Abstraction has 3595 states and 5591 transitions. [2024-11-11 22:51:28,794 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 31.333333333333332) internal successors, (94), 3 states have internal predecessors, (94), 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 22:51:28,794 INFO L276 IsEmpty]: Start isEmpty. Operand 3595 states and 5591 transitions. [2024-11-11 22:51:28,795 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2024-11-11 22:51:28,795 INFO L210 NwaCegarLoop]: Found error trace [2024-11-11 22:51:28,795 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 22:51:28,795 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2024-11-11 22:51:28,795 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-11 22:51:28,796 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-11 22:51:28,796 INFO L85 PathProgramCache]: Analyzing trace with hash -1332693356, now seen corresponding path program 1 times [2024-11-11 22:51:28,796 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-11 22:51:28,796 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1922414264] [2024-11-11 22:51:28,796 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 22:51:28,796 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-11 22:51:28,832 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 22:51:28,908 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 22:51:28,909 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-11 22:51:28,909 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1922414264] [2024-11-11 22:51:28,909 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1922414264] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-11 22:51:28,909 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-11 22:51:28,909 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-11 22:51:28,909 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [189960380] [2024-11-11 22:51:28,909 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-11 22:51:28,909 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-11 22:51:28,909 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-11 22:51:28,910 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-11 22:51:28,910 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-11 22:51:28,910 INFO L87 Difference]: Start difference. First operand 3595 states and 5591 transitions. Second operand has 3 states, 3 states have (on average 31.333333333333332) internal successors, (94), 3 states have internal predecessors, (94), 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 22:51:28,958 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-11 22:51:28,958 INFO L93 Difference]: Finished difference Result 6039 states and 9361 transitions. [2024-11-11 22:51:28,959 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-11 22:51:28,959 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 31.333333333333332) internal successors, (94), 3 states have internal predecessors, (94), 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 94 [2024-11-11 22:51:28,959 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-11 22:51:28,967 INFO L225 Difference]: With dead ends: 6039 [2024-11-11 22:51:28,967 INFO L226 Difference]: Without dead ends: 4769 [2024-11-11 22:51:28,972 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 22:51:28,973 INFO L435 NwaCegarLoop]: 1673 mSDtfsCounter, 1518 mSDsluCounter, 114 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1518 SdHoareTripleChecker+Valid, 1787 SdHoareTripleChecker+Invalid, 6 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 4 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-11 22:51:28,973 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1518 Valid, 1787 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-11 22:51:28,980 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4769 states. [2024-11-11 22:51:29,058 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4769 to 4767. [2024-11-11 22:51:29,063 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4767 states, 4765 states have (on average 1.5460650577124868) internal successors, (7367), 4766 states have internal predecessors, (7367), 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 22:51:29,071 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4767 states to 4767 states and 7367 transitions. [2024-11-11 22:51:29,072 INFO L78 Accepts]: Start accepts. Automaton has 4767 states and 7367 transitions. Word has length 94 [2024-11-11 22:51:29,073 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-11 22:51:29,073 INFO L471 AbstractCegarLoop]: Abstraction has 4767 states and 7367 transitions. [2024-11-11 22:51:29,073 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 31.333333333333332) internal successors, (94), 3 states have internal predecessors, (94), 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 22:51:29,073 INFO L276 IsEmpty]: Start isEmpty. Operand 4767 states and 7367 transitions. [2024-11-11 22:51:29,074 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2024-11-11 22:51:29,074 INFO L210 NwaCegarLoop]: Found error trace [2024-11-11 22:51:29,074 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 22:51:29,074 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2024-11-11 22:51:29,074 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-11 22:51:29,074 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-11 22:51:29,074 INFO L85 PathProgramCache]: Analyzing trace with hash -94431340, now seen corresponding path program 1 times [2024-11-11 22:51:29,074 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-11 22:51:29,074 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [119383543] [2024-11-11 22:51:29,075 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 22:51:29,075 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-11 22:51:29,117 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 22:51:29,203 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 22:51:29,203 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-11 22:51:29,203 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [119383543] [2024-11-11 22:51:29,203 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [119383543] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-11 22:51:29,203 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-11 22:51:29,203 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-11 22:51:29,203 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [235851607] [2024-11-11 22:51:29,203 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-11 22:51:29,203 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-11 22:51:29,204 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-11 22:51:29,204 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-11 22:51:29,204 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-11 22:51:29,204 INFO L87 Difference]: Start difference. First operand 4767 states and 7367 transitions. Second operand has 3 states, 3 states have (on average 31.333333333333332) internal successors, (94), 3 states have internal predecessors, (94), 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 22:51:29,340 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-11 22:51:29,340 INFO L93 Difference]: Finished difference Result 9459 states and 14521 transitions. [2024-11-11 22:51:29,343 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-11 22:51:29,343 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 31.333333333333332) internal successors, (94), 3 states have internal predecessors, (94), 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 94 [2024-11-11 22:51:29,344 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-11 22:51:29,363 INFO L225 Difference]: With dead ends: 9459 [2024-11-11 22:51:29,363 INFO L226 Difference]: Without dead ends: 7017 [2024-11-11 22:51:29,372 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 22:51:29,376 INFO L435 NwaCegarLoop]: 1671 mSDtfsCounter, 1516 mSDsluCounter, 118 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1516 SdHoareTripleChecker+Valid, 1789 SdHoareTripleChecker+Invalid, 6 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 4 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-11 22:51:29,377 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1516 Valid, 1789 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-11 22:51:29,385 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7017 states. [2024-11-11 22:51:29,575 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7017 to 7015. [2024-11-11 22:51:29,584 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7015 states, 7013 states have (on average 1.5295879081705404) internal successors, (10727), 7014 states have internal predecessors, (10727), 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 22:51:29,592 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7015 states to 7015 states and 10727 transitions. [2024-11-11 22:51:29,593 INFO L78 Accepts]: Start accepts. Automaton has 7015 states and 10727 transitions. Word has length 94 [2024-11-11 22:51:29,593 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-11 22:51:29,593 INFO L471 AbstractCegarLoop]: Abstraction has 7015 states and 10727 transitions. [2024-11-11 22:51:29,594 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 31.333333333333332) internal successors, (94), 3 states have internal predecessors, (94), 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 22:51:29,594 INFO L276 IsEmpty]: Start isEmpty. Operand 7015 states and 10727 transitions. [2024-11-11 22:51:29,594 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2024-11-11 22:51:29,594 INFO L210 NwaCegarLoop]: Found error trace [2024-11-11 22:51:29,595 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 22:51:29,595 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2024-11-11 22:51:29,595 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-11 22:51:29,595 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-11 22:51:29,595 INFO L85 PathProgramCache]: Analyzing trace with hash 1985067156, now seen corresponding path program 1 times [2024-11-11 22:51:29,595 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-11 22:51:29,596 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1981739376] [2024-11-11 22:51:29,596 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 22:51:29,596 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-11 22:51:29,614 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 22:51:29,654 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 22:51:29,654 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-11 22:51:29,654 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1981739376] [2024-11-11 22:51:29,654 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1981739376] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-11 22:51:29,654 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-11 22:51:29,655 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-11 22:51:29,655 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1008743190] [2024-11-11 22:51:29,655 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-11 22:51:29,655 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-11 22:51:29,655 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-11 22:51:29,655 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-11 22:51:29,655 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-11 22:51:29,655 INFO L87 Difference]: Start difference. First operand 7015 states and 10727 transitions. Second operand has 3 states, 3 states have (on average 31.333333333333332) internal successors, (94), 3 states have internal predecessors, (94), 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 22:51:29,842 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-11 22:51:29,842 INFO L93 Difference]: Finished difference Result 16011 states and 24265 transitions. [2024-11-11 22:51:29,842 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-11 22:51:29,842 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 31.333333333333332) internal successors, (94), 3 states have internal predecessors, (94), 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 94 [2024-11-11 22:51:29,843 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-11 22:51:29,857 INFO L225 Difference]: With dead ends: 16011 [2024-11-11 22:51:29,858 INFO L226 Difference]: Without dead ends: 11321 [2024-11-11 22:51:29,862 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 22:51:29,863 INFO L435 NwaCegarLoop]: 1669 mSDtfsCounter, 1514 mSDsluCounter, 122 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1514 SdHoareTripleChecker+Valid, 1791 SdHoareTripleChecker+Invalid, 6 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 4 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-11 22:51:29,863 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1514 Valid, 1791 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-11 22:51:29,869 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11321 states. [2024-11-11 22:51:30,024 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11321 to 11319. [2024-11-11 22:51:30,036 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 11319 states, 11317 states have (on average 1.507731731024123) internal successors, (17063), 11318 states have internal predecessors, (17063), 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 22:51:30,049 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11319 states to 11319 states and 17063 transitions. [2024-11-11 22:51:30,050 INFO L78 Accepts]: Start accepts. Automaton has 11319 states and 17063 transitions. Word has length 94 [2024-11-11 22:51:30,050 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-11 22:51:30,050 INFO L471 AbstractCegarLoop]: Abstraction has 11319 states and 17063 transitions. [2024-11-11 22:51:30,050 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 31.333333333333332) internal successors, (94), 3 states have internal predecessors, (94), 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 22:51:30,050 INFO L276 IsEmpty]: Start isEmpty. Operand 11319 states and 17063 transitions. [2024-11-11 22:51:30,051 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2024-11-11 22:51:30,051 INFO L210 NwaCegarLoop]: Found error trace [2024-11-11 22:51:30,051 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 22:51:30,051 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2024-11-11 22:51:30,051 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-11 22:51:30,052 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-11 22:51:30,052 INFO L85 PathProgramCache]: Analyzing trace with hash -528967276, now seen corresponding path program 1 times [2024-11-11 22:51:30,052 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-11 22:51:30,052 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [706890336] [2024-11-11 22:51:30,052 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 22:51:30,052 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-11 22:51:30,069 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 22:51:30,107 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 22:51:30,107 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-11 22:51:30,107 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [706890336] [2024-11-11 22:51:30,107 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [706890336] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-11 22:51:30,107 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-11 22:51:30,108 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-11 22:51:30,108 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2123819250] [2024-11-11 22:51:30,108 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-11 22:51:30,108 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-11 22:51:30,108 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-11 22:51:30,108 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-11 22:51:30,109 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-11 22:51:30,109 INFO L87 Difference]: Start difference. First operand 11319 states and 17063 transitions. Second operand has 3 states, 3 states have (on average 31.333333333333332) internal successors, (94), 3 states have internal predecessors, (94), 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 22:51:30,301 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-11 22:51:30,301 INFO L93 Difference]: Finished difference Result 28539 states and 42601 transitions. [2024-11-11 22:51:30,302 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-11 22:51:30,302 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 31.333333333333332) internal successors, (94), 3 states have internal predecessors, (94), 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 94 [2024-11-11 22:51:30,302 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-11 22:51:30,331 INFO L225 Difference]: With dead ends: 28539 [2024-11-11 22:51:30,331 INFO L226 Difference]: Without dead ends: 19545 [2024-11-11 22:51:30,344 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 22:51:30,345 INFO L435 NwaCegarLoop]: 1667 mSDtfsCounter, 1512 mSDsluCounter, 126 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1512 SdHoareTripleChecker+Valid, 1793 SdHoareTripleChecker+Invalid, 6 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 4 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-11 22:51:30,345 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1512 Valid, 1793 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-11 22:51:30,356 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19545 states. [2024-11-11 22:51:30,876 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19545 to 19543. [2024-11-11 22:51:30,898 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 19543 states, 19541 states have (on average 1.4823704006959726) internal successors, (28967), 19542 states have internal predecessors, (28967), 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 22:51:30,930 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19543 states to 19543 states and 28967 transitions. [2024-11-11 22:51:30,931 INFO L78 Accepts]: Start accepts. Automaton has 19543 states and 28967 transitions. Word has length 94 [2024-11-11 22:51:30,931 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-11 22:51:30,931 INFO L471 AbstractCegarLoop]: Abstraction has 19543 states and 28967 transitions. [2024-11-11 22:51:30,931 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 31.333333333333332) internal successors, (94), 3 states have internal predecessors, (94), 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 22:51:30,932 INFO L276 IsEmpty]: Start isEmpty. Operand 19543 states and 28967 transitions. [2024-11-11 22:51:30,932 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2024-11-11 22:51:30,932 INFO L210 NwaCegarLoop]: Found error trace [2024-11-11 22:51:30,933 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 22:51:30,933 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2024-11-11 22:51:30,933 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-11 22:51:30,933 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-11 22:51:30,933 INFO L85 PathProgramCache]: Analyzing trace with hash -1759464300, now seen corresponding path program 1 times [2024-11-11 22:51:30,934 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-11 22:51:30,934 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [746586081] [2024-11-11 22:51:30,934 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 22:51:30,934 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-11 22:51:30,957 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 22:51:31,020 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 22:51:31,020 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-11 22:51:31,020 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [746586081] [2024-11-11 22:51:31,020 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [746586081] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-11 22:51:31,020 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-11 22:51:31,021 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-11 22:51:31,021 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1106240685] [2024-11-11 22:51:31,021 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-11 22:51:31,021 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-11 22:51:31,021 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-11 22:51:31,022 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-11 22:51:31,022 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-11 22:51:31,022 INFO L87 Difference]: Start difference. First operand 19543 states and 28967 transitions. Second operand has 3 states, 3 states have (on average 31.333333333333332) internal successors, (94), 3 states have internal predecessors, (94), 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 22:51:31,433 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-11 22:51:31,433 INFO L93 Difference]: Finished difference Result 52443 states and 76969 transitions. [2024-11-11 22:51:31,434 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-11 22:51:31,434 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 31.333333333333332) internal successors, (94), 3 states have internal predecessors, (94), 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 94 [2024-11-11 22:51:31,434 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-11 22:51:31,490 INFO L225 Difference]: With dead ends: 52443 [2024-11-11 22:51:31,491 INFO L226 Difference]: Without dead ends: 35225 [2024-11-11 22:51:31,518 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 22:51:31,518 INFO L435 NwaCegarLoop]: 1685 mSDtfsCounter, 1522 mSDsluCounter, 106 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1522 SdHoareTripleChecker+Valid, 1791 SdHoareTripleChecker+Invalid, 6 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 4 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-11 22:51:31,519 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1522 Valid, 1791 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-11 22:51:31,541 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35225 states. [2024-11-11 22:51:32,142 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35225 to 35223. [2024-11-11 22:51:32,177 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 35223 states, 35221 states have (on average 1.4547854972885494) internal successors, (51239), 35222 states have internal predecessors, (51239), 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 22:51:32,219 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35223 states to 35223 states and 51239 transitions. [2024-11-11 22:51:32,221 INFO L78 Accepts]: Start accepts. Automaton has 35223 states and 51239 transitions. Word has length 94 [2024-11-11 22:51:32,221 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-11 22:51:32,221 INFO L471 AbstractCegarLoop]: Abstraction has 35223 states and 51239 transitions. [2024-11-11 22:51:32,221 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 31.333333333333332) internal successors, (94), 3 states have internal predecessors, (94), 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 22:51:32,221 INFO L276 IsEmpty]: Start isEmpty. Operand 35223 states and 51239 transitions. [2024-11-11 22:51:32,228 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 120 [2024-11-11 22:51:32,228 INFO L210 NwaCegarLoop]: Found error trace [2024-11-11 22:51:32,228 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-11 22:51:32,228 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2024-11-11 22:51:32,228 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-11 22:51:32,229 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-11 22:51:32,229 INFO L85 PathProgramCache]: Analyzing trace with hash -1733023753, now seen corresponding path program 1 times [2024-11-11 22:51:32,229 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-11 22:51:32,229 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [130803483] [2024-11-11 22:51:32,229 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 22:51:32,229 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-11 22:51:32,259 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 22:51:32,556 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 19 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-11-11 22:51:32,556 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-11 22:51:32,556 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [130803483] [2024-11-11 22:51:32,558 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [130803483] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-11 22:51:32,558 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-11 22:51:32,558 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2024-11-11 22:51:32,558 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1605133406] [2024-11-11 22:51:32,558 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-11 22:51:32,558 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-11-11 22:51:32,558 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-11 22:51:32,559 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-11-11 22:51:32,559 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=72, Unknown=0, NotChecked=0, Total=90 [2024-11-11 22:51:32,559 INFO L87 Difference]: Start difference. First operand 35223 states and 51239 transitions. Second operand has 10 states, 10 states have (on average 11.8) internal successors, (118), 10 states have internal predecessors, (118), 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 22:51:36,757 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-11 22:51:36,757 INFO L93 Difference]: Finished difference Result 295209 states and 427312 transitions. [2024-11-11 22:51:36,757 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-11-11 22:51:36,758 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 11.8) internal successors, (118), 10 states have internal predecessors, (118), 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 119 [2024-11-11 22:51:36,758 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-11 22:51:37,392 INFO L225 Difference]: With dead ends: 295209 [2024-11-11 22:51:37,393 INFO L226 Difference]: Without dead ends: 272167 [2024-11-11 22:51:37,515 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=88, Invalid=184, Unknown=0, NotChecked=0, Total=272 [2024-11-11 22:51:37,516 INFO L435 NwaCegarLoop]: 1701 mSDtfsCounter, 11705 mSDsluCounter, 3582 mSDsCounter, 0 mSdLazyCounter, 286 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 11705 SdHoareTripleChecker+Valid, 5283 SdHoareTripleChecker+Invalid, 293 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 286 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-11 22:51:37,516 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [11705 Valid, 5283 Invalid, 293 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 286 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-11 22:51:37,925 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 272167 states. [2024-11-11 22:51:41,191 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 272167 to 63255. [2024-11-11 22:51:41,282 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 63255 states, 63253 states have (on average 1.4454808467582565) internal successors, (91431), 63254 states have internal predecessors, (91431), 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 22:51:41,455 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 63255 states to 63255 states and 91431 transitions. [2024-11-11 22:51:41,465 INFO L78 Accepts]: Start accepts. Automaton has 63255 states and 91431 transitions. Word has length 119 [2024-11-11 22:51:41,466 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-11 22:51:41,466 INFO L471 AbstractCegarLoop]: Abstraction has 63255 states and 91431 transitions. [2024-11-11 22:51:41,466 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 11.8) internal successors, (118), 10 states have internal predecessors, (118), 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 22:51:41,466 INFO L276 IsEmpty]: Start isEmpty. Operand 63255 states and 91431 transitions. [2024-11-11 22:51:41,476 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 120 [2024-11-11 22:51:41,476 INFO L210 NwaCegarLoop]: Found error trace [2024-11-11 22:51:41,476 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-11 22:51:41,476 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2024-11-11 22:51:41,476 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-11 22:51:41,477 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-11 22:51:41,477 INFO L85 PathProgramCache]: Analyzing trace with hash 579963127, now seen corresponding path program 1 times [2024-11-11 22:51:41,477 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-11 22:51:41,477 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [495700865] [2024-11-11 22:51:41,477 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 22:51:41,477 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-11 22:51:41,521 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 22:51:41,775 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 17 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-11-11 22:51:41,776 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-11 22:51:41,776 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [495700865] [2024-11-11 22:51:41,776 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [495700865] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-11 22:51:41,776 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-11 22:51:41,776 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2024-11-11 22:51:41,776 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1426376238] [2024-11-11 22:51:41,776 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-11 22:51:41,777 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-11-11 22:51:41,777 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-11 22:51:41,777 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-11-11 22:51:41,777 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=72, Unknown=0, NotChecked=0, Total=90 [2024-11-11 22:51:41,777 INFO L87 Difference]: Start difference. First operand 63255 states and 91431 transitions. Second operand has 10 states, 10 states have (on average 11.6) internal successors, (116), 10 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 22:51:47,762 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-11 22:51:47,763 INFO L93 Difference]: Finished difference Result 328105 states and 474672 transitions. [2024-11-11 22:51:47,763 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-11-11 22:51:47,763 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 11.6) internal successors, (116), 10 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 119 [2024-11-11 22:51:47,764 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-11 22:51:48,526 INFO L225 Difference]: With dead ends: 328105 [2024-11-11 22:51:48,527 INFO L226 Difference]: Without dead ends: 295207 [2024-11-11 22:51:48,618 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=88, Invalid=184, Unknown=0, NotChecked=0, Total=272 [2024-11-11 22:51:48,619 INFO L435 NwaCegarLoop]: 1700 mSDtfsCounter, 11707 mSDsluCounter, 3528 mSDsCounter, 0 mSdLazyCounter, 279 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 11707 SdHoareTripleChecker+Valid, 5228 SdHoareTripleChecker+Invalid, 286 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 279 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-11 22:51:48,619 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [11707 Valid, 5228 Invalid, 286 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 279 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-11 22:51:48,773 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 295207 states. [2024-11-11 22:51:53,302 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 295207 to 107671. [2024-11-11 22:51:53,375 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 107671 states, 107669 states have (on average 1.4400338073168693) internal successors, (155047), 107670 states have internal predecessors, (155047), 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 22:51:53,793 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 107671 states to 107671 states and 155047 transitions. [2024-11-11 22:51:53,804 INFO L78 Accepts]: Start accepts. Automaton has 107671 states and 155047 transitions. Word has length 119 [2024-11-11 22:51:53,805 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-11 22:51:53,805 INFO L471 AbstractCegarLoop]: Abstraction has 107671 states and 155047 transitions. [2024-11-11 22:51:53,805 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 11.6) internal successors, (116), 10 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 22:51:53,805 INFO L276 IsEmpty]: Start isEmpty. Operand 107671 states and 155047 transitions. [2024-11-11 22:51:53,815 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 120 [2024-11-11 22:51:53,815 INFO L210 NwaCegarLoop]: Found error trace [2024-11-11 22:51:53,815 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-11 22:51:53,815 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2024-11-11 22:51:53,816 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-11 22:51:53,816 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-11 22:51:53,816 INFO L85 PathProgramCache]: Analyzing trace with hash -1610020105, now seen corresponding path program 1 times [2024-11-11 22:51:53,816 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-11 22:51:53,816 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [120018325] [2024-11-11 22:51:53,816 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 22:51:53,817 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-11 22:51:53,838 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 22:51:54,027 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 13 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2024-11-11 22:51:54,028 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-11 22:51:54,028 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [120018325] [2024-11-11 22:51:54,028 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [120018325] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-11 22:51:54,028 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-11 22:51:54,028 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2024-11-11 22:51:54,028 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [389671080] [2024-11-11 22:51:54,029 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-11 22:51:54,029 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-11-11 22:51:54,029 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-11 22:51:54,029 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-11-11 22:51:54,029 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=72, Unknown=0, NotChecked=0, Total=90 [2024-11-11 22:51:54,030 INFO L87 Difference]: Start difference. First operand 107671 states and 155047 transitions. Second operand has 10 states, 10 states have (on average 11.2) internal successors, (112), 10 states have internal predecessors, (112), 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 22:52:01,710 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-11 22:52:01,711 INFO L93 Difference]: Finished difference Result 361001 states and 521904 transitions. [2024-11-11 22:52:01,711 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-11-11 22:52:01,711 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 11.2) internal successors, (112), 10 states have internal predecessors, (112), 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 119 [2024-11-11 22:52:01,711 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-11 22:52:02,603 INFO L225 Difference]: With dead ends: 361001 [2024-11-11 22:52:02,604 INFO L226 Difference]: Without dead ends: 328103 [2024-11-11 22:52:02,696 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=88, Invalid=184, Unknown=0, NotChecked=0, Total=272 [2024-11-11 22:52:02,697 INFO L435 NwaCegarLoop]: 1698 mSDtfsCounter, 11751 mSDsluCounter, 3518 mSDsCounter, 0 mSdLazyCounter, 237 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 11751 SdHoareTripleChecker+Valid, 5216 SdHoareTripleChecker+Invalid, 244 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 237 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-11 22:52:02,697 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [11751 Valid, 5216 Invalid, 244 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 237 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-11 22:52:02,887 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 328103 states.