./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/eca-rers2012/Problem13_label37.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_label37.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 a60dbc2f79c578f373d1608befa1a0be5fe97eed98271e53ccf8c768ad5b972e --- Real Ultimate output --- This is Ultimate 0.2.5-tmp.fs.icfgbuilder-eval-023d838-m [2024-11-09 19:34:01,376 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-09 19:34:01,433 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-11-09 19:34:01,438 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-09 19:34:01,440 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-09 19:34:01,459 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-09 19:34:01,460 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-09 19:34:01,460 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-09 19:34:01,461 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-09 19:34:01,461 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-09 19:34:01,461 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-09 19:34:01,462 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-09 19:34:01,462 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-09 19:34:01,462 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-09 19:34:01,462 INFO L153 SettingsManager]: * Use SBE=true [2024-11-09 19:34:01,463 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-09 19:34:01,463 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-09 19:34:01,463 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-09 19:34:01,464 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-09 19:34:01,464 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-09 19:34:01,464 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-09 19:34:01,465 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-09 19:34:01,465 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-09 19:34:01,465 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-09 19:34:01,469 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-09 19:34:01,470 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-09 19:34:01,470 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-09 19:34:01,470 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-09 19:34:01,470 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2024-11-09 19:34:01,470 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-09 19:34:01,471 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-09 19:34:01,471 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-09 19:34:01,471 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-09 19:34:01,471 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-09 19:34:01,471 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-09 19:34:01,472 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-09 19:34:01,472 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-09 19:34:01,472 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-09 19:34:01,472 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-09 19:34:01,472 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-09 19:34:01,472 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-09 19:34:01,473 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-09 19:34:01,477 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 -> a60dbc2f79c578f373d1608befa1a0be5fe97eed98271e53ccf8c768ad5b972e [2024-11-09 19:34:01,667 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-09 19:34:01,687 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-09 19:34:01,690 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-09 19:34:01,690 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-09 19:34:01,691 INFO L274 PluginConnector]: CDTParser initialized [2024-11-09 19:34:01,692 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/eca-rers2012/Problem13_label37.c [2024-11-09 19:34:02,939 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-09 19:34:03,302 INFO L384 CDTParser]: Found 1 translation units. [2024-11-09 19:34:03,304 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/eca-rers2012/Problem13_label37.c [2024-11-09 19:34:03,326 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/96d07c389/6ec09b4648ea42e5b31f3ca913485627/FLAGde4937651 [2024-11-09 19:34:03,338 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/96d07c389/6ec09b4648ea42e5b31f3ca913485627 [2024-11-09 19:34:03,341 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-09 19:34:03,342 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-09 19:34:03,344 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-09 19:34:03,344 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-09 19:34:03,349 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-09 19:34:03,350 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.11 07:34:03" (1/1) ... [2024-11-09 19:34:03,350 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@460ab100 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 07:34:03, skipping insertion in model container [2024-11-09 19:34:03,351 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.11 07:34:03" (1/1) ... [2024-11-09 19:34:03,441 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-09 19:34:03,697 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_label37.c[7700,7713] [2024-11-09 19:34:04,279 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-09 19:34:04,287 INFO L200 MainTranslator]: Completed pre-run [2024-11-09 19:34:04,309 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_label37.c[7700,7713] [2024-11-09 19:34:04,696 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-09 19:34:04,715 INFO L204 MainTranslator]: Completed translation [2024-11-09 19:34:04,715 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 07:34:04 WrapperNode [2024-11-09 19:34:04,715 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-09 19:34:04,716 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-09 19:34:04,717 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-09 19:34:04,717 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-09 19:34:04,721 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:34:04" (1/1) ... [2024-11-09 19:34:04,768 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:34:04" (1/1) ... [2024-11-09 19:34:05,164 INFO L138 Inliner]: procedures = 17, calls = 11, calls flagged for inlining = 6, calls inlined = 6, statements flattened = 5586 [2024-11-09 19:34:05,164 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-09 19:34:05,165 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-09 19:34:05,165 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-09 19:34:05,165 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-09 19:34:05,173 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 07:34:04" (1/1) ... [2024-11-09 19:34:05,173 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 07:34:04" (1/1) ... [2024-11-09 19:34:05,254 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 07:34:04" (1/1) ... [2024-11-09 19:34:05,514 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:34:05,514 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 07:34:04" (1/1) ... [2024-11-09 19:34:05,514 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 07:34:04" (1/1) ... [2024-11-09 19:34:05,783 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 07:34:04" (1/1) ... [2024-11-09 19:34:05,809 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 07:34:04" (1/1) ... [2024-11-09 19:34:05,830 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 07:34:04" (1/1) ... [2024-11-09 19:34:05,848 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 07:34:04" (1/1) ... [2024-11-09 19:34:05,894 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-09 19:34:05,895 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2024-11-09 19:34:05,895 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2024-11-09 19:34:05,895 INFO L274 PluginConnector]: IcfgBuilder initialized [2024-11-09 19:34:05,897 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 07:34:04" (1/1) ... [2024-11-09 19:34:05,901 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-09 19:34:05,910 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 19:34:05,925 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:34:05,928 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:34:05,960 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-09 19:34:05,960 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-11-09 19:34:05,960 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-09 19:34:05,960 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-09 19:34:06,012 INFO L256 CfgBuilder]: Building ICFG [2024-11-09 19:34:06,013 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-09 19:34:10,733 INFO L1247 $ProcedureCfgBuilder]: dead code at ProgramPoint L1894: havoc calculate_output_#t~ret9#1; [2024-11-09 19:34:10,733 INFO L1247 $ProcedureCfgBuilder]: dead code at ProgramPoint L3629: havoc calculate_output2_#t~ret10#1; [2024-11-09 19:34:10,733 INFO L1247 $ProcedureCfgBuilder]: dead code at ProgramPoint L5351: havoc calculate_output3_#t~ret11#1; [2024-11-09 19:34:10,979 INFO L? ?]: Removed 2111 outVars from TransFormulas that were not future-live. [2024-11-09 19:34:10,980 INFO L307 CfgBuilder]: Performing block encoding [2024-11-09 19:34:11,008 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-09 19:34:11,008 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2024-11-09 19:34:11,009 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 09.11 07:34:11 BoogieIcfgContainer [2024-11-09 19:34:11,009 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2024-11-09 19:34:11,010 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-09 19:34:11,010 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-09 19:34:11,013 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-09 19:34:11,013 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 09.11 07:34:03" (1/3) ... [2024-11-09 19:34:11,013 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@cc1c3b6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.11 07:34:11, skipping insertion in model container [2024-11-09 19:34:11,014 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 07:34:04" (2/3) ... [2024-11-09 19:34:11,014 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@cc1c3b6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.11 07:34:11, skipping insertion in model container [2024-11-09 19:34:11,014 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 09.11 07:34:11" (3/3) ... [2024-11-09 19:34:11,015 INFO L112 eAbstractionObserver]: Analyzing ICFG Problem13_label37.c [2024-11-09 19:34:11,027 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-09 19:34:11,027 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-11-09 19:34:11,090 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-09 19:34:11,095 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;@36a1129a, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-09 19:34:11,096 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-09 19:34:11,102 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:34:11,109 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2024-11-09 19:34:11,109 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 19:34:11,110 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 19:34:11,110 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 19:34:11,114 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 19:34:11,114 INFO L85 PathProgramCache]: Analyzing trace with hash 593814576, now seen corresponding path program 1 times [2024-11-09 19:34:11,121 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 19:34:11,122 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1591451571] [2024-11-09 19:34:11,122 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 19:34:11,122 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 19:34:11,234 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 19:34:11,515 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:11,516 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 19:34:11,516 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1591451571] [2024-11-09 19:34:11,516 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1591451571] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 19:34:11,516 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 19:34:11,517 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-09 19:34:11,518 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [574948962] [2024-11-09 19:34:11,518 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 19:34:11,521 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-09 19:34:11,522 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 19:34:11,542 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-09 19:34:11,542 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-09 19:34:11,546 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 18.666666666666668) internal successors, (56), 2 states have internal predecessors, (56), 0 states have call successors, (0), 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:17,133 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 19:34:17,134 INFO L93 Difference]: Finished difference Result 3088 states and 7843 transitions. [2024-11-09 19:34:17,135 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-09 19:34:17,136 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 18.666666666666668) internal successors, (56), 2 states have internal predecessors, (56), 0 states have call successors, (0), 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 56 [2024-11-09 19:34:17,136 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 19:34:17,162 INFO L225 Difference]: With dead ends: 3088 [2024-11-09 19:34:17,162 INFO L226 Difference]: Without dead ends: 1902 [2024-11-09 19:34:17,168 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:17,170 INFO L432 NwaCegarLoop]: 469 mSDtfsCounter, 1701 mSDsluCounter, 173 mSDsCounter, 0 mSdLazyCounter, 4387 mSolverCounterSat, 599 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1701 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:17,171 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1701 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:17,187 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1902 states. [2024-11-09 19:34:17,245 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1902 to 1897. [2024-11-09 19:34:17,248 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:17,253 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1897 states to 1897 states and 4724 transitions. [2024-11-09 19:34:17,255 INFO L78 Accepts]: Start accepts. Automaton has 1897 states and 4724 transitions. Word has length 56 [2024-11-09 19:34:17,255 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 19:34:17,255 INFO L471 AbstractCegarLoop]: Abstraction has 1897 states and 4724 transitions. [2024-11-09 19:34:17,255 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 18.666666666666668) internal successors, (56), 2 states have internal predecessors, (56), 0 states have call successors, (0), 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:17,256 INFO L276 IsEmpty]: Start isEmpty. Operand 1897 states and 4724 transitions. [2024-11-09 19:34:17,258 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 123 [2024-11-09 19:34:17,258 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 19:34:17,259 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2024-11-09 19:34:17,259 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-09 19:34:17,259 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 19:34:17,260 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 19:34:17,260 INFO L85 PathProgramCache]: Analyzing trace with hash 1833755560, now seen corresponding path program 1 times [2024-11-09 19:34:17,260 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 19:34:17,260 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1509796318] [2024-11-09 19:34:17,260 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 19:34:17,262 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 19:34:17,307 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 19:34:17,623 INFO L134 CoverageAnalysis]: Checked inductivity of 52 backedges. 52 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 19:34:17,623 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 19:34:17,623 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1509796318] [2024-11-09 19:34:17,624 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1509796318] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 19:34:17,624 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 19:34:17,624 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-09 19:34:17,625 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [640761809] [2024-11-09 19:34:17,625 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 19:34:17,627 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-09 19:34:17,627 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 19:34:17,628 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-09 19:34:17,628 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-09 19:34:17,628 INFO L87 Difference]: Start difference. First operand 1897 states and 4724 transitions. Second operand has 3 states, 3 states have (on average 40.666666666666664) internal successors, (122), 2 states have internal predecessors, (122), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 19:34:22,471 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 19:34:22,471 INFO L93 Difference]: Finished difference Result 5445 states and 13870 transitions. [2024-11-09 19:34:22,472 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-09 19:34:22,474 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 40.666666666666664) internal successors, (122), 2 states have internal predecessors, (122), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 122 [2024-11-09 19:34:22,474 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 19:34:22,487 INFO L225 Difference]: With dead ends: 5445 [2024-11-09 19:34:22,487 INFO L226 Difference]: Without dead ends: 3550 [2024-11-09 19:34:22,490 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:22,491 INFO L432 NwaCegarLoop]: 747 mSDtfsCounter, 1531 mSDsluCounter, 138 mSDsCounter, 0 mSdLazyCounter, 4559 mSolverCounterSat, 361 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1531 SdHoareTripleChecker+Valid, 885 SdHoareTripleChecker+Invalid, 4920 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 361 IncrementalHoareTripleChecker+Valid, 4559 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.7s IncrementalHoareTripleChecker+Time [2024-11-09 19:34:22,492 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1531 Valid, 885 Invalid, 4920 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [361 Valid, 4559 Invalid, 0 Unknown, 0 Unchecked, 4.7s Time] [2024-11-09 19:34:22,495 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3550 states. [2024-11-09 19:34:22,545 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3550 to 3489. [2024-11-09 19:34:22,550 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3489 states, 3488 states have (on average 2.406823394495413) internal successors, (8395), 3488 states have internal predecessors, (8395), 0 states have call successors, (0), 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:22,558 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3489 states to 3489 states and 8395 transitions. [2024-11-09 19:34:22,559 INFO L78 Accepts]: Start accepts. Automaton has 3489 states and 8395 transitions. Word has length 122 [2024-11-09 19:34:22,559 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 19:34:22,559 INFO L471 AbstractCegarLoop]: Abstraction has 3489 states and 8395 transitions. [2024-11-09 19:34:22,560 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 40.666666666666664) internal successors, (122), 2 states have internal predecessors, (122), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 19:34:22,560 INFO L276 IsEmpty]: Start isEmpty. Operand 3489 states and 8395 transitions. [2024-11-09 19:34:22,561 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 124 [2024-11-09 19:34:22,562 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 19:34:22,562 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 19:34:22,562 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-09 19:34:22,562 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 19:34:22,563 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 19:34:22,563 INFO L85 PathProgramCache]: Analyzing trace with hash -1616982238, now seen corresponding path program 1 times [2024-11-09 19:34:22,563 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 19:34:22,563 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1115223596] [2024-11-09 19:34:22,563 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 19:34:22,564 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 19:34:22,590 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 19:34:22,740 INFO L134 CoverageAnalysis]: Checked inductivity of 52 backedges. 52 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 19:34:22,741 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 19:34:22,741 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1115223596] [2024-11-09 19:34:22,741 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1115223596] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 19:34:22,741 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 19:34:22,741 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-09 19:34:22,741 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1374541537] [2024-11-09 19:34:22,742 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 19:34:22,742 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-09 19:34:22,742 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 19:34:22,742 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-09 19:34:22,744 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-09 19:34:22,744 INFO L87 Difference]: Start difference. First operand 3489 states and 8395 transitions. Second operand has 3 states, 3 states have (on average 41.0) internal successors, (123), 2 states have internal predecessors, (123), 0 states have call successors, (0), 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:27,004 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 19:34:27,004 INFO L93 Difference]: Finished difference Result 10164 states and 24767 transitions. [2024-11-09 19:34:27,004 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-09 19:34:27,005 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 41.0) internal successors, (123), 2 states have internal predecessors, (123), 0 states have call successors, (0), 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 123 [2024-11-09 19:34:27,005 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 19:34:27,023 INFO L225 Difference]: With dead ends: 10164 [2024-11-09 19:34:27,024 INFO L226 Difference]: Without dead ends: 6677 [2024-11-09 19:34:27,028 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:27,029 INFO L432 NwaCegarLoop]: 1054 mSDtfsCounter, 1516 mSDsluCounter, 153 mSDsCounter, 0 mSdLazyCounter, 3943 mSolverCounterSat, 780 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.5s 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.2s IncrementalHoareTripleChecker+Time [2024-11-09 19:34:27,029 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.2s Time] [2024-11-09 19:34:27,033 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6677 states. [2024-11-09 19:34:27,114 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6677 to 6661. [2024-11-09 19:34:27,124 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6661 states, 6660 states have (on average 2.237087087087087) internal successors, (14899), 6660 states have internal predecessors, (14899), 0 states have call successors, (0), 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:27,140 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6661 states to 6661 states and 14899 transitions. [2024-11-09 19:34:27,140 INFO L78 Accepts]: Start accepts. Automaton has 6661 states and 14899 transitions. Word has length 123 [2024-11-09 19:34:27,143 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 19:34:27,143 INFO L471 AbstractCegarLoop]: Abstraction has 6661 states and 14899 transitions. [2024-11-09 19:34:27,143 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 41.0) internal successors, (123), 2 states have internal predecessors, (123), 0 states have call successors, (0), 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:27,143 INFO L276 IsEmpty]: Start isEmpty. Operand 6661 states and 14899 transitions. [2024-11-09 19:34:27,145 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 144 [2024-11-09 19:34:27,145 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 19:34:27,145 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 19:34:27,149 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-11-09 19:34:27,149 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 19:34:27,150 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 19:34:27,150 INFO L85 PathProgramCache]: Analyzing trace with hash 830657576, now seen corresponding path program 1 times [2024-11-09 19:34:27,150 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 19:34:27,150 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1223391385] [2024-11-09 19:34:27,150 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 19:34:27,150 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 19:34:27,190 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 19:34:27,497 INFO L134 CoverageAnalysis]: Checked inductivity of 52 backedges. 52 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 19:34:27,499 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 19:34:27,499 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1223391385] [2024-11-09 19:34:27,499 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1223391385] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 19:34:27,500 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 19:34:27,500 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-09 19:34:27,500 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1687927272] [2024-11-09 19:34:27,500 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 19:34:27,501 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-09 19:34:27,501 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 19:34:27,501 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-09 19:34:27,501 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-09 19:34:27,502 INFO L87 Difference]: Start difference. First operand 6661 states and 14899 transitions. Second operand has 4 states, 4 states have (on average 35.75) internal successors, (143), 3 states have internal predecessors, (143), 0 states have call successors, (0), 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:34,263 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 19:34:34,264 INFO L93 Difference]: Finished difference Result 14110 states and 32127 transitions. [2024-11-09 19:34:34,264 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-09 19:34:34,265 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 35.75) internal successors, (143), 3 states have internal predecessors, (143), 0 states have call successors, (0), 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 143 [2024-11-09 19:34:34,265 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 19:34:34,294 INFO L225 Difference]: With dead ends: 14110 [2024-11-09 19:34:34,295 INFO L226 Difference]: Without dead ends: 7451 [2024-11-09 19:34:34,305 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:34,308 INFO L432 NwaCegarLoop]: 735 mSDtfsCounter, 4729 mSDsluCounter, 297 mSDsCounter, 0 mSdLazyCounter, 6299 mSolverCounterSat, 841 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 5.6s 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.6s IncrementalHoareTripleChecker+Time [2024-11-09 19:34:34,312 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.6s Time] [2024-11-09 19:34:34,322 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7451 states. [2024-11-09 19:34:34,446 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7451 to 7450. [2024-11-09 19:34:34,458 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:34,477 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7450 states to 7450 states and 16461 transitions. [2024-11-09 19:34:34,477 INFO L78 Accepts]: Start accepts. Automaton has 7450 states and 16461 transitions. Word has length 143 [2024-11-09 19:34:34,477 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 19:34:34,478 INFO L471 AbstractCegarLoop]: Abstraction has 7450 states and 16461 transitions. [2024-11-09 19:34:34,478 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 35.75) internal successors, (143), 3 states have internal predecessors, (143), 0 states have call successors, (0), 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:34,478 INFO L276 IsEmpty]: Start isEmpty. Operand 7450 states and 16461 transitions. [2024-11-09 19:34:34,481 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 222 [2024-11-09 19:34:34,481 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 19:34:34,481 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:34,481 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-11-09 19:34:34,481 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 19:34:34,482 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 19:34:34,486 INFO L85 PathProgramCache]: Analyzing trace with hash 720718705, now seen corresponding path program 1 times [2024-11-09 19:34:34,486 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 19:34:34,486 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1532305198] [2024-11-09 19:34:34,486 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 19:34:34,487 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 19:34:34,552 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 19:34:34,776 INFO L134 CoverageAnalysis]: Checked inductivity of 172 backedges. 172 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 19:34:34,777 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 19:34:34,777 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1532305198] [2024-11-09 19:34:34,778 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1532305198] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 19:34:34,778 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 19:34:34,779 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-09 19:34:34,779 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [830012446] [2024-11-09 19:34:34,779 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 19:34:34,780 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-09 19:34:34,780 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 19:34:34,780 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-09 19:34:34,780 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-09 19:34:34,781 INFO L87 Difference]: Start difference. First operand 7450 states and 16461 transitions. Second operand has 3 states, 3 states have (on average 73.66666666666667) internal successors, (221), 3 states have internal predecessors, (221), 0 states have call successors, (0), 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:39,247 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 19:34:39,247 INFO L93 Difference]: Finished difference Result 17278 states and 39418 transitions. [2024-11-09 19:34:39,247 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-09 19:34:39,248 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 73.66666666666667) internal successors, (221), 3 states have internal predecessors, (221), 0 states have call successors, (0), 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 221 [2024-11-09 19:34:39,248 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 19:34:39,264 INFO L225 Difference]: With dead ends: 17278 [2024-11-09 19:34:39,264 INFO L226 Difference]: Without dead ends: 10618 [2024-11-09 19:34:39,268 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:39,269 INFO L432 NwaCegarLoop]: 798 mSDtfsCounter, 1617 mSDsluCounter, 121 mSDsCounter, 0 mSdLazyCounter, 3809 mSolverCounterSat, 929 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.7s 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.3s IncrementalHoareTripleChecker+Time [2024-11-09 19:34:39,269 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.3s Time] [2024-11-09 19:34:39,276 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10618 states. [2024-11-09 19:34:39,357 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10618 to 10610. [2024-11-09 19:34:39,371 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:39,385 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10610 states to 10610 states and 23355 transitions. [2024-11-09 19:34:39,385 INFO L78 Accepts]: Start accepts. Automaton has 10610 states and 23355 transitions. Word has length 221 [2024-11-09 19:34:39,386 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 19:34:39,386 INFO L471 AbstractCegarLoop]: Abstraction has 10610 states and 23355 transitions. [2024-11-09 19:34:39,387 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 73.66666666666667) internal successors, (221), 3 states have internal predecessors, (221), 0 states have call successors, (0), 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:39,387 INFO L276 IsEmpty]: Start isEmpty. Operand 10610 states and 23355 transitions. [2024-11-09 19:34:39,389 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 241 [2024-11-09 19:34:39,389 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 19:34:39,389 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 19:34:39,390 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-11-09 19:34:39,390 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 19:34:39,391 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 19:34:39,391 INFO L85 PathProgramCache]: Analyzing trace with hash -2078057266, now seen corresponding path program 1 times [2024-11-09 19:34:39,391 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 19:34:39,391 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [682327555] [2024-11-09 19:34:39,391 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 19:34:39,391 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 19:34:39,418 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 19:34:39,533 INFO L134 CoverageAnalysis]: Checked inductivity of 191 backedges. 105 proven. 0 refuted. 0 times theorem prover too weak. 86 trivial. 0 not checked. [2024-11-09 19:34:39,533 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 19:34:39,533 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [682327555] [2024-11-09 19:34:39,533 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [682327555] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 19:34:39,533 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 19:34:39,533 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-09 19:34:39,533 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [212741711] [2024-11-09 19:34:39,533 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 19:34:39,534 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-09 19:34:39,534 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 19:34:39,534 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-09 19:34:39,534 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-09 19:34:39,534 INFO L87 Difference]: Start difference. First operand 10610 states and 23355 transitions. Second operand has 3 states, 3 states have (on average 51.666666666666664) internal successors, (155), 2 states have internal predecessors, (155), 0 states have call successors, (0), 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,699 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 19:34:43,699 INFO L93 Difference]: Finished difference Result 29882 states and 66561 transitions. [2024-11-09 19:34:43,702 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-09 19:34:43,702 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 51.666666666666664) internal successors, (155), 2 states have internal predecessors, (155), 0 states have call successors, (0), 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 240 [2024-11-09 19:34:43,702 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 19:34:43,734 INFO L225 Difference]: With dead ends: 29882 [2024-11-09 19:34:43,735 INFO L226 Difference]: Without dead ends: 20062 [2024-11-09 19:34:43,746 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,748 INFO L432 NwaCegarLoop]: 907 mSDtfsCounter, 1578 mSDsluCounter, 149 mSDsCounter, 0 mSdLazyCounter, 3775 mSolverCounterSat, 871 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.4s 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:43,749 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:43,765 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20062 states. [2024-11-09 19:34:43,934 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20062 to 20061. [2024-11-09 19:34:43,958 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:43,983 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20061 states to 20061 states and 42772 transitions. [2024-11-09 19:34:43,983 INFO L78 Accepts]: Start accepts. Automaton has 20061 states and 42772 transitions. Word has length 240 [2024-11-09 19:34:43,984 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 19:34:43,984 INFO L471 AbstractCegarLoop]: Abstraction has 20061 states and 42772 transitions. [2024-11-09 19:34:43,984 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 51.666666666666664) internal successors, (155), 2 states have internal predecessors, (155), 0 states have call successors, (0), 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,985 INFO L276 IsEmpty]: Start isEmpty. Operand 20061 states and 42772 transitions. [2024-11-09 19:34:43,988 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 273 [2024-11-09 19:34:43,988 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 19:34:43,988 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:43,988 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-11-09 19:34:43,988 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 19:34:43,989 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 19:34:43,989 INFO L85 PathProgramCache]: Analyzing trace with hash 224015183, now seen corresponding path program 1 times [2024-11-09 19:34:43,990 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 19:34:43,990 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [897091272] [2024-11-09 19:34:43,990 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 19:34:43,990 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 19:34:44,020 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 19:34:44,091 INFO L134 CoverageAnalysis]: Checked inductivity of 194 backedges. 194 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 19:34:44,092 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 19:34:44,092 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [897091272] [2024-11-09 19:34:44,092 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [897091272] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 19:34:44,092 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 19:34:44,092 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-09 19:34:44,092 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [561388614] [2024-11-09 19:34:44,092 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 19:34:44,093 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-09 19:34:44,093 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 19:34:44,093 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-09 19:34:44,093 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-09 19:34:44,093 INFO L87 Difference]: Start difference. First operand 20061 states and 42772 transitions. Second operand has 3 states, 3 states have (on average 90.66666666666667) internal successors, (272), 3 states have internal predecessors, (272), 0 states have call successors, (0), 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,254 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 19:34:48,254 INFO L93 Difference]: Finished difference Result 39317 states and 84019 transitions. [2024-11-09 19:34:48,254 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-09 19:34:48,255 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 90.66666666666667) internal successors, (272), 3 states have internal predecessors, (272), 0 states have call successors, (0), 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 272 [2024-11-09 19:34:48,255 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 19:34:48,284 INFO L225 Difference]: With dead ends: 39317 [2024-11-09 19:34:48,284 INFO L226 Difference]: Without dead ends: 20046 [2024-11-09 19:34:48,301 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,304 INFO L432 NwaCegarLoop]: 2241 mSDtfsCounter, 1753 mSDsluCounter, 140 mSDsCounter, 0 mSdLazyCounter, 3787 mSolverCounterSat, 598 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.3s 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, 3.9s IncrementalHoareTripleChecker+Time [2024-11-09 19:34:48,304 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1753 Valid, 2381 Invalid, 4385 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [598 Valid, 3787 Invalid, 0 Unknown, 0 Unchecked, 3.9s Time] [2024-11-09 19:34:48,317 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20046 states. [2024-11-09 19:34:48,462 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20046 to 20044. [2024-11-09 19:34:48,481 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:48,504 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20044 states to 20044 states and 41220 transitions. [2024-11-09 19:34:48,504 INFO L78 Accepts]: Start accepts. Automaton has 20044 states and 41220 transitions. Word has length 272 [2024-11-09 19:34:48,505 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 19:34:48,505 INFO L471 AbstractCegarLoop]: Abstraction has 20044 states and 41220 transitions. [2024-11-09 19:34:48,505 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 90.66666666666667) internal successors, (272), 3 states have internal predecessors, (272), 0 states have call successors, (0), 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,505 INFO L276 IsEmpty]: Start isEmpty. Operand 20044 states and 41220 transitions. [2024-11-09 19:34:48,511 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 312 [2024-11-09 19:34:48,513 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 19:34:48,513 INFO L215 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 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:48,513 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-11-09 19:34:48,513 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 19:34:48,514 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 19:34:48,514 INFO L85 PathProgramCache]: Analyzing trace with hash -707214341, now seen corresponding path program 1 times [2024-11-09 19:34:48,514 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 19:34:48,514 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1186210925] [2024-11-09 19:34:48,514 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 19:34:48,514 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 19:34:48,547 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 19:34:48,660 INFO L134 CoverageAnalysis]: Checked inductivity of 382 backedges. 158 proven. 0 refuted. 0 times theorem prover too weak. 224 trivial. 0 not checked. [2024-11-09 19:34:48,660 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 19:34:48,660 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1186210925] [2024-11-09 19:34:48,660 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1186210925] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 19:34:48,660 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 19:34:48,660 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-09 19:34:48,660 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1559044970] [2024-11-09 19:34:48,661 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 19:34:48,661 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-09 19:34:48,661 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 19:34:48,661 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-09 19:34:48,661 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-09 19:34:48,661 INFO L87 Difference]: Start difference. First operand 20044 states and 41220 transitions. Second operand has 3 states, 3 states have (on average 52.0) internal successors, (156), 2 states have internal predecessors, (156), 0 states have call successors, (0), 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:53,274 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 19:34:53,274 INFO L93 Difference]: Finished difference Result 54299 states and 112323 transitions. [2024-11-09 19:34:53,278 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-09 19:34:53,279 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 52.0) internal successors, (156), 2 states have internal predecessors, (156), 0 states have call successors, (0), 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 311 [2024-11-09 19:34:53,280 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 19:34:53,368 INFO L225 Difference]: With dead ends: 54299 [2024-11-09 19:34:53,368 INFO L226 Difference]: Without dead ends: 35045 [2024-11-09 19:34:53,408 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:53,409 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:53,410 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:53,452 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35045 states. [2024-11-09 19:34:53,893 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35045 to 33455. [2024-11-09 19:34:53,939 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:54,017 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33455 states to 33455 states and 67823 transitions. [2024-11-09 19:34:54,022 INFO L78 Accepts]: Start accepts. Automaton has 33455 states and 67823 transitions. Word has length 311 [2024-11-09 19:34:54,023 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 19:34:54,024 INFO L471 AbstractCegarLoop]: Abstraction has 33455 states and 67823 transitions. [2024-11-09 19:34:54,024 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 52.0) internal successors, (156), 2 states have internal predecessors, (156), 0 states have call successors, (0), 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:54,024 INFO L276 IsEmpty]: Start isEmpty. Operand 33455 states and 67823 transitions. [2024-11-09 19:34:54,030 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 345 [2024-11-09 19:34:54,030 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 19:34:54,031 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:54,034 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-11-09 19:34:54,034 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 19:34:54,034 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 19:34:54,035 INFO L85 PathProgramCache]: Analyzing trace with hash 1961553684, now seen corresponding path program 1 times [2024-11-09 19:34:54,035 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 19:34:54,035 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [813296139] [2024-11-09 19:34:54,035 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 19:34:54,035 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 19:34:54,109 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 19:34:54,505 INFO L134 CoverageAnalysis]: Checked inductivity of 201 backedges. 201 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 19:34:54,505 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 19:34:54,505 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [813296139] [2024-11-09 19:34:54,505 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [813296139] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 19:34:54,505 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 19:34:54,505 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-09 19:34:54,506 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1504371245] [2024-11-09 19:34:54,506 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 19:34:54,506 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-09 19:34:54,506 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 19:34:54,507 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-09 19:34:54,507 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-09 19:34:54,508 INFO L87 Difference]: Start difference. First operand 33455 states and 67823 transitions. Second operand has 3 states, 3 states have (on average 114.66666666666667) internal successors, (344), 3 states have internal predecessors, (344), 0 states have call successors, (0), 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:58,510 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 19:34:58,511 INFO L93 Difference]: Finished difference Result 66933 states and 135681 transitions. [2024-11-09 19:34:58,511 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-09 19:34:58,512 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 114.66666666666667) internal successors, (344), 3 states have internal predecessors, (344), 0 states have call successors, (0), 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 344 [2024-11-09 19:34:58,512 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 19:34:58,549 INFO L225 Difference]: With dead ends: 66933 [2024-11-09 19:34:58,549 INFO L226 Difference]: Without dead ends: 32688 [2024-11-09 19:34:58,570 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:58,570 INFO L432 NwaCegarLoop]: 2439 mSDtfsCounter, 1408 mSDsluCounter, 142 mSDsCounter, 0 mSdLazyCounter, 3945 mSolverCounterSat, 310 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.2s 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:58,570 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:58,587 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32688 states. [2024-11-09 19:34:58,801 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32688 to 31875. [2024-11-09 19:34:58,827 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:59,199 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31875 states to 31875 states and 64302 transitions. [2024-11-09 19:34:59,199 INFO L78 Accepts]: Start accepts. Automaton has 31875 states and 64302 transitions. Word has length 344 [2024-11-09 19:34:59,199 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 19:34:59,203 INFO L471 AbstractCegarLoop]: Abstraction has 31875 states and 64302 transitions. [2024-11-09 19:34:59,203 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 114.66666666666667) internal successors, (344), 3 states have internal predecessors, (344), 0 states have call successors, (0), 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:59,204 INFO L276 IsEmpty]: Start isEmpty. Operand 31875 states and 64302 transitions. [2024-11-09 19:34:59,206 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 350 [2024-11-09 19:34:59,210 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 19:34:59,210 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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:59,210 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-11-09 19:34:59,211 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 19:34:59,212 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 19:34:59,212 INFO L85 PathProgramCache]: Analyzing trace with hash 10860377, now seen corresponding path program 1 times [2024-11-09 19:34:59,212 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 19:34:59,212 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2016686770] [2024-11-09 19:34:59,212 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 19:34:59,212 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 19:34:59,262 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 19:34:59,517 INFO L134 CoverageAnalysis]: Checked inductivity of 230 backedges. 230 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 19:34:59,518 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 19:34:59,518 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2016686770] [2024-11-09 19:34:59,518 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2016686770] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 19:34:59,518 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 19:34:59,518 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-09 19:34:59,518 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [475193187] [2024-11-09 19:34:59,518 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 19:34:59,519 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-09 19:34:59,519 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 19:34:59,519 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-09 19:34:59,520 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-11-09 19:34:59,520 INFO L87 Difference]: Start difference. First operand 31875 states and 64302 transitions. Second operand has 4 states, 4 states have (on average 87.25) internal successors, (349), 3 states have internal predecessors, (349), 0 states have call successors, (0), 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:05,395 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 19:35:05,396 INFO L93 Difference]: Finished difference Result 62165 states and 125571 transitions. [2024-11-09 19:35:05,396 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-09 19:35:05,396 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 87.25) internal successors, (349), 3 states have internal predecessors, (349), 0 states have call successors, (0), 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 349 [2024-11-09 19:35:05,396 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 19:35:05,434 INFO L225 Difference]: With dead ends: 62165 [2024-11-09 19:35:05,434 INFO L226 Difference]: Without dead ends: 35026 [2024-11-09 19:35:05,449 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:35:05,450 INFO L432 NwaCegarLoop]: 831 mSDtfsCounter, 2880 mSDsluCounter, 301 mSDsCounter, 0 mSdLazyCounter, 7441 mSolverCounterSat, 414 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2880 SdHoareTripleChecker+Valid, 1132 SdHoareTripleChecker+Invalid, 7855 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 414 IncrementalHoareTripleChecker+Valid, 7441 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 5.6s IncrementalHoareTripleChecker+Time [2024-11-09 19:35:05,450 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [2880 Valid, 1132 Invalid, 7855 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [414 Valid, 7441 Invalid, 0 Unknown, 0 Unchecked, 5.6s Time] [2024-11-09 19:35:05,466 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35026 states. [2024-11-09 19:35:05,670 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35026 to 32659. [2024-11-09 19:35:05,693 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:35:05,734 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32659 states to 32659 states and 65502 transitions. [2024-11-09 19:35:05,735 INFO L78 Accepts]: Start accepts. Automaton has 32659 states and 65502 transitions. Word has length 349 [2024-11-09 19:35:05,735 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 19:35:05,735 INFO L471 AbstractCegarLoop]: Abstraction has 32659 states and 65502 transitions. [2024-11-09 19:35:05,735 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 87.25) internal successors, (349), 3 states have internal predecessors, (349), 0 states have call successors, (0), 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:05,735 INFO L276 IsEmpty]: Start isEmpty. Operand 32659 states and 65502 transitions. [2024-11-09 19:35:05,739 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 386 [2024-11-09 19:35:05,739 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 19:35:05,739 INFO L215 NwaCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 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:35:05,739 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2024-11-09 19:35:05,739 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 19:35:05,740 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 19:35:05,740 INFO L85 PathProgramCache]: Analyzing trace with hash 757275321, now seen corresponding path program 1 times [2024-11-09 19:35:05,740 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 19:35:05,740 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [695300115] [2024-11-09 19:35:05,740 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 19:35:05,740 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 19:35:05,776 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 19:35:06,109 INFO L134 CoverageAnalysis]: Checked inductivity of 650 backedges. 211 proven. 0 refuted. 0 times theorem prover too weak. 439 trivial. 0 not checked. [2024-11-09 19:35:06,109 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 19:35:06,109 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [695300115] [2024-11-09 19:35:06,109 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [695300115] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 19:35:06,109 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 19:35:06,109 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-09 19:35:06,110 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [228682164] [2024-11-09 19:35:06,110 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 19:35:06,110 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-09 19:35:06,110 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 19:35:06,110 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-09 19:35:06,110 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-09 19:35:06,110 INFO L87 Difference]: Start difference. First operand 32659 states and 65502 transitions. Second operand has 3 states, 3 states have (on average 52.333333333333336) internal successors, (157), 3 states have internal predecessors, (157), 0 states have call successors, (0), 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:09,916 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 19:35:09,916 INFO L93 Difference]: Finished difference Result 64526 states and 129494 transitions. [2024-11-09 19:35:09,916 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-09 19:35:09,917 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 52.333333333333336) internal successors, (157), 3 states have internal predecessors, (157), 0 states have call successors, (0), 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 385 [2024-11-09 19:35:09,917 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 19:35:09,957 INFO L225 Difference]: With dead ends: 64526 [2024-11-09 19:35:09,957 INFO L226 Difference]: Without dead ends: 32657 [2024-11-09 19:35:09,976 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:09,977 INFO L432 NwaCegarLoop]: 2036 mSDtfsCounter, 1865 mSDsluCounter, 81 mSDsCounter, 0 mSdLazyCounter, 3771 mSolverCounterSat, 421 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1865 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.6s IncrementalHoareTripleChecker+Time [2024-11-09 19:35:09,977 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1865 Valid, 2117 Invalid, 4192 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [421 Valid, 3771 Invalid, 0 Unknown, 0 Unchecked, 3.6s Time] [2024-11-09 19:35:09,997 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32657 states. [2024-11-09 19:35:10,217 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32657 to 32656. [2024-11-09 19:35:10,237 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:10,279 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32656 states to 32656 states and 64696 transitions. [2024-11-09 19:35:10,280 INFO L78 Accepts]: Start accepts. Automaton has 32656 states and 64696 transitions. Word has length 385 [2024-11-09 19:35:10,280 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 19:35:10,281 INFO L471 AbstractCegarLoop]: Abstraction has 32656 states and 64696 transitions. [2024-11-09 19:35:10,281 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 52.333333333333336) internal successors, (157), 3 states have internal predecessors, (157), 0 states have call successors, (0), 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:10,281 INFO L276 IsEmpty]: Start isEmpty. Operand 32656 states and 64696 transitions. [2024-11-09 19:35:10,285 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 409 [2024-11-09 19:35:10,285 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 19:35:10,285 INFO L215 NwaCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 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:10,286 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2024-11-09 19:35:10,286 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 19:35:10,286 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 19:35:10,286 INFO L85 PathProgramCache]: Analyzing trace with hash 287523403, now seen corresponding path program 1 times [2024-11-09 19:35:10,286 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 19:35:10,286 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [841879070] [2024-11-09 19:35:10,286 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 19:35:10,287 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 19:35:10,325 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 19:35:10,731 INFO L134 CoverageAnalysis]: Checked inductivity of 673 backedges. 501 proven. 0 refuted. 0 times theorem prover too weak. 172 trivial. 0 not checked. [2024-11-09 19:35:10,732 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 19:35:10,732 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [841879070] [2024-11-09 19:35:10,732 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [841879070] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 19:35:10,732 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 19:35:10,732 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-09 19:35:10,733 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [224074934] [2024-11-09 19:35:10,733 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 19:35:10,734 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-09 19:35:10,734 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 19:35:10,734 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-09 19:35:10,734 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-11-09 19:35:10,735 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) [2024-11-09 19:35:18,087 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 19:35:18,087 INFO L93 Difference]: Finished difference Result 113587 states and 225554 transitions. [2024-11-09 19:35:18,091 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-09 19:35:18,091 INFO L78 Accepts]: Start accepts. Automaton has 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) Word has length 408 [2024-11-09 19:35:18,092 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 19:35:18,187 INFO L225 Difference]: With dead ends: 113587 [2024-11-09 19:35:18,187 INFO L226 Difference]: Without dead ends: 81721 [2024-11-09 19:35:18,213 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:35:18,213 INFO L432 NwaCegarLoop]: 643 mSDtfsCounter, 3137 mSDsluCounter, 190 mSDsCounter, 0 mSdLazyCounter, 8709 mSolverCounterSat, 988 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 5.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3137 SdHoareTripleChecker+Valid, 833 SdHoareTripleChecker+Invalid, 9697 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 988 IncrementalHoareTripleChecker+Valid, 8709 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 6.9s IncrementalHoareTripleChecker+Time [2024-11-09 19:35:18,213 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [3137 Valid, 833 Invalid, 9697 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [988 Valid, 8709 Invalid, 0 Unknown, 0 Unchecked, 6.9s Time] [2024-11-09 19:35:18,264 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 81721 states. [2024-11-09 19:35:19,131 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 81721 to 80806. [2024-11-09 19:35:19,232 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 80806 states, 80805 states have (on average 1.977340511106986) internal successors, (159779), 80805 states have internal predecessors, (159779), 0 states have call successors, (0), 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:19,691 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 80806 states to 80806 states and 159779 transitions. [2024-11-09 19:35:19,695 INFO L78 Accepts]: Start accepts. Automaton has 80806 states and 159779 transitions. Word has length 408 [2024-11-09 19:35:19,696 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 19:35:19,696 INFO L471 AbstractCegarLoop]: Abstraction has 80806 states and 159779 transitions. [2024-11-09 19:35:19,697 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has 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) [2024-11-09 19:35:19,697 INFO L276 IsEmpty]: Start isEmpty. Operand 80806 states and 159779 transitions. [2024-11-09 19:35:19,712 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 499 [2024-11-09 19:35:19,712 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 19:35:19,716 INFO L215 NwaCegarLoop]: trace histogram [6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 19:35:19,716 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2024-11-09 19:35:19,716 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 19:35:19,717 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 19:35:19,717 INFO L85 PathProgramCache]: Analyzing trace with hash 1349979009, now seen corresponding path program 1 times [2024-11-09 19:35:19,717 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 19:35:19,717 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1325297324] [2024-11-09 19:35:19,717 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 19:35:19,717 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 19:35:19,785 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 19:35:20,046 INFO L134 CoverageAnalysis]: Checked inductivity of 1056 backedges. 795 proven. 0 refuted. 0 times theorem prover too weak. 261 trivial. 0 not checked. [2024-11-09 19:35:20,046 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 19:35:20,046 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1325297324] [2024-11-09 19:35:20,047 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1325297324] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 19:35:20,047 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 19:35:20,047 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-09 19:35:20,047 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [945998033] [2024-11-09 19:35:20,047 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 19:35:20,047 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-09 19:35:20,048 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 19:35:20,048 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-09 19:35:20,048 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-09 19:35:20,049 INFO L87 Difference]: Start difference. First operand 80806 states and 159779 transitions. Second operand has 3 states, 3 states have (on average 97.66666666666667) internal successors, (293), 3 states have internal predecessors, (293), 0 states have call successors, (0), 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:24,397 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 19:35:24,398 INFO L93 Difference]: Finished difference Result 162399 states and 321070 transitions. [2024-11-09 19:35:24,398 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-09 19:35:24,399 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 97.66666666666667) internal successors, (293), 3 states have internal predecessors, (293), 0 states have call successors, (0), 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 498 [2024-11-09 19:35:24,399 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 19:35:24,642 INFO L225 Difference]: With dead ends: 162399 [2024-11-09 19:35:24,643 INFO L226 Difference]: Without dead ends: 82383 [2024-11-09 19:35:24,667 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:35:24,667 INFO L432 NwaCegarLoop]: 2057 mSDtfsCounter, 1652 mSDsluCounter, 83 mSDsCounter, 0 mSdLazyCounter, 3818 mSolverCounterSat, 568 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1652 SdHoareTripleChecker+Valid, 2140 SdHoareTripleChecker+Invalid, 4386 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 568 IncrementalHoareTripleChecker+Valid, 3818 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.8s IncrementalHoareTripleChecker+Time [2024-11-09 19:35:24,668 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1652 Valid, 2140 Invalid, 4386 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [568 Valid, 3818 Invalid, 0 Unknown, 0 Unchecked, 3.8s Time] [2024-11-09 19:35:24,736 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 82383 states. [2024-11-09 19:35:25,452 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 82383 to 80796. [2024-11-09 19:35:25,504 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 80796 states, 80795 states have (on average 1.963116529488211) internal successors, (158610), 80795 states have internal predecessors, (158610), 0 states have call successors, (0), 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:25,813 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 80796 states to 80796 states and 158610 transitions. [2024-11-09 19:35:25,814 INFO L78 Accepts]: Start accepts. Automaton has 80796 states and 158610 transitions. Word has length 498 [2024-11-09 19:35:25,814 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 19:35:25,814 INFO L471 AbstractCegarLoop]: Abstraction has 80796 states and 158610 transitions. [2024-11-09 19:35:25,814 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 97.66666666666667) internal successors, (293), 3 states have internal predecessors, (293), 0 states have call successors, (0), 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:25,814 INFO L276 IsEmpty]: Start isEmpty. Operand 80796 states and 158610 transitions. [2024-11-09 19:35:25,823 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 513 [2024-11-09 19:35:25,823 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 19:35:25,823 INFO L215 NwaCegarLoop]: trace histogram [6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 19:35:25,823 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2024-11-09 19:35:25,824 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 19:35:25,824 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 19:35:25,824 INFO L85 PathProgramCache]: Analyzing trace with hash 1045570460, now seen corresponding path program 1 times [2024-11-09 19:35:25,824 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 19:35:25,824 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1145694402] [2024-11-09 19:35:25,824 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 19:35:25,825 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 19:35:25,877 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 19:35:26,877 INFO L134 CoverageAnalysis]: Checked inductivity of 1059 backedges. 772 proven. 52 refuted. 0 times theorem prover too weak. 235 trivial. 0 not checked. [2024-11-09 19:35:26,877 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 19:35:26,877 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1145694402] [2024-11-09 19:35:26,878 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1145694402] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-09 19:35:26,878 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [122501408] [2024-11-09 19:35:26,878 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 19:35:26,878 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 19:35:26,878 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 19:35:26,883 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-09 19:35:26,887 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2024-11-09 19:35:27,060 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 19:35:27,064 INFO L255 TraceCheckSpWp]: Trace formula consists of 699 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-11-09 19:35:27,074 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 19:35:27,695 INFO L134 CoverageAnalysis]: Checked inductivity of 1059 backedges. 797 proven. 0 refuted. 0 times theorem prover too weak. 262 trivial. 0 not checked. [2024-11-09 19:35:27,695 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-09 19:35:27,695 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [122501408] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 19:35:27,696 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-09 19:35:27,696 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [4] total 6 [2024-11-09 19:35:27,696 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1357343213] [2024-11-09 19:35:27,696 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 19:35:27,696 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-09 19:35:27,696 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 19:35:27,697 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-09 19:35:27,697 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2024-11-09 19:35:27,697 INFO L87 Difference]: Start difference. First operand 80796 states and 158610 transitions. Second operand has 3 states, 3 states have (on average 102.0) 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:35:32,196 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 19:35:32,196 INFO L93 Difference]: Finished difference Result 193099 states and 380167 transitions. [2024-11-09 19:35:32,196 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-09 19:35:32,196 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 102.0) 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 512 [2024-11-09 19:35:32,197 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 19:35:32,348 INFO L225 Difference]: With dead ends: 193099 [2024-11-09 19:35:32,348 INFO L226 Difference]: Without dead ends: 117034 [2024-11-09 19:35:32,374 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 515 GetRequests, 511 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2024-11-09 19:35:32,378 INFO L432 NwaCegarLoop]: 905 mSDtfsCounter, 1444 mSDsluCounter, 158 mSDsCounter, 0 mSdLazyCounter, 3810 mSolverCounterSat, 702 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1444 SdHoareTripleChecker+Valid, 1063 SdHoareTripleChecker+Invalid, 4512 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 702 IncrementalHoareTripleChecker+Valid, 3810 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.9s IncrementalHoareTripleChecker+Time [2024-11-09 19:35:32,379 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1444 Valid, 1063 Invalid, 4512 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [702 Valid, 3810 Invalid, 0 Unknown, 0 Unchecked, 3.9s Time] [2024-11-09 19:35:32,445 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 117034 states. [2024-11-09 19:35:33,594 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 117034 to 87853. [2024-11-09 19:35:33,662 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 87853 states, 87852 states have (on average 1.9560169375768337) internal successors, (171840), 87852 states have internal predecessors, (171840), 0 states have call successors, (0), 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:33,968 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 87853 states to 87853 states and 171840 transitions. [2024-11-09 19:35:33,969 INFO L78 Accepts]: Start accepts. Automaton has 87853 states and 171840 transitions. Word has length 512 [2024-11-09 19:35:33,970 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 19:35:33,970 INFO L471 AbstractCegarLoop]: Abstraction has 87853 states and 171840 transitions. [2024-11-09 19:35:33,970 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 102.0) 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:35:33,970 INFO L276 IsEmpty]: Start isEmpty. Operand 87853 states and 171840 transitions. [2024-11-09 19:35:33,977 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 515 [2024-11-09 19:35:33,977 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 19:35:33,981 INFO L215 NwaCegarLoop]: trace histogram [6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:35:34,000 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2024-11-09 19:35:34,181 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable13 [2024-11-09 19:35:34,182 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 19:35:34,183 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 19:35:34,183 INFO L85 PathProgramCache]: Analyzing trace with hash -534278946, now seen corresponding path program 1 times [2024-11-09 19:35:34,183 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 19:35:34,183 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1789064004] [2024-11-09 19:35:34,183 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 19:35:34,184 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 19:35:34,233 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 19:35:34,397 INFO L134 CoverageAnalysis]: Checked inductivity of 1020 backedges. 692 proven. 0 refuted. 0 times theorem prover too weak. 328 trivial. 0 not checked. [2024-11-09 19:35:34,397 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 19:35:34,397 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1789064004] [2024-11-09 19:35:34,397 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1789064004] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 19:35:34,397 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 19:35:34,397 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-09 19:35:34,398 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1747990784] [2024-11-09 19:35:34,398 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 19:35:34,399 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-09 19:35:34,400 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 19:35:34,401 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-09 19:35:34,401 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-09 19:35:34,401 INFO L87 Difference]: Start difference. First operand 87853 states and 171840 transitions. Second operand has 3 states, 3 states have (on average 92.66666666666667) internal successors, (278), 3 states have internal predecessors, (278), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)