./Ultimate.py --spec /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/properties/unreach-call.prp --file /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/seq-mthreaded-reduced/pals_floodmax.5.4.ufo.BOUNDED-10.pals.c.v+cfa-reducer.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version a046e57d Calling Ultimate with: /root/.sdkman/candidates/java/current/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 /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/seq-mthreaded-reduced/pals_floodmax.5.4.ufo.BOUNDED-10.pals.c.v+cfa-reducer.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 e22fd4a52371acb4b873b206639f8f51f7518d2778c43044aaff0b323ebca998 --- Real Ultimate output --- This is Ultimate 0.2.5-tmp.dk.eval-mul-div-a046e57-m [2024-10-12 20:19:00,760 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-12 20:19:00,850 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-10-12 20:19:00,857 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-12 20:19:00,857 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-12 20:19:00,891 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-12 20:19:00,892 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-12 20:19:00,892 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-12 20:19:00,893 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-10-12 20:19:00,894 INFO L153 SettingsManager]: * Use memory slicer=true [2024-10-12 20:19:00,895 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-10-12 20:19:00,895 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-10-12 20:19:00,896 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-12 20:19:00,897 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-12 20:19:00,897 INFO L153 SettingsManager]: * Use SBE=true [2024-10-12 20:19:00,898 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-12 20:19:00,900 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-10-12 20:19:00,900 INFO L153 SettingsManager]: * sizeof long=4 [2024-10-12 20:19:00,901 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-10-12 20:19:00,901 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-10-12 20:19:00,901 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-12 20:19:00,902 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-10-12 20:19:00,905 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-10-12 20:19:00,905 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-10-12 20:19:00,906 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-12 20:19:00,906 INFO L153 SettingsManager]: * sizeof long double=12 [2024-10-12 20:19:00,906 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-10-12 20:19:00,906 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-12 20:19:00,907 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-12 20:19:00,907 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-12 20:19:00,907 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-10-12 20:19:00,907 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-10-12 20:19:00,907 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-12 20:19:00,908 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-12 20:19:00,908 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-10-12 20:19:00,908 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-10-12 20:19:00,908 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-10-12 20:19:00,909 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-10-12 20:19:00,909 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-10-12 20:19:00,909 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-10-12 20:19:00,909 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-10-12 20:19:00,911 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-10-12 20:19:00,911 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 -> e22fd4a52371acb4b873b206639f8f51f7518d2778c43044aaff0b323ebca998 [2024-10-12 20:19:01,187 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-12 20:19:01,214 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-12 20:19:01,218 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-12 20:19:01,219 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-12 20:19:01,219 INFO L274 PluginConnector]: CDTParser initialized [2024-10-12 20:19:01,221 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/seq-mthreaded-reduced/pals_floodmax.5.4.ufo.BOUNDED-10.pals.c.v+cfa-reducer.c [2024-10-12 20:19:02,684 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-12 20:19:03,012 INFO L384 CDTParser]: Found 1 translation units. [2024-10-12 20:19:03,013 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/seq-mthreaded-reduced/pals_floodmax.5.4.ufo.BOUNDED-10.pals.c.v+cfa-reducer.c [2024-10-12 20:19:03,038 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/98548892a/4988f58c0af6427ea97230aa5b8454e2/FLAG903a837ff [2024-10-12 20:19:03,056 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/98548892a/4988f58c0af6427ea97230aa5b8454e2 [2024-10-12 20:19:03,058 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-12 20:19:03,060 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-12 20:19:03,063 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-12 20:19:03,064 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-12 20:19:03,069 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-12 20:19:03,070 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 12.10 08:19:03" (1/1) ... [2024-10-12 20:19:03,071 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@1f5d4f76 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 08:19:03, skipping insertion in model container [2024-10-12 20:19:03,071 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 12.10 08:19:03" (1/1) ... [2024-10-12 20:19:03,149 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-12 20:19:03,549 WARN L248 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-reduced/pals_floodmax.5.4.ufo.BOUNDED-10.pals.c.v+cfa-reducer.c[22084,22097] [2024-10-12 20:19:03,731 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-12 20:19:03,753 INFO L200 MainTranslator]: Completed pre-run [2024-10-12 20:19:03,873 WARN L248 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-reduced/pals_floodmax.5.4.ufo.BOUNDED-10.pals.c.v+cfa-reducer.c[22084,22097] [2024-10-12 20:19:03,937 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-12 20:19:03,965 INFO L204 MainTranslator]: Completed translation [2024-10-12 20:19:03,966 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 08:19:03 WrapperNode [2024-10-12 20:19:03,966 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-12 20:19:03,967 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-10-12 20:19:03,967 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-10-12 20:19:03,967 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-10-12 20:19:03,976 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 08:19:03" (1/1) ... [2024-10-12 20:19:04,003 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 08:19:03" (1/1) ... [2024-10-12 20:19:04,185 INFO L138 Inliner]: procedures = 24, calls = 7, calls flagged for inlining = 2, calls inlined = 2, statements flattened = 2876 [2024-10-12 20:19:04,186 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-10-12 20:19:04,186 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-10-12 20:19:04,187 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-10-12 20:19:04,187 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-10-12 20:19:04,198 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 08:19:03" (1/1) ... [2024-10-12 20:19:04,198 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 08:19:03" (1/1) ... [2024-10-12 20:19:04,211 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 08:19:03" (1/1) ... [2024-10-12 20:19:04,261 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-10-12 20:19:04,261 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 08:19:03" (1/1) ... [2024-10-12 20:19:04,262 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 08:19:03" (1/1) ... [2024-10-12 20:19:04,299 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 08:19:03" (1/1) ... [2024-10-12 20:19:04,319 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 08:19:03" (1/1) ... [2024-10-12 20:19:04,331 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 08:19:03" (1/1) ... [2024-10-12 20:19:04,343 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 08:19:03" (1/1) ... [2024-10-12 20:19:04,360 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-10-12 20:19:04,362 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-10-12 20:19:04,362 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-10-12 20:19:04,363 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-10-12 20:19:04,364 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 08:19:03" (1/1) ... [2024-10-12 20:19:04,369 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-12 20:19:04,385 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-12 20:19:04,400 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-10-12 20:19:04,408 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-10-12 20:19:04,450 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-10-12 20:19:04,450 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-10-12 20:19:04,450 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-10-12 20:19:04,451 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-10-12 20:19:04,650 INFO L238 CfgBuilder]: Building ICFG [2024-10-12 20:19:04,652 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-10-12 20:19:07,043 INFO L? ?]: Removed 252 outVars from TransFormulas that were not future-live. [2024-10-12 20:19:07,043 INFO L287 CfgBuilder]: Performing block encoding [2024-10-12 20:19:07,151 INFO L309 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-10-12 20:19:07,152 INFO L314 CfgBuilder]: Removed 0 assume(true) statements. [2024-10-12 20:19:07,153 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.10 08:19:07 BoogieIcfgContainer [2024-10-12 20:19:07,153 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-10-12 20:19:07,155 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-10-12 20:19:07,155 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-10-12 20:19:07,158 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-10-12 20:19:07,159 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 12.10 08:19:03" (1/3) ... [2024-10-12 20:19:07,159 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@64340a82 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 12.10 08:19:07, skipping insertion in model container [2024-10-12 20:19:07,159 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 08:19:03" (2/3) ... [2024-10-12 20:19:07,160 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@64340a82 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 12.10 08:19:07, skipping insertion in model container [2024-10-12 20:19:07,160 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.10 08:19:07" (3/3) ... [2024-10-12 20:19:07,162 INFO L112 eAbstractionObserver]: Analyzing ICFG pals_floodmax.5.4.ufo.BOUNDED-10.pals.c.v+cfa-reducer.c [2024-10-12 20:19:07,178 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-10-12 20:19:07,178 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-10-12 20:19:07,273 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-10-12 20:19:07,282 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;@5afd9f3, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-12 20:19:07,283 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-10-12 20:19:07,292 INFO L276 IsEmpty]: Start isEmpty. Operand has 734 states, 732 states have (on average 1.8442622950819672) internal successors, (1350), 733 states have internal predecessors, (1350), 0 states have call successors, (0), 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-10-12 20:19:07,316 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 204 [2024-10-12 20:19:07,316 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 20:19:07,318 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-10-12 20:19:07,318 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 20:19:07,323 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 20:19:07,324 INFO L85 PathProgramCache]: Analyzing trace with hash -1014936547, now seen corresponding path program 1 times [2024-10-12 20:19:07,333 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 20:19:07,333 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [998369341] [2024-10-12 20:19:07,333 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 20:19:07,334 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 20:19:07,706 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 20:19:08,204 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-12 20:19:08,205 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 20:19:08,205 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [998369341] [2024-10-12 20:19:08,206 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [998369341] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 20:19:08,206 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 20:19:08,206 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-12 20:19:08,208 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1814645998] [2024-10-12 20:19:08,208 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 20:19:08,212 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-12 20:19:08,213 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 20:19:08,235 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-12 20:19:08,236 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-12 20:19:08,240 INFO L87 Difference]: Start difference. First operand has 734 states, 732 states have (on average 1.8442622950819672) internal successors, (1350), 733 states have internal predecessors, (1350), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 3 states, 3 states have (on average 67.66666666666667) internal successors, (203), 3 states have internal predecessors, (203), 0 states have call successors, (0), 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-10-12 20:19:08,495 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 20:19:08,496 INFO L93 Difference]: Finished difference Result 1105 states and 1979 transitions. [2024-10-12 20:19:08,497 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-12 20:19:08,498 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 67.66666666666667) internal successors, (203), 3 states have internal predecessors, (203), 0 states have call successors, (0), 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 203 [2024-10-12 20:19:08,499 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 20:19:08,524 INFO L225 Difference]: With dead ends: 1105 [2024-10-12 20:19:08,525 INFO L226 Difference]: Without dead ends: 909 [2024-10-12 20:19:08,529 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-10-12 20:19:08,534 INFO L432 NwaCegarLoop]: 1346 mSDtfsCounter, 338 mSDsluCounter, 1242 mSDsCounter, 0 mSdLazyCounter, 25 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 338 SdHoareTripleChecker+Valid, 2588 SdHoareTripleChecker+Invalid, 29 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 25 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-10-12 20:19:08,535 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [338 Valid, 2588 Invalid, 29 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 25 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-10-12 20:19:08,555 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 909 states. [2024-10-12 20:19:08,628 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 909 to 907. [2024-10-12 20:19:08,632 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 907 states, 906 states have (on average 1.7428256070640176) internal successors, (1579), 906 states have internal predecessors, (1579), 0 states have call successors, (0), 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-10-12 20:19:08,636 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 907 states to 907 states and 1579 transitions. [2024-10-12 20:19:08,638 INFO L78 Accepts]: Start accepts. Automaton has 907 states and 1579 transitions. Word has length 203 [2024-10-12 20:19:08,640 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 20:19:08,640 INFO L471 AbstractCegarLoop]: Abstraction has 907 states and 1579 transitions. [2024-10-12 20:19:08,641 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 67.66666666666667) internal successors, (203), 3 states have internal predecessors, (203), 0 states have call successors, (0), 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-10-12 20:19:08,641 INFO L276 IsEmpty]: Start isEmpty. Operand 907 states and 1579 transitions. [2024-10-12 20:19:08,651 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 208 [2024-10-12 20:19:08,653 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 20:19:08,653 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-10-12 20:19:08,654 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-10-12 20:19:08,654 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 20:19:08,655 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 20:19:08,655 INFO L85 PathProgramCache]: Analyzing trace with hash 1480286202, now seen corresponding path program 1 times [2024-10-12 20:19:08,655 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 20:19:08,655 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [382400305] [2024-10-12 20:19:08,656 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 20:19:08,656 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 20:19:08,790 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 20:19:09,093 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-12 20:19:09,094 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 20:19:09,094 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [382400305] [2024-10-12 20:19:09,094 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [382400305] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 20:19:09,094 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 20:19:09,094 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-12 20:19:09,094 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [202160061] [2024-10-12 20:19:09,095 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 20:19:09,098 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-12 20:19:09,099 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 20:19:09,100 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-12 20:19:09,101 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-12 20:19:09,101 INFO L87 Difference]: Start difference. First operand 907 states and 1579 transitions. Second operand has 3 states, 3 states have (on average 69.0) internal successors, (207), 3 states have internal predecessors, (207), 0 states have call successors, (0), 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-10-12 20:19:09,196 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 20:19:09,197 INFO L93 Difference]: Finished difference Result 1615 states and 2771 transitions. [2024-10-12 20:19:09,198 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-12 20:19:09,198 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 69.0) internal successors, (207), 3 states have internal predecessors, (207), 0 states have call successors, (0), 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 207 [2024-10-12 20:19:09,200 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 20:19:09,206 INFO L225 Difference]: With dead ends: 1615 [2024-10-12 20:19:09,207 INFO L226 Difference]: Without dead ends: 1250 [2024-10-12 20:19:09,210 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-10-12 20:19:09,212 INFO L432 NwaCegarLoop]: 1491 mSDtfsCounter, 292 mSDsluCounter, 1235 mSDsCounter, 0 mSdLazyCounter, 9 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 292 SdHoareTripleChecker+Valid, 2726 SdHoareTripleChecker+Invalid, 9 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 9 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-12 20:19:09,213 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [292 Valid, 2726 Invalid, 9 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 9 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-12 20:19:09,215 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1250 states. [2024-10-12 20:19:09,249 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1250 to 1248. [2024-10-12 20:19:09,252 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1248 states, 1247 states have (on average 1.7249398556535687) internal successors, (2151), 1247 states have internal predecessors, (2151), 0 states have call successors, (0), 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-10-12 20:19:09,257 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1248 states to 1248 states and 2151 transitions. [2024-10-12 20:19:09,258 INFO L78 Accepts]: Start accepts. Automaton has 1248 states and 2151 transitions. Word has length 207 [2024-10-12 20:19:09,260 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 20:19:09,260 INFO L471 AbstractCegarLoop]: Abstraction has 1248 states and 2151 transitions. [2024-10-12 20:19:09,260 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 69.0) internal successors, (207), 3 states have internal predecessors, (207), 0 states have call successors, (0), 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-10-12 20:19:09,260 INFO L276 IsEmpty]: Start isEmpty. Operand 1248 states and 2151 transitions. [2024-10-12 20:19:09,264 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 212 [2024-10-12 20:19:09,265 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 20:19:09,266 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-10-12 20:19:09,266 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-10-12 20:19:09,266 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 20:19:09,267 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 20:19:09,268 INFO L85 PathProgramCache]: Analyzing trace with hash -1250992074, now seen corresponding path program 1 times [2024-10-12 20:19:09,268 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 20:19:09,268 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [645009919] [2024-10-12 20:19:09,269 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 20:19:09,269 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 20:19:09,383 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 20:19:09,582 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-12 20:19:09,586 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 20:19:09,586 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [645009919] [2024-10-12 20:19:09,587 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [645009919] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 20:19:09,587 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 20:19:09,587 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-12 20:19:09,587 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [146122032] [2024-10-12 20:19:09,587 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 20:19:09,588 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-12 20:19:09,588 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 20:19:09,589 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-12 20:19:09,591 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-12 20:19:09,592 INFO L87 Difference]: Start difference. First operand 1248 states and 2151 transitions. Second operand has 3 states, 3 states have (on average 70.33333333333333) internal successors, (211), 3 states have internal predecessors, (211), 0 states have call successors, (0), 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-10-12 20:19:09,723 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 20:19:09,724 INFO L93 Difference]: Finished difference Result 1949 states and 3335 transitions. [2024-10-12 20:19:09,724 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-12 20:19:09,725 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 70.33333333333333) internal successors, (211), 3 states have internal predecessors, (211), 0 states have call successors, (0), 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 211 [2024-10-12 20:19:09,725 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 20:19:09,734 INFO L225 Difference]: With dead ends: 1949 [2024-10-12 20:19:09,734 INFO L226 Difference]: Without dead ends: 1584 [2024-10-12 20:19:09,736 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-10-12 20:19:09,737 INFO L432 NwaCegarLoop]: 1492 mSDtfsCounter, 293 mSDsluCounter, 1242 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 293 SdHoareTripleChecker+Valid, 2734 SdHoareTripleChecker+Invalid, 7 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 5 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-12 20:19:09,739 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [293 Valid, 2734 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-12 20:19:09,742 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1584 states. [2024-10-12 20:19:09,769 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1584 to 1582. [2024-10-12 20:19:09,773 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1582 states, 1581 states have (on average 1.7160025300442758) internal successors, (2713), 1581 states have internal predecessors, (2713), 0 states have call successors, (0), 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-10-12 20:19:09,778 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1582 states to 1582 states and 2713 transitions. [2024-10-12 20:19:09,780 INFO L78 Accepts]: Start accepts. Automaton has 1582 states and 2713 transitions. Word has length 211 [2024-10-12 20:19:09,780 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 20:19:09,780 INFO L471 AbstractCegarLoop]: Abstraction has 1582 states and 2713 transitions. [2024-10-12 20:19:09,781 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 70.33333333333333) internal successors, (211), 3 states have internal predecessors, (211), 0 states have call successors, (0), 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-10-12 20:19:09,781 INFO L276 IsEmpty]: Start isEmpty. Operand 1582 states and 2713 transitions. [2024-10-12 20:19:09,784 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 212 [2024-10-12 20:19:09,784 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 20:19:09,784 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-10-12 20:19:09,785 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-10-12 20:19:09,785 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 20:19:09,786 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 20:19:09,786 INFO L85 PathProgramCache]: Analyzing trace with hash 1198878909, now seen corresponding path program 1 times [2024-10-12 20:19:09,786 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 20:19:09,787 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [410458493] [2024-10-12 20:19:09,787 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 20:19:09,787 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 20:19:09,870 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 20:19:10,088 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-12 20:19:10,089 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 20:19:10,089 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [410458493] [2024-10-12 20:19:10,089 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [410458493] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 20:19:10,090 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 20:19:10,090 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-12 20:19:10,090 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [882537444] [2024-10-12 20:19:10,091 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 20:19:10,091 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-12 20:19:10,092 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 20:19:10,092 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-12 20:19:10,093 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-12 20:19:10,093 INFO L87 Difference]: Start difference. First operand 1582 states and 2713 transitions. Second operand has 3 states, 3 states have (on average 70.33333333333333) internal successors, (211), 3 states have internal predecessors, (211), 0 states have call successors, (0), 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-10-12 20:19:10,254 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 20:19:10,255 INFO L93 Difference]: Finished difference Result 3522 states and 5969 transitions. [2024-10-12 20:19:10,256 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-12 20:19:10,256 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 70.33333333333333) internal successors, (211), 3 states have internal predecessors, (211), 0 states have call successors, (0), 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 211 [2024-10-12 20:19:10,257 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 20:19:10,266 INFO L225 Difference]: With dead ends: 3522 [2024-10-12 20:19:10,266 INFO L226 Difference]: Without dead ends: 2519 [2024-10-12 20:19:10,269 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-10-12 20:19:10,270 INFO L432 NwaCegarLoop]: 1284 mSDtfsCounter, 285 mSDsluCounter, 1236 mSDsCounter, 0 mSdLazyCounter, 9 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 285 SdHoareTripleChecker+Valid, 2520 SdHoareTripleChecker+Invalid, 9 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 9 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-12 20:19:10,273 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [285 Valid, 2520 Invalid, 9 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 9 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-12 20:19:10,276 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2519 states. [2024-10-12 20:19:10,317 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2519 to 2517. [2024-10-12 20:19:10,322 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2517 states, 2516 states have (on average 1.6975357710651828) internal successors, (4271), 2516 states have internal predecessors, (4271), 0 states have call successors, (0), 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-10-12 20:19:10,330 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2517 states to 2517 states and 4271 transitions. [2024-10-12 20:19:10,331 INFO L78 Accepts]: Start accepts. Automaton has 2517 states and 4271 transitions. Word has length 211 [2024-10-12 20:19:10,331 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 20:19:10,331 INFO L471 AbstractCegarLoop]: Abstraction has 2517 states and 4271 transitions. [2024-10-12 20:19:10,332 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 70.33333333333333) internal successors, (211), 3 states have internal predecessors, (211), 0 states have call successors, (0), 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-10-12 20:19:10,332 INFO L276 IsEmpty]: Start isEmpty. Operand 2517 states and 4271 transitions. [2024-10-12 20:19:10,335 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 216 [2024-10-12 20:19:10,335 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 20:19:10,336 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-10-12 20:19:10,336 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-10-12 20:19:10,337 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 20:19:10,337 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 20:19:10,337 INFO L85 PathProgramCache]: Analyzing trace with hash -735486374, now seen corresponding path program 1 times [2024-10-12 20:19:10,338 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 20:19:10,338 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [288373511] [2024-10-12 20:19:10,338 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 20:19:10,338 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 20:19:10,406 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 20:19:10,610 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-12 20:19:10,611 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 20:19:10,611 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [288373511] [2024-10-12 20:19:10,612 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [288373511] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 20:19:10,612 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 20:19:10,613 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-12 20:19:10,613 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1605035383] [2024-10-12 20:19:10,613 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 20:19:10,615 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-12 20:19:10,615 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 20:19:10,615 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-12 20:19:10,616 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-12 20:19:10,616 INFO L87 Difference]: Start difference. First operand 2517 states and 4271 transitions. Second operand has 3 states, 3 states have (on average 71.66666666666667) internal successors, (215), 3 states have internal predecessors, (215), 0 states have call successors, (0), 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-10-12 20:19:10,789 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 20:19:10,789 INFO L93 Difference]: Finished difference Result 6261 states and 10517 transitions. [2024-10-12 20:19:10,790 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-12 20:19:10,790 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 71.66666666666667) internal successors, (215), 3 states have internal predecessors, (215), 0 states have call successors, (0), 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 215 [2024-10-12 20:19:10,791 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 20:19:10,807 INFO L225 Difference]: With dead ends: 6261 [2024-10-12 20:19:10,807 INFO L226 Difference]: Without dead ends: 4323 [2024-10-12 20:19:10,814 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-10-12 20:19:10,815 INFO L432 NwaCegarLoop]: 1399 mSDtfsCounter, 278 mSDsluCounter, 1237 mSDsCounter, 0 mSdLazyCounter, 9 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 278 SdHoareTripleChecker+Valid, 2636 SdHoareTripleChecker+Invalid, 9 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 9 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-12 20:19:10,815 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [278 Valid, 2636 Invalid, 9 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 9 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-12 20:19:10,821 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4323 states. [2024-10-12 20:19:10,898 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4323 to 4321. [2024-10-12 20:19:10,908 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4321 states, 4320 states have (on average 1.6793981481481481) internal successors, (7255), 4320 states have internal predecessors, (7255), 0 states have call successors, (0), 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-10-12 20:19:10,925 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4321 states to 4321 states and 7255 transitions. [2024-10-12 20:19:10,925 INFO L78 Accepts]: Start accepts. Automaton has 4321 states and 7255 transitions. Word has length 215 [2024-10-12 20:19:10,926 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 20:19:10,926 INFO L471 AbstractCegarLoop]: Abstraction has 4321 states and 7255 transitions. [2024-10-12 20:19:10,926 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 71.66666666666667) internal successors, (215), 3 states have internal predecessors, (215), 0 states have call successors, (0), 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-10-12 20:19:10,926 INFO L276 IsEmpty]: Start isEmpty. Operand 4321 states and 7255 transitions. [2024-10-12 20:19:10,930 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 220 [2024-10-12 20:19:10,930 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 20:19:10,930 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-10-12 20:19:10,931 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-10-12 20:19:10,931 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 20:19:10,931 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 20:19:10,932 INFO L85 PathProgramCache]: Analyzing trace with hash -1762205722, now seen corresponding path program 1 times [2024-10-12 20:19:10,932 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 20:19:10,932 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [554815371] [2024-10-12 20:19:10,932 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 20:19:10,933 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 20:19:11,005 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 20:19:11,150 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-12 20:19:11,151 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 20:19:11,151 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [554815371] [2024-10-12 20:19:11,152 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [554815371] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 20:19:11,152 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 20:19:11,152 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-12 20:19:11,152 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1668028870] [2024-10-12 20:19:11,152 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 20:19:11,153 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-12 20:19:11,153 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 20:19:11,154 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-12 20:19:11,154 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-12 20:19:11,154 INFO L87 Difference]: Start difference. First operand 4321 states and 7255 transitions. Second operand has 3 states, 3 states have (on average 73.0) internal successors, (219), 3 states have internal predecessors, (219), 0 states have call successors, (0), 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-10-12 20:19:11,275 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 20:19:11,276 INFO L93 Difference]: Finished difference Result 7917 states and 13271 transitions. [2024-10-12 20:19:11,276 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-12 20:19:11,276 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 73.0) internal successors, (219), 3 states have internal predecessors, (219), 0 states have call successors, (0), 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 219 [2024-10-12 20:19:11,277 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 20:19:11,300 INFO L225 Difference]: With dead ends: 7917 [2024-10-12 20:19:11,301 INFO L226 Difference]: Without dead ends: 5979 [2024-10-12 20:19:11,306 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-10-12 20:19:11,307 INFO L432 NwaCegarLoop]: 1399 mSDtfsCounter, 279 mSDsluCounter, 1244 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 279 SdHoareTripleChecker+Valid, 2643 SdHoareTripleChecker+Invalid, 7 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 5 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-12 20:19:11,309 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [279 Valid, 2643 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-12 20:19:11,315 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5979 states. [2024-10-12 20:19:11,455 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5979 to 5977. [2024-10-12 20:19:11,466 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5977 states, 5976 states have (on average 1.6741967871485943) internal successors, (10005), 5976 states have internal predecessors, (10005), 0 states have call successors, (0), 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-10-12 20:19:11,485 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5977 states to 5977 states and 10005 transitions. [2024-10-12 20:19:11,488 INFO L78 Accepts]: Start accepts. Automaton has 5977 states and 10005 transitions. Word has length 219 [2024-10-12 20:19:11,489 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 20:19:11,490 INFO L471 AbstractCegarLoop]: Abstraction has 5977 states and 10005 transitions. [2024-10-12 20:19:11,490 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 73.0) internal successors, (219), 3 states have internal predecessors, (219), 0 states have call successors, (0), 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-10-12 20:19:11,490 INFO L276 IsEmpty]: Start isEmpty. Operand 5977 states and 10005 transitions. [2024-10-12 20:19:11,493 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 220 [2024-10-12 20:19:11,493 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 20:19:11,494 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-10-12 20:19:11,494 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-10-12 20:19:11,494 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 20:19:11,495 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 20:19:11,495 INFO L85 PathProgramCache]: Analyzing trace with hash -1811518115, now seen corresponding path program 1 times [2024-10-12 20:19:11,495 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 20:19:11,495 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [24092427] [2024-10-12 20:19:11,496 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 20:19:11,496 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 20:19:11,562 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 20:19:11,757 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-12 20:19:11,757 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 20:19:11,757 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [24092427] [2024-10-12 20:19:11,757 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [24092427] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 20:19:11,758 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 20:19:11,758 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-12 20:19:11,758 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [683409592] [2024-10-12 20:19:11,758 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 20:19:11,759 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-12 20:19:11,759 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 20:19:11,759 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-12 20:19:11,759 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-12 20:19:11,760 INFO L87 Difference]: Start difference. First operand 5977 states and 10005 transitions. Second operand has 3 states, 3 states have (on average 73.0) internal successors, (219), 3 states have internal predecessors, (219), 0 states have call successors, (0), 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-10-12 20:19:11,924 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 20:19:11,925 INFO L93 Difference]: Finished difference Result 16145 states and 26843 transitions. [2024-10-12 20:19:11,925 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-12 20:19:11,925 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 73.0) internal successors, (219), 3 states have internal predecessors, (219), 0 states have call successors, (0), 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 219 [2024-10-12 20:19:11,926 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 20:19:11,977 INFO L225 Difference]: With dead ends: 16145 [2024-10-12 20:19:11,977 INFO L226 Difference]: Without dead ends: 10863 [2024-10-12 20:19:11,988 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-10-12 20:19:11,991 INFO L432 NwaCegarLoop]: 1285 mSDtfsCounter, 271 mSDsluCounter, 1238 mSDsCounter, 0 mSdLazyCounter, 9 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 271 SdHoareTripleChecker+Valid, 2523 SdHoareTripleChecker+Invalid, 9 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 9 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-12 20:19:11,991 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [271 Valid, 2523 Invalid, 9 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 9 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-12 20:19:12,004 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10863 states. [2024-10-12 20:19:12,241 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10863 to 10861. [2024-10-12 20:19:12,273 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10861 states, 10860 states have (on average 1.6582872928176795) internal successors, (18009), 10860 states have internal predecessors, (18009), 0 states have call successors, (0), 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-10-12 20:19:12,318 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10861 states to 10861 states and 18009 transitions. [2024-10-12 20:19:12,319 INFO L78 Accepts]: Start accepts. Automaton has 10861 states and 18009 transitions. Word has length 219 [2024-10-12 20:19:12,320 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 20:19:12,320 INFO L471 AbstractCegarLoop]: Abstraction has 10861 states and 18009 transitions. [2024-10-12 20:19:12,320 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 73.0) internal successors, (219), 3 states have internal predecessors, (219), 0 states have call successors, (0), 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-10-12 20:19:12,320 INFO L276 IsEmpty]: Start isEmpty. Operand 10861 states and 18009 transitions. [2024-10-12 20:19:12,324 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 224 [2024-10-12 20:19:12,325 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 20:19:12,325 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-10-12 20:19:12,325 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-10-12 20:19:12,326 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 20:19:12,326 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 20:19:12,326 INFO L85 PathProgramCache]: Analyzing trace with hash -1625652038, now seen corresponding path program 1 times [2024-10-12 20:19:12,326 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 20:19:12,327 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1008181754] [2024-10-12 20:19:12,327 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 20:19:12,327 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 20:19:12,411 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 20:19:12,787 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-12 20:19:12,788 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 20:19:12,788 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1008181754] [2024-10-12 20:19:12,788 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1008181754] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 20:19:12,788 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 20:19:12,788 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-10-12 20:19:12,788 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [127413884] [2024-10-12 20:19:12,788 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 20:19:12,789 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-12 20:19:12,789 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 20:19:12,789 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-12 20:19:12,790 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-10-12 20:19:12,790 INFO L87 Difference]: Start difference. First operand 10861 states and 18009 transitions. Second operand has 7 states, 7 states have (on average 31.857142857142858) internal successors, (223), 7 states have internal predecessors, (223), 0 states have call successors, (0), 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-10-12 20:19:13,732 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 20:19:13,732 INFO L93 Difference]: Finished difference Result 73997 states and 123150 transitions. [2024-10-12 20:19:13,733 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-10-12 20:19:13,737 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 31.857142857142858) internal successors, (223), 7 states have internal predecessors, (223), 0 states have call successors, (0), 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 223 [2024-10-12 20:19:13,738 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 20:19:13,888 INFO L225 Difference]: With dead ends: 73997 [2024-10-12 20:19:13,888 INFO L226 Difference]: Without dead ends: 63831 [2024-10-12 20:19:13,935 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=63, Invalid=119, Unknown=0, NotChecked=0, Total=182 [2024-10-12 20:19:13,936 INFO L432 NwaCegarLoop]: 1271 mSDtfsCounter, 4553 mSDsluCounter, 9084 mSDsCounter, 0 mSdLazyCounter, 214 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4553 SdHoareTripleChecker+Valid, 10355 SdHoareTripleChecker+Invalid, 220 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 214 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-10-12 20:19:13,937 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [4553 Valid, 10355 Invalid, 220 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 214 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-10-12 20:19:14,014 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 63831 states. [2024-10-12 20:19:14,828 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 63831 to 20816. [2024-10-12 20:19:14,865 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 20816 states, 20815 states have (on average 1.6535190968051885) internal successors, (34418), 20815 states have internal predecessors, (34418), 0 states have call successors, (0), 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-10-12 20:19:14,930 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20816 states to 20816 states and 34418 transitions. [2024-10-12 20:19:14,930 INFO L78 Accepts]: Start accepts. Automaton has 20816 states and 34418 transitions. Word has length 223 [2024-10-12 20:19:14,931 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 20:19:14,931 INFO L471 AbstractCegarLoop]: Abstraction has 20816 states and 34418 transitions. [2024-10-12 20:19:14,931 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 31.857142857142858) internal successors, (223), 7 states have internal predecessors, (223), 0 states have call successors, (0), 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-10-12 20:19:14,931 INFO L276 IsEmpty]: Start isEmpty. Operand 20816 states and 34418 transitions. [2024-10-12 20:19:14,935 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 225 [2024-10-12 20:19:14,935 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 20:19:14,936 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-10-12 20:19:14,936 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-10-12 20:19:14,936 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 20:19:14,936 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 20:19:14,937 INFO L85 PathProgramCache]: Analyzing trace with hash 1072774625, now seen corresponding path program 1 times [2024-10-12 20:19:14,937 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 20:19:14,937 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [858092237] [2024-10-12 20:19:14,937 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 20:19:14,937 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 20:19:15,001 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 20:19:15,184 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-12 20:19:15,185 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 20:19:15,185 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [858092237] [2024-10-12 20:19:15,185 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [858092237] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 20:19:15,185 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 20:19:15,185 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-12 20:19:15,185 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [959041232] [2024-10-12 20:19:15,185 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 20:19:15,186 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-12 20:19:15,186 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 20:19:15,187 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-12 20:19:15,187 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-12 20:19:15,187 INFO L87 Difference]: Start difference. First operand 20816 states and 34418 transitions. Second operand has 4 states, 4 states have (on average 56.0) internal successors, (224), 4 states have internal predecessors, (224), 0 states have call successors, (0), 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-10-12 20:19:15,870 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 20:19:15,872 INFO L93 Difference]: Finished difference Result 61919 states and 102778 transitions. [2024-10-12 20:19:15,872 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-12 20:19:15,873 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 56.0) internal successors, (224), 4 states have internal predecessors, (224), 0 states have call successors, (0), 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 224 [2024-10-12 20:19:15,873 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 20:19:15,982 INFO L225 Difference]: With dead ends: 61919 [2024-10-12 20:19:15,982 INFO L226 Difference]: Without dead ends: 41860 [2024-10-12 20:19:16,023 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 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-10-12 20:19:16,024 INFO L432 NwaCegarLoop]: 1273 mSDtfsCounter, 939 mSDsluCounter, 2627 mSDsCounter, 0 mSdLazyCounter, 41 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 939 SdHoareTripleChecker+Valid, 3900 SdHoareTripleChecker+Invalid, 41 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 41 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-10-12 20:19:16,025 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [939 Valid, 3900 Invalid, 41 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 41 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-10-12 20:19:16,068 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 41860 states. [2024-10-12 20:19:16,671 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 41860 to 31295. [2024-10-12 20:19:16,723 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 31295 states, 31294 states have (on average 1.6553972007413562) internal successors, (51804), 31294 states have internal predecessors, (51804), 0 states have call successors, (0), 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-10-12 20:19:16,809 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31295 states to 31295 states and 51804 transitions. [2024-10-12 20:19:16,810 INFO L78 Accepts]: Start accepts. Automaton has 31295 states and 51804 transitions. Word has length 224 [2024-10-12 20:19:16,810 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 20:19:16,811 INFO L471 AbstractCegarLoop]: Abstraction has 31295 states and 51804 transitions. [2024-10-12 20:19:16,811 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 56.0) internal successors, (224), 4 states have internal predecessors, (224), 0 states have call successors, (0), 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-10-12 20:19:16,811 INFO L276 IsEmpty]: Start isEmpty. Operand 31295 states and 51804 transitions. [2024-10-12 20:19:16,815 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 225 [2024-10-12 20:19:16,815 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 20:19:16,816 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-10-12 20:19:16,816 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-10-12 20:19:16,816 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 20:19:16,816 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 20:19:16,817 INFO L85 PathProgramCache]: Analyzing trace with hash 1860956234, now seen corresponding path program 1 times [2024-10-12 20:19:16,817 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 20:19:16,817 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1702073700] [2024-10-12 20:19:16,817 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 20:19:16,817 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 20:19:16,887 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 20:19:17,202 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-12 20:19:17,203 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 20:19:17,203 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1702073700] [2024-10-12 20:19:17,203 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1702073700] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 20:19:17,203 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 20:19:17,203 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-12 20:19:17,204 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2091520154] [2024-10-12 20:19:17,204 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 20:19:17,204 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-12 20:19:17,204 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 20:19:17,205 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-12 20:19:17,206 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-12 20:19:17,206 INFO L87 Difference]: Start difference. First operand 31295 states and 51804 transitions. Second operand has 3 states, 3 states have (on average 74.66666666666667) internal successors, (224), 3 states have internal predecessors, (224), 0 states have call successors, (0), 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-10-12 20:19:17,607 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 20:19:17,607 INFO L93 Difference]: Finished difference Result 59897 states and 99326 transitions. [2024-10-12 20:19:17,608 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-12 20:19:17,608 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 74.66666666666667) internal successors, (224), 3 states have internal predecessors, (224), 0 states have call successors, (0), 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 224 [2024-10-12 20:19:17,610 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 20:19:17,705 INFO L225 Difference]: With dead ends: 59897 [2024-10-12 20:19:17,706 INFO L226 Difference]: Without dead ends: 43929 [2024-10-12 20:19:17,740 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-10-12 20:19:17,741 INFO L432 NwaCegarLoop]: 1365 mSDtfsCounter, 272 mSDsluCounter, 1245 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 272 SdHoareTripleChecker+Valid, 2610 SdHoareTripleChecker+Invalid, 7 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 5 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-12 20:19:17,742 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [272 Valid, 2610 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-12 20:19:17,778 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 43929 states. [2024-10-12 20:19:18,411 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 43929 to 43927. [2024-10-12 20:19:18,478 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 43927 states, 43926 states have (on average 1.6528252060283204) internal successors, (72602), 43926 states have internal predecessors, (72602), 0 states have call successors, (0), 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-10-12 20:19:18,578 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43927 states to 43927 states and 72602 transitions. [2024-10-12 20:19:18,579 INFO L78 Accepts]: Start accepts. Automaton has 43927 states and 72602 transitions. Word has length 224 [2024-10-12 20:19:18,579 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 20:19:18,579 INFO L471 AbstractCegarLoop]: Abstraction has 43927 states and 72602 transitions. [2024-10-12 20:19:18,580 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 74.66666666666667) internal successors, (224), 3 states have internal predecessors, (224), 0 states have call successors, (0), 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-10-12 20:19:18,580 INFO L276 IsEmpty]: Start isEmpty. Operand 43927 states and 72602 transitions. [2024-10-12 20:19:18,584 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 225 [2024-10-12 20:19:18,584 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 20:19:18,584 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-10-12 20:19:18,585 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2024-10-12 20:19:18,585 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 20:19:18,585 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 20:19:18,586 INFO L85 PathProgramCache]: Analyzing trace with hash 1308500106, now seen corresponding path program 1 times [2024-10-12 20:19:18,586 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 20:19:18,586 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [132353010] [2024-10-12 20:19:18,586 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 20:19:18,586 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 20:19:18,656 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 20:19:19,016 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-12 20:19:19,017 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 20:19:19,017 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [132353010] [2024-10-12 20:19:19,018 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [132353010] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 20:19:19,018 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 20:19:19,019 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-12 20:19:19,019 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [903937731] [2024-10-12 20:19:19,019 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 20:19:19,020 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-12 20:19:19,020 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 20:19:19,020 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-12 20:19:19,021 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-12 20:19:19,021 INFO L87 Difference]: Start difference. First operand 43927 states and 72602 transitions. Second operand has 3 states, 3 states have (on average 74.66666666666667) internal successors, (224), 3 states have internal predecessors, (224), 0 states have call successors, (0), 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-10-12 20:19:19,491 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 20:19:19,491 INFO L93 Difference]: Finished difference Result 83513 states and 138376 transitions. [2024-10-12 20:19:19,492 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-12 20:19:19,492 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 74.66666666666667) internal successors, (224), 3 states have internal predecessors, (224), 0 states have call successors, (0), 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 224 [2024-10-12 20:19:19,493 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 20:19:19,848 INFO L225 Difference]: With dead ends: 83513 [2024-10-12 20:19:19,848 INFO L226 Difference]: Without dead ends: 60857 [2024-10-12 20:19:19,892 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-10-12 20:19:19,895 INFO L432 NwaCegarLoop]: 1457 mSDtfsCounter, 286 mSDsluCounter, 1243 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 286 SdHoareTripleChecker+Valid, 2700 SdHoareTripleChecker+Invalid, 7 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 5 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-12 20:19:19,895 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [286 Valid, 2700 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-12 20:19:19,936 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 60857 states. [2024-10-12 20:19:20,691 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 60857 to 60855. [2024-10-12 20:19:20,773 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 60855 states, 60854 states have (on average 1.6512308147369112) internal successors, (100484), 60854 states have internal predecessors, (100484), 0 states have call successors, (0), 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-10-12 20:19:20,922 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 60855 states to 60855 states and 100484 transitions. [2024-10-12 20:19:20,924 INFO L78 Accepts]: Start accepts. Automaton has 60855 states and 100484 transitions. Word has length 224 [2024-10-12 20:19:20,925 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 20:19:20,925 INFO L471 AbstractCegarLoop]: Abstraction has 60855 states and 100484 transitions. [2024-10-12 20:19:20,925 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 74.66666666666667) internal successors, (224), 3 states have internal predecessors, (224), 0 states have call successors, (0), 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-10-12 20:19:20,925 INFO L276 IsEmpty]: Start isEmpty. Operand 60855 states and 100484 transitions. [2024-10-12 20:19:20,928 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 225 [2024-10-12 20:19:20,929 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 20:19:20,929 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-10-12 20:19:20,929 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2024-10-12 20:19:20,929 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 20:19:20,930 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 20:19:20,930 INFO L85 PathProgramCache]: Analyzing trace with hash -1693818678, now seen corresponding path program 1 times [2024-10-12 20:19:20,930 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 20:19:20,930 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1800287574] [2024-10-12 20:19:20,930 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 20:19:20,930 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 20:19:21,001 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 20:19:21,403 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-12 20:19:21,404 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 20:19:21,404 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1800287574] [2024-10-12 20:19:21,404 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1800287574] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 20:19:21,405 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 20:19:21,405 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-12 20:19:21,405 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1738374469] [2024-10-12 20:19:21,405 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 20:19:21,406 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-12 20:19:21,408 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 20:19:21,409 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-12 20:19:21,409 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-12 20:19:21,410 INFO L87 Difference]: Start difference. First operand 60855 states and 100484 transitions. Second operand has 3 states, 3 states have (on average 74.66666666666667) internal successors, (224), 3 states have internal predecessors, (224), 0 states have call successors, (0), 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-10-12 20:19:21,948 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 20:19:21,948 INFO L93 Difference]: Finished difference Result 133559 states and 221684 transitions. [2024-10-12 20:19:21,948 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-12 20:19:21,949 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 74.66666666666667) internal successors, (224), 3 states have internal predecessors, (224), 0 states have call successors, (0), 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 224 [2024-10-12 20:19:21,949 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 20:19:22,140 INFO L225 Difference]: With dead ends: 133559 [2024-10-12 20:19:22,141 INFO L226 Difference]: Without dead ends: 91735 [2024-10-12 20:19:22,213 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-10-12 20:19:22,214 INFO L432 NwaCegarLoop]: 1540 mSDtfsCounter, 300 mSDsluCounter, 1241 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 300 SdHoareTripleChecker+Valid, 2781 SdHoareTripleChecker+Invalid, 7 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 5 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-12 20:19:22,215 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [300 Valid, 2781 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-12 20:19:22,298 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 91735 states. [2024-10-12 20:19:23,651 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 91735 to 91733. [2024-10-12 20:19:23,770 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 91733 states, 91732 states have (on average 1.6519317141237517) internal successors, (151535), 91732 states have internal predecessors, (151535), 0 states have call successors, (0), 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-10-12 20:19:23,930 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 91733 states to 91733 states and 151535 transitions. [2024-10-12 20:19:23,930 INFO L78 Accepts]: Start accepts. Automaton has 91733 states and 151535 transitions. Word has length 224 [2024-10-12 20:19:23,930 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 20:19:23,930 INFO L471 AbstractCegarLoop]: Abstraction has 91733 states and 151535 transitions. [2024-10-12 20:19:23,931 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 74.66666666666667) internal successors, (224), 3 states have internal predecessors, (224), 0 states have call successors, (0), 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-10-12 20:19:23,931 INFO L276 IsEmpty]: Start isEmpty. Operand 91733 states and 151535 transitions. [2024-10-12 20:19:23,934 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 226 [2024-10-12 20:19:23,934 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 20:19:23,934 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-10-12 20:19:23,934 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2024-10-12 20:19:23,935 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 20:19:23,935 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 20:19:23,935 INFO L85 PathProgramCache]: Analyzing trace with hash -1170786719, now seen corresponding path program 1 times [2024-10-12 20:19:23,935 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 20:19:23,936 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1913915871] [2024-10-12 20:19:23,936 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 20:19:23,936 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 20:19:23,998 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 20:19:24,180 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-12 20:19:24,181 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 20:19:24,181 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1913915871] [2024-10-12 20:19:24,181 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1913915871] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 20:19:24,181 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 20:19:24,181 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-12 20:19:24,182 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1343375991] [2024-10-12 20:19:24,182 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 20:19:24,182 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-12 20:19:24,182 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 20:19:24,183 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-12 20:19:24,183 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-12 20:19:24,183 INFO L87 Difference]: Start difference. First operand 91733 states and 151535 transitions. Second operand has 4 states, 4 states have (on average 56.25) internal successors, (225), 4 states have internal predecessors, (225), 0 states have call successors, (0), 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-10-12 20:19:25,309 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 20:19:25,309 INFO L93 Difference]: Finished difference Result 301364 states and 498658 transitions. [2024-10-12 20:19:25,309 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-12 20:19:25,310 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 56.25) internal successors, (225), 4 states have internal predecessors, (225), 0 states have call successors, (0), 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 225 [2024-10-12 20:19:25,310 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 20:19:25,661 INFO L225 Difference]: With dead ends: 301364 [2024-10-12 20:19:25,661 INFO L226 Difference]: Without dead ends: 210267 [2024-10-12 20:19:26,171 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 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-10-12 20:19:26,172 INFO L432 NwaCegarLoop]: 1281 mSDtfsCounter, 937 mSDsluCounter, 2831 mSDsCounter, 0 mSdLazyCounter, 51 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 937 SdHoareTripleChecker+Valid, 4112 SdHoareTripleChecker+Invalid, 51 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 51 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-12 20:19:26,173 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [937 Valid, 4112 Invalid, 51 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 51 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-12 20:19:26,371 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 210267 states. [2024-10-12 20:19:28,069 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 210267 to 150731. [2024-10-12 20:19:28,645 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 150731 states, 150730 states have (on average 1.6489418164930671) internal successors, (248545), 150730 states have internal predecessors, (248545), 0 states have call successors, (0), 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-10-12 20:19:29,168 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 150731 states to 150731 states and 248545 transitions. [2024-10-12 20:19:29,168 INFO L78 Accepts]: Start accepts. Automaton has 150731 states and 248545 transitions. Word has length 225 [2024-10-12 20:19:29,169 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 20:19:29,169 INFO L471 AbstractCegarLoop]: Abstraction has 150731 states and 248545 transitions. [2024-10-12 20:19:29,169 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 56.25) internal successors, (225), 4 states have internal predecessors, (225), 0 states have call successors, (0), 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-10-12 20:19:29,169 INFO L276 IsEmpty]: Start isEmpty. Operand 150731 states and 248545 transitions. [2024-10-12 20:19:29,171 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 227 [2024-10-12 20:19:29,171 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 20:19:29,171 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-10-12 20:19:29,171 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2024-10-12 20:19:29,172 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 20:19:29,172 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 20:19:29,172 INFO L85 PathProgramCache]: Analyzing trace with hash -1997153624, now seen corresponding path program 1 times [2024-10-12 20:19:29,173 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 20:19:29,173 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [998879787] [2024-10-12 20:19:29,173 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 20:19:29,173 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 20:19:29,234 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 20:19:29,411 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-12 20:19:29,412 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 20:19:29,412 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [998879787] [2024-10-12 20:19:29,412 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [998879787] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 20:19:29,412 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 20:19:29,412 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-12 20:19:29,412 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1821147796] [2024-10-12 20:19:29,412 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 20:19:29,413 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-12 20:19:29,413 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 20:19:29,413 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-12 20:19:29,414 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-12 20:19:29,414 INFO L87 Difference]: Start difference. First operand 150731 states and 248545 transitions. Second operand has 4 states, 4 states have (on average 56.5) internal successors, (226), 4 states have internal predecessors, (226), 0 states have call successors, (0), 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-10-12 20:19:31,260 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 20:19:31,260 INFO L93 Difference]: Finished difference Result 494900 states and 817522 transitions. [2024-10-12 20:19:31,261 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-12 20:19:31,261 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 56.5) internal successors, (226), 4 states have internal predecessors, (226), 0 states have call successors, (0), 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 226 [2024-10-12 20:19:31,261 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 20:19:31,858 INFO L225 Difference]: With dead ends: 494900 [2024-10-12 20:19:31,858 INFO L226 Difference]: Without dead ends: 344805 [2024-10-12 20:19:31,987 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 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-10-12 20:19:31,987 INFO L432 NwaCegarLoop]: 1274 mSDtfsCounter, 935 mSDsluCounter, 2833 mSDsCounter, 0 mSdLazyCounter, 51 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 935 SdHoareTripleChecker+Valid, 4107 SdHoareTripleChecker+Invalid, 51 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 51 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-12 20:19:31,988 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [935 Valid, 4107 Invalid, 51 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 51 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-12 20:19:32,956 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 344805 states. [2024-10-12 20:19:35,815 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 344805 to 247325. [2024-10-12 20:19:36,018 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 247325 states, 247324 states have (on average 1.6460472901942391) internal successors, (407107), 247324 states have internal predecessors, (407107), 0 states have call successors, (0), 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-10-12 20:19:37,400 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 247325 states to 247325 states and 407107 transitions. [2024-10-12 20:19:37,401 INFO L78 Accepts]: Start accepts. Automaton has 247325 states and 407107 transitions. Word has length 226 [2024-10-12 20:19:37,401 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 20:19:37,401 INFO L471 AbstractCegarLoop]: Abstraction has 247325 states and 407107 transitions. [2024-10-12 20:19:37,401 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 56.5) internal successors, (226), 4 states have internal predecessors, (226), 0 states have call successors, (0), 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-10-12 20:19:37,401 INFO L276 IsEmpty]: Start isEmpty. Operand 247325 states and 407107 transitions. [2024-10-12 20:19:37,407 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 228 [2024-10-12 20:19:37,407 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 20:19:37,407 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-10-12 20:19:37,407 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2024-10-12 20:19:37,408 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 20:19:37,408 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 20:19:37,408 INFO L85 PathProgramCache]: Analyzing trace with hash -1840165880, now seen corresponding path program 1 times [2024-10-12 20:19:37,408 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 20:19:37,408 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [802988051] [2024-10-12 20:19:37,408 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 20:19:37,409 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 20:19:37,484 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 20:19:37,680 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-12 20:19:37,681 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 20:19:37,684 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [802988051] [2024-10-12 20:19:37,684 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [802988051] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 20:19:37,684 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 20:19:37,684 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-12 20:19:37,685 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1597272598] [2024-10-12 20:19:37,685 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 20:19:37,685 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-12 20:19:37,685 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 20:19:37,686 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-12 20:19:37,686 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-12 20:19:37,686 INFO L87 Difference]: Start difference. First operand 247325 states and 407107 transitions. Second operand has 4 states, 4 states have (on average 56.75) internal successors, (227), 4 states have internal predecessors, (227), 0 states have call successors, (0), 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-10-12 20:19:40,865 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 20:19:40,866 INFO L93 Difference]: Finished difference Result 809460 states and 1334922 transitions. [2024-10-12 20:19:40,866 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-12 20:19:40,866 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 56.75) internal successors, (227), 4 states have internal predecessors, (227), 0 states have call successors, (0), 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 227 [2024-10-12 20:19:40,867 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 20:19:42,771 INFO L225 Difference]: With dead ends: 809460 [2024-10-12 20:19:42,771 INFO L226 Difference]: Without dead ends: 562771 [2024-10-12 20:19:42,936 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 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-10-12 20:19:42,936 INFO L432 NwaCegarLoop]: 1273 mSDtfsCounter, 933 mSDsluCounter, 2760 mSDsCounter, 0 mSdLazyCounter, 41 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 933 SdHoareTripleChecker+Valid, 4033 SdHoareTripleChecker+Invalid, 41 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 41 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-12 20:19:42,937 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [933 Valid, 4033 Invalid, 41 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 41 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-12 20:19:43,325 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 562771 states. [2024-10-12 20:19:48,531 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 562771 to 404323. [2024-10-12 20:19:48,876 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 404323 states, 404322 states have (on average 1.6432373207493038) internal successors, (664397), 404322 states have internal predecessors, (664397), 0 states have call successors, (0), 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-10-12 20:19:50,883 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 404323 states to 404323 states and 664397 transitions. [2024-10-12 20:19:50,884 INFO L78 Accepts]: Start accepts. Automaton has 404323 states and 664397 transitions. Word has length 227 [2024-10-12 20:19:50,884 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 20:19:50,884 INFO L471 AbstractCegarLoop]: Abstraction has 404323 states and 664397 transitions. [2024-10-12 20:19:50,884 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 56.75) internal successors, (227), 4 states have internal predecessors, (227), 0 states have call successors, (0), 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-10-12 20:19:50,884 INFO L276 IsEmpty]: Start isEmpty. Operand 404323 states and 664397 transitions. [2024-10-12 20:19:50,889 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 229 [2024-10-12 20:19:50,890 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 20:19:50,890 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-10-12 20:19:50,890 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2024-10-12 20:19:50,890 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 20:19:50,891 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 20:19:50,891 INFO L85 PathProgramCache]: Analyzing trace with hash -1263955089, now seen corresponding path program 1 times [2024-10-12 20:19:50,891 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 20:19:50,891 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [130814095] [2024-10-12 20:19:50,891 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 20:19:50,892 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 20:19:50,967 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 20:19:51,151 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-12 20:19:51,151 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 20:19:51,152 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [130814095] [2024-10-12 20:19:51,153 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [130814095] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 20:19:51,153 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 20:19:51,154 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-12 20:19:51,154 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2053665189] [2024-10-12 20:19:51,154 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 20:19:51,154 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-12 20:19:51,155 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 20:19:51,155 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-12 20:19:51,155 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-12 20:19:51,155 INFO L87 Difference]: Start difference. First operand 404323 states and 664397 transitions. Second operand has 4 states, 4 states have (on average 57.0) internal successors, (228), 4 states have internal predecessors, (228), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)