./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/seq-mthreaded/pals_opt-floodmax.4.1.ufo.UNBOUNDED.pals.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/seq-mthreaded/pals_opt-floodmax.4.1.ufo.UNBOUNDED.pals.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 ed935744e0b15a55a11878fa4d21c1a0b8f1c4098e81aa4afd54cd8910ee834a --- Real Ultimate output --- This is Ultimate 0.2.5-tmp.fs.icfgbuilder-eval-023d838-m [2024-11-09 23:38:44,020 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-09 23:38:44,082 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-11-09 23:38:44,087 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-09 23:38:44,087 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-09 23:38:44,116 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-09 23:38:44,117 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-09 23:38:44,117 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-09 23:38:44,118 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-09 23:38:44,119 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-09 23:38:44,120 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-09 23:38:44,120 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-09 23:38:44,120 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-09 23:38:44,122 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-09 23:38:44,122 INFO L153 SettingsManager]: * Use SBE=true [2024-11-09 23:38:44,122 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-09 23:38:44,123 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-09 23:38:44,123 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-09 23:38:44,123 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-09 23:38:44,123 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-09 23:38:44,127 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-09 23:38:44,127 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-09 23:38:44,127 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-09 23:38:44,127 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-09 23:38:44,128 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-09 23:38:44,128 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-09 23:38:44,128 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-09 23:38:44,128 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-09 23:38:44,129 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2024-11-09 23:38:44,129 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-09 23:38:44,129 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-09 23:38:44,129 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-09 23:38:44,130 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-09 23:38:44,130 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-09 23:38:44,130 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-09 23:38:44,131 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-09 23:38:44,131 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-09 23:38:44,131 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-09 23:38:44,132 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-09 23:38:44,132 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-09 23:38:44,132 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-09 23:38:44,133 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-09 23:38:44,133 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 -> ed935744e0b15a55a11878fa4d21c1a0b8f1c4098e81aa4afd54cd8910ee834a [2024-11-09 23:38:44,346 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-09 23:38:44,367 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-09 23:38:44,370 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-09 23:38:44,371 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-09 23:38:44,372 INFO L274 PluginConnector]: CDTParser initialized [2024-11-09 23:38:44,373 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/seq-mthreaded/pals_opt-floodmax.4.1.ufo.UNBOUNDED.pals.c [2024-11-09 23:38:45,599 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-09 23:38:45,856 INFO L384 CDTParser]: Found 1 translation units. [2024-11-09 23:38:45,859 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/seq-mthreaded/pals_opt-floodmax.4.1.ufo.UNBOUNDED.pals.c [2024-11-09 23:38:45,876 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/3161b2596/6c837d5fe71c4520969c79d29738a05b/FLAGb5ef7a532 [2024-11-09 23:38:46,195 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/3161b2596/6c837d5fe71c4520969c79d29738a05b [2024-11-09 23:38:46,197 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-09 23:38:46,198 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-09 23:38:46,199 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-09 23:38:46,199 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-09 23:38:46,204 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-09 23:38:46,204 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.11 11:38:46" (1/1) ... [2024-11-09 23:38:46,205 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6d0c4144 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 11:38:46, skipping insertion in model container [2024-11-09 23:38:46,205 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.11 11:38:46" (1/1) ... [2024-11-09 23:38:46,236 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-09 23:38:46,507 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/seq-mthreaded/pals_opt-floodmax.4.1.ufo.UNBOUNDED.pals.c[26792,26805] [2024-11-09 23:38:46,511 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-09 23:38:46,523 INFO L200 MainTranslator]: Completed pre-run [2024-11-09 23:38:46,593 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/seq-mthreaded/pals_opt-floodmax.4.1.ufo.UNBOUNDED.pals.c[26792,26805] [2024-11-09 23:38:46,594 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-09 23:38:46,612 INFO L204 MainTranslator]: Completed translation [2024-11-09 23:38:46,612 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 11:38:46 WrapperNode [2024-11-09 23:38:46,613 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-09 23:38:46,614 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-09 23:38:46,615 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-09 23:38:46,616 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-09 23:38:46,621 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 11:38:46" (1/1) ... [2024-11-09 23:38:46,636 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 11:38:46" (1/1) ... [2024-11-09 23:38:46,676 INFO L138 Inliner]: procedures = 24, calls = 15, calls flagged for inlining = 10, calls inlined = 10, statements flattened = 998 [2024-11-09 23:38:46,677 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-09 23:38:46,680 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-09 23:38:46,680 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-09 23:38:46,680 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-09 23:38:46,696 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 11:38:46" (1/1) ... [2024-11-09 23:38:46,696 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 11:38:46" (1/1) ... [2024-11-09 23:38:46,704 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 11:38:46" (1/1) ... [2024-11-09 23:38:46,722 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 23:38:46,726 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 11:38:46" (1/1) ... [2024-11-09 23:38:46,726 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 11:38:46" (1/1) ... [2024-11-09 23:38:46,747 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 11:38:46" (1/1) ... [2024-11-09 23:38:46,753 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 11:38:46" (1/1) ... [2024-11-09 23:38:46,756 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 11:38:46" (1/1) ... [2024-11-09 23:38:46,761 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 11:38:46" (1/1) ... [2024-11-09 23:38:46,773 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-09 23:38:46,774 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2024-11-09 23:38:46,774 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2024-11-09 23:38:46,774 INFO L274 PluginConnector]: IcfgBuilder initialized [2024-11-09 23:38:46,775 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 11:38:46" (1/1) ... [2024-11-09 23:38:46,782 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-09 23:38:46,793 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 23:38:46,816 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 23:38:46,821 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 23:38:46,866 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-09 23:38:46,867 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-11-09 23:38:46,867 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-09 23:38:46,867 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-09 23:38:47,012 INFO L256 CfgBuilder]: Building ICFG [2024-11-09 23:38:47,018 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-09 23:38:47,969 INFO L? ?]: Removed 103 outVars from TransFormulas that were not future-live. [2024-11-09 23:38:47,969 INFO L307 CfgBuilder]: Performing block encoding [2024-11-09 23:38:47,989 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-09 23:38:47,989 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2024-11-09 23:38:47,990 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 09.11 11:38:47 BoogieIcfgContainer [2024-11-09 23:38:47,991 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2024-11-09 23:38:47,992 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-09 23:38:47,992 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-09 23:38:47,994 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-09 23:38:47,995 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 09.11 11:38:46" (1/3) ... [2024-11-09 23:38:47,995 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7649ca0e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.11 11:38:47, skipping insertion in model container [2024-11-09 23:38:47,995 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 11:38:46" (2/3) ... [2024-11-09 23:38:47,995 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7649ca0e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.11 11:38:47, skipping insertion in model container [2024-11-09 23:38:47,995 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 09.11 11:38:47" (3/3) ... [2024-11-09 23:38:47,996 INFO L112 eAbstractionObserver]: Analyzing ICFG pals_opt-floodmax.4.1.ufo.UNBOUNDED.pals.c [2024-11-09 23:38:48,008 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-09 23:38:48,009 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-11-09 23:38:48,068 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-09 23:38:48,073 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;@7fb7be18, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-09 23:38:48,073 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-09 23:38:48,078 INFO L276 IsEmpty]: Start isEmpty. Operand has 326 states, 324 states have (on average 1.7407407407407407) internal successors, (564), 325 states have internal predecessors, (564), 0 states have call successors, (0), 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 23:38:48,091 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 80 [2024-11-09 23:38:48,092 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 23:38:48,094 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, 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 23:38:48,094 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 23:38:48,098 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 23:38:48,098 INFO L85 PathProgramCache]: Analyzing trace with hash -484254583, now seen corresponding path program 1 times [2024-11-09 23:38:48,105 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 23:38:48,105 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [678287827] [2024-11-09 23:38:48,105 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 23:38:48,106 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 23:38:48,423 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 23:38:48,617 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 23:38:48,618 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 23:38:48,618 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [678287827] [2024-11-09 23:38:48,618 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [678287827] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 23:38:48,618 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 23:38:48,619 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-09 23:38:48,620 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1686126784] [2024-11-09 23:38:48,621 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 23:38:48,625 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-11-09 23:38:48,626 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 23:38:48,648 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-11-09 23:38:48,649 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-09 23:38:48,652 INFO L87 Difference]: Start difference. First operand has 326 states, 324 states have (on average 1.7407407407407407) internal successors, (564), 325 states have internal predecessors, (564), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 2 states, 2 states have (on average 39.5) internal successors, (79), 2 states have internal predecessors, (79), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 23:38:48,697 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 23:38:48,699 INFO L93 Difference]: Finished difference Result 440 states and 762 transitions. [2024-11-09 23:38:48,700 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-09 23:38:48,702 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 39.5) internal successors, (79), 2 states have internal predecessors, (79), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 79 [2024-11-09 23:38:48,702 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 23:38:48,714 INFO L225 Difference]: With dead ends: 440 [2024-11-09 23:38:48,714 INFO L226 Difference]: Without dead ends: 321 [2024-11-09 23:38:48,718 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-09 23:38:48,723 INFO L432 NwaCegarLoop]: 556 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 0 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 556 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-09 23:38:48,724 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 556 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-09 23:38:48,742 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 321 states. [2024-11-09 23:38:48,772 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 321 to 321. [2024-11-09 23:38:48,775 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 321 states, 320 states have (on average 1.7375) internal successors, (556), 320 states have internal predecessors, (556), 0 states have call successors, (0), 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 23:38:48,777 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 321 states to 321 states and 556 transitions. [2024-11-09 23:38:48,781 INFO L78 Accepts]: Start accepts. Automaton has 321 states and 556 transitions. Word has length 79 [2024-11-09 23:38:48,781 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 23:38:48,781 INFO L471 AbstractCegarLoop]: Abstraction has 321 states and 556 transitions. [2024-11-09 23:38:48,781 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 39.5) internal successors, (79), 2 states have internal predecessors, (79), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 23:38:48,782 INFO L276 IsEmpty]: Start isEmpty. Operand 321 states and 556 transitions. [2024-11-09 23:38:48,784 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 80 [2024-11-09 23:38:48,784 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 23:38:48,785 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, 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 23:38:48,785 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-09 23:38:48,785 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 23:38:48,786 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 23:38:48,786 INFO L85 PathProgramCache]: Analyzing trace with hash -453234776, now seen corresponding path program 1 times [2024-11-09 23:38:48,786 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 23:38:48,786 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1405068864] [2024-11-09 23:38:48,786 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 23:38:48,787 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 23:38:48,848 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 23:38:49,115 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 23:38:49,116 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 23:38:49,116 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1405068864] [2024-11-09 23:38:49,116 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1405068864] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 23:38:49,116 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 23:38:49,116 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-09 23:38:49,117 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [177217373] [2024-11-09 23:38:49,117 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 23:38:49,118 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-09 23:38:49,118 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 23:38:49,119 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-09 23:38:49,121 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-09 23:38:49,121 INFO L87 Difference]: Start difference. First operand 321 states and 556 transitions. Second operand has 5 states, 5 states have (on average 15.8) internal successors, (79), 5 states have internal predecessors, (79), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 23:38:49,220 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 23:38:49,221 INFO L93 Difference]: Finished difference Result 438 states and 754 transitions. [2024-11-09 23:38:49,221 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-09 23:38:49,221 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 15.8) internal successors, (79), 5 states have internal predecessors, (79), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 79 [2024-11-09 23:38:49,222 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 23:38:49,224 INFO L225 Difference]: With dead ends: 438 [2024-11-09 23:38:49,226 INFO L226 Difference]: Without dead ends: 321 [2024-11-09 23:38:49,227 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-09 23:38:49,227 INFO L432 NwaCegarLoop]: 554 mSDtfsCounter, 0 mSDsluCounter, 1623 mSDsCounter, 0 mSdLazyCounter, 13 mSolverCounterSat, 33 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 2177 SdHoareTripleChecker+Invalid, 46 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 33 IncrementalHoareTripleChecker+Valid, 13 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-09 23:38:49,228 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 2177 Invalid, 46 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [33 Valid, 13 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-09 23:38:49,230 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 321 states. [2024-11-09 23:38:49,244 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 321 to 321. [2024-11-09 23:38:49,245 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 321 states, 320 states have (on average 1.63125) internal successors, (522), 320 states have internal predecessors, (522), 0 states have call successors, (0), 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 23:38:49,248 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 321 states to 321 states and 522 transitions. [2024-11-09 23:38:49,248 INFO L78 Accepts]: Start accepts. Automaton has 321 states and 522 transitions. Word has length 79 [2024-11-09 23:38:49,249 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 23:38:49,249 INFO L471 AbstractCegarLoop]: Abstraction has 321 states and 522 transitions. [2024-11-09 23:38:49,250 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 15.8) internal successors, (79), 5 states have internal predecessors, (79), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 23:38:49,250 INFO L276 IsEmpty]: Start isEmpty. Operand 321 states and 522 transitions. [2024-11-09 23:38:49,252 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 113 [2024-11-09 23:38:49,252 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 23:38:49,253 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 23:38:49,253 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-09 23:38:49,253 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 23:38:49,260 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 23:38:49,260 INFO L85 PathProgramCache]: Analyzing trace with hash 24682426, now seen corresponding path program 1 times [2024-11-09 23:38:49,260 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 23:38:49,260 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1553811564] [2024-11-09 23:38:49,260 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 23:38:49,260 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 23:38:49,356 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 23:38:49,580 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 23:38:49,581 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 23:38:49,582 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1553811564] [2024-11-09 23:38:49,582 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1553811564] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 23:38:49,582 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 23:38:49,582 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-09 23:38:49,582 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2034708931] [2024-11-09 23:38:49,583 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 23:38:49,583 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-09 23:38:49,583 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 23:38:49,585 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-09 23:38:49,585 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-09 23:38:49,585 INFO L87 Difference]: Start difference. First operand 321 states and 522 transitions. Second operand has 3 states, 3 states have (on average 37.333333333333336) internal successors, (112), 3 states have internal predecessors, (112), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 23:38:49,636 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 23:38:49,636 INFO L93 Difference]: Finished difference Result 535 states and 888 transitions. [2024-11-09 23:38:49,636 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-09 23:38:49,637 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 37.333333333333336) internal successors, (112), 3 states have internal predecessors, (112), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 112 [2024-11-09 23:38:49,638 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 23:38:49,639 INFO L225 Difference]: With dead ends: 535 [2024-11-09 23:38:49,640 INFO L226 Difference]: Without dead ends: 422 [2024-11-09 23:38:49,640 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 23:38:49,641 INFO L432 NwaCegarLoop]: 515 mSDtfsCounter, 162 mSDsluCounter, 477 mSDsCounter, 0 mSdLazyCounter, 23 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 162 SdHoareTripleChecker+Valid, 992 SdHoareTripleChecker+Invalid, 29 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 23 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-09 23:38:49,642 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [162 Valid, 992 Invalid, 29 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 23 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-09 23:38:49,643 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 422 states. [2024-11-09 23:38:49,655 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 422 to 418. [2024-11-09 23:38:49,660 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 418 states, 417 states have (on average 1.6426858513189448) internal successors, (685), 417 states have internal predecessors, (685), 0 states have call successors, (0), 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 23:38:49,661 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 418 states to 418 states and 685 transitions. [2024-11-09 23:38:49,661 INFO L78 Accepts]: Start accepts. Automaton has 418 states and 685 transitions. Word has length 112 [2024-11-09 23:38:49,661 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 23:38:49,661 INFO L471 AbstractCegarLoop]: Abstraction has 418 states and 685 transitions. [2024-11-09 23:38:49,661 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 37.333333333333336) internal successors, (112), 3 states have internal predecessors, (112), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 23:38:49,662 INFO L276 IsEmpty]: Start isEmpty. Operand 418 states and 685 transitions. [2024-11-09 23:38:49,662 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 116 [2024-11-09 23:38:49,663 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 23:38:49,663 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 23:38:49,663 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-11-09 23:38:49,663 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 23:38:49,667 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 23:38:49,667 INFO L85 PathProgramCache]: Analyzing trace with hash -775467293, now seen corresponding path program 1 times [2024-11-09 23:38:49,668 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 23:38:49,668 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1455466307] [2024-11-09 23:38:49,668 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 23:38:49,668 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 23:38:49,715 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 23:38:49,790 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 23:38:49,790 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 23:38:49,791 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1455466307] [2024-11-09 23:38:49,791 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1455466307] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 23:38:49,791 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 23:38:49,791 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-09 23:38:49,792 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [160017211] [2024-11-09 23:38:49,792 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 23:38:49,792 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-09 23:38:49,793 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 23:38:49,793 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-09 23:38:49,793 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-09 23:38:49,794 INFO L87 Difference]: Start difference. First operand 418 states and 685 transitions. Second operand has 3 states, 3 states have (on average 38.333333333333336) internal successors, (115), 3 states have internal predecessors, (115), 0 states have call successors, (0), 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 23:38:49,822 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 23:38:49,822 INFO L93 Difference]: Finished difference Result 818 states and 1363 transitions. [2024-11-09 23:38:49,822 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-09 23:38:49,823 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 38.333333333333336) internal successors, (115), 3 states have internal predecessors, (115), 0 states have call successors, (0), 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 115 [2024-11-09 23:38:49,823 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 23:38:49,826 INFO L225 Difference]: With dead ends: 818 [2024-11-09 23:38:49,826 INFO L226 Difference]: Without dead ends: 608 [2024-11-09 23:38:49,829 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 23:38:49,830 INFO L432 NwaCegarLoop]: 519 mSDtfsCounter, 163 mSDsluCounter, 486 mSDsCounter, 0 mSdLazyCounter, 11 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 163 SdHoareTripleChecker+Valid, 1005 SdHoareTripleChecker+Invalid, 13 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 11 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-09 23:38:49,830 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [163 Valid, 1005 Invalid, 13 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 11 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-09 23:38:49,831 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 608 states. [2024-11-09 23:38:49,838 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 608 to 603. [2024-11-09 23:38:49,839 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 603 states, 602 states have (on average 1.6578073089700998) internal successors, (998), 602 states have internal predecessors, (998), 0 states have call successors, (0), 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 23:38:49,840 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 603 states to 603 states and 998 transitions. [2024-11-09 23:38:49,841 INFO L78 Accepts]: Start accepts. Automaton has 603 states and 998 transitions. Word has length 115 [2024-11-09 23:38:49,841 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 23:38:49,841 INFO L471 AbstractCegarLoop]: Abstraction has 603 states and 998 transitions. [2024-11-09 23:38:49,841 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 38.333333333333336) internal successors, (115), 3 states have internal predecessors, (115), 0 states have call successors, (0), 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 23:38:49,841 INFO L276 IsEmpty]: Start isEmpty. Operand 603 states and 998 transitions. [2024-11-09 23:38:49,842 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 119 [2024-11-09 23:38:49,842 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 23:38:49,842 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 23:38:49,843 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-11-09 23:38:49,843 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 23:38:49,843 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 23:38:49,843 INFO L85 PathProgramCache]: Analyzing trace with hash -545026620, now seen corresponding path program 1 times [2024-11-09 23:38:49,843 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 23:38:49,843 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1187141093] [2024-11-09 23:38:49,844 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 23:38:49,844 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 23:38:49,879 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 23:38:49,984 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 23:38:49,984 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 23:38:49,984 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1187141093] [2024-11-09 23:38:49,985 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1187141093] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 23:38:49,985 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 23:38:49,985 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-09 23:38:49,985 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [962012029] [2024-11-09 23:38:49,985 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 23:38:49,986 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-09 23:38:49,986 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 23:38:49,986 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-09 23:38:49,986 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-09 23:38:49,987 INFO L87 Difference]: Start difference. First operand 603 states and 998 transitions. Second operand has 3 states, 3 states have (on average 39.333333333333336) internal successors, (118), 3 states have internal predecessors, (118), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 23:38:50,016 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 23:38:50,017 INFO L93 Difference]: Finished difference Result 1353 states and 2266 transitions. [2024-11-09 23:38:50,017 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-09 23:38:50,017 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 39.333333333333336) internal successors, (118), 3 states have internal predecessors, (118), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 118 [2024-11-09 23:38:50,018 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 23:38:50,020 INFO L225 Difference]: With dead ends: 1353 [2024-11-09 23:38:50,021 INFO L226 Difference]: Without dead ends: 958 [2024-11-09 23:38:50,022 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 23:38:50,022 INFO L432 NwaCegarLoop]: 519 mSDtfsCounter, 156 mSDsluCounter, 487 mSDsCounter, 0 mSdLazyCounter, 11 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 156 SdHoareTripleChecker+Valid, 1006 SdHoareTripleChecker+Invalid, 13 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 11 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-09 23:38:50,023 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [156 Valid, 1006 Invalid, 13 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 11 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-09 23:38:50,024 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 958 states. [2024-11-09 23:38:50,038 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 958 to 951. [2024-11-09 23:38:50,039 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 951 states, 950 states have (on average 1.6652631578947368) internal successors, (1582), 950 states have internal predecessors, (1582), 0 states have call successors, (0), 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 23:38:50,041 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 951 states to 951 states and 1582 transitions. [2024-11-09 23:38:50,041 INFO L78 Accepts]: Start accepts. Automaton has 951 states and 1582 transitions. Word has length 118 [2024-11-09 23:38:50,042 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 23:38:50,042 INFO L471 AbstractCegarLoop]: Abstraction has 951 states and 1582 transitions. [2024-11-09 23:38:50,042 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 39.333333333333336) internal successors, (118), 3 states have internal predecessors, (118), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 23:38:50,043 INFO L276 IsEmpty]: Start isEmpty. Operand 951 states and 1582 transitions. [2024-11-09 23:38:50,044 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 122 [2024-11-09 23:38:50,044 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 23:38:50,044 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 23:38:50,045 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-11-09 23:38:50,045 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 23:38:50,045 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 23:38:50,045 INFO L85 PathProgramCache]: Analyzing trace with hash -57973011, now seen corresponding path program 1 times [2024-11-09 23:38:50,045 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 23:38:50,045 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [4899089] [2024-11-09 23:38:50,046 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 23:38:50,046 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 23:38:50,082 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 23:38:50,175 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 23:38:50,175 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 23:38:50,175 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [4899089] [2024-11-09 23:38:50,175 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [4899089] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 23:38:50,175 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 23:38:50,176 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-09 23:38:50,176 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1610693898] [2024-11-09 23:38:50,176 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 23:38:50,177 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-09 23:38:50,177 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 23:38:50,177 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-09 23:38:50,178 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-09 23:38:50,178 INFO L87 Difference]: Start difference. First operand 951 states and 1582 transitions. Second operand has 3 states, 3 states have (on average 40.333333333333336) internal successors, (121), 3 states have internal predecessors, (121), 0 states have call successors, (0), 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 23:38:50,213 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 23:38:50,214 INFO L93 Difference]: Finished difference Result 2357 states and 3946 transitions. [2024-11-09 23:38:50,214 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-09 23:38:50,214 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 40.333333333333336) internal successors, (121), 3 states have internal predecessors, (121), 0 states have call successors, (0), 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 121 [2024-11-09 23:38:50,215 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 23:38:50,222 INFO L225 Difference]: With dead ends: 2357 [2024-11-09 23:38:50,222 INFO L226 Difference]: Without dead ends: 1614 [2024-11-09 23:38:50,223 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 23:38:50,226 INFO L432 NwaCegarLoop]: 519 mSDtfsCounter, 149 mSDsluCounter, 488 mSDsCounter, 0 mSdLazyCounter, 11 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 149 SdHoareTripleChecker+Valid, 1007 SdHoareTripleChecker+Invalid, 13 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 11 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-09 23:38:50,226 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [149 Valid, 1007 Invalid, 13 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 11 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-09 23:38:50,228 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1614 states. [2024-11-09 23:38:50,248 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1614 to 1603. [2024-11-09 23:38:50,251 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1603 states, 1602 states have (on average 1.6641697877652935) internal successors, (2666), 1602 states have internal predecessors, (2666), 0 states have call successors, (0), 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 23:38:50,254 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1603 states to 1603 states and 2666 transitions. [2024-11-09 23:38:50,256 INFO L78 Accepts]: Start accepts. Automaton has 1603 states and 2666 transitions. Word has length 121 [2024-11-09 23:38:50,257 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 23:38:50,258 INFO L471 AbstractCegarLoop]: Abstraction has 1603 states and 2666 transitions. [2024-11-09 23:38:50,258 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 40.333333333333336) internal successors, (121), 3 states have internal predecessors, (121), 0 states have call successors, (0), 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 23:38:50,258 INFO L276 IsEmpty]: Start isEmpty. Operand 1603 states and 2666 transitions. [2024-11-09 23:38:50,259 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 125 [2024-11-09 23:38:50,259 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 23:38:50,259 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 23:38:50,260 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-11-09 23:38:50,260 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 23:38:50,260 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 23:38:50,261 INFO L85 PathProgramCache]: Analyzing trace with hash 1724417486, now seen corresponding path program 1 times [2024-11-09 23:38:50,261 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 23:38:50,262 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [886868839] [2024-11-09 23:38:50,262 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 23:38:50,262 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 23:38:50,297 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 23:38:50,444 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 23:38:50,445 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 23:38:50,445 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [886868839] [2024-11-09 23:38:50,445 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [886868839] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 23:38:50,445 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 23:38:50,445 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-09 23:38:50,445 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [578557243] [2024-11-09 23:38:50,446 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 23:38:50,446 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-09 23:38:50,446 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 23:38:50,446 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-09 23:38:50,447 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-11-09 23:38:50,447 INFO L87 Difference]: Start difference. First operand 1603 states and 2666 transitions. Second operand has 6 states, 6 states have (on average 20.666666666666668) internal successors, (124), 6 states have internal predecessors, (124), 0 states have call successors, (0), 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 23:38:50,710 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 23:38:50,711 INFO L93 Difference]: Finished difference Result 8131 states and 13750 transitions. [2024-11-09 23:38:50,711 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-11-09 23:38:50,711 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 20.666666666666668) internal successors, (124), 6 states have internal predecessors, (124), 0 states have call successors, (0), 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 124 [2024-11-09 23:38:50,711 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 23:38:50,730 INFO L225 Difference]: With dead ends: 8131 [2024-11-09 23:38:50,730 INFO L226 Difference]: Without dead ends: 6736 [2024-11-09 23:38:50,735 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=40, Invalid=70, Unknown=0, NotChecked=0, Total=110 [2024-11-09 23:38:50,736 INFO L432 NwaCegarLoop]: 530 mSDtfsCounter, 1522 mSDsluCounter, 4046 mSDsCounter, 0 mSdLazyCounter, 226 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1522 SdHoareTripleChecker+Valid, 4576 SdHoareTripleChecker+Invalid, 233 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 226 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-09 23:38:50,736 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1522 Valid, 4576 Invalid, 233 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 226 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-09 23:38:50,741 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6736 states. [2024-11-09 23:38:50,807 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6736 to 2882. [2024-11-09 23:38:50,811 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2882 states, 2881 states have (on average 1.6737244012495662) internal successors, (4822), 2881 states have internal predecessors, (4822), 0 states have call successors, (0), 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 23:38:50,817 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2882 states to 2882 states and 4822 transitions. [2024-11-09 23:38:50,817 INFO L78 Accepts]: Start accepts. Automaton has 2882 states and 4822 transitions. Word has length 124 [2024-11-09 23:38:50,817 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 23:38:50,817 INFO L471 AbstractCegarLoop]: Abstraction has 2882 states and 4822 transitions. [2024-11-09 23:38:50,818 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 20.666666666666668) internal successors, (124), 6 states have internal predecessors, (124), 0 states have call successors, (0), 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 23:38:50,818 INFO L276 IsEmpty]: Start isEmpty. Operand 2882 states and 4822 transitions. [2024-11-09 23:38:50,819 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 126 [2024-11-09 23:38:50,819 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 23:38:50,820 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 23:38:50,820 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-11-09 23:38:50,820 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 23:38:50,821 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 23:38:50,821 INFO L85 PathProgramCache]: Analyzing trace with hash -657976100, now seen corresponding path program 1 times [2024-11-09 23:38:50,821 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 23:38:50,821 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1187833115] [2024-11-09 23:38:50,821 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 23:38:50,821 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 23:38:50,853 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 23:38:50,987 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 23:38:50,987 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 23:38:50,987 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1187833115] [2024-11-09 23:38:50,987 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1187833115] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 23:38:50,988 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 23:38:50,988 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-09 23:38:50,988 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1975271947] [2024-11-09 23:38:50,988 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 23:38:50,988 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-09 23:38:50,988 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 23:38:50,989 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-09 23:38:50,989 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-09 23:38:50,989 INFO L87 Difference]: Start difference. First operand 2882 states and 4822 transitions. Second operand has 4 states, 4 states have (on average 31.25) internal successors, (125), 4 states have internal predecessors, (125), 0 states have call successors, (0), 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 23:38:51,108 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 23:38:51,108 INFO L93 Difference]: Finished difference Result 8400 states and 14166 transitions. [2024-11-09 23:38:51,109 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-09 23:38:51,109 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 31.25) internal successors, (125), 4 states have internal predecessors, (125), 0 states have call successors, (0), 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 125 [2024-11-09 23:38:51,109 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 23:38:51,124 INFO L225 Difference]: With dead ends: 8400 [2024-11-09 23:38:51,124 INFO L226 Difference]: Without dead ends: 5726 [2024-11-09 23:38:51,129 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 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 23:38:51,130 INFO L432 NwaCegarLoop]: 523 mSDtfsCounter, 559 mSDsluCounter, 1160 mSDsCounter, 0 mSdLazyCounter, 50 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 559 SdHoareTripleChecker+Valid, 1683 SdHoareTripleChecker+Invalid, 52 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 50 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-09 23:38:51,130 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [559 Valid, 1683 Invalid, 52 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 50 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-09 23:38:51,136 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5726 states. [2024-11-09 23:38:51,222 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5726 to 4286. [2024-11-09 23:38:51,227 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4286 states, 4285 states have (on average 1.676779463243874) internal successors, (7185), 4285 states have internal predecessors, (7185), 0 states have call successors, (0), 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 23:38:51,235 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4286 states to 4286 states and 7185 transitions. [2024-11-09 23:38:51,235 INFO L78 Accepts]: Start accepts. Automaton has 4286 states and 7185 transitions. Word has length 125 [2024-11-09 23:38:51,236 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 23:38:51,236 INFO L471 AbstractCegarLoop]: Abstraction has 4286 states and 7185 transitions. [2024-11-09 23:38:51,236 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 31.25) internal successors, (125), 4 states have internal predecessors, (125), 0 states have call successors, (0), 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 23:38:51,236 INFO L276 IsEmpty]: Start isEmpty. Operand 4286 states and 7185 transitions. [2024-11-09 23:38:51,238 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 127 [2024-11-09 23:38:51,238 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 23:38:51,238 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 23:38:51,238 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-11-09 23:38:51,238 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 23:38:51,239 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 23:38:51,239 INFO L85 PathProgramCache]: Analyzing trace with hash -1554991536, now seen corresponding path program 1 times [2024-11-09 23:38:51,239 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 23:38:51,239 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [593695526] [2024-11-09 23:38:51,239 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 23:38:51,239 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 23:38:51,266 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 23:38:51,345 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 23:38:51,345 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 23:38:51,345 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [593695526] [2024-11-09 23:38:51,346 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [593695526] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 23:38:51,346 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 23:38:51,346 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-09 23:38:51,346 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [424874474] [2024-11-09 23:38:51,346 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 23:38:51,347 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-09 23:38:51,347 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 23:38:51,347 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-09 23:38:51,348 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-09 23:38:51,348 INFO L87 Difference]: Start difference. First operand 4286 states and 7185 transitions. Second operand has 4 states, 4 states have (on average 31.5) internal successors, (126), 4 states have internal predecessors, (126), 0 states have call successors, (0), 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 23:38:51,482 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 23:38:51,482 INFO L93 Difference]: Finished difference Result 12532 states and 21104 transitions. [2024-11-09 23:38:51,483 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-09 23:38:51,483 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 31.5) internal successors, (126), 4 states have internal predecessors, (126), 0 states have call successors, (0), 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 126 [2024-11-09 23:38:51,483 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 23:38:51,508 INFO L225 Difference]: With dead ends: 12532 [2024-11-09 23:38:51,508 INFO L226 Difference]: Without dead ends: 8454 [2024-11-09 23:38:51,515 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 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 23:38:51,515 INFO L432 NwaCegarLoop]: 511 mSDtfsCounter, 559 mSDsluCounter, 1162 mSDsCounter, 0 mSdLazyCounter, 50 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 559 SdHoareTripleChecker+Valid, 1673 SdHoareTripleChecker+Invalid, 52 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 50 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-09 23:38:51,516 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [559 Valid, 1673 Invalid, 52 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 50 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-09 23:38:51,521 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8454 states. [2024-11-09 23:38:51,667 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8454 to 6345. [2024-11-09 23:38:51,676 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6345 states, 6344 states have (on average 1.674968474148802) internal successors, (10626), 6344 states have internal predecessors, (10626), 0 states have call successors, (0), 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 23:38:51,691 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6345 states to 6345 states and 10626 transitions. [2024-11-09 23:38:51,692 INFO L78 Accepts]: Start accepts. Automaton has 6345 states and 10626 transitions. Word has length 126 [2024-11-09 23:38:51,692 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 23:38:51,693 INFO L471 AbstractCegarLoop]: Abstraction has 6345 states and 10626 transitions. [2024-11-09 23:38:51,693 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 31.5) internal successors, (126), 4 states have internal predecessors, (126), 0 states have call successors, (0), 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 23:38:51,693 INFO L276 IsEmpty]: Start isEmpty. Operand 6345 states and 10626 transitions. [2024-11-09 23:38:51,696 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 128 [2024-11-09 23:38:51,696 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 23:38:51,696 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 23:38:51,696 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-11-09 23:38:51,696 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 23:38:51,697 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 23:38:51,697 INFO L85 PathProgramCache]: Analyzing trace with hash 645042718, now seen corresponding path program 1 times [2024-11-09 23:38:51,697 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 23:38:51,697 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [919686424] [2024-11-09 23:38:51,697 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 23:38:51,697 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 23:38:51,734 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 23:38:51,816 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 23:38:51,817 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 23:38:51,817 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [919686424] [2024-11-09 23:38:51,817 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [919686424] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 23:38:51,817 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 23:38:51,817 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-09 23:38:51,817 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1010237627] [2024-11-09 23:38:51,817 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 23:38:51,818 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-09 23:38:51,818 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 23:38:51,818 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-09 23:38:51,818 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-09 23:38:51,819 INFO L87 Difference]: Start difference. First operand 6345 states and 10626 transitions. Second operand has 4 states, 4 states have (on average 31.75) internal successors, (127), 4 states have internal predecessors, (127), 0 states have call successors, (0), 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 23:38:51,974 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 23:38:51,975 INFO L93 Difference]: Finished difference Result 18644 states and 31344 transitions. [2024-11-09 23:38:51,975 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-09 23:38:51,975 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 31.75) internal successors, (127), 4 states have internal predecessors, (127), 0 states have call successors, (0), 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 127 [2024-11-09 23:38:51,976 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 23:38:52,002 INFO L225 Difference]: With dead ends: 18644 [2024-11-09 23:38:52,002 INFO L226 Difference]: Without dead ends: 12507 [2024-11-09 23:38:52,012 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 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 23:38:52,012 INFO L432 NwaCegarLoop]: 511 mSDtfsCounter, 557 mSDsluCounter, 1164 mSDsCounter, 0 mSdLazyCounter, 50 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 557 SdHoareTripleChecker+Valid, 1675 SdHoareTripleChecker+Invalid, 52 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 50 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-09 23:38:52,013 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [557 Valid, 1675 Invalid, 52 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 50 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-09 23:38:52,022 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12507 states. [2024-11-09 23:38:52,219 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12507 to 9391. [2024-11-09 23:38:52,234 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9391 states, 9390 states have (on average 1.6726304579339724) internal successors, (15706), 9390 states have internal predecessors, (15706), 0 states have call successors, (0), 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 23:38:52,253 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9391 states to 9391 states and 15706 transitions. [2024-11-09 23:38:52,254 INFO L78 Accepts]: Start accepts. Automaton has 9391 states and 15706 transitions. Word has length 127 [2024-11-09 23:38:52,254 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 23:38:52,254 INFO L471 AbstractCegarLoop]: Abstraction has 9391 states and 15706 transitions. [2024-11-09 23:38:52,254 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 31.75) internal successors, (127), 4 states have internal predecessors, (127), 0 states have call successors, (0), 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 23:38:52,255 INFO L276 IsEmpty]: Start isEmpty. Operand 9391 states and 15706 transitions. [2024-11-09 23:38:52,257 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 129 [2024-11-09 23:38:52,257 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 23:38:52,258 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 23:38:52,258 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2024-11-09 23:38:52,258 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 23:38:52,258 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 23:38:52,259 INFO L85 PathProgramCache]: Analyzing trace with hash -2014544127, now seen corresponding path program 1 times [2024-11-09 23:38:52,259 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 23:38:52,259 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [347417220] [2024-11-09 23:38:52,259 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 23:38:52,259 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 23:38:52,288 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 23:38:52,334 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 23:38:52,335 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 23:38:52,335 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [347417220] [2024-11-09 23:38:52,335 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [347417220] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 23:38:52,335 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 23:38:52,335 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-09 23:38:52,335 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1237382492] [2024-11-09 23:38:52,335 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 23:38:52,336 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-09 23:38:52,336 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 23:38:52,336 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-09 23:38:52,336 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-09 23:38:52,336 INFO L87 Difference]: Start difference. First operand 9391 states and 15706 transitions. Second operand has 3 states, 3 states have (on average 42.666666666666664) internal successors, (128), 3 states have internal predecessors, (128), 0 states have call successors, (0), 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 23:38:52,510 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 23:38:52,511 INFO L93 Difference]: Finished difference Result 21209 states and 35563 transitions. [2024-11-09 23:38:52,511 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-09 23:38:52,512 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 42.666666666666664) internal successors, (128), 3 states have internal predecessors, (128), 0 states have call successors, (0), 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 128 [2024-11-09 23:38:52,512 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 23:38:52,530 INFO L225 Difference]: With dead ends: 21209 [2024-11-09 23:38:52,530 INFO L226 Difference]: Without dead ends: 14637 [2024-11-09 23:38:52,534 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 23:38:52,534 INFO L432 NwaCegarLoop]: 666 mSDtfsCounter, 169 mSDsluCounter, 490 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 169 SdHoareTripleChecker+Valid, 1156 SdHoareTripleChecker+Invalid, 7 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 4 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-09 23:38:52,534 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [169 Valid, 1156 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-09 23:38:52,542 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14637 states. [2024-11-09 23:38:52,686 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14637 to 14634. [2024-11-09 23:38:52,705 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 14634 states, 14633 states have (on average 1.6656188068065332) internal successors, (24373), 14633 states have internal predecessors, (24373), 0 states have call successors, (0), 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 23:38:52,728 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14634 states to 14634 states and 24373 transitions. [2024-11-09 23:38:52,729 INFO L78 Accepts]: Start accepts. Automaton has 14634 states and 24373 transitions. Word has length 128 [2024-11-09 23:38:52,730 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 23:38:52,730 INFO L471 AbstractCegarLoop]: Abstraction has 14634 states and 24373 transitions. [2024-11-09 23:38:52,730 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 42.666666666666664) internal successors, (128), 3 states have internal predecessors, (128), 0 states have call successors, (0), 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 23:38:52,730 INFO L276 IsEmpty]: Start isEmpty. Operand 14634 states and 24373 transitions. [2024-11-09 23:38:52,732 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 129 [2024-11-09 23:38:52,732 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 23:38:52,732 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 23:38:52,732 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2024-11-09 23:38:52,732 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 23:38:52,733 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 23:38:52,733 INFO L85 PathProgramCache]: Analyzing trace with hash 556081659, now seen corresponding path program 1 times [2024-11-09 23:38:52,733 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 23:38:52,733 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [748810811] [2024-11-09 23:38:52,733 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 23:38:52,733 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 23:38:52,759 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 23:38:52,808 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 23:38:52,808 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 23:38:52,808 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [748810811] [2024-11-09 23:38:52,808 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [748810811] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 23:38:52,808 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 23:38:52,808 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-09 23:38:52,808 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2118807657] [2024-11-09 23:38:52,808 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 23:38:52,809 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-09 23:38:52,809 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 23:38:52,809 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-09 23:38:52,809 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-09 23:38:52,809 INFO L87 Difference]: Start difference. First operand 14634 states and 24373 transitions. Second operand has 3 states, 3 states have (on average 42.666666666666664) internal successors, (128), 3 states have internal predecessors, (128), 0 states have call successors, (0), 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 23:38:53,084 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 23:38:53,084 INFO L93 Difference]: Finished difference Result 32725 states and 54457 transitions. [2024-11-09 23:38:53,085 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-09 23:38:53,085 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 42.666666666666664) internal successors, (128), 3 states have internal predecessors, (128), 0 states have call successors, (0), 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 128 [2024-11-09 23:38:53,085 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 23:38:53,125 INFO L225 Difference]: With dead ends: 32725 [2024-11-09 23:38:53,125 INFO L226 Difference]: Without dead ends: 22571 [2024-11-09 23:38:53,144 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 23:38:53,145 INFO L432 NwaCegarLoop]: 658 mSDtfsCounter, 162 mSDsluCounter, 491 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 162 SdHoareTripleChecker+Valid, 1149 SdHoareTripleChecker+Invalid, 7 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 4 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-09 23:38:53,145 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [162 Valid, 1149 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-09 23:38:53,164 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22571 states. [2024-11-09 23:38:53,542 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22571 to 22568. [2024-11-09 23:38:53,577 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 22568 states, 22567 states have (on average 1.6532104400230425) internal successors, (37308), 22567 states have internal predecessors, (37308), 0 states have call successors, (0), 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 23:38:53,624 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22568 states to 22568 states and 37308 transitions. [2024-11-09 23:38:53,625 INFO L78 Accepts]: Start accepts. Automaton has 22568 states and 37308 transitions. Word has length 128 [2024-11-09 23:38:53,626 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 23:38:53,626 INFO L471 AbstractCegarLoop]: Abstraction has 22568 states and 37308 transitions. [2024-11-09 23:38:53,626 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 42.666666666666664) internal successors, (128), 3 states have internal predecessors, (128), 0 states have call successors, (0), 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 23:38:53,626 INFO L276 IsEmpty]: Start isEmpty. Operand 22568 states and 37308 transitions. [2024-11-09 23:38:53,627 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 129 [2024-11-09 23:38:53,627 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 23:38:53,627 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 23:38:53,628 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2024-11-09 23:38:53,628 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 23:38:53,628 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 23:38:53,628 INFO L85 PathProgramCache]: Analyzing trace with hash -1999862719, now seen corresponding path program 1 times [2024-11-09 23:38:53,628 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 23:38:53,629 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [525183969] [2024-11-09 23:38:53,629 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 23:38:53,629 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 23:38:53,659 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 23:38:53,711 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 23:38:53,712 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 23:38:53,712 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [525183969] [2024-11-09 23:38:53,712 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [525183969] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 23:38:53,712 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 23:38:53,712 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-09 23:38:53,712 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1877493260] [2024-11-09 23:38:53,712 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 23:38:53,713 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-09 23:38:53,713 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 23:38:53,713 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-09 23:38:53,713 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-09 23:38:53,713 INFO L87 Difference]: Start difference. First operand 22568 states and 37308 transitions. Second operand has 3 states, 3 states have (on average 42.666666666666664) internal successors, (128), 3 states have internal predecessors, (128), 0 states have call successors, (0), 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 23:38:54,103 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 23:38:54,104 INFO L93 Difference]: Finished difference Result 50370 states and 83144 transitions. [2024-11-09 23:38:54,104 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-09 23:38:54,104 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 42.666666666666664) internal successors, (128), 3 states have internal predecessors, (128), 0 states have call successors, (0), 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 128 [2024-11-09 23:38:54,105 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 23:38:54,161 INFO L225 Difference]: With dead ends: 50370 [2024-11-09 23:38:54,162 INFO L226 Difference]: Without dead ends: 34609 [2024-11-09 23:38:54,186 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 23:38:54,187 INFO L432 NwaCegarLoop]: 642 mSDtfsCounter, 155 mSDsluCounter, 492 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 155 SdHoareTripleChecker+Valid, 1134 SdHoareTripleChecker+Invalid, 7 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 4 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-09 23:38:54,187 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [155 Valid, 1134 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-09 23:38:54,213 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34609 states. [2024-11-09 23:38:54,727 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34609 to 34606. [2024-11-09 23:38:54,772 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 34606 states, 34605 states have (on average 1.638289264557145) internal successors, (56693), 34605 states have internal predecessors, (56693), 0 states have call successors, (0), 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 23:38:54,831 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34606 states to 34606 states and 56693 transitions. [2024-11-09 23:38:54,832 INFO L78 Accepts]: Start accepts. Automaton has 34606 states and 56693 transitions. Word has length 128 [2024-11-09 23:38:54,832 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 23:38:54,832 INFO L471 AbstractCegarLoop]: Abstraction has 34606 states and 56693 transitions. [2024-11-09 23:38:54,833 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 42.666666666666664) internal successors, (128), 3 states have internal predecessors, (128), 0 states have call successors, (0), 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 23:38:54,833 INFO L276 IsEmpty]: Start isEmpty. Operand 34606 states and 56693 transitions. [2024-11-09 23:38:54,833 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 129 [2024-11-09 23:38:54,834 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 23:38:54,834 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 23:38:54,834 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2024-11-09 23:38:54,834 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 23:38:54,835 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 23:38:54,835 INFO L85 PathProgramCache]: Analyzing trace with hash -1787525957, now seen corresponding path program 1 times [2024-11-09 23:38:54,835 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 23:38:54,835 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1103352541] [2024-11-09 23:38:54,835 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 23:38:54,835 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 23:38:54,863 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 23:38:54,925 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 23:38:54,926 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 23:38:54,926 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1103352541] [2024-11-09 23:38:54,926 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1103352541] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 23:38:54,926 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 23:38:54,926 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-09 23:38:54,926 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [629194100] [2024-11-09 23:38:54,927 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 23:38:54,927 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-09 23:38:54,927 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 23:38:54,927 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-09 23:38:54,928 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-09 23:38:54,928 INFO L87 Difference]: Start difference. First operand 34606 states and 56693 transitions. Second operand has 3 states, 3 states have (on average 42.666666666666664) internal successors, (128), 3 states have internal predecessors, (128), 0 states have call successors, (0), 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 23:38:55,465 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 23:38:55,465 INFO L93 Difference]: Finished difference Result 68473 states and 112065 transitions. [2024-11-09 23:38:55,466 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-09 23:38:55,466 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 42.666666666666664) internal successors, (128), 3 states have internal predecessors, (128), 0 states have call successors, (0), 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 128 [2024-11-09 23:38:55,466 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 23:38:55,552 INFO L225 Difference]: With dead ends: 68473 [2024-11-09 23:38:55,553 INFO L226 Difference]: Without dead ends: 49044 [2024-11-09 23:38:55,572 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 23:38:55,573 INFO L432 NwaCegarLoop]: 627 mSDtfsCounter, 148 mSDsluCounter, 493 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 148 SdHoareTripleChecker+Valid, 1120 SdHoareTripleChecker+Invalid, 7 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 4 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-09 23:38:55,573 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [148 Valid, 1120 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-09 23:38:55,603 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 49044 states. [2024-11-09 23:38:56,353 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 49044 to 49041. [2024-11-09 23:38:56,412 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 49041 states, 49040 states have (on average 1.623858075040783) internal successors, (79634), 49040 states have internal predecessors, (79634), 0 states have call successors, (0), 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 23:38:56,719 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 49041 states to 49041 states and 79634 transitions. [2024-11-09 23:38:56,721 INFO L78 Accepts]: Start accepts. Automaton has 49041 states and 79634 transitions. Word has length 128 [2024-11-09 23:38:56,721 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 23:38:56,721 INFO L471 AbstractCegarLoop]: Abstraction has 49041 states and 79634 transitions. [2024-11-09 23:38:56,721 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 42.666666666666664) internal successors, (128), 3 states have internal predecessors, (128), 0 states have call successors, (0), 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 23:38:56,721 INFO L276 IsEmpty]: Start isEmpty. Operand 49041 states and 79634 transitions. [2024-11-09 23:38:56,722 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 129 [2024-11-09 23:38:56,722 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 23:38:56,722 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 23:38:56,722 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2024-11-09 23:38:56,723 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 23:38:56,723 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 23:38:56,723 INFO L85 PathProgramCache]: Analyzing trace with hash 69369554, now seen corresponding path program 1 times [2024-11-09 23:38:56,723 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 23:38:56,723 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1014684260] [2024-11-09 23:38:56,723 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 23:38:56,723 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 23:38:56,748 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 23:38:56,824 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 23:38:56,824 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 23:38:56,824 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1014684260] [2024-11-09 23:38:56,825 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1014684260] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 23:38:56,825 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 23:38:56,825 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-09 23:38:56,825 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2037412226] [2024-11-09 23:38:56,825 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 23:38:56,825 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-09 23:38:56,825 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 23:38:56,826 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-09 23:38:56,826 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-09 23:38:56,826 INFO L87 Difference]: Start difference. First operand 49041 states and 79634 transitions. Second operand has 4 states, 4 states have (on average 32.0) internal successors, (128), 4 states have internal predecessors, (128), 0 states have call successors, (0), 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 23:38:58,105 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 23:38:58,106 INFO L93 Difference]: Finished difference Result 158527 states and 257735 transitions. [2024-11-09 23:38:58,107 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-09 23:38:58,107 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 32.0) internal successors, (128), 4 states have internal predecessors, (128), 0 states have call successors, (0), 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 128 [2024-11-09 23:38:58,107 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 23:38:58,356 INFO L225 Difference]: With dead ends: 158527 [2024-11-09 23:38:58,357 INFO L226 Difference]: Without dead ends: 109727 [2024-11-09 23:38:58,416 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 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 23:38:58,417 INFO L432 NwaCegarLoop]: 511 mSDtfsCounter, 555 mSDsluCounter, 1166 mSDsCounter, 0 mSdLazyCounter, 50 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 555 SdHoareTripleChecker+Valid, 1677 SdHoareTripleChecker+Invalid, 52 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 50 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-09 23:38:58,417 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [555 Valid, 1677 Invalid, 52 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 50 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-09 23:38:58,494 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 109727 states. [2024-11-09 23:39:00,470 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 109727 to 79158. [2024-11-09 23:39:00,560 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 79158 states, 79157 states have (on average 1.6162815670123931) internal successors, (127940), 79157 states have internal predecessors, (127940), 0 states have call successors, (0), 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 23:39:00,711 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 79158 states to 79158 states and 127940 transitions. [2024-11-09 23:39:00,714 INFO L78 Accepts]: Start accepts. Automaton has 79158 states and 127940 transitions. Word has length 128 [2024-11-09 23:39:00,715 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 23:39:00,715 INFO L471 AbstractCegarLoop]: Abstraction has 79158 states and 127940 transitions. [2024-11-09 23:39:00,715 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 32.0) internal successors, (128), 4 states have internal predecessors, (128), 0 states have call successors, (0), 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 23:39:00,715 INFO L276 IsEmpty]: Start isEmpty. Operand 79158 states and 127940 transitions. [2024-11-09 23:39:00,717 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 131 [2024-11-09 23:39:00,718 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 23:39:00,718 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 23:39:00,718 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2024-11-09 23:39:00,718 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 23:39:00,718 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 23:39:00,719 INFO L85 PathProgramCache]: Analyzing trace with hash -1657282732, now seen corresponding path program 1 times [2024-11-09 23:39:00,719 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 23:39:00,719 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [130827247] [2024-11-09 23:39:00,719 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 23:39:00,719 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 23:39:00,745 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 23:39:00,970 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 23:39:00,971 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 23:39:00,971 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [130827247] [2024-11-09 23:39:00,971 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [130827247] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 23:39:00,973 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 23:39:00,973 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-09 23:39:00,973 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1298183181] [2024-11-09 23:39:00,973 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 23:39:00,973 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-09 23:39:00,974 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 23:39:00,974 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-09 23:39:00,974 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2024-11-09 23:39:00,975 INFO L87 Difference]: Start difference. First operand 79158 states and 127940 transitions. Second operand has 6 states, 6 states have (on average 21.666666666666668) internal successors, (130), 6 states have internal predecessors, (130), 0 states have call successors, (0), 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 23:39:01,950 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 23:39:01,951 INFO L93 Difference]: Finished difference Result 158078 states and 255503 transitions. [2024-11-09 23:39:01,951 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-09 23:39:01,952 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 21.666666666666668) internal successors, (130), 6 states have internal predecessors, (130), 0 states have call successors, (0), 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 130 [2024-11-09 23:39:01,952 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 23:39:02,482 INFO L225 Difference]: With dead ends: 158078 [2024-11-09 23:39:02,483 INFO L226 Difference]: Without dead ends: 79161 [2024-11-09 23:39:02,544 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=24, Invalid=32, Unknown=0, NotChecked=0, Total=56 [2024-11-09 23:39:02,545 INFO L432 NwaCegarLoop]: 520 mSDtfsCounter, 305 mSDsluCounter, 1446 mSDsCounter, 0 mSdLazyCounter, 74 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 305 SdHoareTripleChecker+Valid, 1966 SdHoareTripleChecker+Invalid, 78 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 74 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-09 23:39:02,545 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [305 Valid, 1966 Invalid, 78 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 74 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-09 23:39:02,582 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 79161 states. [2024-11-09 23:39:03,829 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 79161 to 79158. [2024-11-09 23:39:03,909 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 79158 states, 79157 states have (on average 1.6083858660636456) internal successors, (127315), 79157 states have internal predecessors, (127315), 0 states have call successors, (0), 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 23:39:04,098 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 79158 states to 79158 states and 127315 transitions. [2024-11-09 23:39:04,103 INFO L78 Accepts]: Start accepts. Automaton has 79158 states and 127315 transitions. Word has length 130 [2024-11-09 23:39:04,103 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 23:39:04,104 INFO L471 AbstractCegarLoop]: Abstraction has 79158 states and 127315 transitions. [2024-11-09 23:39:04,104 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 21.666666666666668) internal successors, (130), 6 states have internal predecessors, (130), 0 states have call successors, (0), 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 23:39:04,104 INFO L276 IsEmpty]: Start isEmpty. Operand 79158 states and 127315 transitions. [2024-11-09 23:39:04,105 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 136 [2024-11-09 23:39:04,105 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 23:39:04,105 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 23:39:04,105 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2024-11-09 23:39:04,105 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 23:39:04,106 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 23:39:04,106 INFO L85 PathProgramCache]: Analyzing trace with hash -678073785, now seen corresponding path program 1 times [2024-11-09 23:39:04,106 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 23:39:04,106 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1250731215] [2024-11-09 23:39:04,106 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 23:39:04,106 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 23:39:04,170 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 23:39:04,660 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 23:39:04,660 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 23:39:04,661 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1250731215] [2024-11-09 23:39:04,661 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1250731215] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 23:39:04,661 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 23:39:04,661 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-09 23:39:04,661 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [531245421] [2024-11-09 23:39:04,661 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 23:39:04,661 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-09 23:39:04,661 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 23:39:04,662 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-09 23:39:04,662 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2024-11-09 23:39:04,662 INFO L87 Difference]: Start difference. First operand 79158 states and 127315 transitions. Second operand has 6 states, 6 states have (on average 22.5) internal successors, (135), 6 states have internal predecessors, (135), 0 states have call successors, (0), 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 23:39:05,907 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 23:39:05,907 INFO L93 Difference]: Finished difference Result 231396 states and 372675 transitions. [2024-11-09 23:39:05,908 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-09 23:39:05,908 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 22.5) internal successors, (135), 6 states have internal predecessors, (135), 0 states have call successors, (0), 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 135 [2024-11-09 23:39:05,908 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 23:39:06,164 INFO L225 Difference]: With dead ends: 231396 [2024-11-09 23:39:06,165 INFO L226 Difference]: Without dead ends: 152479 [2024-11-09 23:39:06,230 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=24, Invalid=32, Unknown=0, NotChecked=0, Total=56 [2024-11-09 23:39:06,232 INFO L432 NwaCegarLoop]: 509 mSDtfsCounter, 444 mSDsluCounter, 1464 mSDsCounter, 0 mSdLazyCounter, 65 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 444 SdHoareTripleChecker+Valid, 1973 SdHoareTripleChecker+Invalid, 72 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 65 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-09 23:39:06,232 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [444 Valid, 1973 Invalid, 72 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 65 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-09 23:39:06,347 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 152479 states. [2024-11-09 23:39:09,466 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 152479 to 152476. [2024-11-09 23:39:09,605 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 152476 states, 152475 states have (on average 1.598425971470733) internal successors, (243720), 152475 states have internal predecessors, (243720), 0 states have call successors, (0), 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 23:39:09,916 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 152476 states to 152476 states and 243720 transitions. [2024-11-09 23:39:09,922 INFO L78 Accepts]: Start accepts. Automaton has 152476 states and 243720 transitions. Word has length 135 [2024-11-09 23:39:09,922 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 23:39:09,922 INFO L471 AbstractCegarLoop]: Abstraction has 152476 states and 243720 transitions. [2024-11-09 23:39:09,923 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 22.5) internal successors, (135), 6 states have internal predecessors, (135), 0 states have call successors, (0), 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 23:39:09,923 INFO L276 IsEmpty]: Start isEmpty. Operand 152476 states and 243720 transitions. [2024-11-09 23:39:09,924 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 138 [2024-11-09 23:39:09,924 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 23:39:09,924 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 23:39:09,924 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2024-11-09 23:39:09,924 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 23:39:09,925 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 23:39:09,925 INFO L85 PathProgramCache]: Analyzing trace with hash 1634587306, now seen corresponding path program 1 times [2024-11-09 23:39:09,925 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 23:39:09,925 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1252021637] [2024-11-09 23:39:09,925 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 23:39:09,925 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 23:39:09,980 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 23:39:10,199 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 23:39:10,199 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 23:39:10,200 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1252021637] [2024-11-09 23:39:10,200 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1252021637] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 23:39:10,200 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 23:39:10,200 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-09 23:39:10,200 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1540651370] [2024-11-09 23:39:10,200 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 23:39:10,200 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-09 23:39:10,201 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 23:39:10,201 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-09 23:39:10,201 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-09 23:39:10,201 INFO L87 Difference]: Start difference. First operand 152476 states and 243720 transitions. Second operand has 5 states, 5 states have (on average 27.4) internal successors, (137), 5 states have internal predecessors, (137), 0 states have call successors, (0), 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 23:39:12,166 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 23:39:12,173 INFO L93 Difference]: Finished difference Result 158287 states and 251466 transitions. [2024-11-09 23:39:12,174 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-09 23:39:12,174 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 27.4) internal successors, (137), 5 states have internal predecessors, (137), 0 states have call successors, (0), 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 137 [2024-11-09 23:39:12,174 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 23:39:12,388 INFO L225 Difference]: With dead ends: 158287 [2024-11-09 23:39:12,388 INFO L226 Difference]: Without dead ends: 158284 [2024-11-09 23:39:12,410 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-09 23:39:12,411 INFO L432 NwaCegarLoop]: 519 mSDtfsCounter, 0 mSDsluCounter, 1542 mSDsCounter, 0 mSdLazyCounter, 25 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 2061 SdHoareTripleChecker+Invalid, 26 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 25 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-09 23:39:12,412 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 2061 Invalid, 26 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 25 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-09 23:39:12,493 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 158284 states. [2024-11-09 23:39:14,739 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 158284 to 158284. [2024-11-09 23:39:14,862 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 158284 states, 158283 states have (on average 1.5762968859574307) internal successors, (249501), 158283 states have internal predecessors, (249501), 0 states have call successors, (0), 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 23:39:15,086 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 158284 states to 158284 states and 249501 transitions. [2024-11-09 23:39:15,093 INFO L78 Accepts]: Start accepts. Automaton has 158284 states and 249501 transitions. Word has length 137 [2024-11-09 23:39:15,094 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 23:39:15,094 INFO L471 AbstractCegarLoop]: Abstraction has 158284 states and 249501 transitions. [2024-11-09 23:39:15,094 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 27.4) internal successors, (137), 5 states have internal predecessors, (137), 0 states have call successors, (0), 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 23:39:15,094 INFO L276 IsEmpty]: Start isEmpty. Operand 158284 states and 249501 transitions. [2024-11-09 23:39:15,098 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 177 [2024-11-09 23:39:15,098 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 23:39:15,098 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 23:39:15,098 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2024-11-09 23:39:15,099 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 23:39:15,099 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 23:39:15,099 INFO L85 PathProgramCache]: Analyzing trace with hash -3729641, now seen corresponding path program 1 times [2024-11-09 23:39:15,099 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 23:39:15,099 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [982567304] [2024-11-09 23:39:15,099 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 23:39:15,100 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 23:39:15,124 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 23:39:15,687 INFO L134 CoverageAnalysis]: Checked inductivity of 29 backedges. 26 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2024-11-09 23:39:15,687 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 23:39:15,687 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [982567304] [2024-11-09 23:39:15,687 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [982567304] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 23:39:15,687 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 23:39:15,687 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-09 23:39:15,688 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1779599498] [2024-11-09 23:39:15,688 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 23:39:15,688 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-09 23:39:15,688 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 23:39:15,688 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-09 23:39:15,688 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-11-09 23:39:15,689 INFO L87 Difference]: Start difference. First operand 158284 states and 249501 transitions. Second operand has 6 states, 6 states have (on average 29.0) internal successors, (174), 6 states have internal predecessors, (174), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 23:39:18,643 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 23:39:18,644 INFO L93 Difference]: Finished difference Result 436845 states and 690259 transitions. [2024-11-09 23:39:18,644 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-09 23:39:18,644 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 29.0) internal successors, (174), 6 states have internal predecessors, (174), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 176 [2024-11-09 23:39:18,646 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 23:39:19,377 INFO L225 Difference]: With dead ends: 436845 [2024-11-09 23:39:19,377 INFO L226 Difference]: Without dead ends: 365042 [2024-11-09 23:39:19,544 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=28, Invalid=44, Unknown=0, NotChecked=0, Total=72 [2024-11-09 23:39:19,545 INFO L432 NwaCegarLoop]: 709 mSDtfsCounter, 1109 mSDsluCounter, 2471 mSDsCounter, 0 mSdLazyCounter, 140 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1109 SdHoareTripleChecker+Valid, 3180 SdHoareTripleChecker+Invalid, 143 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 140 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-09 23:39:19,545 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1109 Valid, 3180 Invalid, 143 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 140 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-09 23:39:19,807 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 365042 states. [2024-11-09 23:39:24,666 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 365042 to 255822. [2024-11-09 23:39:24,848 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 255822 states, 255821 states have (on average 1.5730803960581814) internal successors, (402427), 255821 states have internal predecessors, (402427), 0 states have call successors, (0), 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 23:39:25,257 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 255822 states to 255822 states and 402427 transitions. [2024-11-09 23:39:25,267 INFO L78 Accepts]: Start accepts. Automaton has 255822 states and 402427 transitions. Word has length 176 [2024-11-09 23:39:25,267 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 23:39:25,267 INFO L471 AbstractCegarLoop]: Abstraction has 255822 states and 402427 transitions. [2024-11-09 23:39:25,267 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 29.0) internal successors, (174), 6 states have internal predecessors, (174), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 23:39:25,268 INFO L276 IsEmpty]: Start isEmpty. Operand 255822 states and 402427 transitions. [2024-11-09 23:39:25,272 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 177 [2024-11-09 23:39:25,272 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 23:39:25,272 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 23:39:25,272 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2024-11-09 23:39:25,272 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 23:39:25,273 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 23:39:25,273 INFO L85 PathProgramCache]: Analyzing trace with hash -1728071151, now seen corresponding path program 1 times [2024-11-09 23:39:25,273 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 23:39:25,273 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1600406199] [2024-11-09 23:39:25,273 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 23:39:25,273 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 23:39:25,298 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 23:39:25,488 INFO L134 CoverageAnalysis]: Checked inductivity of 29 backedges. 19 proven. 0 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2024-11-09 23:39:25,489 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 23:39:25,489 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1600406199] [2024-11-09 23:39:25,489 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1600406199] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 23:39:25,489 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 23:39:25,489 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-09 23:39:25,489 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [572306706] [2024-11-09 23:39:25,489 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 23:39:25,490 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-09 23:39:25,490 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 23:39:25,490 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-09 23:39:25,490 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-11-09 23:39:25,490 INFO L87 Difference]: Start difference. First operand 255822 states and 402427 transitions. Second operand has 6 states, 6 states have (on average 27.833333333333332) internal successors, (167), 6 states have internal predecessors, (167), 0 states have call successors, (0), 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 23:39:29,027 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 23:39:29,028 INFO L93 Difference]: Finished difference Result 491659 states and 777083 transitions. [2024-11-09 23:39:29,028 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-09 23:39:29,028 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 27.833333333333332) internal successors, (167), 6 states have internal predecessors, (167), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 176 [2024-11-09 23:39:29,030 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 23:39:30,398 INFO L225 Difference]: With dead ends: 491659 [2024-11-09 23:39:30,399 INFO L226 Difference]: Without dead ends: 421506 [2024-11-09 23:39:30,477 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=28, Invalid=44, Unknown=0, NotChecked=0, Total=72 [2024-11-09 23:39:30,479 INFO L432 NwaCegarLoop]: 713 mSDtfsCounter, 1111 mSDsluCounter, 2404 mSDsCounter, 0 mSdLazyCounter, 137 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1111 SdHoareTripleChecker+Valid, 3117 SdHoareTripleChecker+Invalid, 140 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 137 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-09 23:39:30,479 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1111 Valid, 3117 Invalid, 140 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 137 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-09 23:39:30,702 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 421506 states. [2024-11-09 23:39:36,393 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 421506 to 347130. [2024-11-09 23:39:36,721 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 347130 states, 347129 states have (on average 1.5742648986399868) internal successors, (546473), 347129 states have internal predecessors, (546473), 0 states have call successors, (0), 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 23:39:37,926 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 347130 states to 347130 states and 546473 transitions. [2024-11-09 23:39:37,942 INFO L78 Accepts]: Start accepts. Automaton has 347130 states and 546473 transitions. Word has length 176 [2024-11-09 23:39:37,944 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 23:39:37,944 INFO L471 AbstractCegarLoop]: Abstraction has 347130 states and 546473 transitions. [2024-11-09 23:39:37,944 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 27.833333333333332) internal successors, (167), 6 states have internal predecessors, (167), 0 states have call successors, (0), 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 23:39:37,945 INFO L276 IsEmpty]: Start isEmpty. Operand 347130 states and 546473 transitions. [2024-11-09 23:39:37,948 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 177 [2024-11-09 23:39:37,948 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 23:39:37,948 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 23:39:37,948 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2024-11-09 23:39:37,948 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 23:39:37,949 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 23:39:37,949 INFO L85 PathProgramCache]: Analyzing trace with hash 10951767, now seen corresponding path program 1 times [2024-11-09 23:39:37,949 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 23:39:37,949 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1135410787] [2024-11-09 23:39:37,949 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 23:39:37,949 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 23:39:37,980 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 23:39:38,126 INFO L134 CoverageAnalysis]: Checked inductivity of 29 backedges. 12 proven. 0 refuted. 0 times theorem prover too weak. 17 trivial. 0 not checked. [2024-11-09 23:39:38,127 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 23:39:38,127 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1135410787] [2024-11-09 23:39:38,127 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1135410787] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 23:39:38,127 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 23:39:38,127 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-09 23:39:38,127 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [292978835] [2024-11-09 23:39:38,127 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 23:39:38,129 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-09 23:39:38,129 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 23:39:38,129 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-09 23:39:38,129 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-11-09 23:39:38,129 INFO L87 Difference]: Start difference. First operand 347130 states and 546473 transitions. Second operand has 6 states, 6 states have (on average 26.666666666666668) internal successors, (160), 6 states have internal predecessors, (160), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)