./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/eca-rers2012/Problem13_label36.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 023d838f Calling Ultimate with: /root/.sdkman/candidates/java/11.0.12-open/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/eca-rers2012/Problem13_label36.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 e5aa96fbac0e92c80f1f80982b7986fb62416e04af83c742e32bbaeb89f3bf9f --- Real Ultimate output --- This is Ultimate 0.2.5-tmp.fs.icfgbuilder-eval-023d838-m [2024-11-09 19:33:47,482 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-09 19:33:47,576 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-11-09 19:33:47,582 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-09 19:33:47,583 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-09 19:33:47,611 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-09 19:33:47,612 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-09 19:33:47,612 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-09 19:33:47,613 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-09 19:33:47,614 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-09 19:33:47,614 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-09 19:33:47,614 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-09 19:33:47,615 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-09 19:33:47,615 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-09 19:33:47,617 INFO L153 SettingsManager]: * Use SBE=true [2024-11-09 19:33:47,617 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-09 19:33:47,617 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-09 19:33:47,618 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-09 19:33:47,618 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-09 19:33:47,618 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-09 19:33:47,622 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-09 19:33:47,623 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-09 19:33:47,623 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-09 19:33:47,623 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-09 19:33:47,623 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-09 19:33:47,624 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-09 19:33:47,624 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-09 19:33:47,624 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-09 19:33:47,624 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2024-11-09 19:33:47,625 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-09 19:33:47,625 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-09 19:33:47,626 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-09 19:33:47,626 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-09 19:33:47,626 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-09 19:33:47,627 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-09 19:33:47,627 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-09 19:33:47,627 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-09 19:33:47,627 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-09 19:33:47,628 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-09 19:33:47,628 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-09 19:33:47,628 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-09 19:33:47,629 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-09 19:33:47,629 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 -> e5aa96fbac0e92c80f1f80982b7986fb62416e04af83c742e32bbaeb89f3bf9f [2024-11-09 19:33:47,877 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-09 19:33:47,894 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-09 19:33:47,898 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-09 19:33:47,899 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-09 19:33:47,901 INFO L274 PluginConnector]: CDTParser initialized [2024-11-09 19:33:47,903 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/eca-rers2012/Problem13_label36.c [2024-11-09 19:33:49,333 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-09 19:33:49,825 INFO L384 CDTParser]: Found 1 translation units. [2024-11-09 19:33:49,827 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/eca-rers2012/Problem13_label36.c [2024-11-09 19:33:49,859 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/83c901d84/d0d75e0990fd41fe8458a26370614372/FLAGbc15d455f [2024-11-09 19:33:49,874 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/83c901d84/d0d75e0990fd41fe8458a26370614372 [2024-11-09 19:33:49,877 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-09 19:33:49,878 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-09 19:33:49,880 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-09 19:33:49,881 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-09 19:33:49,886 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-09 19:33:49,887 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.11 07:33:49" (1/1) ... [2024-11-09 19:33:49,888 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@74ccfc86 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 07:33:49, skipping insertion in model container [2024-11-09 19:33:49,888 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.11 07:33:49" (1/1) ... [2024-11-09 19:33:50,010 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-09 19:33:50,327 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/eca-rers2012/Problem13_label36.c[1933,1946] [2024-11-09 19:33:51,286 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-09 19:33:51,295 INFO L200 MainTranslator]: Completed pre-run [2024-11-09 19:33:51,315 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/eca-rers2012/Problem13_label36.c[1933,1946] [2024-11-09 19:33:51,799 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-09 19:33:51,864 INFO L204 MainTranslator]: Completed translation [2024-11-09 19:33:51,864 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 07:33:51 WrapperNode [2024-11-09 19:33:51,864 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-09 19:33:51,865 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-09 19:33:51,866 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-09 19:33:51,866 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-09 19:33:51,872 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 07:33:51" (1/1) ... [2024-11-09 19:33:51,934 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 07:33:51" (1/1) ... [2024-11-09 19:33:52,452 INFO L138 Inliner]: procedures = 17, calls = 11, calls flagged for inlining = 6, calls inlined = 6, statements flattened = 5586 [2024-11-09 19:33:52,453 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-09 19:33:52,454 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-09 19:33:52,454 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-09 19:33:52,454 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-09 19:33:52,464 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 07:33:51" (1/1) ... [2024-11-09 19:33:52,464 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 07:33:51" (1/1) ... [2024-11-09 19:33:52,646 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 07:33:51" (1/1) ... [2024-11-09 19:33:52,862 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2024-11-09 19:33:52,862 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 07:33:51" (1/1) ... [2024-11-09 19:33:52,862 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 07:33:51" (1/1) ... [2024-11-09 19:33:53,068 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 07:33:51" (1/1) ... [2024-11-09 19:33:53,092 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 07:33:51" (1/1) ... [2024-11-09 19:33:53,120 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 07:33:51" (1/1) ... [2024-11-09 19:33:53,141 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 07:33:51" (1/1) ... [2024-11-09 19:33:53,190 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-09 19:33:53,192 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2024-11-09 19:33:53,192 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2024-11-09 19:33:53,193 INFO L274 PluginConnector]: IcfgBuilder initialized [2024-11-09 19:33:53,193 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 07:33:51" (1/1) ... [2024-11-09 19:33:53,199 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-09 19:33:53,208 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 19:33:53,224 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-11-09 19:33:53,229 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-11-09 19:33:53,262 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-09 19:33:53,263 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-11-09 19:33:53,263 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-09 19:33:53,263 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-09 19:33:53,329 INFO L256 CfgBuilder]: Building ICFG [2024-11-09 19:33:53,332 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-09 19:33:59,467 INFO L1247 $ProcedureCfgBuilder]: dead code at ProgramPoint L1894: havoc calculate_output_#t~ret9#1; [2024-11-09 19:33:59,467 INFO L1247 $ProcedureCfgBuilder]: dead code at ProgramPoint L3629: havoc calculate_output2_#t~ret10#1; [2024-11-09 19:33:59,467 INFO L1247 $ProcedureCfgBuilder]: dead code at ProgramPoint L5351: havoc calculate_output3_#t~ret11#1; [2024-11-09 19:33:59,782 INFO L? ?]: Removed 2111 outVars from TransFormulas that were not future-live. [2024-11-09 19:33:59,782 INFO L307 CfgBuilder]: Performing block encoding [2024-11-09 19:33:59,827 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-09 19:33:59,827 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2024-11-09 19:33:59,827 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 09.11 07:33:59 BoogieIcfgContainer [2024-11-09 19:33:59,828 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2024-11-09 19:33:59,830 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-09 19:33:59,830 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-09 19:33:59,833 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-09 19:33:59,833 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 09.11 07:33:49" (1/3) ... [2024-11-09 19:33:59,834 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@57eac843 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.11 07:33:59, skipping insertion in model container [2024-11-09 19:33:59,835 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 07:33:51" (2/3) ... [2024-11-09 19:33:59,835 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@57eac843 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.11 07:33:59, skipping insertion in model container [2024-11-09 19:33:59,835 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 09.11 07:33:59" (3/3) ... [2024-11-09 19:33:59,838 INFO L112 eAbstractionObserver]: Analyzing ICFG Problem13_label36.c [2024-11-09 19:33:59,854 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-09 19:33:59,855 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-11-09 19:33:59,956 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-09 19:33:59,965 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;@4eb8c76e, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-09 19:33:59,965 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-09 19:33:59,976 INFO L276 IsEmpty]: Start isEmpty. Operand has 1101 states, 1099 states have (on average 2.4767970882620562) internal successors, (2722), 1100 states have internal predecessors, (2722), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 19:33:59,982 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2024-11-09 19:33:59,982 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 19:33:59,983 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 19:33:59,984 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 19:33:59,988 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 19:33:59,989 INFO L85 PathProgramCache]: Analyzing trace with hash 1581914066, now seen corresponding path program 1 times [2024-11-09 19:34:00,000 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 19:34:00,000 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1658216107] [2024-11-09 19:34:00,001 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 19:34:00,002 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 19:34:00,128 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 19:34:00,282 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 19:34:00,283 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 19:34:00,283 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1658216107] [2024-11-09 19:34:00,284 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1658216107] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 19:34:00,284 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 19:34:00,284 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-09 19:34:00,286 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [78673803] [2024-11-09 19:34:00,287 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 19:34:00,290 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-09 19:34:00,292 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 19:34:00,315 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-09 19:34:00,316 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-09 19:34:00,321 INFO L87 Difference]: Start difference. First operand has 1101 states, 1099 states have (on average 2.4767970882620562) internal successors, (2722), 1100 states have internal predecessors, (2722), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 3 states, 3 states have (on average 4.333333333333333) internal successors, (13), 2 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 19:34:05,909 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 19:34:05,910 INFO L93 Difference]: Finished difference Result 3088 states and 7843 transitions. [2024-11-09 19:34:05,911 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-09 19:34:05,912 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 4.333333333333333) internal successors, (13), 2 states have internal predecessors, (13), 0 states have call successors, (0), 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 13 [2024-11-09 19:34:05,912 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 19:34:05,936 INFO L225 Difference]: With dead ends: 3088 [2024-11-09 19:34:05,936 INFO L226 Difference]: Without dead ends: 1902 [2024-11-09 19:34:05,942 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-09 19:34:05,945 INFO L432 NwaCegarLoop]: 469 mSDtfsCounter, 1744 mSDsluCounter, 173 mSDsCounter, 0 mSdLazyCounter, 4387 mSolverCounterSat, 599 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1744 SdHoareTripleChecker+Valid, 642 SdHoareTripleChecker+Invalid, 4986 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 599 IncrementalHoareTripleChecker+Valid, 4387 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 5.4s IncrementalHoareTripleChecker+Time [2024-11-09 19:34:05,947 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1744 Valid, 642 Invalid, 4986 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [599 Valid, 4387 Invalid, 0 Unknown, 0 Unchecked, 5.4s Time] [2024-11-09 19:34:05,969 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1902 states. [2024-11-09 19:34:06,059 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1902 to 1897. [2024-11-09 19:34:06,065 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1897 states, 1896 states have (on average 2.4915611814345993) internal successors, (4724), 1896 states have internal predecessors, (4724), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 19:34:06,072 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1897 states to 1897 states and 4724 transitions. [2024-11-09 19:34:06,074 INFO L78 Accepts]: Start accepts. Automaton has 1897 states and 4724 transitions. Word has length 13 [2024-11-09 19:34:06,074 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 19:34:06,074 INFO L471 AbstractCegarLoop]: Abstraction has 1897 states and 4724 transitions. [2024-11-09 19:34:06,075 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 4.333333333333333) internal successors, (13), 2 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 19:34:06,075 INFO L276 IsEmpty]: Start isEmpty. Operand 1897 states and 4724 transitions. [2024-11-09 19:34:06,077 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 80 [2024-11-09 19:34:06,078 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 19:34:06,078 INFO L215 NwaCegarLoop]: trace histogram [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] [2024-11-09 19:34:06,079 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-09 19:34:06,079 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 19:34:06,080 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 19:34:06,080 INFO L85 PathProgramCache]: Analyzing trace with hash -499647971, now seen corresponding path program 1 times [2024-11-09 19:34:06,080 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 19:34:06,081 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1224690108] [2024-11-09 19:34:06,081 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 19:34:06,082 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 19:34:06,181 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 19:34:06,502 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 9 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 19:34:06,503 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 19:34:06,503 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1224690108] [2024-11-09 19:34:06,504 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1224690108] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 19:34:06,504 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 19:34:06,504 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-09 19:34:06,504 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1670114486] [2024-11-09 19:34:06,505 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 19:34:06,507 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-09 19:34:06,507 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 19:34:06,508 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-09 19:34:06,509 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-09 19:34:06,509 INFO L87 Difference]: Start difference. First operand 1897 states and 4724 transitions. Second operand has 3 states, 3 states have (on average 26.333333333333332) internal successors, (79), 2 states have internal predecessors, (79), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 19:34:11,788 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 19:34:11,788 INFO L93 Difference]: Finished difference Result 5448 states and 13872 transitions. [2024-11-09 19:34:11,788 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-09 19:34:11,788 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 26.333333333333332) internal successors, (79), 2 states have internal predecessors, (79), 0 states have call successors, (0), 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 79 [2024-11-09 19:34:11,789 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 19:34:11,808 INFO L225 Difference]: With dead ends: 5448 [2024-11-09 19:34:11,809 INFO L226 Difference]: Without dead ends: 3553 [2024-11-09 19:34:11,812 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-09 19:34:11,814 INFO L432 NwaCegarLoop]: 749 mSDtfsCounter, 1534 mSDsluCounter, 138 mSDsCounter, 0 mSdLazyCounter, 4560 mSolverCounterSat, 360 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1534 SdHoareTripleChecker+Valid, 887 SdHoareTripleChecker+Invalid, 4920 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 360 IncrementalHoareTripleChecker+Valid, 4560 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 5.2s IncrementalHoareTripleChecker+Time [2024-11-09 19:34:11,814 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1534 Valid, 887 Invalid, 4920 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [360 Valid, 4560 Invalid, 0 Unknown, 0 Unchecked, 5.2s Time] [2024-11-09 19:34:11,819 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3553 states. [2024-11-09 19:34:11,888 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3553 to 3489. [2024-11-09 19:34:11,897 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3489 states, 3488 states have (on average 2.407110091743119) internal successors, (8396), 3488 states have internal predecessors, (8396), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 19:34:11,909 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3489 states to 3489 states and 8396 transitions. [2024-11-09 19:34:11,910 INFO L78 Accepts]: Start accepts. Automaton has 3489 states and 8396 transitions. Word has length 79 [2024-11-09 19:34:11,910 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 19:34:11,910 INFO L471 AbstractCegarLoop]: Abstraction has 3489 states and 8396 transitions. [2024-11-09 19:34:11,911 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 26.333333333333332) internal successors, (79), 2 states have internal predecessors, (79), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 19:34:11,911 INFO L276 IsEmpty]: Start isEmpty. Operand 3489 states and 8396 transitions. [2024-11-09 19:34:11,914 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 81 [2024-11-09 19:34:11,914 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 19:34:11,915 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 19:34:11,915 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-09 19:34:11,916 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 19:34:11,916 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 19:34:11,920 INFO L85 PathProgramCache]: Analyzing trace with hash -1934468675, now seen corresponding path program 1 times [2024-11-09 19:34:11,920 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 19:34:11,921 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1972270284] [2024-11-09 19:34:11,921 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 19:34:11,921 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 19:34:11,956 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 19:34:12,090 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 9 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 19:34:12,090 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 19:34:12,091 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1972270284] [2024-11-09 19:34:12,092 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1972270284] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 19:34:12,092 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 19:34:12,092 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-09 19:34:12,092 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2120076262] [2024-11-09 19:34:12,092 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 19:34:12,093 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-09 19:34:12,093 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 19:34:12,094 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-09 19:34:12,095 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-09 19:34:12,095 INFO L87 Difference]: Start difference. First operand 3489 states and 8396 transitions. Second operand has 3 states, 3 states have (on average 26.666666666666668) internal successors, (80), 2 states have internal predecessors, (80), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 19:34:16,572 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 19:34:16,573 INFO L93 Difference]: Finished difference Result 10164 states and 24770 transitions. [2024-11-09 19:34:16,573 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-09 19:34:16,574 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 26.666666666666668) internal successors, (80), 2 states have internal predecessors, (80), 0 states have call successors, (0), 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 80 [2024-11-09 19:34:16,575 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 19:34:16,607 INFO L225 Difference]: With dead ends: 10164 [2024-11-09 19:34:16,608 INFO L226 Difference]: Without dead ends: 6677 [2024-11-09 19:34:16,613 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-09 19:34:16,614 INFO L432 NwaCegarLoop]: 1054 mSDtfsCounter, 1516 mSDsluCounter, 153 mSDsCounter, 0 mSdLazyCounter, 3943 mSolverCounterSat, 780 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1516 SdHoareTripleChecker+Valid, 1207 SdHoareTripleChecker+Invalid, 4723 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 780 IncrementalHoareTripleChecker+Valid, 3943 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.4s IncrementalHoareTripleChecker+Time [2024-11-09 19:34:16,615 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1516 Valid, 1207 Invalid, 4723 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [780 Valid, 3943 Invalid, 0 Unknown, 0 Unchecked, 4.4s Time] [2024-11-09 19:34:16,624 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6677 states. [2024-11-09 19:34:16,724 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6677 to 6661. [2024-11-09 19:34:16,736 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6661 states, 6660 states have (on average 2.2372372372372373) internal successors, (14900), 6660 states have internal predecessors, (14900), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 19:34:16,751 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6661 states to 6661 states and 14900 transitions. [2024-11-09 19:34:16,751 INFO L78 Accepts]: Start accepts. Automaton has 6661 states and 14900 transitions. Word has length 80 [2024-11-09 19:34:16,754 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 19:34:16,754 INFO L471 AbstractCegarLoop]: Abstraction has 6661 states and 14900 transitions. [2024-11-09 19:34:16,754 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 26.666666666666668) internal successors, (80), 2 states have internal predecessors, (80), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 19:34:16,754 INFO L276 IsEmpty]: Start isEmpty. Operand 6661 states and 14900 transitions. [2024-11-09 19:34:16,755 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 101 [2024-11-09 19:34:16,755 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 19:34:16,756 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 19:34:16,756 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-11-09 19:34:16,756 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 19:34:16,758 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 19:34:16,761 INFO L85 PathProgramCache]: Analyzing trace with hash 1969533943, now seen corresponding path program 1 times [2024-11-09 19:34:16,761 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 19:34:16,761 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1346654857] [2024-11-09 19:34:16,761 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 19:34:16,761 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 19:34:16,797 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 19:34:17,108 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 9 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 19:34:17,109 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 19:34:17,109 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1346654857] [2024-11-09 19:34:17,109 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1346654857] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 19:34:17,109 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 19:34:17,109 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-09 19:34:17,110 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1583519294] [2024-11-09 19:34:17,110 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 19:34:17,110 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-09 19:34:17,110 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 19:34:17,111 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-09 19:34:17,111 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-09 19:34:17,111 INFO L87 Difference]: Start difference. First operand 6661 states and 14900 transitions. Second operand has 4 states, 4 states have (on average 25.0) internal successors, (100), 3 states have internal predecessors, (100), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 19:34:23,691 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 19:34:23,691 INFO L93 Difference]: Finished difference Result 14110 states and 32128 transitions. [2024-11-09 19:34:23,692 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-09 19:34:23,692 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 25.0) internal successors, (100), 3 states have internal predecessors, (100), 0 states have call successors, (0), 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 100 [2024-11-09 19:34:23,692 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 19:34:23,721 INFO L225 Difference]: With dead ends: 14110 [2024-11-09 19:34:23,721 INFO L226 Difference]: Without dead ends: 7451 [2024-11-09 19:34:23,728 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-11-09 19:34:23,729 INFO L432 NwaCegarLoop]: 735 mSDtfsCounter, 4729 mSDsluCounter, 297 mSDsCounter, 0 mSdLazyCounter, 6299 mSolverCounterSat, 841 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 5.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4729 SdHoareTripleChecker+Valid, 1032 SdHoareTripleChecker+Invalid, 7140 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 841 IncrementalHoareTripleChecker+Valid, 6299 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 6.4s IncrementalHoareTripleChecker+Time [2024-11-09 19:34:23,729 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [4729 Valid, 1032 Invalid, 7140 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [841 Valid, 6299 Invalid, 0 Unknown, 0 Unchecked, 6.4s Time] [2024-11-09 19:34:23,736 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7451 states. [2024-11-09 19:34:23,838 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7451 to 7450. [2024-11-09 19:34:23,856 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7450 states, 7449 states have (on average 2.2098268223922672) internal successors, (16461), 7449 states have internal predecessors, (16461), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 19:34:23,874 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7450 states to 7450 states and 16461 transitions. [2024-11-09 19:34:23,875 INFO L78 Accepts]: Start accepts. Automaton has 7450 states and 16461 transitions. Word has length 100 [2024-11-09 19:34:23,896 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 19:34:23,897 INFO L471 AbstractCegarLoop]: Abstraction has 7450 states and 16461 transitions. [2024-11-09 19:34:23,897 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 25.0) internal successors, (100), 3 states have internal predecessors, (100), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 19:34:23,898 INFO L276 IsEmpty]: Start isEmpty. Operand 7450 states and 16461 transitions. [2024-11-09 19:34:23,900 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 179 [2024-11-09 19:34:23,904 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 19:34:23,904 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 19:34:23,905 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-11-09 19:34:23,905 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 19:34:23,905 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 19:34:23,905 INFO L85 PathProgramCache]: Analyzing trace with hash -138866799, now seen corresponding path program 1 times [2024-11-09 19:34:23,905 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 19:34:23,906 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2080272732] [2024-11-09 19:34:23,906 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 19:34:23,906 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 19:34:23,958 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 19:34:24,249 INFO L134 CoverageAnalysis]: Checked inductivity of 86 backedges. 86 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 19:34:24,251 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 19:34:24,251 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2080272732] [2024-11-09 19:34:24,251 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2080272732] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 19:34:24,251 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 19:34:24,251 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-09 19:34:24,252 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [151154491] [2024-11-09 19:34:24,252 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 19:34:24,252 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-09 19:34:24,255 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 19:34:24,256 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-09 19:34:24,256 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-09 19:34:24,256 INFO L87 Difference]: Start difference. First operand 7450 states and 16461 transitions. Second operand has 3 states, 3 states have (on average 59.333333333333336) internal successors, (178), 3 states have internal predecessors, (178), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 19:34:28,457 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 19:34:28,457 INFO L93 Difference]: Finished difference Result 17278 states and 39418 transitions. [2024-11-09 19:34:28,457 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-09 19:34:28,458 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 59.333333333333336) internal successors, (178), 3 states have internal predecessors, (178), 0 states have call successors, (0), 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 178 [2024-11-09 19:34:28,458 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 19:34:28,481 INFO L225 Difference]: With dead ends: 17278 [2024-11-09 19:34:28,481 INFO L226 Difference]: Without dead ends: 10618 [2024-11-09 19:34:28,491 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-09 19:34:28,492 INFO L432 NwaCegarLoop]: 798 mSDtfsCounter, 1617 mSDsluCounter, 121 mSDsCounter, 0 mSdLazyCounter, 3809 mSolverCounterSat, 929 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1617 SdHoareTripleChecker+Valid, 919 SdHoareTripleChecker+Invalid, 4738 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 929 IncrementalHoareTripleChecker+Valid, 3809 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.1s IncrementalHoareTripleChecker+Time [2024-11-09 19:34:28,492 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1617 Valid, 919 Invalid, 4738 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [929 Valid, 3809 Invalid, 0 Unknown, 0 Unchecked, 4.1s Time] [2024-11-09 19:34:28,503 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10618 states. [2024-11-09 19:34:28,744 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10618 to 10610. [2024-11-09 19:34:28,764 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10610 states, 10609 states have (on average 2.2014327457818834) internal successors, (23355), 10609 states have internal predecessors, (23355), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 19:34:28,786 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10610 states to 10610 states and 23355 transitions. [2024-11-09 19:34:28,786 INFO L78 Accepts]: Start accepts. Automaton has 10610 states and 23355 transitions. Word has length 178 [2024-11-09 19:34:28,787 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 19:34:28,787 INFO L471 AbstractCegarLoop]: Abstraction has 10610 states and 23355 transitions. [2024-11-09 19:34:28,788 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 59.333333333333336) internal successors, (178), 3 states have internal predecessors, (178), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 19:34:28,788 INFO L276 IsEmpty]: Start isEmpty. Operand 10610 states and 23355 transitions. [2024-11-09 19:34:28,790 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 198 [2024-11-09 19:34:28,790 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 19:34:28,794 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2024-11-09 19:34:28,794 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-11-09 19:34:28,795 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 19:34:28,795 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 19:34:28,795 INFO L85 PathProgramCache]: Analyzing trace with hash -71459436, now seen corresponding path program 1 times [2024-11-09 19:34:28,795 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 19:34:28,795 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [118394924] [2024-11-09 19:34:28,795 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 19:34:28,796 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 19:34:28,838 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 19:34:29,007 INFO L134 CoverageAnalysis]: Checked inductivity of 105 backedges. 19 proven. 0 refuted. 0 times theorem prover too weak. 86 trivial. 0 not checked. [2024-11-09 19:34:29,007 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 19:34:29,007 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [118394924] [2024-11-09 19:34:29,008 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [118394924] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 19:34:29,008 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 19:34:29,008 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-09 19:34:29,008 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1935053272] [2024-11-09 19:34:29,008 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 19:34:29,009 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-09 19:34:29,011 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 19:34:29,011 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-09 19:34:29,011 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-09 19:34:29,012 INFO L87 Difference]: Start difference. First operand 10610 states and 23355 transitions. Second operand has 3 states, 3 states have (on average 37.333333333333336) internal successors, (112), 2 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-09 19:34:33,198 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 19:34:33,199 INFO L93 Difference]: Finished difference Result 29882 states and 66561 transitions. [2024-11-09 19:34:33,201 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-09 19:34:33,201 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 37.333333333333336) internal successors, (112), 2 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 197 [2024-11-09 19:34:33,202 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 19:34:33,245 INFO L225 Difference]: With dead ends: 29882 [2024-11-09 19:34:33,245 INFO L226 Difference]: Without dead ends: 20062 [2024-11-09 19:34:33,259 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-09 19:34:33,261 INFO L432 NwaCegarLoop]: 907 mSDtfsCounter, 1578 mSDsluCounter, 149 mSDsCounter, 0 mSdLazyCounter, 3775 mSolverCounterSat, 871 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1578 SdHoareTripleChecker+Valid, 1056 SdHoareTripleChecker+Invalid, 4646 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 871 IncrementalHoareTripleChecker+Valid, 3775 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.0s IncrementalHoareTripleChecker+Time [2024-11-09 19:34:33,261 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1578 Valid, 1056 Invalid, 4646 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [871 Valid, 3775 Invalid, 0 Unknown, 0 Unchecked, 4.0s Time] [2024-11-09 19:34:33,283 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20062 states. [2024-11-09 19:34:33,520 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20062 to 20061. [2024-11-09 19:34:33,551 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 20061 states, 20060 states have (on average 2.1322033898305084) internal successors, (42772), 20060 states have internal predecessors, (42772), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 19:34:33,783 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20061 states to 20061 states and 42772 transitions. [2024-11-09 19:34:33,784 INFO L78 Accepts]: Start accepts. Automaton has 20061 states and 42772 transitions. Word has length 197 [2024-11-09 19:34:33,785 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 19:34:33,785 INFO L471 AbstractCegarLoop]: Abstraction has 20061 states and 42772 transitions. [2024-11-09 19:34:33,785 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 37.333333333333336) internal successors, (112), 2 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-09 19:34:33,785 INFO L276 IsEmpty]: Start isEmpty. Operand 20061 states and 42772 transitions. [2024-11-09 19:34:33,788 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 230 [2024-11-09 19:34:33,789 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 19:34:33,790 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 19:34:33,790 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-11-09 19:34:33,790 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 19:34:33,792 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 19:34:33,792 INFO L85 PathProgramCache]: Analyzing trace with hash -957445543, now seen corresponding path program 1 times [2024-11-09 19:34:33,792 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 19:34:33,792 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1622495828] [2024-11-09 19:34:33,792 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 19:34:33,793 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 19:34:33,856 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 19:34:34,004 INFO L134 CoverageAnalysis]: Checked inductivity of 108 backedges. 108 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 19:34:34,004 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 19:34:34,004 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1622495828] [2024-11-09 19:34:34,004 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1622495828] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 19:34:34,005 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 19:34:34,005 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-09 19:34:34,005 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1733407217] [2024-11-09 19:34:34,005 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 19:34:34,006 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-09 19:34:34,006 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 19:34:34,006 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-09 19:34:34,007 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-09 19:34:34,007 INFO L87 Difference]: Start difference. First operand 20061 states and 42772 transitions. Second operand has 3 states, 3 states have (on average 76.33333333333333) internal successors, (229), 3 states have internal predecessors, (229), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 19:34:38,460 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 19:34:38,460 INFO L93 Difference]: Finished difference Result 39317 states and 84019 transitions. [2024-11-09 19:34:38,460 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-09 19:34:38,460 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 76.33333333333333) internal successors, (229), 3 states have internal predecessors, (229), 0 states have call successors, (0), 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 229 [2024-11-09 19:34:38,461 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 19:34:38,499 INFO L225 Difference]: With dead ends: 39317 [2024-11-09 19:34:38,499 INFO L226 Difference]: Without dead ends: 20046 [2024-11-09 19:34:38,515 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-09 19:34:38,519 INFO L432 NwaCegarLoop]: 2241 mSDtfsCounter, 1753 mSDsluCounter, 140 mSDsCounter, 0 mSdLazyCounter, 3787 mSolverCounterSat, 598 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1753 SdHoareTripleChecker+Valid, 2381 SdHoareTripleChecker+Invalid, 4385 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 598 IncrementalHoareTripleChecker+Valid, 3787 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.2s IncrementalHoareTripleChecker+Time [2024-11-09 19:34:38,519 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1753 Valid, 2381 Invalid, 4385 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [598 Valid, 3787 Invalid, 0 Unknown, 0 Unchecked, 4.2s Time] [2024-11-09 19:34:38,540 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20046 states. [2024-11-09 19:34:38,746 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20046 to 20044. [2024-11-09 19:34:38,769 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 20044 states, 20043 states have (on average 2.056578356533453) internal successors, (41220), 20043 states have internal predecessors, (41220), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 19:34:38,800 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20044 states to 20044 states and 41220 transitions. [2024-11-09 19:34:38,801 INFO L78 Accepts]: Start accepts. Automaton has 20044 states and 41220 transitions. Word has length 229 [2024-11-09 19:34:38,801 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 19:34:38,802 INFO L471 AbstractCegarLoop]: Abstraction has 20044 states and 41220 transitions. [2024-11-09 19:34:38,802 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 76.33333333333333) internal successors, (229), 3 states have internal predecessors, (229), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 19:34:38,802 INFO L276 IsEmpty]: Start isEmpty. Operand 20044 states and 41220 transitions. [2024-11-09 19:34:38,806 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 269 [2024-11-09 19:34:38,806 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 19:34:38,806 INFO L215 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 19:34:38,806 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-11-09 19:34:38,806 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 19:34:38,807 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 19:34:38,807 INFO L85 PathProgramCache]: Analyzing trace with hash 1846037322, now seen corresponding path program 1 times [2024-11-09 19:34:38,807 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 19:34:38,807 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1890371690] [2024-11-09 19:34:38,807 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 19:34:38,807 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 19:34:38,863 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 19:34:39,068 INFO L134 CoverageAnalysis]: Checked inductivity of 253 backedges. 29 proven. 0 refuted. 0 times theorem prover too weak. 224 trivial. 0 not checked. [2024-11-09 19:34:39,068 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 19:34:39,068 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1890371690] [2024-11-09 19:34:39,068 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1890371690] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 19:34:39,069 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 19:34:39,069 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-09 19:34:39,069 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [319357585] [2024-11-09 19:34:39,069 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 19:34:39,069 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-09 19:34:39,069 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 19:34:39,070 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-09 19:34:39,070 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-09 19:34:39,070 INFO L87 Difference]: Start difference. First operand 20044 states and 41220 transitions. Second operand has 3 states, 3 states have (on average 37.666666666666664) internal successors, (113), 2 states have internal predecessors, (113), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 19:34:43,615 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 19:34:43,615 INFO L93 Difference]: Finished difference Result 54299 states and 112323 transitions. [2024-11-09 19:34:43,616 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-09 19:34:43,616 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 37.666666666666664) internal successors, (113), 2 states have internal predecessors, (113), 0 states have call successors, (0), 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 268 [2024-11-09 19:34:43,617 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 19:34:43,817 INFO L225 Difference]: With dead ends: 54299 [2024-11-09 19:34:43,817 INFO L226 Difference]: Without dead ends: 35045 [2024-11-09 19:34:43,834 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-09 19:34:43,835 INFO L432 NwaCegarLoop]: 760 mSDtfsCounter, 1625 mSDsluCounter, 128 mSDsCounter, 0 mSdLazyCounter, 3964 mSolverCounterSat, 757 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1625 SdHoareTripleChecker+Valid, 888 SdHoareTripleChecker+Invalid, 4721 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 757 IncrementalHoareTripleChecker+Valid, 3964 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.3s IncrementalHoareTripleChecker+Time [2024-11-09 19:34:43,835 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1625 Valid, 888 Invalid, 4721 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [757 Valid, 3964 Invalid, 0 Unknown, 0 Unchecked, 4.3s Time] [2024-11-09 19:34:43,862 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35045 states. [2024-11-09 19:34:44,170 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35045 to 33455. [2024-11-09 19:34:44,206 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 33455 states, 33454 states have (on average 2.0273509894183057) internal successors, (67823), 33454 states have internal predecessors, (67823), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 19:34:44,265 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33455 states to 33455 states and 67823 transitions. [2024-11-09 19:34:44,266 INFO L78 Accepts]: Start accepts. Automaton has 33455 states and 67823 transitions. Word has length 268 [2024-11-09 19:34:44,266 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 19:34:44,266 INFO L471 AbstractCegarLoop]: Abstraction has 33455 states and 67823 transitions. [2024-11-09 19:34:44,266 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 37.666666666666664) internal successors, (113), 2 states have internal predecessors, (113), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 19:34:44,267 INFO L276 IsEmpty]: Start isEmpty. Operand 33455 states and 67823 transitions. [2024-11-09 19:34:44,271 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 302 [2024-11-09 19:34:44,271 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 19:34:44,271 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 19:34:44,271 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-11-09 19:34:44,271 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 19:34:44,272 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 19:34:44,272 INFO L85 PathProgramCache]: Analyzing trace with hash 1948386062, now seen corresponding path program 1 times [2024-11-09 19:34:44,272 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 19:34:44,272 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [186309423] [2024-11-09 19:34:44,272 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 19:34:44,272 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 19:34:44,326 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 19:34:44,647 INFO L134 CoverageAnalysis]: Checked inductivity of 115 backedges. 115 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 19:34:44,647 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 19:34:44,647 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [186309423] [2024-11-09 19:34:44,647 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [186309423] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 19:34:44,648 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 19:34:44,648 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-09 19:34:44,648 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [902596464] [2024-11-09 19:34:44,648 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 19:34:44,649 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-09 19:34:44,649 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 19:34:44,650 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-09 19:34:44,651 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-09 19:34:44,651 INFO L87 Difference]: Start difference. First operand 33455 states and 67823 transitions. Second operand has 3 states, 3 states have (on average 100.33333333333333) internal successors, (301), 3 states have internal predecessors, (301), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 19:34:48,722 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 19:34:48,722 INFO L93 Difference]: Finished difference Result 66933 states and 135681 transitions. [2024-11-09 19:34:48,723 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-09 19:34:48,723 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 100.33333333333333) internal successors, (301), 3 states have internal predecessors, (301), 0 states have call successors, (0), 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 301 [2024-11-09 19:34:48,724 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 19:34:48,771 INFO L225 Difference]: With dead ends: 66933 [2024-11-09 19:34:48,772 INFO L226 Difference]: Without dead ends: 32688 [2024-11-09 19:34:48,798 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-09 19:34:48,799 INFO L432 NwaCegarLoop]: 2439 mSDtfsCounter, 1408 mSDsluCounter, 142 mSDsCounter, 0 mSdLazyCounter, 3945 mSolverCounterSat, 310 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1408 SdHoareTripleChecker+Valid, 2581 SdHoareTripleChecker+Invalid, 4255 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 310 IncrementalHoareTripleChecker+Valid, 3945 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.8s IncrementalHoareTripleChecker+Time [2024-11-09 19:34:48,799 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1408 Valid, 2581 Invalid, 4255 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [310 Valid, 3945 Invalid, 0 Unknown, 0 Unchecked, 3.8s Time] [2024-11-09 19:34:48,825 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32688 states. [2024-11-09 19:34:49,104 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32688 to 31875. [2024-11-09 19:34:49,134 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 31875 states, 31874 states have (on average 2.0173809374411746) internal successors, (64302), 31874 states have internal predecessors, (64302), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 19:34:49,191 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31875 states to 31875 states and 64302 transitions. [2024-11-09 19:34:49,191 INFO L78 Accepts]: Start accepts. Automaton has 31875 states and 64302 transitions. Word has length 301 [2024-11-09 19:34:49,192 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 19:34:49,192 INFO L471 AbstractCegarLoop]: Abstraction has 31875 states and 64302 transitions. [2024-11-09 19:34:49,192 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 100.33333333333333) internal successors, (301), 3 states have internal predecessors, (301), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 19:34:49,192 INFO L276 IsEmpty]: Start isEmpty. Operand 31875 states and 64302 transitions. [2024-11-09 19:34:49,196 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 307 [2024-11-09 19:34:49,197 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 19:34:49,197 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 19:34:49,197 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-11-09 19:34:49,197 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 19:34:49,204 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 19:34:49,205 INFO L85 PathProgramCache]: Analyzing trace with hash 2051756483, now seen corresponding path program 1 times [2024-11-09 19:34:49,205 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 19:34:49,205 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [597424894] [2024-11-09 19:34:49,205 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 19:34:49,205 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 19:34:49,258 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 19:34:49,883 INFO L134 CoverageAnalysis]: Checked inductivity of 144 backedges. 144 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 19:34:49,883 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 19:34:49,883 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [597424894] [2024-11-09 19:34:49,884 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [597424894] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 19:34:49,884 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 19:34:49,884 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-09 19:34:49,884 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2087875210] [2024-11-09 19:34:49,884 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 19:34:49,885 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-09 19:34:49,885 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 19:34:49,886 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-09 19:34:49,886 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-11-09 19:34:49,886 INFO L87 Difference]: Start difference. First operand 31875 states and 64302 transitions. Second operand has 4 states, 4 states have (on average 76.5) internal successors, (306), 3 states have internal predecessors, (306), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 19:34:55,354 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 19:34:55,354 INFO L93 Difference]: Finished difference Result 62165 states and 125571 transitions. [2024-11-09 19:34:55,355 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-09 19:34:55,355 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 76.5) internal successors, (306), 3 states have internal predecessors, (306), 0 states have call successors, (0), 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 306 [2024-11-09 19:34:55,355 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 19:34:55,399 INFO L225 Difference]: With dead ends: 62165 [2024-11-09 19:34:55,399 INFO L226 Difference]: Without dead ends: 35026 [2024-11-09 19:34:55,423 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-11-09 19:34:55,424 INFO L432 NwaCegarLoop]: 831 mSDtfsCounter, 2959 mSDsluCounter, 203 mSDsCounter, 0 mSdLazyCounter, 6926 mSolverCounterSat, 606 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2959 SdHoareTripleChecker+Valid, 1034 SdHoareTripleChecker+Invalid, 7532 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 606 IncrementalHoareTripleChecker+Valid, 6926 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 5.2s IncrementalHoareTripleChecker+Time [2024-11-09 19:34:55,424 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [2959 Valid, 1034 Invalid, 7532 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [606 Valid, 6926 Invalid, 0 Unknown, 0 Unchecked, 5.2s Time] [2024-11-09 19:34:55,452 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35026 states. [2024-11-09 19:34:55,692 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35026 to 32659. [2024-11-09 19:34:55,720 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 32659 states, 32658 states have (on average 2.0056953885724784) internal successors, (65502), 32658 states have internal predecessors, (65502), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 19:34:55,780 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32659 states to 32659 states and 65502 transitions. [2024-11-09 19:34:55,781 INFO L78 Accepts]: Start accepts. Automaton has 32659 states and 65502 transitions. Word has length 306 [2024-11-09 19:34:55,781 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 19:34:55,781 INFO L471 AbstractCegarLoop]: Abstraction has 32659 states and 65502 transitions. [2024-11-09 19:34:55,782 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 76.5) internal successors, (306), 3 states have internal predecessors, (306), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 19:34:55,782 INFO L276 IsEmpty]: Start isEmpty. Operand 32659 states and 65502 transitions. [2024-11-09 19:34:55,787 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 343 [2024-11-09 19:34:55,788 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 19:34:55,788 INFO L215 NwaCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 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] [2024-11-09 19:34:55,788 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2024-11-09 19:34:55,788 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 19:34:55,789 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 19:34:55,789 INFO L85 PathProgramCache]: Analyzing trace with hash -485723761, now seen corresponding path program 1 times [2024-11-09 19:34:55,789 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 19:34:55,789 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1354421303] [2024-11-09 19:34:55,790 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 19:34:55,790 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 19:34:55,856 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 19:34:56,441 INFO L134 CoverageAnalysis]: Checked inductivity of 478 backedges. 39 proven. 0 refuted. 0 times theorem prover too weak. 439 trivial. 0 not checked. [2024-11-09 19:34:56,441 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 19:34:56,441 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1354421303] [2024-11-09 19:34:56,441 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1354421303] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 19:34:56,442 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 19:34:56,442 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-09 19:34:56,442 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [793568301] [2024-11-09 19:34:56,442 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 19:34:56,442 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-09 19:34:56,442 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 19:34:56,443 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-09 19:34:56,443 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-09 19:34:56,443 INFO L87 Difference]: Start difference. First operand 32659 states and 65502 transitions. Second operand has 3 states, 3 states have (on average 38.0) internal successors, (114), 3 states have internal predecessors, (114), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 19:35:00,078 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 19:35:00,078 INFO L93 Difference]: Finished difference Result 64526 states and 129494 transitions. [2024-11-09 19:35:00,078 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-09 19:35:00,079 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 38.0) internal successors, (114), 3 states have internal predecessors, (114), 0 states have call successors, (0), 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 342 [2024-11-09 19:35:00,079 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 19:35:00,116 INFO L225 Difference]: With dead ends: 64526 [2024-11-09 19:35:00,116 INFO L226 Difference]: Without dead ends: 32657 [2024-11-09 19:35:00,137 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-09 19:35:00,138 INFO L432 NwaCegarLoop]: 2036 mSDtfsCounter, 1908 mSDsluCounter, 81 mSDsCounter, 0 mSdLazyCounter, 3771 mSolverCounterSat, 421 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1908 SdHoareTripleChecker+Valid, 2117 SdHoareTripleChecker+Invalid, 4192 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 421 IncrementalHoareTripleChecker+Valid, 3771 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.4s IncrementalHoareTripleChecker+Time [2024-11-09 19:35:00,138 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1908 Valid, 2117 Invalid, 4192 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [421 Valid, 3771 Invalid, 0 Unknown, 0 Unchecked, 3.4s Time] [2024-11-09 19:35:00,162 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32657 states. [2024-11-09 19:35:00,412 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32657 to 32656. [2024-11-09 19:35:00,432 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 32656 states, 32655 states have (on average 1.9811973664063696) internal successors, (64696), 32655 states have internal predecessors, (64696), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 19:35:00,470 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32656 states to 32656 states and 64696 transitions. [2024-11-09 19:35:00,471 INFO L78 Accepts]: Start accepts. Automaton has 32656 states and 64696 transitions. Word has length 342 [2024-11-09 19:35:00,471 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 19:35:00,471 INFO L471 AbstractCegarLoop]: Abstraction has 32656 states and 64696 transitions. [2024-11-09 19:35:00,471 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 38.0) internal successors, (114), 3 states have internal predecessors, (114), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 19:35:00,471 INFO L276 IsEmpty]: Start isEmpty. Operand 32656 states and 64696 transitions. [2024-11-09 19:35:00,478 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 366 [2024-11-09 19:35:00,478 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 19:35:00,478 INFO L215 NwaCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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] [2024-11-09 19:35:00,479 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2024-11-09 19:35:00,479 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 19:35:00,479 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 19:35:00,479 INFO L85 PathProgramCache]: Analyzing trace with hash 1303059671, now seen corresponding path program 1 times [2024-11-09 19:35:00,479 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 19:35:00,479 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1203386680] [2024-11-09 19:35:00,479 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 19:35:00,480 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 19:35:00,533 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 19:35:00,749 INFO L134 CoverageAnalysis]: Checked inductivity of 501 backedges. 415 proven. 0 refuted. 0 times theorem prover too weak. 86 trivial. 0 not checked. [2024-11-09 19:35:00,750 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 19:35:00,750 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1203386680] [2024-11-09 19:35:00,750 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1203386680] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 19:35:00,750 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 19:35:00,750 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-09 19:35:00,750 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1622077378] [2024-11-09 19:35:00,750 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 19:35:00,751 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-09 19:35:00,751 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 19:35:00,752 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-09 19:35:00,752 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-11-09 19:35:00,752 INFO L87 Difference]: Start difference. First operand 32656 states and 64696 transitions. Second operand has 4 states, 4 states have (on average 72.75) internal successors, (291), 3 states have internal predecessors, (291), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)